2021 Ninth International Symposium on Computing and Networking (CANDAR)最新文献_第3页

A Proposal of Code Modification Problem for Web Client Programming Using JavaScript 基于JavaScript的Web客户端编程中的代码修改问题

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00035

Khaing Hsu Wai, N. Funabiki, Khin Thet Mon, San Hay Mar Shwe, Htoo Htoo Sandi Kyaw, Kh Lin

{"title":"A Proposal of Code Modification Problem for Web Client Programming Using JavaScript","authors":"Khaing Hsu Wai, N. Funabiki, Khin Thet Mon, San Hay Mar Shwe, Htoo Htoo Sandi Kyaw, Kh Lin","doi":"10.1109/CANDAR53791.2021.00035","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00035","url":null,"abstract":"Programming Learning Assistant System (PLAS) has been developed as a web-based self-learning platform for programming. PLAS offers several types of exercise problems for code reading and code writing skills, namely, grammar-concept understanding problem (GUP), value trace problem (VTP), element fill-in-blank problem (EFP), code completion problem (CCP), and code writing problem (CWP), to support studies at various levels for C, C++, Java, Python, and JavaScript programming and each problem has different targets for the students. JavaScript is commonly used together with HTML and CSS, to introduce dynamic behaviors of web pages in web application systems. Thus, JavaScript should be studied along with them for web client programming. In this paper, we propose a code modification problem (CMP) as a new type in PLAS, to study web client programming using JavaScript. Since a web page is made by using various functions together, reading and understanding sample source codes using them will be an effective way. Actually, students should have a lot of practices in code reading before implementing source codes from scratch. The CMP instance gives a source code using the functions to be studied and the screenshot of the web page generated by it. Then, it requests to modify the code to generate another web page given by the screenshot. The correctness of any answer is checked through string matching with the correct one. For the evaluation, we generated 25 CMP instances and assigned them to 23 students in Okayama University. Their solution results confirm the validity of the proposal.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"19 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":"115647093","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

Template Protected Fingerprint Verification using Set Similarity-based Minutia Cylinder Code and MinHash 模板保护指纹验证使用设置相似度的圆柱代码和MinHash

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00036

Yoshiko Yasumura, Masakazu Fujio, Wataru Nakamura, Yosuke Kaga, Kenta Takahashi

{"title":"Template Protected Fingerprint Verification using Set Similarity-based Minutia Cylinder Code and MinHash","authors":"Yoshiko Yasumura, Masakazu Fujio, Wataru Nakamura, Yosuke Kaga, Kenta Takahashi","doi":"10.1109/CANDAR53791.2021.00036","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00036","url":null,"abstract":"Various services ranging from finance to public services are digitalized in the recent years for higher efficiency and user convenience. With this service digitalization, the need for digitally identifying and authenticating a user is increasing. Biometric authentication is a user authentication method based on biometrics such as fingerprint, face, and iris, which are unique to each individual, and it is spreading widely in the recent years. In particular, fingerprint biometric systems have a large market share due to its high recognition accuracy, and it is implemented in many mobile devices. Although biometric authentication is convenient, biometric data are sensitive information that needs to be secured from biometric data leakage risk. By using a template protection technique, biometrics can be transformed so that the original biometrics cannot be recovered while enabling verification. However, it has a trade-off between security and accuracy, and remains as a problem to be solved. In this paper, we propose a new fingerprint matching method based on Minutia Cylinder Code (MCC) and Jaccard coefficient, then extend it to template protected fingerprint verification by proposing a new template protection technique using MinHash. Our experimental results show that our proposed fingerprint matching method achieves higher accuracy than the conventional MCC, and that our template protected fingerprint verification has comparable accuracy to that of unprotected matching.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"25 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":"128081954","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

Evaluation of an HLS-based heterogeneous redundant design approach for functional safety systems on FPGAs 基于hls的fpga功能安全系统异构冗余设计方法的评价

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00030

Taichi Saikai, Kotoko Miyata, Taito Manabe, Yuichiro Shibata

{"title":"Evaluation of an HLS-based heterogeneous redundant design approach for functional safety systems on FPGAs","authors":"Taichi Saikai, Kotoko Miyata, Taito Manabe, Yuichiro Shibata","doi":"10.1109/CANDAR53791.2021.00030","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00030","url":null,"abstract":"Field programmable gate arrays (FPGAs) are now used in a wide range of application fields including aerospace, medical, and industrial infrastructure systems, where not only soft errors but also common cause faults must be treated in systems design. Although the heterogeneous redundant design is preferable in such application fields, it tends to be a large burden on system designers. Even with high-level synthesis (HLS) technologies, which have enabled productive design processes without register transfer level (RTL) descriptions, an efficient design approach for redundant design is not always clear. In this paper, we proposed a productive heterogeneous redundant design method, focusing on diversity in FPGA resources. Then, we implemented homogeneous and heterogeneous redundant designs for PID control, using RTL and HLS, and evaluated their error detection capability and reliability. The simulation results showed that heterogeneous redundant designs by the proposed method have a high error detection rate in both RTL and HLS implementations in an application-level circuit.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"75 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":"128167795","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

CANDAR 2021 Conference Organizers 加拿大2021年会议组织者

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/candar53791.2021.00006

引用次数: 0

[Title page] (标题页)

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/candar53791.2021.00002

引用次数: 0

M-KUBOS/PYNQ Cluster for multi-access edge computing 用于多访问边缘计算的M-KUBOS/PYNQ集群

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00020

Takumi Inage, Kazuei Hironaka, Kensuke Iizuka, Kohe Ito, Yasuyu Fukushima, M. Namiki, H. Amano

引用次数: 8

Efficient and Large Scale Pre-training Techniques for Japanese Natural Language Processing 日语自然语言处理的高效大规模预训练技术

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00022

Akihiko Kasagi, Masahiro Asaoka, Akihiro Tabuchi, Yosuke Oyama, Takumi Honda, Yasufumi Sakai, Thang Dang, T. Tabaru

{"title":"Efficient and Large Scale Pre-training Techniques for Japanese Natural Language Processing","authors":"Akihiko Kasagi, Masahiro Asaoka, Akihiro Tabuchi, Yosuke Oyama, Takumi Honda, Yasufumi Sakai, Thang Dang, T. Tabaru","doi":"10.1109/CANDAR53791.2021.00022","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00022","url":null,"abstract":"Pre-training in natural language processing greatly affects the accuracy of downstream tasks. However, pre-training is a bottleneck in the AI system development process because it takes a long time to train the neural network model by using large-scale input data. Our purpose in this paper is to obtain a highly accurate pre-training model in a short time using a large-scale computation environment. Since reducing the time per iteration is difficult even if using large number of computation nodes, it is necessary to reduce the number of iterations. Therefore, we focus on the learning efficiency per iteration and choice a dense Masked Language Model (MLM) task of pretraining in order to utilize a significant power of large-scale cluster. We implemented BERT-xlarge using the dense MLM on Megatron-LM and evaluated the improvement of learning time and learning efficiency for a Japanese language dataset using 768 GPUs on AI Bridging Cloud Infrastructure (ABCI). Our BERT-xlarge improves the learning efficiency per iteration 10 times and completes pre-training in 4.65 hours. This pre-training takes 4.9 months if we use a single GPU. We also evaluated two fine-tunings, JSNLI and Twitter evaluation analysis, to compare the accuracy of downstream tasks with our BERTs and other BERTs. As a result, our BERT-3.9b achieved 94.30% accuracy of JSNLI, and our BERT-xlarge achieved 90.63% accuracy of Twitter evaluation analysis.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","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":"131843215","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

PZLAST: an ultra-fast sequence similarity search tool implemented on a MIMD processor PZLAST:一个在MIMD处理器上实现的超快速序列相似性搜索工具

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00021

Hitoshi Ishikawa, Hiroshi Mori, Koichi Higashi, Yoshiaki Kato, Tomofumi Sakai, T. Ebisuzaki, Ken Kurokawa

引用次数: 1

Solving the sparse QUBO on multiple GPUs for Simulating a Quantum Annealer 模拟量子退火器的多gpu稀疏QUBO求解

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

Tomohiro Imanaga, K. Nakano, Ryota Yasudo, Yasuaki Ito, Yuya Kawamata, Ryota Katsuki, Shiro Ozaki, Takashi Yazane, Kenichiro Hamano

{"title":"Solving the sparse QUBO on multiple GPUs for Simulating a Quantum Annealer","authors":"Tomohiro Imanaga, K. Nakano, Ryota Yasudo, Yasuaki Ito, Yuya Kawamata, Ryota Katsuki, Shiro Ozaki, Takashi Yazane, Kenichiro Hamano","doi":"10.1109/CANDAR53791.2021.00011","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00011","url":null,"abstract":"Quadratic Unconstraint Binary Optimization (QUBO) is a combinatorial optimization problem such that an $ntimes n$ upper triangle matrix $W$ is given and the objective is to find an n-bit vector $X$ that minimizes the energy value $E(X)=X^{T}WX$. A QUBO instance $W$ is sparse if instance $W$ has few non-zero elements. The D-Wave 2000$Q$ is a quantum annealer that can solve 2048-bit sparse QUBO instances represented as a Chimera graph topology. We present a sparse QUBO solver running on GPUs for 2048-bit sparse QUBO with a Chimera graph topology. We have evaluated the performance of our sparse QUBO solver and the D-Wave 2000Q for solving 2048-bit QUBO instances with various resolutions. The experimental results show that our sparse QUBO solver running on a GPU cloud server with 8 NVIDIA A100 GPUs can find optimal solutions in less than 3ms for all instances while the D-Wave 2000$Q$ cannot find them in 996.7ms. Hence, our QUBO solver can find better solutions than the D-Wave 2000Q in less than 1/300 running time. We can think that our QUBO solver is a quantum annealer simulator with better performance in terms of the accuracy of solutions and the running time. Our result implies that quantum annealer D-Wave 2000$Q$ does not achieve quantum supremacy yet.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"1 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":"131292220","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}

引用次数: 3

Reducing Revocation Lists in CS-Based Revocable Group Signature Scheme Using Vector Commitment 利用矢量承诺减少基于cs的可撤销组签名方案中的撤销列表

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00032

Kouhei Sugimoto, T. Nakanishi

引用次数: 0