The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] Y(22683hit)

861-880hit(22683hit)

  • Number of Failed Components in Consecutive-k-out-of-n:G Systems and Their Applications in Optimization Problems

    Lei ZHOU  Hisashi YAMAMOTO  

     
    PAPER-Reliability, Maintainability and Safety Analysis

      Pubricized:
    2021/12/16
      Vol:
    E105-A No:6
      Page(s):
    943-951

    In this paper, we study the number of failed components in a consecutive-k-out-of-n:G system. The distributions and expected values of the number of failed components when system is failed or working at a particular time t are evaluated. We also apply them to the optimization problems concerned with the optimal number of components and the optimal replacement time. Finally, we present the illustrative examples for the expected number of failed components and give the numerical results for the optimization problems.

  • Vulnerability — Information Leakage of Reused Secret Key in NewHope

    Routo TERADA  Reynaldo CACERES VILLENA  

     
    PAPER-Cryptography and Information Security

      Pubricized:
    2021/12/06
      Vol:
    E105-A No:6
      Page(s):
    952-964

    The NIST post-quantum project intends to standardize cryptographic systems that are secure against attacks by both quantum and classical computers. One of these cryptographic systems is NewHope that is a RING-LWE based key exchange scheme. The NewHope Key Encapsulation Method (KEM) allows to establish an encapsulated (secret) key shared by two participants. This scheme defines a private key that is used to encipher a random shared secret and the private key enables the deciphering. This paper presents Fault Information Leakage attacks, using conventional personal computers, if the attacked participant, say Bob, reuses his public key. This assumption is not so strong since reusing the pair (secret, public) keys saves Bob's device computing cost when the public global parameter is not changed. With our result we can conclude that, to prevent leakage, Bob should not reuse his NewHope secret and public keys because Bob's secret key can be retrieved with only 2 communications. We also found that Bob's secret keys can be retrieved for NewHopeToy2, NewHopeToy1 and NewHopeLudicrous with 1, 2, and 3 communications, respectively.

  • A Cost-Sensitive Golden Chip-Free Hardware Trojan Detection Using Principal Component Analysis and Naïve Bayes Classification Algorithm

    Yanjiang LIU  Xianzhao XIA  Jingxin ZHONG  Pengfei GUO  Chunsheng ZHU  Zibin DAI  

     
    PAPER-Cryptography and Information Security

      Pubricized:
    2021/12/03
      Vol:
    E105-A No:6
      Page(s):
    965-974

    Side-channel analysis is one of the most investigated hardware Trojan detection approaches. However, nearly all the side-channel analysis approaches require golden chips for reference, which are hard to obtain actually. Besides, majority of existing Trojan detection algorithms focus on the data similarity and ignore the Trojan misclassification during the detection. In this paper, we propose a cost-sensitive golden chip-free hardware Trojan detection framework, which aims to minimize the probability of Trojan misclassification during the detection. The post-layout simulation data of voltage variations at different process corners is utilized as a golden reference. Further, a classification algorithm based on the combination of principal component analysis and Naïve bayes is exploited to identify the existence of hardware Trojan with a minimum misclassification risk. Experimental results on ASIC demonstrate that the proposed approach improves the detection accuracy ratio compared with the three detection algorithms and distinguishes the Trojan with only 0.27% area occupies even under ±15% process variations.

  • Variable Tap-Length Algorithm Based on a Mixed Error Cost Function

    Yufei HAN  Yibo LI  Yao LI  

     
    LETTER-Digital Signal Processing

      Pubricized:
    2021/12/17
      Vol:
    E105-A No:6
      Page(s):
    1006-1009

    Numerous variable tap-length algorithms can be found in some literature and few strategies are derived from a basic theoretical formula. Thus, some algorithms lack of theoretical depth and their performance are unstable. In view of this point, the novel variable tap-length algorithm which is based on the mixed error cost function is presented in this letter. By analyzing the mixed expectation of the prior and the posterior error, the novel variable tap-length strategy is derived. The proposed algorithm has a more valid proximity to the optimal tap-length and a good convergence ability by the performance analysis. It can solve many deficiencies comprising large fluctuations of the tap-length, the high complexity and the weak steady-state ability. Simulation results demonstrate that the proposed algorithm equips good performance.

  • Rain Attenuation Characteristics due to Typhoon Wind Velocities in Satellite Communications Open Access

    Yasuyuki MAEKAWA  Yoshiaki SHIBAGAKI  

     
    PAPER-Propagation

      Pubricized:
    2021/12/03
      Vol:
    E105-B No:6
      Page(s):
    757-765

    Rain attenuation characteristics due to typhoon passage are discussed using the Ku-band BS satellite signal observations conducted by Osaka Electro-Communication University in Neayagawa from 1988 to 2019. The degree of hourly rain attenuation due to rainfall rate is largely enhanced as typhoon passes the east side of the station, while it becomes smaller in the case of west side passage. Compared to hourly ground wind velocities of nearby AMeDAS, the equivalent path lengths of rain attenuation become larger as the wind directions approach the same angle to the satellite, while they become smaller as the wind directions approach the opposite angle to the satellite. The increase and decrease of the equivalent path lengths are confirmed in other Ku-band and Ka-band satellite paths with different azimuth angles, such as CS, SKP, and SBC. Modified equivalent path lengths calculated by a simple propagation path model including horizontal wind speeds along the same direction to the satellite agree well with the equivalent path lengths observed by each satellite. The equivalent path lengths are, for the first time, proved to be largely affected by the direction of typhoon passage and the horizontal wind velocities.

  • Analyses of Transient Energy Deposition in Biological Bodies Exposed to Electromagnetic Pulses Using Parameter Extraction Method Open Access

    Jerdvisanop CHAKAROTHAI  Katsumi FUJII  Yukihisa SUZUKI  Jun SHIBAYAMA  Kanako WAKE  

     
    INVITED PAPER

      Pubricized:
    2021/12/29
      Vol:
    E105-B No:6
      Page(s):
    694-706

    In this study, we develop a numerical method for determining transient energy deposition in biological bodies exposed to electromagnetic (EM) pulses. We use a newly developed frequency-dependent finite-difference time-domain (FD2TD) method, which is combined with the fast inverse Laplace transform (FILT) and Prony method. The FILT and Prony method are utilized to transform the Cole-Cole model of biological media into a sum of multiple Debye relaxation terms. Parameters of Debye terms are then extracted by comparison with the time-domain impulse responses. The extracted parameters are used in an FDTD formulation, which is derived using the auxiliary differential equation method, and transient energy deposition into a biological medium is calculated by the equivalent circuit method. The validity of our proposed method is demonstrated by comparing numerical results and those derived from an analytical method. Finally, transient energy deposition into human heads of TARO and HANAKO models is then calculated using the proposed method and, physical insights into pulse exposures of the human heads are provided.

  • Path Loss Prediction Method Merged Conventional Models Effectively in Machine Learning for Mobile Communications

    Hiroaki NAKABAYASHI  Kiyoaki ITOI  

     
    PAPER-Propagation

      Pubricized:
    2021/12/14
      Vol:
    E105-B No:6
      Page(s):
    737-747

    Basic characteristics for relating design and base station layout design in land mobile communications are provided through a propagation model for path loss prediction. Owing to the rapid annual increase in traffic data, the number of base stations has increased accordingly. Therefore, propagation models for various scenarios and frequency bands are necessitated. To solve problems optimization and creation methods using the propagation model, a path loss prediction method that merges multiple models in machine learning is proposed herein. The method is discussed based on measurement values from Kitakyushu-shi. In machine learning, the selection of input parameters and suppression of overlearning are important for achieving highly accurate predictions. Therefore, the acquisition of conventional models based on the propagation environment and the use of input parameters of high importance are proposed. The prediction accuracy for Kitakyushu-shi using the proposed method indicates a root mean square error (RMSE) of 3.68dB. In addition, predictions are performed in Narashino-shi to confirm the effectiveness of the method in other urban scenarios. Results confirm the effectiveness of the proposed method for the urban scenario in Narashino-shi, and an RMSE of 4.39dB is obtained for the accuracy.

  • Accurate Source-Number Estimation Using Denoising Preprocessing and Singular Value Decomposition

    Shohei HAMADA  Koichi ICHIGE  Katsuhisa KASHIWAGI  Nobuya ARAKAWA  Ryo SAITO  

     
    PAPER-DOA Estimation

      Pubricized:
    2021/12/03
      Vol:
    E105-B No:6
      Page(s):
    766-774

    This paper proposes two accurate source-number estimation methods for array antennas and multi-input multi-output radar. Direction of arrival (DOA) estimation is important in high-speed wireless communication and radar imaging. Most representative DOA estimation methods require the source-number information in advance and often fail to estimate DOAs in severe environments such as those having low signal-to-noise ratio or large transmission-power difference. Received signals are often bandlimited or narrowband signals, so the proposed methods first involves denoising preprocessing by removing undesired components then comparing the original and denoised signal information. The performances of the proposed methods were evaluated through computer simulations.

  • Adiabatic Quantum-Flux-Parametron: A Tutorial Review Open Access

    Naoki TAKEUCHI  Taiki YAMAE  Christopher L. AYALA  Hideo SUZUKI  Nobuyuki YOSHIKAWA  

     
    INVITED PAPER

      Pubricized:
    2022/01/19
      Vol:
    E105-C No:6
      Page(s):
    251-263

    The adiabatic quantum-flux-parametron (AQFP) is an energy-efficient superconductor logic element based on the quantum flux parametron. AQFP circuits can operate with energy dissipation near the thermodynamic and quantum limits by maximizing the energy efficiency of adiabatic switching. We have established the design methodology for AQFP logic and developed various energy-efficient systems using AQFP logic, such as a low-power microprocessor, reversible computer, single-photon image sensor, and stochastic electronics. We have thus demonstrated the feasibility of the wide application of AQFP logic in future information and communications technology. In this paper, we present a tutorial review on AQFP logic to provide insights into AQFP circuit technology as an introduction to this research field. We describe the historical background, operating principle, design methodology, and recent progress of AQFP logic.

  • Adiabatic Quantum-Flux-Parametron with Delay-Line Clocking Using Square Excitation Currents

    Taiki YAMAE  Naoki TAKEUCHI  Nobuyuki YOSHIKAWA  

     
    PAPER

      Pubricized:
    2022/01/19
      Vol:
    E105-C No:6
      Page(s):
    277-282

    The adiabatic quantum-flux-parametron (AQFP) is an energy-efficient superconductor logic device. In a previous study, we proposed a low-latency clocking scheme called delay-line clocking, and several low-latency AQFP logic gates have been demonstrated. In delay-line clocking, the latency between adjacent excitation phases is determined by the propagation delay of excitation currents, and thus the rising time of excitation currents should be sufficiently small; otherwise, an AQFP gate can switch before the previous gate is fully excited. This means that delay-line clocking needs high clock frequencies, because typical excitation currents are sinusoidal and the rising time depends on the frequency. However, AQFP circuits need to be tested in a wide frequency range experimentally. Hence, in the present study, we investigate AQFP circuits adopting delay-line clocking with square excitation currents to apply delay-line clocking in a low frequency range. Square excitation currents have shorter rising time than sinusoidal excitation currents and thus enable low frequency operation. We demonstrate an AQFP buffer chain with delay-line clocking using square excitation currents, in which the latency is approximately 20ps per gate, and confirm that the operating margin for the buffer chain is kept sufficiently wide at clock frequencies below 1GHz, whereas in the sinusoidal case the operating margin shrinks below 500MHz. These results indicate that AQFP circuits adopting delay-line clocking can operate in a low frequency range by using square excitation currents.

  • A Conflict-Aware Capacity Control Mechanism for Deep Cache Hierarchy

    Jiaheng LIU  Ryusuke EGAWA  Hiroyuki TAKIZAWA  

     
    PAPER-Computer System

      Pubricized:
    2022/03/09
      Vol:
    E105-D No:6
      Page(s):
    1150-1163

    As the number of cores on a processor increases, cache hierarchies contain more cache levels and a larger last level cache (LLC). Thus, the power and energy consumption of the cache hierarchy becomes non-negligible. Meanwhile, because the cache usage behaviors of individual applications can be different, it is possible to achieve higher energy efficiency of the computing system by determining the appropriate cache configurations for individual applications. This paper proposes a cache control mechanism to improve energy efficiency by adjusting a cache hierarchy to each application. Our mechanism first bypasses and disables a less-significant cache level, then partially disables the LLC, and finally adjusts the associativity if it suffers from a large number of conflict misses. The mechanism can achieve significant energy saving at the sacrifice of small performance degradation. The evaluation results show that our mechanism improves energy efficiency by 23.9% and 7.0% on average over the baseline and the cache-level bypassing mechanisms, respectively. In addition, even if the LLC resource contention occurs, the proposed mechanism is still effective for improving energy efficiency.

  • Facial Recognition of Dairy Cattle Based on Improved Convolutional Neural Network

    Zhi WENG  Longzhen FAN  Yong ZHANG  Zhiqiang ZHENG  Caili GONG  Zhongyue WEI  

     
    PAPER-Image Processing and Video Processing

      Pubricized:
    2022/03/02
      Vol:
    E105-D No:6
      Page(s):
    1234-1238

    As the basis of fine breeding management and animal husbandry insurance, individual recognition of dairy cattle is an important issue in the animal husbandry management field. Due to the limitations of the traditional method of cow identification, such as being easy to drop and falsify, it can no longer meet the needs of modern intelligent pasture management. In recent years, with the rise of computer vision technology, deep learning has developed rapidly in the field of face recognition. The recognition accuracy has surpassed the level of human face recognition and has been widely used in the production environment. However, research on the facial recognition of large livestock, such as dairy cattle, needs to be developed and improved. According to the idea of a residual network, an improved convolutional neural network (Res_5_2Net) method for individual dairy cow recognition is proposed based on dairy cow facial images in this letter. The recognition accuracy on our self-built cow face database (3012 training sets, 1536 test sets) can reach 94.53%. The experimental results show that the efficiency of identification of dairy cows is effectively improved.

  • Detection of Trust Shilling Attacks in Recommender Systems

    Xian CHEN  Xi DENG  Chensen HUANG  Hyoseop SHIN  

     
    LETTER-Data Engineering, Web Information Systems

      Pubricized:
    2022/03/02
      Vol:
    E105-D No:6
      Page(s):
    1239-1242

    Most research on detecting shilling attacks focuses on users' rating behavior but does not consider that attackers may also attack the users' trusting behavior. For example, attackers may give a low score to other users' ratings so that people would think the ratings from the users are not helpful. In this paper, we define the trust shilling attack, propose the behavior features of trust attacks, and present an effective detection method using machine learning methods. The experimental results demonstrate that, based on our proposed behavior features of trust attacks, we can detect trust shilling attacks as well as traditional shilling attacks accurately.

  • Single-Image Camera Calibration for Furniture Layout Using Natural-Marker-Based Augmented Reality

    Kazumoto TANAKA  Yunchuan ZHANG  

     
    LETTER-Multimedia Pattern Processing

      Pubricized:
    2022/03/09
      Vol:
    E105-D No:6
      Page(s):
    1243-1248

    We propose an augmented-reality-based method for arranging furniture using natural markers extracted from the edges of the walls of rooms. The proposed method extracts natural markers and estimates the camera parameters from single images of rooms using deep neural networks. Experimental results show that in all the measurements, the superimposition error of the proposed method was lower than that of general marker-based methods that use practical-sized markers.

  • Automatic Planning Algorithms for 300GHz Wireless Backhaul Links Open Access

    Bo Kum JUNG  Thomas KÜRNER  

     
    INVITED PAPER

      Pubricized:
    2021/12/03
      Vol:
    E105-B No:6
      Page(s):
    685-693

    With the increasing densification of 5G and future 6G networks high-capacity backhaul links to connect the numerous base stations become an issue. Since not all base stations can be connected via fibre links for either technical or economic reasons wireless connections at 300GHz, which may provide data rates comparable to fibre links, are an alternative. This paper deals with the planning of 300GHz backhaul links and describes two novel automatic planning approaches for backhaul links arranged in ring and star topology. The two planning approaches are applied to various scenarios and the corresponding planning results are evaluated by comparing signal to interference plus noise ratio under various simulation conditions including weather impacts showing the feasibility of wireless backhaul links.

  • k-Uniform States and Quantum Combinatorial Designs

    Shanqi PANG  Xiankui PENG  Xiao ZHANG  Ruining ZHANG  Cuijiao YIN  

     
    PAPER-Information Theory

      Pubricized:
    2021/12/20
      Vol:
    E105-A No:6
      Page(s):
    975-982

    Quantum combinatorial designs are gaining popularity in quantum information theory. Quantum Latin squares can be used to construct mutually unbiased maximally entangled bases and unitary error bases. Here we present a general method for constructing quantum Latin arrangements from irredundant orthogonal arrays. As an application of the method, many new quantum Latin arrangements are obtained. We also find a sufficient condition such that the improved quantum orthogonal arrays [10] are equivalent to quantum Latin arrangements. We further prove that an improved quantum orthogonal array can produce a quantum uniform state.

  • Gene Fingerprinting: Cracking Encrypted Tunnel with Zero-Shot Learning

    Ding LI  Chunxiang GU  Yuefei ZHU  

     
    PAPER-Information Network

      Pubricized:
    2022/03/23
      Vol:
    E105-D No:6
      Page(s):
    1172-1184

    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.

  • Improvement of Radiation Efficiency for Platform-Mounted Small Antenna by Evaluation of Characteristic Mode with Metal Casing Using Infinitesimal Dipole

    Takumi NISHIME  Hiroshi HASHIGUCHI  Naobumi MICHISHITA  Hisashi MORISHITA  

     
    PAPER-Antennas

      Pubricized:
    2021/12/14
      Vol:
    E105-B No:6
      Page(s):
    722-728

    Platform-mounted small antennas increase dielectric loss and conductive loss and decrease the radiation efficiency. This paper proposes a novel antenna design method to improve radiation efficiency for platform-mounted small antennas by characteristic mode analysis. The proposed method uses mapping of modal weighting coefficient (MWC) and infinitesimal dipole and evaluate the metal casing with 100mm × 55mm × 23mm as a platform excited by an inverted-F antenna. The simulation and measurement results show that the radiation efficiency of 5% is improved with the whole system from 2.5% of the single antenna.

  • Radio Frame Timing Detection Method Using Demodulation Reference Signals Based on PCID Detection for NR Initial Access

    Kyogo OTA  Daisuke INOUE  Mamoru SAWAHASHI  Satoshi NAGATA  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2021/12/01
      Vol:
    E105-B No:6
      Page(s):
    775-787

    This paper proposes individual computation processes of the partial demodulation reference signal (DM-RS) sequence in a synchronization signal (SS)/physical broadcast channel (PBCH) block to be used to detect the radio frame timing based on SS/PBCH block index detection for New Radio (NR) initial access. We present the radio frame timing detection probability using the proposed partial DM-RS sequence detection method that is applied subsequent to the physical-layer cell identity (PCID) detection in five tapped delay line (TDL) models in both non-line-of-sight (NLOS) and line-of-sight (LOS) environments. Computer simulation results show that by using the proposed method, the radio frame timing detection probabilities of almost 100% and higher than 90% are achieved for the LOS and NLOS channel models, respectively, at the average received signal-to-noise power ratio (SNR) of 0dB with the frequency stability of a local oscillator in a set of user equipment (UE) of 5ppm at the carrier frequency of 4GHz.

  • In Search of the Performance- and Energy-Efficient CNN Accelerators Open Access

    Stanislav SEDUKHIN  Yoichi TOMIOKA  Kohei YAMAMOTO  

     
    PAPER

      Pubricized:
    2021/12/03
      Vol:
    E105-C No:6
      Page(s):
    209-221

    In this paper, starting from the algorithm, a performance- and energy-efficient 3D structure or shape of the Tensor Processing Engine (TPE) for CNN acceleration is systematically searched and evaluated. An optimal accelerator's shape maximizes the number of concurrent MAC operations per clock cycle while minimizes the number of redundant operations. The proposed 3D vector-parallel TPE architecture with an optimal shape can be very efficiently used for considerable CNN acceleration. Due to implemented support of inter-block image data independency, it is possible to use multiple of such TPEs for the additional CNN acceleration. Moreover, it is shown that the proposed TPE can also be uniformly used for acceleration of the different CNN models such as VGG, ResNet, YOLO, and SSD. We also demonstrate that our theoretical efficiency analysis is matched with the result of a real implementation for an SSD model to which a state-of-the-art channel pruning technique is applied.

861-880hit(22683hit)