Wenjun Fan, Jinoh Kim, Ikkyun Kim, Xiaobo Zhou, Sang-Yoon Chang
{"title":"Performance Analyses for Applying Machine Learning on Bitcoin Miners","authors":"Wenjun Fan, Jinoh Kim, Ikkyun Kim, Xiaobo Zhou, Sang-Yoon Chang","doi":"10.1109/ICEIC51217.2021.9369776","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369776","url":null,"abstract":"Bitcoin and cryptocurrency rely on peer-to-peer (P2P) networking. Incorporating intelligence on Bitcoin miners to analyze and control networking can improve the information delivery and defend against networking threats. However, applying machine learning (ML) for building intelligence introduces a challenge because miners participate in the resource-intensive distributed consensus protocol and the ML application can consume much computing resources. In this paper, we study the feasibility and the interplay between ML algorithms and mining operations. Our prototype-based experiments measure and compare the performance of the ML algorithms to evaluate the implementation overhead and efficiencies of the ML algorithms and their impacts on mining operations, i.e., the mining reduction when the ML algorithm is running in parallel.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131393337","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}
{"title":"Comparison of Hardware Accelerator of Matrix Multiplication with Approximate Adders","authors":"Y. Chung, Manhee Cho, Youngmin Kim","doi":"10.1109/ICEIC51217.2021.9369821","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369821","url":null,"abstract":"Approximate computing is attracting attention as an energy-efficient design, especially suitable for Deep Neural Network and Image Processing. In this study, a variety of approximate adders are applied to a hardware accelerator of 8 by 8 Matrix Multiplication in parallel structure to compare Error Distance and Error Rate. In the simulations, each shows different error figures according to metrics for the reliability, and AMA1, InXA2 and VAXA show the fewest errors according to the indicators. In addition, it shows that various approximate adders have few errors that can be used for matrix multiplication, and that parallel structures and approximate computing can be used appropriately for matrix operations.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127832528","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}
{"title":"An Efficient Recognition Method for Object Detection System","authors":"Kyung-Min Lee, Chi-Ho Lin","doi":"10.1109/ICEIC51217.2021.9369802","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369802","url":null,"abstract":"In this paper, we proposed an efficient method of recognition for object detection systems. The proposed method uses convolution layer and PCA to quickly reduce dimensions and extract reliable features. In addition, features extracted from the proposed method calculate vectors in areas corresponding to background of the image. Called eigenvalues and used to create a mask for background. It splits the image into objects and backgrounds. To determine the efficiency of the proposed method, evaluate the INRIA benchmark image data set from $640times 480$ to $128times 64$ to measure accuracy performance. As a result, the performance showed high accuracy and low parameter memory. In conclusion, the proposed method confirmed that efficient object detection is possible.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126260278","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}
{"title":"A virtual reality system for dissecting vertebrates with an observation function","authors":"T. Sekiguchi, M. Makino","doi":"10.1109/ICEIC51217.2021.9369824","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369824","url":null,"abstract":"Giving chances of hands-on experience is important for K-12 education, in order to make students obtain deep understanding. However, there is less opportunities of such experience in science education in Japan, due to some reasons. Therefore, in this paper, a virtual reality system is proposed with which the students can interactively experiment the dissection of vertebrate animals. Through a series of four stages in VR space, the proposed system provides a learner to learn the inner structure of the animal and the procedure of the dissection. Also giving the haptic sense in use of the vibration on the hand controllers, the system represents difference between alive and dead, so that the learner has a chance to think of the animal ethics.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614208","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}
{"title":"Deep Reinforcement Learning-based Task Offloading Decision in the Time Varying Channel","authors":"Jinkyo Jeong, Il Kim, Daesik Hong","doi":"10.1109/ICEIC51217.2021.9369737","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369737","url":null,"abstract":"This paper proposes a dynamic task offloading decision control scheme to minimize the total delay to execute computation task taking into account the time-varying channel. Specifically, we consider the practical task offloading process, where executing computation task is carried out over multiple channel coherence times. In order to make an accurate decision on the task offloading process performed over multiple channel coherence times, we utilize the model-free reinforcement learning, since environment dynamics of the system, channel transition probabilities, is challenging to estimate. We formulate a problem of minimizing the total delay of executing computation task based on a Markov decision process (MDP). In order to solve the MDP problem, we develop a model-free reinforcement learning algorithm. Simulation results show that our proposed scheme outperforms the conventional scheme.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124773178","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}
JiWook Youn, Kyeong‐Eun Han, Jongtae Song, Joonki Lee
{"title":"Experimental Demonstration of Service-Aware Scheduler for Disaggregated Data Centers","authors":"JiWook Youn, Kyeong‐Eun Han, Jongtae Song, Joonki Lee","doi":"10.1109/ICEIC51217.2021.9369768","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369768","url":null,"abstract":"A novel service-aware scheduler and optical circuit switch-based system architecture are proposed for disaggregated data centers. The proposed scheduler classifies requested services into four priorities to ensure differentiated bandwidth. The scheduler provides 100% throughput with scheduling time of 63.3 ns. The measured round-trip latency to access disaggregated memory is 1177.6 ns. The optical circuit switch consists of AWGR and tunable wavelength transceivers.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114644324","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}
{"title":"Hard Deterministic Particle Swarm Optimisation for Certain Result Solution","authors":"S. Thongkrairat, V. Chutchavong","doi":"10.1109/ICEIC51217.2021.9369777","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369777","url":null,"abstract":"Stochastic optimisation's performance is globally acknowledged for its flexibility, robustness and performance – the result of optimisation is usually outstanding and acceptable. However, stochastic methods benefit from random variance to produce feasible results. However, there is one significant disadvantage when it comes to the certainty of results. The stochastic method may give an unsatisfied result. Even though it is an unlikely possibility, it can happen. Therefore, we propose an algorithm that eliminates this problem by changing the calculation core to a deterministic base. In this paper, we select Particle Swarm Optimisation (PSO) as the prototype algorithm and modify the particle moving method to generate an inevitable result. The results show that our process can produce a certain result solution, and the output from our deterministic algorithm is also acceptable, like the original algorithm.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125463197","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}
{"title":"Tile-based Code Generation for Efficiently Accessing to Scratchpad Memory","authors":"Jaewook Lee, Yoonah Paik, S. Kim","doi":"10.1109/ICEIC51217.2021.9369731","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369731","url":null,"abstract":"Most accelerators have used scratchpad memory (SPM) as software-managed working storage. However, the large amount of data used in recent applications like deep learning is hard to fit in the limited storage. It causes a significant burden to a programmer who should efficiently software-manage the SPM. This paper introduces a tile-based code generation for efficiently managing and executing an SPM by modifying Polly's loop tiling in LLVM, i.e., a polyhedral optimization library. For the performance analysis, we analyze the SPM copy overhead depending on a tiling factor.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"119 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116701906","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}
{"title":"Attribute Compression for Point Cloud Data Using Variable Bit Depth and an Error Correction Table","authors":"Min Ku Lee, E. Jang, Eun-Young Chang, J. Cha","doi":"10.1109/ICEIC51217.2021.9369752","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369752","url":null,"abstract":"In this paper, we propose an improved attribute compression method for point cloud data, using variable bit depth and an error correction table. The evolution of sensors makes it possible to represent 3D models ever more precisely by using ever larger amounts of point data, which makes the need for an efficient compression algorithm ever higher. The emerging MPEG Point Cloud Compression (PCC) standard is trying to meet the demand of compression. We tackled two issues in MPEG-I Part 9 G-PCC. First, because encoding the reflectance attribute with a fixed bit depth limits the compression performance, we propose encoding the reflectance attribute with variable bit depth. Second, because errors can occur between the original and reconstructed values when encoding and decoding the reflectance attribute, we propose minimizing them using an error correction table. Experimental results show that the proposed method outperformed MPEG PCC substantially.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116198776","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}
H. Jang, D. Jung, Sungkyu Kwon, Doohyung Cho, Kunsik Park, Jong-Won Lim, Yun Hwa Choi
{"title":"Analysis of Parasitic Effects by Bonding Structure","authors":"H. Jang, D. Jung, Sungkyu Kwon, Doohyung Cho, Kunsik Park, Jong-Won Lim, Yun Hwa Choi","doi":"10.1109/ICEIC51217.2021.9369816","DOIUrl":"https://doi.org/10.1109/ICEIC51217.2021.9369816","url":null,"abstract":"In this paper, a direct-bonded copper (DBC) substrate with wire-bonding and a DBC substrate with clip-bonding are designed and fabricated to compare inductance as their structure. Through a comparison of them, it is proved that the clip for the semiconductor package is suitable for decreasing inductance and direct current resistance (DCR). Also, the clip which has reduced inductance and DCR is expected to improve switching characteristics and efficiency in the power conversion system.","PeriodicalId":170294,"journal":{"name":"2021 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115643079","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}