Zhaolin MA Jiali YOU Haojiang DENG
Due to the increase in the volume of data and intensified concurrent requests, distributed caching is commonly used to manage high-concurrency requests and alleviate pressure on databases. However, there is limited research on distributed record mapping caching, and traditional caching algorithms have suboptimal resolution performance for mapping records that typically follow a long-tail distribution. To address the aforementioned issue, in this paper, we propose a recommendation-based adaptive auxiliary caching method, AC-REC, which delivers the primary cache record along with a list of additional cache records. The method uses request correlations as a basis for recommendations, customizes the number of additional cache entries provided, and dynamically adjusts the time-to-live. We conducted evaluations to compare the performance of our method against various benchmark strategies. The results show that our proposed method, as compared to the conventional LCE method, increased the cache hit ratio by an average of 20%, Moreover, this improvement is achieved while effectively utilizing the cache space. We believe that our strategy will contribute an effective solution to the related studies in both traditional network architecture and caching in paradigms like ICN.
Rikuya SASAKI Hiroyuki ICHIDA Htoo Htoo Sandi KYAW Keiichi KANEKO
The increasing demand for high-performance computing in recent years has led to active research on massively parallel systems. The interconnection network in a massively parallel system interconnects hundreds of thousands of processing elements so that they can process large tasks while communicating among others. By regarding the processing elements as nodes and the links between processing elements as edges, respectively, we can discuss various problems of interconnection networks in the framework of the graph theory. Many topologies have been proposed for interconnection networks of massively parallel systems. The hypercube is a very popular topology and it has many variants. The cross-cube is such a topology, which can be obtained by adding one extra edge to each node of the hypercube. The cross-cube reduces the diameter of the hypercube, and allows cycles of odd lengths. Therefore, we focus on the cross-cube and propose an algorithm that constructs disjoint paths from a node to a set of nodes. We give a proof of correctness of the algorithm. Also, we show that the time complexity and the maximum path length of the algorithm are O(n3 log n) and 2n - 3, respectively. Moreover, we estimate that the average execution time of the algorithm is O(n2) based on a computer experiment.
Yuqiang ZHANG Huamin YANG Cheng HAN Chao ZHANG Chaoran ZHU
In this paper, we present a novel photometric compensation network named CASEformer, which is built upon the Swin module. For the first time, we combine coordinate attention and channel attention mechanisms to extract rich features from input images. Employing a multi-level encoder-decoder architecture with skip connections, we establish multiscale interactions between projection surfaces and projection images, achieving precise inference and compensation. Furthermore, through an attention fusion module, which simultaneously leverages both coordinate and channel information, we enhance the global context of feature maps while preserving enhanced texture coordinate details. The experimental results demonstrate the superior compensation effectiveness of our approach compared to the current state-of-the-art methods. Additionally, we propose a method for multi-surface projection compensation, further enriching our contributions.
Compressed sensing is a rapidly growing research field in signal and image processing, machine learning, statistics, and systems control. In this survey paper, we provide a review of the theoretical foundations of compressed sensing and present state-of-the-art algorithms for solving the corresponding optimization problems. Additionally, we discuss several practical applications of compressed sensing, such as group testing, sparse system identification, and sparse feedback gain design, and demonstrate their effectiveness through Python programs. This survey paper aims to contribute to the advancement of compressed sensing research and its practical applications in various scientific disciplines.
Takumi KOMORI Yutaka MASUDA Tohru ISHIHARA
Recent embedded systems require both traditional machinery control and information processing, such as network and GUI handling. A dual-OS platform consolidates a real-time OS (RTOS) and general-purpose OS (GPOS) to realize efficient software development on one physical processor. Although the dual-OS platform attracts increasing attention, it often suffers from energy inefficiency in the GPOS for guaranteeing real-time responses of the RTOS. This paper proposes an energy minimization method called DVFS virtualization, which allows running multiple DVFS policies dedicated to the RTOS and GPOS, respectively. The experimental evaluation using a commercial microcontroller showed that the proposed hardware could change the supply voltage within 500 ns and reduce the energy consumption of typical applications by 60 % in the best case compared to conventional dual-OS platforms. Furthermore, evaluation using a commercial microprocessor achieved a 15 % energy reduction of practical open-source software at best.
Keita TERASHIMA Koichi KOBAYASHI Yuh YAMASHITA
In a multi-agent system, it is important to consider a design method of cooperative actions in order to achieve a common goal. In this paper, we propose two novel multi-agent reinforcement learning methods, where the control specification is described by linear temporal logic formulas, which represent a common goal. First, we propose a simple solution method, which is directly extended from the single-agent case. In this method, there are some technical issues caused by the increase in the number of agents. Next, to overcome these technical issues, we propose a new method in which an aggregator is introduced. Finally, these two methods are compared by numerical simulations, with a surveillance problem as an example.
Ryuta SHIRAKI Yojiro MORI Hiroshi HASEGAWA
We propose a demodulation framework to extend the maximum distance of unrepeated transmission systems, where the simplest back propagation (BP), polarization and phase recovery, data arrangement for machine learning (ML), and symbol decision based on ML are rationally combined. The deterministic waveform distortion caused by fiber nonlinearity and chromatic dispersion is partially eliminated by BP whose calculation cost is minimized by adopting the single-step Fourier method in a pre-processing step. The non-deterministic waveform distortion, i.e., polarization and phase fluctuations, can be eliminated in a precise manner. Finally, the optimized ML model conducts the symbol decision under the influence of residual deterministic waveform distortion that cannot be cancelled by the simplest BP. Extensive numerical simulations confirm that a DP-16QAM signal can be transmitted over 240km of a standard single-mode fiber without optical repeaters. The maximum transmission distance is extended by 25km.
Dody ICHWANA PUTRA Muhammad HARRY BINTANG PRATAMA Ryotaro ISSHIKI Yuhei NAGAO Leonardo LANANTE JR Hiroshi OCHI
This paper presents a unified software and hardware wireless AI platform (USHWAP) for developing and evaluating machine learning in wireless systems. The platform integrates multi-software development such as MATLAB and Python with hardware platforms like FPGA and SDR, allowing for flexible and scalable device and edge computing application development. The USHWAP is implemented and validated using FPGAs and SDRs. Wireless signal classification, wireless LAN sensing, and rate adaptation are used as examples to showcase the platform's capabilities. The platform enables versatile development, including software simulation and real-time hardware implementation, offering flexibility and scalability for multiple applications. It is intended to be used by wireless-AI researchers to develop and evaluate intelligent algorithms in a laboratory environment.
Weitao JIAN Ming CAI Wei HUANG Shichang LI
Mobility as a Service (MaaS) is a smart mobility model that integrates mobility services to deliver transportation needs through a single interface, offering users flexible and personalizd mobility. This paper presents a structural approach for developing a MaaS system architecture under Autonomous Transportation Systems (ATS), which is a new transition from the Intelligent Transportation Systems (ITS) with emerging technologies. Five primary components, including system elements, user needs, services, functions, and technologies, are defined to represent the system architecture. Based on the components, we introduce three architecture elements: functional architecture, logical architecture and physical architecture. Furthermore, this paper presents an evaluation process, links the architecture elements during the process and develops a three-layer structure for system performance evaluation. The proposed MaaS system architecture design can help the administration make services planning and implement planned services in an organized way, and support further technical deployment of mobility services.
Kentaro ISHIZU Mitsuhiro AZUMA Hiroaki YAMAGUCHI Akihito KATO Iwao HOSAKO
Beyond 5G is the next generation mobile communication system expected to be used from around 2030. Services in the 2030s will be composed of multiple systems provided by not only the conventional networking industry but also a wide range of industries. However, the current mobile communication system architecture is designed with a focus on networking performance and not oriented to accommodate and optimize potential systems including service management and applications, though total resource optimizations and service level performance enhancement among the systems are required. In this paper, a new concept of the Beyond 5G cross-industry service platform (B5G-XISP) is presented on which multiple systems from different industries are appropriately organized and optimized for service providers. Then, an architecture of the B5G-XISP is proposed based on requirements revealed from issues of current mobile communication systems. The proposed architecture is compared with other architectures along with use cases of an assumed future supply chain business.
Satoru KUROKAWA Michitaka AMEYA Yui OTAGAKI Hiroshi MURATA Masatoshi ONIZAWA Masahiro SATO Masanobu HIROSE
We have developed an all-optical fiber link antenna measurement system for a millimeter wave 5th generation mobile communication frequency band around 28 GHz. Our developed system consists of an optical fiber link an electrical signal transmission system, an antenna-coupled-electrode electric-field (EO) sensor system for 28GHz-band as an electrical signal receiving system, and a 6-axis vertically articulated robot with an arm length of 1m. Our developed optical fiber link electrical signal transmission system can transmit the electrical signal of more than 40GHz with more than -30dBm output level. Our developed EO sensor can receive the electrical signal from 27GHz to 30GHz. In addition, we have estimated a far field antenna factor of the EO sensor system for the 28GHz-band using an amplitude center modified antenna factor estimation equation. The estimated far field antenna factor of the sensor system is 83.2dB/m at 28GHz.
Weisen LUO Xiuqin WEI Hiroo SEKIYA
This paper presents an analysis-based design method for designing the class-Φ22 wireless power transfer (WPT) system, taking its subsystems as a whole into account. By using the proposed design method, it is possible to derive accurate design values which can make sure the class-E Zero-Voltage-Switching/Zero-Derivative-Switching (ZVS/ZDS) to obtain without applying any tuning processes. Additionally, it is possible to take the effects of the switch on resistance, diode forward voltage drop, and equivalent series resistances (ESRs) of all passive elements on the system operations into account. Furthermore, design curves for a wide range of parameters are developed and organized as basic data for various applications. The validities of the proposed design procedure and derived design curves are confirmed by LTspice simulation and circuit experiment. In the experimental measurements, the class-Φ22 WPT system achieves 78.8% power-transmission efficiency at 6.78MHz operating frequency and 7.96W output power. Additionally, the results obtained from the LTspice simulation and laboratory experiment show quantitative agreements with the analytical predictions, which indicates the accuracy and validity of the proposed analytical method and design curves given in this paper.
Kenshiro CHUMAN Yukitoshi SANADA
This paper proposes an adaptive mixing probability scheme for mixed Gibbs sampling (MGS) or MGS with maximum ratio combining (MRC) in multiple-input multiple-output (MIMO) demodulation. In the conventional MGS algorithm, the mixing probability is fixed. Thus, if a search point is captured by a local minimum, it takes a larger number of samples to escape. In the proposed scheme, the mixing probability is increased when a candidate transmit symbol vector is captured by a local minimum. Using the adaptive mixing probability, the numbers of candidate transmit symbol vectors searched by demodulation algorithms increase. The proposed scheme in MGS as well as MGS with MRC reduces an error floor level as compared with the conventional scheme. Numerical results obtained through computer simulation show that the bit error rates of the MGS as well as the MGS with MRC reduces by about 1/100 when the number of iterations is 100 in a 64×64 MIMO system.
We thank Kamata et al. (2023) [1] for their interest in our work [2], and for providing an explanation of the quasi-linear kernel from a viewpoint of multiple kernel learning. In this letter, we first give a summary of the quasi-linear SVM. Then we provide a discussion on the novelty of quasi-linear kernels against multiple kernel learning. Finally, we explain the contributions of our work [2].
Ullah IMDAD Akram BEN AHMED Kazuei HIRONAKA Kensuke IIZUKA Hideharu AMANO
FPGA clusters that consist of multiple FPGA boards have been gaining interest in recent times. Massively parallel processing with a stand-alone heterogeneous FPGA cluster with SoC- style FPGAs and mid-scale FPGAs is promising with cost-performance benefit. Here, we propose such a heterogeneous FPGA cluster with FiC and M-KUBOS cluster. FiC consists of multiple boards, mounting middle scale Xilinx's FPGAs and DRAMs, which are tightly coupled with high-speed serial links. In addition, M-KUBOS boards are connected to FiC for ensuring high IO data transfer bandwidth. As an example of massively parallel processing, here we implement genomic pattern search. Next-generation sequencing (NGS) technology has revolutionized biological system related research by its high-speed, scalable and massive throughput. To analyze the genomic data, short read mapping technique is used where short Deoxyribonucleic acid (DNA) sequences are mapped relative to a known reference sequence. Although several pattern matching techniques are available, FM-index based pattern search is perfectly suitable for this task due to the fastest mapping from known indices. Since matching can be done in parallel for different data, the massively parallel computing which distributes data, executes in parallel and gathers the results can be applied. We also implement a data compression method where about 10 times reduction in data size is achieved. We found that a M-KUBOS board matches four FiC boards, and a system with six M-KUBOS boards and 24 FiC boards achieved 30 times faster than the software based implementation.
Junya YOSHIDA Naoki HAYASHI Shigemasa TAKAI
This paper presents a quantized gradient descent algorithm for distributed nonconvex optimization in multiagent systems that takes into account the bandwidth limitation of communication channels. Each agent encodes its estimation variable using a zoom-in parameter and sends the quantized intermediate variable to the neighboring agents. Then, each agent updates the estimation by decoding the received information. In this paper, we show that all agents achieve consensus and their estimated variables converge to a critical point in the optimization problem. A numerical example of a nonconvex logistic regression shows that there is a trade-off between the convergence rate of the estimation and the communication bandwidth.
Naoko KIFUNE Hironori UCHIKAWA
At a flash memory, each stored data frame is protected by error correction codes (ECC) such as Bose-Chaudhuri-Hocquenghem (BCH) codes from random errors. Exclusive-OR (XOR) based erasure codes like RAID-5 have also been employed at the flash memory to protect from memory block defects. Conventionally, the ECC and erasure codes are used separately since their target errors are different. Due to recent aggressive technology scaling, additional error correction capability for random errors is required without adding redundancy. We propose an algorithm to improve error correction capability by using XOR parity with a simple counter that counts the number of unreliable bits in the XOR stripe. We also propose to apply Chase decoding to the proposed algorithm. The counter makes it possible to reduce the false correction and execute the efficient Chase decoding. We show that combining the proposed algorithm with Chase decoding can significantly improve the decoding performance.
Hidenori MATSUO Ryo TAKAHASHI Fumiyuki ADACHI
To cope with ever growing mobile data traffic, we recently proposed a concept of cellular ultra-dense radio access network (RAN). In the cellular ultra-dense RAN, a number of distributed antennas are deployed in the base station (BS) coverage area (cell) and user-clusters are formed to perform small-scale distributed multiuser multi-input multi-output (MU-MIMO) transmission and reception in each user-cluster in parallel using the same frequency resource. We also proposed a decentralized interference coordination (IC) framework to effectively mitigate both intra-cell and inter-cell interferences caused in the cellular ultra-dense RAN. The inter-cell IC adopted in this framework is the fractional frequency reuse (FFR), realized by applying the channel segregation (CS) algorithm, and is called CS-FFR in this paper. CS-FFR divides the available bandwidth into several sub-bands and allocates multiple sub-bands to different cells. In this paper, focusing on the optimization of the CS-FFR, we find by computer simulation the optimum bandwidth division number and the sub-band allocation ratio to maximize the link capacity. We also discuss the convergence speed of CS-FFR in a cellular ultra-dense RAN.
Jonghyeok YOU Heesoo KIM Kilho LEE
This paper proposes a fault-resilient ROS platform supporting rapid fault detection and recovery. The platform employs heartbeat-based fault detection and node replication-based recovery. Our prototype implementation on top of the ROS Melodic shows a great performance in evaluations with a Nvidia development board and an inverted pendulum device.
Koji NAKAO Katsunari YOSHIOKA Takayuki SASAKI Rui TANABE Xuping HUANG Takeshi TAKAHASHI Akira FUJITA Jun'ichi TAKEUCHI Noboru MURATA Junji SHIKATA Kazuki IWAMOTO Kazuki TAKADA Yuki ISHIDA Masaru TAKEUCHI Naoto YANAI
In this paper, we developed the latest IoT honeypots to capture IoT malware currently on the loose, analyzed IoT malware with new features such as persistent infection, developed malware removal methods to be provided to IoT device users. Furthermore, as attack behaviors using IoT devices become more diverse and sophisticated every year, we conducted research related to various factors involved in understanding the overall picture of attack behaviors from the perspective of incident responders. As the final stage of countermeasures, we also conducted research and development of IoT malware disabling technology to stop only IoT malware activities in IoT devices and IoT system disabling technology to remotely control (including stopping) IoT devices themselves.