Parallel processing area extraction and data transfer number reduction for automatic GPU offloading of IoT applications

For Open IoT, we have proposed Tacit Computing technology to discover the devices that have data users need on demand and use them dynamically and an automatic GPU offloading technology as an elementary technology of Tacit Computing. However, it can improve limited applications because it only optimizes parallelizable loop statements extraction. Thus, in this paper, to improve performances of more applications automatically, we propose an improved method with reduction of data transfer between CPU and GPU. We evaluate our proposed offloading method by applying it to Darknet and find that it can process it 3 times as quickly as only using CPU.Comment: 6 pages, 4 figures, in Japanese, IEICE Technical Report, SC2018-3

Experiments of posture estimation on vehicles using wearable acceleration sensors

In this paper, we study methods to estimate drivers' posture in vehicles using acceleration data of wearable sensor and conduct a field test. Recently, sensor technologies have been progressed. Solutions of safety management to analyze vital data acquired from wearable sensor and judge work status are proposed. To prevent huge accidents, demands for safety management of bus and taxi are high. However, acceleration of vehicles is added to wearable sensor in vehicles, and there is no guarantee to estimate drivers' posture accurately. Therefore, in this paper, we study methods to estimate driving posture using acceleration data acquired from T-shirt type wearable sensor hitoe, conduct field tests and implement a sample application.Comment: 4 pages, 4 figures, The 3rd IEEE International Conference on Big Data Security on Cloud (BigDataSecurity 2017), pp.14-17, Beijing, May 201

Server Structure Proposal and Automatic Verification Technology on IaaS Cloud of Plural Type Servers

In this paper, we propose a server structure proposal and automatic performance verification technology which proposes and verifies an appropriate server structure on Infrastructure as a Service (IaaS) cloud with baremetal servers, container based virtual servers and virtual machines. Recently, cloud services have been progressed and providers provide not only virtual machines but also baremetal servers and container based virtual servers. However, users need to design an appropriate server structure for their requirements based on 3 types quantitative performances and users need much technical knowledge to optimize their system performances. Therefore, we study a technology which satisfies users' performance requirements on these 3 types IaaS cloud. Firstly, we measure performances of a baremetal server, Docker containers, KVM (Kernel based Virtual Machine) virtual machines on OpenStack with virtual server number changing. Secondly, we propose a server structure proposal technology based on the measured quantitative data. A server structure proposal technology receives an abstract template of OpenStack Heat and function/performance requirements and then creates a concrete template with server specification information. Thirdly, we propose an automatic performance verification technology which executes necessary performance tests automatically on provisioned user environments according to the template.Comment: Evaluations of server structure proposal were insufficient in section

Security Camera Movie and ERP Data Matching System to Prevent Theft

In this paper, we propose a SaaS service which prevents shoplifting using image analysis and ERP. In Japan, total damage of shoplifting reaches 450 billion yen. Based on cloud and data analysis technology, we propose a shoplifting prevention service with image analysis of security camera and ERP data check for small shops. We evaluated movie analysis.Comment: 2 pages, 2 figures, IEEE Consumer Communications and Networking Conference (CCNC2017), pp.1021-1022, Jan. 201

Sequentially Stable Coalition Structures

In this paper, we examine the question of which coalition structures farsighted players form in coalition formation games with externalities. We introduce a stability concept for a coalition structure called a sequentially stable coalition structure. Our concept of domination between two coalition structures is based on a “step-by-step” approach to describe negotiation steps concretely by restricting how coalition structures can change: when one coalition structure is changed to another one, either (i) only one merging of two separate coalitions into a coalition occurs, or (ii) only one breaking up of a coalition into two separate coalitions happens. As applications of our stability notion, we show that the efficient grand coalition structure can be sequentially stable in simple partition function form games and common pool resource games.