{"title":"Efficiency Comparison of Row-Diagonal Parity and EVENODD Encoded Check Disk Repair Algorithms","authors":"Yiran Chen","doi":"10.1109/ISAIEE57420.2022.00019","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00019","url":null,"abstract":"The high dependence on information technology in modern society leads to the ever-increasing demand for data reliability and availability. However, the increasing size of systems and the use of cheap but less reliable components have made component failures such as disk failures more common. As a new algorithm Row-Diagonal Parity (RDP) for the propose of protecting against double disk failures. It stores all unencoded data and uses only the entire operation during construction and reconstruction to computational complexity. RDP works in individual stripe blocks commonly used in file systems, disk arrays, and databases. In the information column, use parity lines of a different slope, or slopes, to obtain a check column. The code word of an EVENODD code is placed in an array of (m-1)*(m+2), where m is a prime number, where the information is set in an array of (m-1)*m, and the last two columns are the parity information characters. Two columns of parity bits are XOR by the information bits in the same row or on the diagonal of a given slope. The layout strategy using EVENODD coding algorithm can allow two data blocks to error at the same time, which can ensure the stability of the system. It has been widely used in technologies such as RAID (Redundant Arrays of Independent Disks).A fast repair algorithm is proposed the check disk failure repair problem in distributed storage systems based on RAID 6 encoding. This paper proposed a fast repair algorithm. Through the theoretical analysis of RDP and EVENODD encoding, the node's computational encoding capability is used to transfer encoded data blocks to repair the checksum disk, which reduces the data transfer during the repair process and shortens the repair time. The theoretical analysis shows that this algorithm can significantly reduce the bandwidth resources consumed during the check disk failure repair process and improve the repair efficiency compared to traditional repair algorithms.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115120582","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":"Analysis of Learning Mechanism of Generative Adversarial Network","authors":"Yuning Zhang","doi":"10.1109/ISAIEE57420.2022.00020","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00020","url":null,"abstract":"The generative adversarial network learns different kinds of real images and generates corresponding fake images. The image quality generated based on the generative adversarial network show the strength of the learning ability of the model for different kinds of images. Based on the apparent differences in features of different types of images, this paper proposes to judge the strength of features of different kinds of images in the generative adversarial network learning process based on generative adversarial networks and convolutional neural networks. The experiment uses three different kinds of data sets, including cartoon, face and food, and carries out three groups of experiments. The experimental results show that the simpler the image is, the stronger the learning ability is.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354327","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":"Probabilistic Load Flow Using Point Estimate Method Based on Nataf Transformation for Active Distribution Network","authors":"Youlin Bai","doi":"10.1109/ISAIEE57420.2022.00026","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00026","url":null,"abstract":"To deal with the uncertainty and correlation of renewable energy resources and loads, a probabilistic load flow method for active distribution network considering the correlation between input variables is proposed. Firstly, the probabilistic models of uncertain input variables are established respectively, and then the sampling points in the independent standard normal space can be transformed into the relevant non-normal variable space through inverse Nataf transformation. Next, improved probabilistic load flow method using three-point estimate method with Nataf transformation is proposed to fit the probability distribution of each output variable. At last, accuracy of the proposed algorithm has been validated by the comparative tests in IEEE 33-bus distribution system.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116178257","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":"Promoting System for Students' Creativity Based on Optimization Algorithm","authors":"Jingqiu Yang, Minte Fan","doi":"10.1109/ISAIEE57420.2022.00128","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00128","url":null,"abstract":"As the training object of the school, the creativity of students is related to whether the school can provide the society with talents who meet the needs of economic development and possess certain creativity. The purpose of this paper is to study the design of students' creativity-promoting systems based on optimization algorithms. Through a large number of related materials, the research status of students' creativity education and the connotation and characteristics of students' creativity are analyzed and studied, and the problems and solutions of the current students' creativity to promote informatization are learned. The promotion system of student creativity has designed and developed functional modules such as maker courses, maker activities, maker innovation works, maker information, etc. We have conducted research on students' creativity and promotion effect. On the basis of Creativity, the evaluation index system and scoring standard of creativity are established, and the optimized mathematical formula for the promotion effect of creativity is given. By calculating the creativity score of a student after using the system, the student's creativity score increased from 60 points to 69 points at the beginning, and the system can meet the needs of users.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122446104","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}
Taiheng Zheng, Chaoping Wang, Fengqian Sun, Haiying Liu
{"title":"Traffic Statistics Based on Lightweight Multi-objective Tracking Algorithm","authors":"Taiheng Zheng, Chaoping Wang, Fengqian Sun, Haiying Liu","doi":"10.1109/ISAIEE57420.2022.00034","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00034","url":null,"abstract":"In the field of intelligent transportation, traffic flow statistics has been an important research branch. With the continuous development of deep learning technology, there have been many algorithms applied in the field of intelligent transportation, but the existing traffic flow statistics methods have poor accuracy, are greatly affected by environmental lighting, etc., and the large amount of computing leads to high requirements for hardware equipment and other disadvantages. In this paper, we propose a lightweight multi-target tracking algorithm based on the improved YOLOv5 and DeepSORT. A new structure of self-attentive mechanism and convolutional network integration is added to the backbone network of YOLOv5, which effectively improves the accuracy of the algorithm without enhancing the original computation. In DeepSORT tracking, a light-weight network ShufflenetV2 is used instead of the original heavy identification network to reduce the amount of network computation and make the algorithm less configurable for mobile devices. The experimental results show that the proposed algorithm is highly accurate, feasible and can calculate the traffic flow in real time.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123186154","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":"Research on the Level Test Application System of Computer Artificial Intelligence Technology in English Education","authors":"Chen Dan","doi":"10.1109/ISAIEE57420.2022.00013","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00013","url":null,"abstract":"Based on computer artificial intelligence technology, this paper designs an online automatic evaluation and correction system for higher vocational English based on the combination of C/S mode and B/S mode. This paper firstly designs the functional requirements of the system. The design of the system implementation plan adopts the C/S mode to realize the evaluation and reform. The system implements the English online test process according to the scale of the higher vocational English test and the test requirements and through modules such as group test management, score management, and online test. In this paper, the genetic algorithm is used to determine the optimal solution of the test papers. The system has the advantages of high utilization of network resources, flexible deployment and convenient updating. The simulation results show that the online testing system for higher vocational English education can improve students' English level, especially to cultivate students' online reading habits and help students to correct pronunciation and intonation.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124952540","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":"ASC Model Based on Feature Stratification and Multichannel ECAP A- TDNN","authors":"Ai Xin, Zhang Haitao, Zhao Shuai","doi":"10.1109/ISAIEE57420.2022.00118","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00118","url":null,"abstract":"The input audio signal in the acoustic scene classification(ASC) task is composed of multiple acoustic events superimposed on each other, leading to problems such as low recognition rate of complex environments and easy overfitting of the model easily. An ASC model based on feature stratification and multichannel ECAPA- TDNN is proposed to address the above problems. Firstly, the extended harmonic-percussive source separation(HPSS) technique is used to divide the log-Mel spectrogram into three components of harmonics, percussive sources and residuals, each of which contains specific types of feature data, to strip the audio signals in the superposition state. On the other hand, the ECAP A-TDNN network structure, which has performed well in the field of acoustic recognition, is applied, and a multichannel ECAP A-TDNN is proposed in combination with the group convolution technique, into which the feature components are input for the ASC task. The results show that the ASC model based on feature stratification can not only reduce the overfitting problem generated by audio overlap, but also enhance the recognition ability of the model for complex environments; moreover, ECAPA-TDNN can achieve a more continuous focus on acoustic features and improve the classification performance while maintaining the original parameter magnitude.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127401549","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 Novel Recommendation Model Based on Interactive Nearest Neighbor Sessions","authors":"Xueli Shen, Yijun Liu, Xiangfu Meng","doi":"10.1109/ISAIEE57420.2022.00119","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00119","url":null,"abstract":"For some session recommendation algorithms, only the information in the target session is modeled, ignoring the auxiliary role of the interactive nearest neighbor sessions to the target session, resulting in the potential collaborative information is not fully utilized. Therefore,we propose a novel recommendation model based on interactive nearest neighbor sessions(ARMBINNS). Firstly,a directed current session graph (DCSG) is constructed, which focuses on the conversion transitions between frequent items in the target session. The directed current session graph is modeled by graph neural network and soft attention mechanism to generate the session representation of user preference items. Then we search the interactive nearest neighbor sessions of the target session, select items from interactive nearest neighbor sessions and construct undirected interactive nearest neighbor graph (UING) with the target session. Similarly, the undirected interactive nearest neighbor graph is modeled by graph neural network and soft attention mechanism to generate a session representation with nearest neighbor information. Finally, rich session embedding is generated by combining the two types of session representation information through the fusion gating mechanism. Through experiments, it is verified that the proposed model has better recommendation performance compared with 9 advanced recommendation methods.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127382141","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":"Research on Data System Data Classification Methods Based on Convolutional Neural Networks","authors":"L. Yu, Xiaoxin Ru","doi":"10.1109/ISAIEE57420.2022.00071","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00071","url":null,"abstract":"A large amount of business data contains a huge value in the information system. Especially since the information system has entered various industries, the industry knowledge contained in it often helps promote the development of the industry. Therefore, data system data mining is very important. However, there are a large amount of non-balanced data inside the information system, which is difficult to apply for traditional classifiers. This article proposes to use integrated learning ideas to solve a small amount of data in the non-balanced data classification of non-balanced data classification through deep convolutional neural networks, which is easily ignored. It is expected that this article's research can help the information system data classification work.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129596284","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}
Liu Lamei, Fang Junjie, Huang Huiling, Zhang Yongjian, Han Jun
{"title":"Mask Defect Detection Algorithm Based on Improved EfficientNetV2","authors":"Liu Lamei, Fang Junjie, Huang Huiling, Zhang Yongjian, Han Jun","doi":"10.1109/ISAIEE57420.2022.00110","DOIUrl":"https://doi.org/10.1109/ISAIEE57420.2022.00110","url":null,"abstract":"Aiming at the problem of insufficient detection accuracy of mask defects with many types and large differences, a deep learning classification algorithm based on improved efficientnetv2 is proposed to achieve efficient detection of fourteen complex mask defects. In this paper, efficientnetv2 with strong feature extraction ability is used as the backbone network, combined with the improved compression and incentive attention mechanism, h-swish activation function and label smoothing technology, to enhance the attention of the model to defects, improve the detection speed of the model, reduce the impact of noise, and reduce the complexity of the model. The generated model realizes the classification and recognition of mask surface defects and structural abnormalities, with an average accuracy of 98.95% and a transmission frame rate of 40fps per second.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133896970","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}