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

Keyword Search Result

[Keyword] (42807hit)

2541-2560hit(42807hit)

  • Non-Orthogonal Packet Access Based on Low Density Signature With Phase Only Adaptive Precoding

    Satoshi DENNO  Ryoko SASAKI  Yafei HOU  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2020/09/15
      Vol:
    E104-B No:3
      Page(s):
    328-337

    This paper proposes non-orthogonal packet access based on low density signature with phase only adaptive precoding. The proposed access allows multiple user terminals to send their packets simultaneously for implementing massive connectivity, though only one antenna is put on every terminal and on an access point. This paper proposes a criterion that defines the optimum rotation angles for the phase only precoding, and an algorithm based on the steepest descent to approach the optimum rotation angles. Moreover, this paper proposes two complexity-reduced algorithms that converge much faster than the original algorithm. When 6 packets are transmitted in 4 time slots, i.e., overloading ratio of 1.5, the proposed adaptive precoding based on all the proposed algorithms attains a gain of about 4dB at the BER of 10-4 in Rician fading channels.

  • Constructions and Some Search Results of Ternary LRCs with d = 6 Open Access

    Youliang ZHENG  Ruihu LI  Jingjie LV  Qiang FU  

     
    LETTER-Coding Theory

      Pubricized:
    2020/09/01
      Vol:
    E104-A No:3
      Page(s):
    644-649

    Locally repairable codes (LRCs) are a type of new erasure codes designed for modern distributed storage systems (DSSs). In order to obtain ternary LRCs of distance 6, firstly, we propose constructions with disjoint repair groups and construct several families of LRCs with 1 ≤ r ≤ 6, where codes with 3 ≤ r ≤ 6 are obtained through a search algorithm. Then, we propose a new method to extend the length of codes without changing the distance. By employing the methods such as expansion and deletion, we obtain more LRCs from a known LRC. The resulting LRCs are optimal or near optimal in terms of the Cadambe-Mazumdar (C-M) bound.

  • FOREWORD Open Access

    Atsuyoshi NAKAMURA  

     
    FOREWORD

      Vol:
    E104-D No:3
      Page(s):
    354-354
  • FOREWORD Open Access

    Hiroaki HARAI  

     
    FOREWORD

      Vol:
    E104-B No:3
      Page(s):
    187-187
  • Real-Time Distant Sound Source Suppression Using Spectral Phase Difference

    Kazuhiro MURAKAMI  Arata KAWAMURA  Yoh-ichi FUJISAKA  Nobuhiko HIRUMA  Youji IIGUNI  

     
    PAPER-Engineering Acoustics

      Pubricized:
    2020/09/24
      Vol:
    E104-A No:3
      Page(s):
    604-612

    In this paper, we propose a real-time BSS (Blind Source Separation) system with two microphones that extracts only desired sound sources. Under the assumption that the desired sound sources are close to the microphones, the proposed BSS system suppresses distant sound sources as undesired sound sources. We previously developed a BSS system that can estimate the distance from a microphone to a sound source and suppress distant sound sources, but it was not a real-time processing system. The proposed BSS system is a real-time version of our previous BSS system. To develop the proposed BSS system, we simplify some BSS procedures of the previous system. Simulation results showed that the proposed system can effectively suppress the distant source signals in real-time and has almost the same capability as the previous system.

  • Robustness of Deep Learning Models in Dermatological Evaluation: A Critical Assessment

    Sourav MISHRA  Subhajit CHAUDHURY  Hideaki IMAIZUMI  Toshihiko YAMASAKI  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2020/12/22
      Vol:
    E104-D No:3
      Page(s):
    419-429

    Our paper attempts to critically assess the robustness of deep learning methods in dermatological evaluation. Although deep learning is being increasingly sought as a means to improve dermatological diagnostics, the performance of models and methods have been rarely investigated beyond studies done under ideal settings. We aim to look beyond results obtained on curated and ideal data corpus, by investigating resilience and performance on user-submitted data. Assessing via few imitated conditions, we have found the overall accuracy to drop and individual predictions change significantly in many cases despite of robust training.

  • Benchmarking Modern Edge Devices for AI Applications

    Pilsung KANG  Jongmin JO  

     
    PAPER-Computer System

      Pubricized:
    2020/12/08
      Vol:
    E104-D No:3
      Page(s):
    394-403

    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.

  • Experimental Verification of SDN/NFV in Integrated mmWave Access and Mesh Backhaul Networks Open Access

    Makoto NAKAMURA  Hiroaki NISHIUCHI  Jin NAKAZATO  Konstantin KOSLOWSKI  Julian DAUBE  Ricardo SANTOS  Gia Khanh TRAN  Kei SAKAGUCHI  

     
    PAPER-Network

      Pubricized:
    2020/09/29
      Vol:
    E104-B No:3
      Page(s):
    217-228

    In this paper, a Proof-of-Concept (PoC) architecture is constructed, and the effectiveness of mmWave overlay heterogeneous network (HetNet) with mesh backhaul utilizing route-multiplexing and Multi-access Edge Computing (MEC) utilizing prefetching algorithm is verified by measuring the throughput and the download time of real contents. The architecture can cope with the intensive mobile data traffic since data delivery utilizes multiple backhaul routes based on the mesh topology, i.e. route-multiplexing mechanism. On the other hand, MEC deploys the network edge contents requested in advance by nearby User Equipment (UE) based on pre-registered context information such as location, destination, demand application, etc. to the network edge, which is called prefetching algorithm. Therefore, mmWave access can be fully exploited even with capacity-limited backhaul networks by introducing the proposed algorithm. These technologies solve the problems in conventional mmWave HetNet to reduce mobile data traffic on backhaul networks to cloud networks. In addition, the proposed architecture is realized by introducing wireless Software Defined Network (SDN) and Network Function Virtualization (NFV). In our architecture, the network is dynamically controlled via wide-coverage microwave band links by which UE's context information is collected for optimizing the network resources and controlling network infrastructures to establish backhaul routes and MEC servers. In this paper, we develop the hardware equipment and middleware systems, and introduce these algorithms which are used as a driver of IEEE802.11ad and open source software. For 5G and beyond, the architecture integrated in mmWave backhaul, MEC and SDN/NFV will support some scenarios and use cases.

  • Lightweight Operation History Graph for Traceability on Program Elements

    Takayuki OMORI  Katsuhisa MARUYAMA  Atsushi OHNISHI  

     
    PAPER-Software System

      Pubricized:
    2020/12/15
      Vol:
    E104-D No:3
      Page(s):
    404-418

    History data of edit operations are more beneficial than those stored in version control systems since they provide detailed information on how source code was changed. Meanwhile, a large number of recorded edit operations discourage developers and researchers from roughly understanding the changes. To assist with this task, it is desirable that they easily obtain traceability links for changed program elements over two source code snapshots before and after a code change. In this paper, we propose a graph representation called Operation History Graph (OHG), which presents code change information with such traceability links that are inferred from the history of edit operations. An OHG instance is generated by parsing any source code snapshot restored by edit histories and combining resultant abstract syntax trees (ASTs) into a single graph structure. To improve the performance of building graph instances, we avoided simply maintaining every program element. Any program element presenting the inner-structure of methods and non-changed elements are omitted. In addition, we adopted a lightweight static analysis for type name resolving to reduce required memory resource in the analysis while the accuracy of name resolving is preserved. Moreover, we assign a specific ID to each node and edge in the graph instance so that a part of the graph data can be separately stored and loaded on demand. These decisions make it feasible to build, manipulate, and store the graph with limited computer resources. To demonstrate the usefulness of the proposed operation history graph and verify whether detected traceability links are sufficient to reveal actual changes of program elements, we implemented tools to generate and manipulate OHG instances. The evaluation on graph generation performance shows that our tool can reduce the required computer resource as compared to another tool authors previously proposed. Moreover, the evaluation on traceability shows that OHG provides traceability links with sufficient accuracy as compared to the baseline approach using GumTree.

  • Geolocation-Centric Information Platform for Resilient Spatio-temporal Content Management Open Access

    Kazuya TSUKAMOTO  Hitomi TAMURA  Yuzo TAENAKA  Daiki NOBAYASHI  Hiroshi YAMAMOTO  Takeshi IKENAGA  Myung LEE  

     
    INVITED PAPER-Network

      Pubricized:
    2020/09/11
      Vol:
    E104-B No:3
      Page(s):
    199-209

    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.

  • A Satisfiability Algorithm for Synchronous Boolean Circuits

    Hiroki MORIZUMI  

     
    LETTER

      Pubricized:
    2020/11/02
      Vol:
    E104-D No:3
      Page(s):
    392-393

    The circuit satisfiability problem has been intensively studied since Ryan Williams showed a connection between the problem and lower bounds for circuit complexity. In this letter, we present a #SAT algorithm for synchronous Boolean circuits of n inputs and s gates in time $2^{nleft(1 - rac{1}{2^{O(s/n)}} ight)}$ if s=o(n log n).

  • End-to-End SDN/NFV Orchestration of Multi-Domain Transport Networks and Distributed Computing Infrastructure for Beyond-5G Services Open Access

    Carlos MANSO  Pol ALEMANY  Ricard VILALTA  Raul MUÑOZ  Ramon CASELLAS  Ricardo MARTÍNEZ  

     
    INVITED PAPER-Network

      Pubricized:
    2020/09/11
      Vol:
    E104-B No:3
      Page(s):
    188-198

    The need of telecommunications operators to reduce Capital and Operational Expenditures in networks which traffic is continuously growing has made them search for new alternatives to simplify and automate their procedures. Because of the different transport network segments and multiple layers, the deployment of end-to-end services is a complex task. Also, because of the multiple vendor existence, the control plane has not been fully homogenized, making end-to-end connectivity services a manual and slow process, and the allocation of computing resources across the entire network a difficult task. The new massive capacity requested by Data Centers and the new 5G connectivity services will urge for a better solution to orchestrate the transport network and the distributed computing resources. This article presents and demonstrates a Network Slicing solution together with an end-to-end service orchestration for transport networks. The Network Slicing solution permits the co-existence of virtual networks (one per service) over the same physical network to ensure the specific service requirements. The network orchestrator allows automated end-to-end services across multi-layer multi-domain network segments making use of the standard Transport API (TAPI) data model for both l0 and l2 layers. Both solutions will allow to keep up with beyond 5G services and the higher and faster demand of network and computing resources.

  • On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes

    Kento KIMURA  Kazuyuki AMANO  Tetsuya ARAKI  

     
    PAPER

      Pubricized:
    2020/10/14
      Vol:
    E104-D No:3
      Page(s):
    355-361

    Given a box of some specified size and a number of pieces of some specified shape, the anti-slide problem considers how to pack the pieces such that none of the pieces in the box can slide in any direction. The object is to find such a sparsest packing. In this paper, we consider the problem for the case of a two-dimensional square box using T-tetromino pieces. We show that, for a square box of side length n, the number of pieces in a sparsest packing is exactly $lfloor 2n/3 floor$ when n≢0 (mod 3), and is between 2n/3-1 and n-1 when n≡0 (mod 3).

  • Compact Model of Magnetic Tunnel Junctions for SPICE Simulation Based on Switching Probability

    Haoyan LIU  Takashi OHSAWA  

     
    PAPER-Semiconductor Materials and Devices

      Pubricized:
    2020/09/08
      Vol:
    E104-C No:3
      Page(s):
    121-127

    We propose a compact magnetic tunnel junction (MTJ) model for circuit simulation by de-facto standard SPICE in this paper. It is implemented by Verilog-A language which makes it easy to simulate MTJs with other standard devices. Based on the switching probability, we smoothly connect the adiabatic precessional model and the thermal activation model by using an interpolation technique based on the cubic spline method. We can predict the switching time after a current is applied. Meanwhile, we use appropriate physical models to describe other MTJ characteristics. Simulation results validate that the model is consistent with experimental data and effective for MTJ/CMOS hybrid circuit simulation.

  • Clustering of Handwritten Mathematical Expressions for Computer-Assisted Marking

    Vu-Tran-Minh KHUONG  Khanh-Minh PHAN  Huy-Quang UNG  Cuong-Tuan NGUYEN  Masaki NAKAGAWA  

     
    PAPER-Educational Technology

      Pubricized:
    2020/11/24
      Vol:
    E104-D No:2
      Page(s):
    275-284

    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.

  • FOREWORD Open Access

    Tomotaka WADA  

     
    FOREWORD

      Vol:
    E104-A No:2
      Page(s):
    348-348
  • FOREWORD Open Access

    Pingzhi FAN  Tetsuya KOJIMA  

     
    FOREWORD

      Vol:
    E104-A No:2
      Page(s):
    375-375
  • FOREWORD Open Access

    Nobuyuki ITOH  

     
    FOREWORD

      Vol:
    E104-A No:2
      Page(s):
    476-476
  • Temperature-Robust 0.48-V FD-SOI Intermittent Startup Circuit with 300-nA Quiescent Current for Batteryless Wireless Sensor Capable of 1-μA Energy Harvesting Sources

    Minoru SUDO  Fumiyasu UTSUNOMIYA  Ami TANAKA  Takakuni DOUSEKI  

     
    PAPER

      Vol:
    E104-A No:2
      Page(s):
    506-515

    A temperature-variation-tolerant intermittent startup circuit (ISC) that suppresses quiescent current to 300nA at 0.48V was developed. The ISC is a key circuit for a batteryless wireless sensor that can detect a 1μA generation current of energy harvesting sources from the intervals of wireless signals. The ISC consists of an ultralow-voltage detector composed of a depletion-type MOSFET and low-Vth MOSFETs, a Dickson-type gate-boosted charge pump circuit, and a power-switch control circuit. The detector consists of a voltage reference comparator and a feedback-controlled latch circuit for a hysteresis function. The voltage reference comparator, which has a common source stage with a folded constant-current-source load composed of a depletion-type nMOSFET, makes it possible to reduce the temperature dependency of the detection voltage, while suppressing the quiescent current to 300nA at 0.48V. The ISC fabricated with fully-depleted silicon-on-insulator (FD-SOI) CMOS technology also suppresses the variation of the quiescent current. To verify the effectiveness of the circuit, the ISC was fabricated in a 0.8-μm triple-Vth FD-SOI CMOS process. An experiment on the fabricated system, the ISC boosts the input voltage of 0.48V to 2.4V while suppressing the quiescent current to less than 300nA at 0.48V. The measured temperature coefficient of the detection voltage was ±50ppm/°C. The fluctuation of the quiescent current was 250nA ± 90nA in the temperature range from 0°C to 40°C. An intermittent energy harvesting sensor with the ISC was also fabricated. The sensor could detect a generation current of 1μA at EH sources within an accuracy of ±15% in the temperature range from 0°C to 40°C. It was also successfully applied to a self-powered wireless plant-monitoring sensor system.

  • Mobility Innovation “Another CASE” Open Access

    Koji OGURI  Haruki KAWANAKA  Shintaro ONO  

     
    INVITED PAPER

      Vol:
    E104-A No:2
      Page(s):
    349-356

    The environment surrounding automotive technology is undergoing a major transformation. In particular, as technological innovation advances in new areas called “CASE” such as Connected, Autonomous/Automated, Shared, and Electric, various research activities are underway. However, this is an approach from the standpoint of the automobile centered, and when considering the development of a new automobile society, it is necessary to consider from the standpoint of “human centered,” who are users, too. Therefore, this paper proposes the possibility of technological innovation in the area of “Another CASE” such as Comfortable, Accessible, Safety, and Enjoy/Exciting, and introduces the contents of some interesting researches.

2541-2560hit(42807hit)