Jianglin WEI Anna KUWANA Haruo KOBAYASHI Kazuyoshi KUBO
In this paper, an algorithm based on Taylor series expansion is proposed to calculate the logarithm (log2x) of IEEE754 binary32 accuracy floating-point number by a multi-domain partitioning method. The general mantissa (1≤x<2) is multiplied by 2, 4, 8, … (or equivalently left-shifted by 1, 2, 3, … bits), the regions of (2≤x<4), (4≤x<8), (8≤x<16),… are considered, and Taylor-series expansion is applied. In those regions, the slope of f(x)=log2 x with respect to x is gentle compared to the region of (1≤x<2), which reduces the required number of terms. We also consider the trade-offs among the numbers of additions, subtractions, and multiplications and Look-Up Table (LUT) size in hardware to select the best algorithm for the engineer's design and build the best hardware device.
At present, the application of different types of memristors in electronics is being deeply studied. Given the nonlinearity characterizing memristors, a circuit with memristors cannot be treated by classical circuit analysis. In this paper, memristor is equivalent to a nonlinear dynamic system composed of linear dynamic system and nonlinear static system by Volterra series. The nonlinear transfer function of memristor is derived. In the complex frequency domain, the n-order complex frequency response of memristor is established by multiple Laplace transform, and the response of MLC parallel circuit is taken as an example to verify. Theoretical analysis shows that the complex frequency domain analysis method of memristor transforms the problem of solving nonlinear circuit in time domain into n times complex frequency domain analysis of linear circuit, which provides an idea for nonlinear dynamic system analysis.
Ding LI Chunxiang GU Yuefei ZHU
Website Fingerprinting (WF) enables a passive attacker to identify which website a user is visiting over an encrypted tunnel. Current WF attacks have two strong assumptions: (i) specific tunnel, i.e., the attacker can train on traffic samples collected in a simulated tunnel with the same tunnel settings as the user, and (ii) pseudo-open-world, where the attacker has access to training samples of unmonitored sites and treats them as a separate class. These assumptions, while experimentally feasible, render WF attacks less usable in practice. In this paper, we present Gene Fingerprinting (GF), a new WF attack that achieves cross-tunnel transferability by generating fingerprints that reflect the intrinsic profile of a website. The attack leverages Zero-shot Learning — a machine learning technique not requiring training samples to identify a given class — to reduce the effort to collect data from different tunnels and achieve a real open-world. We demonstrate the attack performance using three popular tunneling tools: OpenSSH, Shadowsocks, and OpenVPN. The GF attack attains over 94% accuracy on each tunnel, far better than existing CUMUL, DF, and DDTW attacks. In the more realistic open-world scenario, the attack still obtains 88% TPR and 9% FPR, outperforming the state-of-the-art attacks. These results highlight the danger of our attack in various scenarios where gathering and training on a tunnel-specific dataset would be impractical.
A variety of smart services are being provided on multiple virtual networks embedded into a common inter-cloud substrate network. The substrate network operator deploys critical substrate nodes so that multiple service providers can achieve enhanced services due to the secure sharing of their service data. Even if one of the critical substrate nodes incurs damage, resiliency of the enhanced services can be assured due to reallocation of the workload and periodic backup of the service data to the other normal critical substrate nodes. However, the connectivity of the embedded virtual networks must be maintained so that the enhanced services can be continuously provided to all clients on the virtual networks. This paper considers resilient virtual network embedding (VNE) that ensures the connectivity of the embedded virtual networks after critical substrate node failures have occurred. The resilient VNE problem is formulated using an integer linear programming model and a distance-based method is proposed to solve the large-scale resilient VNE problem efficiently. Simulation results demonstrate that the distance-based method can derive a sub-optimum VNE solution with a small computational effort. The method derived a VNE solution with an approximation ratio of less than 1.2 within ten seconds in all the simulation experiments.
Masaki NAKAMURA Shuki HIGASHI Kazutoshi SAKAKIBARA Kazuhiro OGATA
Because processes run concurrently in multitask systems, the size of the state space grows exponentially. Therefore, it is not straightforward to formally verify that such systems enjoy desired properties. Real-time constrains make the formal verification more challenging. In this paper, we propose the following to address the challenge: (1) a way to model multitask real-time systems as observational transition systems (OTSs), a kind of state transition systems, (2) a way to describe their specifications in CafeOBJ, an algebraic specification language, and (3) a way to verify that such systems enjoy desired properties based on such formal specifications by writing proof scores, proof plans, in CafeOBJ. As a case study, we model Fischer's protocol, a well-known real-time mutual exclusion protocol, as an OTS, describe its specification in CafeOBJ, and verify that the protocol enjoys the mutual exclusion property when an arbitrary number of processes participates in the protocol*.
We consider a reliable decentralized supervisory control problem for discrete event systems in the inference-based framework. This problem requires us to synthesize local supervisors such that the controlled system achieves the specification and is nonblocking, even if local control decisions of some local supervisors are not available for making the global control decision. In the case of single-level inference, we introduce a notion of reliable 1-inference-observability and show that reliable 1-inference-observability together with controllability and Lm(G)-closedness is a necessary and sufficient condition for the existence of a solution to the reliable decentralized supervisory control problem.
Koji TASHIRO Kenji HOSHINO Atsushi NAGATE
High-altitude platform stations (HAPSs) are recognized as a promising technology for coverage extension in the sixth generation (6G) mobile communications and beyond. The purpose of this study is to develop a HAPS system with a coverage radius of 100km and high capacity by focusing on the following two aspects: array antenna structure and user selection. HAPS systems must jointly use massive multiple-input multiple-output (mMIMO) and multiuser MIMO techniques to increase their capacity. However, the coverage achieved by a conventional planar array antenna is limited to a circular area with a radius of only tens of kilometers. A conventional semi-orthogonal user selection (SUS) scheme based on the orthogonality of channel vectors achieves high capacity, but it has high complexity. First, this paper proposes a cylindrical mMIMO system to achieve an ultra-wide coverage radius of 100km and high capacity. Second, this paper presents a novel angle-based user selection (AUS) scheme, where a user selection problem is formulated as a maximization of the minimum angular difference between users over all user groups. Finally, a low-complexity suboptimal algorithm (SA) for AUS is also proposed. Assuming an area with a 100km radius, simulation results demonstrate that the proposed cylindrical mMIMO system improves the signal-to-interference-plus-noise ratio by approx. 12dB at the boundary of the area, and it achieves approx. 1.5 times higher capacity than the conventional mMIMO which uses a planar array antenna. In addition, the results show that the proposed AUS scheme improves the lower percentiles in the system capacity distribution compared with SUS and basic random user selection. Furthermore, the computational complexity of the proposed SA is in the order of only 1/4000 that of SUS.
Xiao HONG Yuehong GAO Hongwen YANG
Computer networks tend to be subjected to the proliferation of mobile demands, therefore it poses a great challenge to guarantee the quality of network service. For real-time systems, the QoS performance bound analysis for the complex network topology and background traffic in modern networks is often difficult. Network calculus, nevertheless, converts a complex non-linear network system into an analyzable linear system to accomplish more accurate delay bound analysis. The existing network environment contains complex network resource allocation schemes, and delay bound analysis is generally pessimistic, hence it is essential to modify the analysis model to improve the bound accuracy. In this paper, the main research approach is to obtain the measurement results of an actual network by building a measurement environment and the corresponding theoretical results by network calculus. A comparison between measurement data and theoretical results is made for the purpose of clarifying the scheme of bandwidth scheduling. The measurement results and theoretical analysis results are verified and corrected, in order to propose an accurate per-flow end-to-end delay bound analytic model for a large-scale scheduling network. On this basis, the instructional significance of the analysis results for the engineering construction is discussed.
Masaya KUMAZAKI Masaki OGURA Takuji TACHIBANA
For beyond 5G era, in network function virtualization (NFV) environments, service chaining can be utilized to provide the flexible network infrastructures needed to support the creation of various application services. In this paper, we propose a dynamic service chain construction based on model predictive control (MPC) to utilize network resources. In the proposed method, the number of data packets in the buffer at each node is modeled as a dynamical system for MPC. Then, we formulate an optimization problem with the predicted amount of traffic injecting into each service chain from users for the dynamical system. In the optimization problem, the transmission route of each service chain, the node where each VNF is placed, and the amount of resources for each VNF are determined simultaneously by using MPC so that the amount of resources allocated to VNFs and the number of VNF migrations are minimized. In addition, the performance of data transmission is also controlled by considering the maximum amount of data packets stored in buffers. The performance of the proposed method is evaluated by simulation, and the effectiveness of the proposed method with different parameter values is investigated.
In this paper, we propose the first private decision tree evaluation (PDTE) schemes which are suitable for use in Machine Learning as a Service (MLaaS) scenarios. In our schemes, a user and a model owner send the ciphertexts of a sample and a decision tree model, respectively, and a single server classifies the sample without knowing the sample nor the decision tree. Although many PDTE schemes have been proposed so far, most of them require to reveal the decision tree to the server. This is undesirable because the classification model is the intellectual property of the model owner, and/or it may include sensitive information used to train the model, and therefore the model also should be hidden from the server. In other PDTE schemes, multiple servers jointly conduct the classification process and the decision tree is kept secret from the servers under the assumption they do not collude. Unfortunately, this assumption may not hold because MLaaS is usually provided by a single company. In contrast, our schemes do not have such problems. In principle, fully homomorphic encryption allows us to classify an encrypted sample based on an encrypted decision tree, and in fact, the existing non-interactive PDTE scheme can be modified so that the server classifies only handling ciphertexts. However, the resulting scheme is less efficient than ours. We also show the experimental results for our schemes.
A new adaptive binarization method is proposed for the vehicle state images obtained from the intelligent operation and maintenance system of rail transit. The method can check the corresponding vehicle status information in the intelligent operation and maintenance system of rail transit more quickly and effectively, track and monitor the vehicle operation status in real time, and improve the emergency response ability of the system. The advantages of the proposed method mainly include two points. For decolorization, we use the method of contrast preserving decolorization[1] obtain the appropriate ratio of R, G, and B for the grayscale of the RGB image which can retain the color information of the vehicle state images background to the maximum, and maintain the contrast between the foreground and the background. In terms of threshold selection, the mean value and standard deviation of gray value corresponding to multi-color background of vehicle state images are obtained by using major cluster estimation[2], and the adaptive threshold is determined by the 2 sigma principle for binarization, which can extract text, identifier and other target information effectively. The experimental results show that, regarding the vehicle state images with rich background color information, this method is better than the traditional binarization methods, such as the global threshold Otsu algorithm[3] and the local threshold Sauvola algorithm[4],[5] based on threshold, Mean-Shift algorithm[6], K-Means algorithm[7] and Fuzzy C Means[8] algorithm based on statistical learning. As an image preprocessing scheme for intelligent rail transit data verification, the method can improve the accuracy of text and identifier recognition effectively by verifying the optical character recognition through a data set containing images of different vehicle statuses.
Yuji HASHIMOTO Koji NUIDA Goichiro HANAOKA
It is an important research area to construct a cryptosystem that satisfies the security for multi-user setting. In addition, it is desirable that such a cryptosystem is tightly secure and the ciphertext size is small. For IND-CCA public key encryption schemes for multi-user setting with constant-size ciphertexts tightly secure under the DH assumptions, in 2020, Y. Sakai and G. Hanaoka firstly proposed such a scheme (implicitly based on hybrid encryption paradigm) under the DDH assumption. More recently, Y. Lee et al. proposed such a hybrid encryption scheme (with slightly stronger security) where the assumption for the KEM part is weakened to the CDH assumption. In this paper, we revisit the twin-DH hashed ElGamal KEM with even shorter ciphertexts than those schemes, and prove that its IND-CCA security for multi-user setting is in fact tightly reducible to the CDH assumption.
Lantian WEI Shan LU Hiroshi KAMABE Jun CHENG
In the user identification (UI) scheme for a multiple-access fading channel based on a randomly generated (0, 1, -1)-signature code, previous studies used the signature code over a noisy multiple-access adder channel, and only the user state information (USI) was decoded by the signature decoder. However, by considering the communication model as a compressed sensing process, it is possible to estimate the channel coefficients while identifying users. In this study, to improve the efficiency of the decoding process, we propose an iterative deep neural network (DNN)-based decoder. Simulation results show that for the randomly generated (0, 1, -1)-signature code, the proposed DNN-based decoder requires less computing time than the classical signal recovery algorithm used in compressed sensing while achieving higher UI and channel estimation (CE) accuracies.
Hao WANG Zhe LIU Chunpeng GE Kouichi SAKURAI Chunhua SU
Smart contracts are becoming more and more popular in financial scenarios like medical insurance. Rather than traditional schemes, using smart contracts as a medium is a better choice for both participants, as it is fairer, more reliable, more efficient, and enables real-time payment. However, medical insurance contracts need to input the patient's condition information as the judgment logic to trigger subsequent execution. Since the blockchain is a closed network, it lacks a secure network environment for data interaction with the outside world. The Data feed aims to provide the service of the on-chain and off-chain data interaction. Existing researches on the data feed has solved the security problems on it effectively, such as Town Crier, TLS-N and they have also taken into account the privacy-preserving problems. However, these schemes cannot actually protect privacy because when the ciphertext data is executed by the contract, privacy information can still be inferred by analyzing the transaction results, since states of the contract are publicly visible. In this paper, based on zero-knowledge proof and Hawk technology, a on-and-off-chain complete smart contract data feed privacy-preserving scheme is proposed. In order to present our scheme more intuitively, we combined the medical insurance compensation case to implement it, which is called MIPDF. In our MIPDF, the patient and the insurance company are parties involved in the contract, and the hospital is the data provider of data feed. The patient's medical data is sent to the smart contract under the umbrella of the zero-knowledge proof signature scheme. The smart contract verifies the proof and calculates the insurance premium based on the judgment logic. Meanwhile, we use Hawk technology to ensure the privacy of on-chain contract execution, so that no information will be disclosed due to the result of contract execution. We give a general description of our scheme within the Universal Composability (UC) framework. We experiment and evaluate MIPDF on Ethereum for in-depth analysis. The results show that our scheme can securely and efficiently support the functions of medical insurance and achieve complete privacy-preserving.
Shota MORI Keiichi MIZUTANI Hiroshi HARADA
In-band full-duplex (IBFD) has been an attractive technology, which can theoretically double the spectral efficiency. However, when performing IBFD in the dynamic-duplex cellular (DDC) system, inter-user interference (IUI) deteriorates transmission performance in downlink (DL) communication and limits IBFD-applicable area and IBFD application ratio. In this paper, to expand the IBFD-applicable area and improve the IBFD application ratio, we propose an IUI reduction scheme using successive interference cancellation (SIC) for the DDC system. SIC can utilize the power difference and reduce the signal with the higher power. The effectiveness of the proposed scheme is evaluated by the computer simulation. The IUI reducing effect on the IBFD-inapplicable area is confirmed when the received power of the IUI is stronger than that of the desired signal at the user equipment for DL (DL-UE). The IBFD-inapplicable area within 95m from the DL-UE, where the IBFD does not work without the proposed scheme, can reduce by 43.6% from 52.8% to 9.2% by applying the proposed scheme. Moreover, the IBFD application ratio can improve by 24.6% from 69.5% to 94.1%.
The development of educational informatization makes data privacy particularly important in education. With society's development, the education system is complicated, and the result of education evaluation becomes more and more critical to students. The evaluation process of education must be justice and transparent. In recent years, the Onscreen Marking (OSM) system based on traditional cloud platforms has been widely used in various large-scale public examinations. However, due to the excessive concentration of power in the existing scheme, the mainstream marking process is not transparent, and there are hidden dangers of black-box operation, which will damage the fairness of the examination. In addition, issues related to data security and privacy are still considered to be severe challenges. This paper deals with the above problems by providing secure and private transactions in a distributed OSM assuming the semi-trusted examination center. We have implemented a proof-of-concept for a consortium blockchain-based OSM in a privacy-preserving and auditable manner, enabling markers to mark on the distributed ledger anonymously. We have proposed a distributed OSM system in high-level, which provides theoretical support for the fair evaluation process of education informatization. It has particular theoretical and application value for education combined with blockchain.
Young H. OH Yunho JIN Tae Jun HAM Jae W. LEE
Many cloud service providers employ specialized hardware accelerators, called neural processing units (NPUs), to accelerate deep neural networks (DNNs). An NPU scheduler is responsible for scheduling incoming user requests and required to satisfy the two, often conflicting, optimization goals: maximizing system throughput and satisfying quality-of-service (QoS) constraints (e.g., deadlines) of individual requests. We propose Layerweaver+, a low-cost layer-wise DNN scheduler for NPUs, which provides both high system throughput and minimal QoS violations. For a serving scenario based on the industry-standard MLPerf inference benchmark, Layerweaver+ significantly improves the system throughput by up to 266.7% over the baseline scheduler serving one DNN at a time.
Shuhei YAMAMOTO Takeshi KURASHIMA Hiroyuki TODA
Front video and sensor data captured by vehicle-mounted event recorders are used for not only traffic accident evidence but also safe-driving education as near-miss traffic incident data. However, most event recorder (ER) data shows only regular driving events. To utilize near-miss data for safe-driving education, we need to be able to easily and rapidly locate the appropriate data from large amounts of ER data through labels attached to the scenes/events of interest. This paper proposes a method that can automatically identify near-misses with objects such as pedestrians and bicycles by processing the ER data. The proposed method extracts two deep feature representations that consider car status and the environment surrounding the car. The first feature representation is generated by considering the temporal transitions of car status. The second one can extract the positional relationship between the car and surrounding objects by processing object detection results. Experiments on actual ER data demonstrate that the proposed method can accurately identify and tag near-miss events.
Naoya MUKOJIMA Masaki YASUGI Yasuhiro MIZUTANI Takeshi YASUI Hirotsugu YAMAMOTO
We have utilized single-pixel imaging and deep-learning to solve the privacy-preserving problem in gesture recognition for interactive display. Silhouette images of hand gestures were acquired by use of a display panel as an illumination. Reconstructions of gesture images have been performed by numerical experiments on single-pixel imaging by changing the number of illumination mask patterns. For the training and the image restoration with deep learning, we prepared reconstructed data with 250 and 500 illuminations as datasets. For each of the 250 and 500 illuminations, we prepared 9000 datasets in which original images and reconstructed data were paired. Of these data, 8500 data were used for training a neural network (6800 data for training and 1700 data for validation), and 500 data were used to evaluate the accuracy of image restoration. Our neural network, based on U-net, was able to restore images close to the original images even from reconstructed data with greatly reduced number of illuminations, which is 1/40 of the single-pixel imaging without deep learning. Compared restoration accuracy between cases using shadowgraph (black on white background) and negative-positive reversed images (white on black background) as silhouette image, the accuracy of the restored image was lower for negative-positive-reversed images when the number of illuminations was small. Moreover, we found that the restoration accuracy decreased in the order of rock, scissor, and paper. Shadowgraph is suitable for gesture silhouette, and it is necessary to prepare training data and construct neural networks, to avoid the restoration accuracy between gestures when further reducing the number of illuminations.
Junichi KINOSHITA Akira TAKAMORI Kazuhisa YAMAMOTO Kazuo KURODA Koji SUZUKI Keisuke HIEDA
Image resolution under the effect of color speckle was successfully measured for a raster-scan mobile projector, using the modified contrast modulation method. This method was based on the eye-diagram analysis for distinguishing the binary image signals, black-and-white line pairs. The image resolution and the related metrics, illuminance, chromaticity, and speckle contrast were measured at the nine regions on the full-frame area projected on a standard diffusive reflectance screen. The nonuniformity data over the nine regions were discussed and analyzed.