2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)最新文献_第2页

A New Higher Order Differential of Enocoro-128v2 一种新的Enocoro-128v2高阶微分

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00070

Naoki Shibayama, Y. Igarashi

引用次数: 0

Implementation and Evaluation of an Identity-Based Encryption with Security Against the KGC 基于身份的KGC安全加密的实现与评估

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00061

Shuntaro Ema, Yuta Sato, K. Emura, T. Ohigashi

{"title":"Implementation and Evaluation of an Identity-Based Encryption with Security Against the KGC","authors":"Shuntaro Ema, Yuta Sato, K. Emura, T. Ohigashi","doi":"10.1109/CANDARW53999.2021.00061","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00061","url":null,"abstract":"In identity-based encryption (IBE), a key generation center (KGC) issues a secret key for an identity. Although any value can be used as a public key, the KGC has the potential to decrypt all ciphertexts even if it is not the actual destination. To solve this key escrow problem, Emura, Katsumata, and Watanabe (EKW) proposed an IBE scheme with security against KGC (ESORICS 2019) and provided a pairing-based construction by extending the Boneh-Franklin IBE scheme (CRYPTO 2001). Briefly, they used the Chow framework (PKC 2009), which introduced a new type of authority known as an identity-certifying authority (ICA). Each user obtains an identity certificate from the ICA and can anonymously obtain a secret key from the KGC through an interactive protocol. Though the KGC can issue a secret key without knowing the user’s identity, an additional communication (between the user and the ICA) and computation by the KGC are required compared to the conventional IBE scheme. In this paper, we implement the pairing-based EKW IBE scheme and show that the additional costs are insignificant compared to the Boneh-Franklin IBE scheme.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114673395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Hybrid Interconnection Networks for Reducing Hardware Cost and Improving Path Diversity Based on Fat-Trees and Hypercubes 基于胖树和超立方体的降低硬件成本和提高路径多样性的混合互连网络

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00049

Yaodong Wang, Yamin Li

引用次数: 0

A Proposal of Dynamic Job Scheduling Algorithm Considering CPU Core Utilization for User-PC Computing System 一种考虑CPU内核利用率的用户pc计算系统动态作业调度算法

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00051

Ariel Kamoyedji, N. Funabiki, Hein Htet, M. Kuribayashi

{"title":"A Proposal of Dynamic Job Scheduling Algorithm Considering CPU Core Utilization for User-PC Computing System","authors":"Ariel Kamoyedji, N. Funabiki, Hein Htet, M. Kuribayashi","doi":"10.1109/CANDARW53999.2021.00051","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00051","url":null,"abstract":"The User-PC computing system (UPC) has been studied as a very low cost distributed computing platform that leverages idling resources of users’ personal computers (PCs). Designed according to the master-worker model, the master PC accepts jobs from users and assigns them to available worker PCs. An efficient static job assignment algorithm considering CPU core utilization has already been devised for the UPC system. It finds an optimal assignment that minimizes the makespan in a static scenario, i.e. jobs are all available in the beginning and all worker PCs are idle. However, in reality, jobs dynamically join and leave the system and as such, some workers may be busy when new jobs arrive. In this paper, we propose a dynamic job scheduling algorithm for the UPC system by extending the static job assignment algorithm. It finds assigned workers to all queuing jobs either on new job arrival, or on job completion by a worker PC. For evaluation, we conducted experiments using six worker PCs and up to 42 jobs. Our algorithm could significantly reduce the makespan compared to other scheduling algorithms.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":" 105","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113952859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A Performance Evaluation of Vehicular Swarm Intelligence for Seamless Route Guidance using Opportunistic Networking 基于机会网络的车辆群智能无缝路径引导性能评价

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00008

Shogo Amita, A. Fujihara

{"title":"A Performance Evaluation of Vehicular Swarm Intelligence for Seamless Route Guidance using Opportunistic Networking","authors":"Shogo Amita, A. Fujihara","doi":"10.1109/CANDARW53999.2021.00008","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00008","url":null,"abstract":"We considered a vehicular route guidance system in normal times that can be seamlessly transferable to a evacuation guidance system in times of disaster. In recent years, based on the high penetration rate and availability of smartphones, several swarm intelligence systems have been proposed where mobile nodes autonomously collect information on impassable and congested areas by disaster using their smartphone applications to guide evacuation by sharing the information with other nodes in proximity. It was not fully understood whether this guidance method in times of disaster is also effective as a route guidance method in normal times. For example, the impact of the method on travel time and distance have not been theoretically evaluated in normal times, where there are various destinations for each traffic vehicle. In addition, it was not known what proportion of the vehicles with proximity information sharing will be effective for smooth movement in normal times. In this study, we performed simulations of vehicles and their opportunistic networking in grid-like road networks assuming an urban area to investigate the effects of the number of traffic vehicles, the proportion of traffic vehicles sharing proximity information, and the number of road closures on distributions of travel time and distance. By using Wilcoxon signed-rank test, we found scenarios in which there was a significant difference in the distributions compared to the corresponding scenarios without proximity information sharing. As a result, we confirmed that if the proportion of vehicles sharing proximity information is more than 50%, significant differences in the distributions occur when the size of the road network and the number of vehicles are sufficiently large, where a large-scale traffic congestion is more likely to occur. We also confirmed more significant differences as increasing the number of road closures.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122742120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A GPU Implementation of Watercolor Painting Image Generation 水彩画图像生成的GPU实现

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00031

Jiamian Huang, Yasuaki Ito, K. Nakano

{"title":"A GPU Implementation of Watercolor Painting Image Generation","authors":"Jiamian Huang, Yasuaki Ito, K. Nakano","doi":"10.1109/CANDARW53999.2021.00031","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00031","url":null,"abstract":"Stroke-based rendering is a technique to generate images with the painting effect of an actual brush stroke by repeating a drawing, called a stroke, many times. In this paper, we propose a watercolor image generation with stroke-based rendering. We use a physical model that simulates a watercolor painting on paper by computing the movement of water and pigment. This method requires a large number of strokes to be drawn one by one, and the computational cost of watercolor simulation for each stroke drawn is also very high. Therefore, to reduce the generation time, we propose a parallel algorithm for drawing multiple strokes simultaneously. The idea of the parallel algorithm is to generate multiple strokes independently. However, since some of the generated strokes have overlaps, such strokes cannot be drawn simultaneously. In our approach, we find non-overlapping strokes by reducing this problem to the independent point set problem and solving it instead. Furthermore, we implement this parallel algorithm on the GPU. Experimental results show that the proposed GPU implementation on NVIDIA GeForce RTX 3090 attains a speed-up factor of up to 75 over a sequential execution on the CPU.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122823504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Recognizing HPC Workloads Based on Power Draw Signatures 基于功耗特征的HPC工作负载识别

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00053

Sven Köhler, Lukas Wenzel, Max Plauth, Pawel Böning, Philipp Gampe, Leonard Geier, A. Polze

引用次数: 1

An Enhancement of Physical Web with Stateful BLE Beacons 有状态BLE信标对物理Web的增强

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00011

Kobayashi Kakeru, S. Fujita

引用次数: 1

A machine learning-based NIDS that collects training data from within the organization and updates the discriminator periodically and automatically 基于机器学习的NIDS，从组织内部收集训练数据，并定期自动更新鉴别器

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00077

Hideya Sato, R. Kobayashi

引用次数: 0

Supporting Music Arrangement, Ringer Assignment, and Score Preparation for Musicbell Ensembles 支持音乐安排，铃声分配，和乐谱准备为音乐钟合奏

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00092

Shumpei Miyake, Keita Ushida

引用次数: 0