Concurrency and Computation-Practice & Experience最新文献

{"title":"The quality evaluation system of ideological and political classroom teaching in universities based on GA-BP algorithm","authors":"Guohua Jing","doi":"10.1002/cpe.8228","DOIUrl":"10.1002/cpe.8228","url":null,"abstract":"<div>\u0000 \u0000 <p>The advancement of teaching quality is an indispensable section of the reform and growth of universities, and ideological and political education has critical impact on ideological education. The quality of classroom education can provide data support for efficient development, and has crucial influence on achieving scientific, reasonable, and accurate evaluation of ideological and political teaching performance. Thus, a performance assessment system for ideological and political education in universities with genetic algorithm optimized neural network algorithm is put forward. First, based on existing teaching evaluation indicators and combined with actual situations, a targeted teaching quality evaluation system is proposed. Then, based on BP, an adaptive genetic algorithm is proposed for improvement, and the output results are improved using entropy method. The results indicated that the proposed model could reach its optimal state after 81 iterations in this study. In the fitting test, it reached 0.971. In actual testing, the average error was only 2.68, which was much bigger than the other three algorithms. Its accuracy was 2%–3.2% higher than that of the best existing algorithms. These results indicated that the method put forward in this study had better practical significance, lower error, more accurate evaluation results, and offered scientific data support for the education reform work of universities, which can better accelerate the development and construction of universities.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 23","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141779643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Label distribution feature selection based on neighborhood rough set","authors":"Yilin Wu,&nbsp;Wenzhong Guo,&nbsp;Yaojin Lin","doi":"10.1002/cpe.8236","DOIUrl":"10.1002/cpe.8236","url":null,"abstract":"<div>\u0000 \u0000 <p>In label distribution learning (LDL), an instance is involved with many labels in different importance degrees, and the feature space of instances is accompanied with thousands of redundant and/or irrelevant features. Therefore, the main characteristic of feature selection in LDL is to evaluate the ability of each feature. Motivated by neighborhood rough set (NRS), which can be used to measure the dependency degree of feature via constructing neighborhood relations on feature space and label space, respectively, this article proposes a novel label distribution feature selection method. In this article, the neighborhood class of instance in label distribution space is defined, which is beneficial to recognize the logical class of target instance. Then, a new NRS model for LDL is proposed. Specially, the dependency degree of feature combining label weight is defined. Finally, a label distribution feature selection based on NRS is presented. Extensive experiments on 12 data sets show the effectiveness of the proposed algorithm.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 23","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141779634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bringing HPE Slingshot 11 support to Open MPI","authors":"Amir Shehata,&nbsp;Thomas Naughton,&nbsp;David E. Bernholdt,&nbsp;Howard Pritchard","doi":"10.1002/cpe.8203","DOIUrl":"10.1002/cpe.8203","url":null,"abstract":"<div>\u0000 \u0000 <p>The Cray HPE Slingshot 11 network is used on the new exascale systems arriving at the U.S. Department of Energy (DoE) laboratories (e.g., <i>Frontier</i>, <i>Aurora</i>, <i>Perlmutter</i>). As such, the support of this network is an important capability to meet the needs of exascale applications. This article highlights recent work to develop supporting infrastructure to enable Open MPI to efficiently support these new platforms. A key component of this effort involves development of a new Open Fabrics Interface (OFI) provider, <i>LinkX</i>. We discuss the design and development of enhancements that take advantage of the new Slingshot 11 network and AMD GPUs. We include performance data from tests on the <i>Frontier</i> supercomputer using synthetic communication benchmarks, and the vendor provided MPI as a baseline for comparison. The tests demonstrate full functionality of Open MPI on the system and initial results show favorable performance when compared to the highly tuned vendor implementation.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141743571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improving reading performance by file prefetching mechanism in distributed cache systems","authors":"Jing Gui,&nbsp;Yongbin Wang,&nbsp;Wuyue Shuai","doi":"10.1002/cpe.8215","DOIUrl":"10.1002/cpe.8215","url":null,"abstract":"<div>\u0000 \u0000 <p>Distributed cache systems are utilized to enhance I/O performance between computing applications and storage systems. However, the traditional file access predictors employed in these cache systems are only suitable for workloads with simple file access patterns, rendering them inadequate for the complex access patterns found in big data computing scenarios. In this article, we propose a file access predictor (DFAP) based on WaveNet, which has exhibited promising results in file access tasks when compared to other baseline models. Cache systems are often constrained by limited cache space due to cost, cluster size, and other factors. In big data scenarios, cached data and prefetched data often compete for limited space. To address this issue, we introduce a cache prefetching algorithm (CBAP) for cache systems, which is based on cost-benefit analysis to improve cache utilization. Furthermore, we implement a novel file prefetching framework on Alluxio, which accelerates computing jobs by up to 18%.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141743573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The application of IGA in urban landscape design optimization","authors":"Linyu Liu,&nbsp;Raziah Ahmad,&nbsp;Suriati Ahmad,&nbsp;Xuejie Wang","doi":"10.1002/cpe.8227","DOIUrl":"10.1002/cpe.8227","url":null,"abstract":"<div>\u0000 \u0000 <p>The foundation of urban landscape design optimization is the precise evaluation of the effectiveness. To address the issues of strong subjectivity, low efficiency, and poor accuracy in urban landscape design evaluation methods, an intelligent evaluation method combining improved genetic algorithm and error backpropagation neural network is proposed. First, based on Maslow's demand theory and questionnaire survey results, it selects indicators to construct an evaluation index system for urban landscape design. Second, in response to the performance defects of the error backpropagation neural network model, the moth flame algorithm is used to optimize it. Then, in response to the defect that the optimization effect of the moth flame algorithm is not ideal enough, a multiple strategy including improved genetic algorithm is adopted to optimize it. Finally, an urban landscape design evaluation model is constructed based on improved error backpropagation neural network. The experimental results show that the fitting coefficient of the model is 0.9523, with a minimum deviation of less than 1%. The above results indicate that the proposed model can effectively improve the accuracy and efficiency of urban landscape design evaluation, providing data support for urban landscape design optimization. The research on the intelligent development of urban landscape design is of reference significance and has to some extent promoted the development of urban landscape design.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141743572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Network traffic classification based- masked language regression model using CNN","authors":"Steffi P. L.,&nbsp;W. R. Sam Emmanuel,&nbsp;P. Arockia Jansi Rani","doi":"10.1002/cpe.8223","DOIUrl":"10.1002/cpe.8223","url":null,"abstract":"<div>\u0000 \u0000 <p>Network traffic classification task has become increasingly challenging. The objective behind this classification is to effectively handle bandwidth, prioritize certain types of traffic, enhance application performance, and more. In recent times, there has been a surge in exploring deep learning approaches for network traffic categorization. However, these models demand substantial volumes of training data. Additionally, many classification methods necessitate manual feature extraction, a process that is not only time-consuming but also laborious. Addressing the challenge of identifying optimal features to enhance classification accuracy, this work introduces a deep learning model designed for effective classification of network traffic. The model comprises the following key stages: (a) The dataset involves TCP flows captured from running different network stress and web crawling tools, (b) Pre-processing for removal of anomalies and noises using Label Encoder and OneHotEncoder, (c) The utilization of K-BERT for feature extraction aims to retrieve local spatial–temporal features, (d) feature selection using linear regression model (LASSO) and finally, and (e) The classification of network traffic involves neural network. The model serves to enhance the precision and efficiency of the classification mission. Through comprehensive experimental analysis, it was observed that the Masked Language-based Regression model surpassed other referenced models, achieving an exceptional accuracy of 0.97.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141647743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Blockchain based secret key management for trusted platform module standard in reconfigurable platform","authors":"Rourab Paul,&nbsp;Nimisha Ghosh,&nbsp;Amrutanshu Panigrahi,&nbsp;Amlan Chakrabarti,&nbsp;Prasant Mohapatra","doi":"10.1002/cpe.8225","DOIUrl":"10.1002/cpe.8225","url":null,"abstract":"<div>\u0000 \u0000 <p>The growing sophistication of cyber attacks, vulnerabilities in high computing systems and increasing dependency on cryptography to protect our digital data, make it more important to keep secret keys safe and secure. A few major issues of secret keys, like incorrect use of keys, inappropriate storage of keys, inadequate protection of keys, insecure movement of keys, lack of audit logging, insider threats and nondestruction of keys can compromise the whole security system severely. In this work, we propose a field programmable gate array (FPGA)-based trusted platform module (TPM) framework for operating system companies and OS users, utilizing blockchain to address NIST-recommended secret key management issues. The security processor used in OS user machines is partitioned into three areas such that <i>processor area</i>, <i>confidential area</i>, and <i>crypto area</i>. The isolated secret key memory in <i>confidential area</i>, along with a private blockchain (BC) can log the life cycle of secret keys of TPM standard. We have also implemented a special custom bus interconnect, which receives custom crypto instructions from Processing Element (PE). During the execution of crypto instructions, the architecture ensures that secret keys are present in <i>confidential area</i> and <i>crypto area</i> but never in the <i>processor area</i>. The movements of secret keys between <i>confidential area</i>, and <i>crypto area</i> are recorded cryptographically after the proper authentication process controlled by the proposed hardware-based private BC framework. To the best of our knowledge, this work is the first attempt to implement a blockchain-based framework between OS company and OS users to address NIST recommended secret key management issues of TPM standard hardware environment. The additional cost of resource usage and timing complexity we spent to implement the proposed idea is nominal. The proposed architecture is implemented with Xilinx <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>V</mi>\u0000 <mi>i</mi>\u0000 <mi>v</mi>\u0000 <mi>a</mi>\u0000 <mi>d</mi>\u0000 <mi>o</mi>\u0000 </mrow>\u0000 <annotation>$$ Vivado $$</annotation>\u0000 </semantics></math> EDA tool using <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>A</mi>\u0000 <mi>r</mi>\u0000 <mi>t</mi>\u0000 <mi>i</mi>\u0000 <mi>x</mi>\u0000 <mspace></mspace>\u0000 <mn>7</mn>\u0000 </mrow>\u0000 <annotation>$$ Artixkern0.3em 7 $$</annotation>\u0000 </semantics></math> FPGA board.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141610171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-population artificial bee colony algorithm for many-objective cascade reservoir scheduling","authors":"Shuai Wang,&nbsp;Hui Wang,&nbsp;Futao Liao,&nbsp;Zichen Wei,&nbsp;Min Hu","doi":"10.1002/cpe.8221","DOIUrl":"10.1002/cpe.8221","url":null,"abstract":"<div>\u0000 \u0000 <p>Artificial bee colony (ABC) is a popular intelligent algorithm that is widely applied to many optimization problems. However, it is challenging for ABC to solve many-objective optimization problems (MaOPs). To tackle this issue, this article proposes a many-objective ABC based on multi-population (called MMaOABC) for MaOPs. In MMaOABC, the population is divided into multiple sub-populations, and each sub-population optimizes one objective. Three search strategies are constructed based on multiple sub-populations to improve convergence and diversity. In the employed bee stage, some excellent solutions in multiple sub-populations are used to guide the convergence. In the onlooker bee stage, new selection probabilities based on diversity metrics are designed to enhance the diversity. Dimensional learning is introduced in the scout bee stage to avoid falling into local minimum. In addition, environmental selection and external archives are utilized for communications among sub-populations. To validate the performance of MMaOABC, two benchmark sets (DTLZ and MaF) with 3, 5, 8, and 15 objectives are tested. Computational results show that MMaOABC is competitive when compared with seven other many-objective evolutionary algorithms (MaOEAs). Finally, MMaOABC is applied to many-objective cascade reservoir scheduling. Simulation results show that MMaOABC still obtains promising performance.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141610172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"MBB-YOLO: A comprehensively improved lightweight algorithm for crowded object detection","authors":"Junguo Liao,&nbsp;Haonan Tian","doi":"10.1002/cpe.8219","DOIUrl":"10.1002/cpe.8219","url":null,"abstract":"<div>\u0000 \u0000 <p>Object detection in crowded scenes involves various difficulties, such as small objects, occluded objects, and insufficient features. Existing models for crowded object detection often focus on only one detection difficulty, and they are too large to be applied in practice. To address the diverse challenges of object detection in crowded scenes, we construct a lightweight crowded object detector called MBB-YOLO, which contains several modules for comprehensive improvement. To improve the network's ability to extract fine-grained features, we use SPD-Conv and the proposed MS-Conv to replace the strided convolution in the network. An bi-branch multi-scale convolution attention (BMCA) module is proposed to aggregate multi-scale contextual information. We also propose boundary-NMS to better identify proposal boxes from different objects, which reduces suppression errors caused by object occlusion. MBB-YOLO achieves 87.6% AP and an inference speed of 78.8 FPS on the CrowdHuman dataset, which surpasses other mainstream lightweight object detectors.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141610173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Leveraging generative adversarial networks for enhanced cryptographic key generation","authors":"Purushottam Singh,&nbsp;Prashant Pranav,&nbsp;Shamama Anwar,&nbsp;Sandip Dutta","doi":"10.1002/cpe.8226","DOIUrl":"10.1002/cpe.8226","url":null,"abstract":"<div>\u0000 \u0000 <p>In this research, we present an innovative cryptographic key generation method utilizing a Generative Adversarial Network (GAN), enhanced by Merkel tree verification, marking a significant advancement in cryptographic security. Our approach successfully generates a large 6272-bit key, rigorously tested for randomness and reliability using the Dieharder and NIST test suites. This groundbreaking method harmoniously blends cutting-edge machine learning techniques with traditional cryptographic verification, setting a new standard in data encryption and security. Our findings not only demonstrate the efficacy of GANs in producing highly secure cryptographic keys but also highlight the effectiveness of Merkel tree verification in ensuring the integrity of these keys. The integration of merkel tree in our method provides a means to efficiently verify the authenticity of the large generated key sets. This research has broad implications for the future of secure communications, providing a robust solution in a world increasingly reliant on digital security. The integration of machine learning and cryptographic principles opens up new avenues for research and development, promising to bolster security measures in an era where digital threats are constantly evolving. This work contributes significantly to the field of cryptography, offering a novel perspective and robust solutions to the challenges of digital data protection.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141610174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}