检索结果-内蒙古大学图书馆

Multi-objective test case prioritization based on epistatic particle swarm optimization

International Journal of Performability Engineering 2018年第10期14卷 2441-2448页

作者： Sun, Jiaze Chen, Jingmin Wang, Gang School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an710121 China

To address the Multi-Objective Test Case Prioritization (MOTCP) problem, an Epistatic Particle Swarm Optimization (EPSO) algorithm is presented. The epistasis in biology is introduced into the new algorithm, and the particles are updated based on the crossover of Epistatic Test Case Segment (ETS) in the test case sequence. The average coverage percentage of program entity and effective execution time of the test case sequence are set as two objective fitness functions in EPSO. The experiment selects four typical open12 source projects as benchmark programs. We adopted Average Percentage of Branch Coverage (APBC) and Effective Execution Time (EET) as objective fitness. The four classical Java testing projects results show that the EPSO is more effective and more diverse than single-point PSO and order PSO. The EPSO algorithm efficiently solves the MOTCP problem by promoting early detection of software defects and reducing software testing costs in regression testing. © 2018 Totem Publisher, Inc. All rights reserved.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

PSO with reverse edge for multi-objective software module clustering

引用

International Journal of Performability Engineering 2018年第10期14卷 2423-2431页

作者： Sun, Jiaze Xu, Yang Wang, Shuyan School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an710121 China

The multi-objective software module clustering problem (MOSMCP) divides the complex software system into subsystems to obtain a perfect structure, which is based on the relations between modules to meet the conflicting software refactor objectives as much as possible. The modularization quality (MQ) and reverse edges number between clusters are considered as evaluation objectives, and a novel particle swarm optimization (PSO) with reverse edge, called REPSO, is proposed. First, the module dependency graph (MDG) in software system under clustering is constructed, and then the multi-objective particle swarm optimization (MOPSO) is improved to cluster the MDG. The exploring approach is used to update the particle locations. Four typical open source projects for module clustering are selected to verify the effectiveness of the REPSO. The laboratorial results prove that the REPSO algorithm is very effective and stable, and the diversity of the optimal solution is good. The REPSO algorithm provides an efficient engineering method for MOSMCP, which enhances the software structure and maintainability. © 2018 Totem Publisher, Inc. All rights reserved.

关键词： Modular construction

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Clustering Combination Method Using Intuitionistic Fuzzy Similarity in Software Module Clustering

Hierarchical Clustering Combination Method Using Intuitionis...

引用

2023 International Conference on networking and network Applications, NaNA 2023

作者： Xia, Hong Wang, Bo Zhang, Yongkang Chen, Yanping School of Computer Science and Technology Xi'an University of Posts and Telecommunications China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing China Xi 'An Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9798350327380

In order to solve the problem that the similarity method used in software module clustering can produce arbitrary decision, and the description matrix of dendrogram generated by base clustering in hierarchical clustering combination does not consider more characteristics of entities, a hierarchical clustering combination method based on intuitionistic fuzzy similarity (HCC-IFS) was proposed. In the process of entity similarity calculation, the intuitionistic fuzzy set theory and similarity calculation method are used to provide membership and non-membership attributes for each entity, so as to improve the merging efficiency and solve arbitrary decision problems. In the description matrix representation of base clustering, the absolute and relative features obtained from the dendrogram are used to construct the description matrix, and the generated description matrix is combined. Finally, the proposed algorithm is verified by experiments. Experimental results show that HCC-IFS can produce better clustering results and improve the recovery quality of software architecture. © 2023 IEEE.

关键词： Fuzzy set theory

来源：评论

学校读者我要写书评

暂无评论

The Research of Retinopathy Image Recognition Method Based on Vit 5

The Research of Retinopathy Image Recognition Method Based o...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Xu, Zongyu Xu, Xuebin Huang, Zihao School of Computer Science and Technology Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China

来源：评论

学校读者我要写书评

暂无评论

Temporal Global Re-detection Based on Interaction-Fusion Attention in Long-Term Visual Tracking 12th

Temporal Global Re-detection Based on Interaction-Fusion At...

引用

12th International Conference on Image and Graphics, ICIG 2023

作者： Ma, Jingyuan Hou, Zhiqiang Han, Ruoxue Ma, Sugang School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Key Laboratory of Network Data Analysis and Intelligent Processing of Shaanxi Province Xi’an710121 China

ISBN: (纸本)9783031463075

In long-term visual tracking, target occlusion and out-of-view are common problems that lead to target drift, adding re-detection to short-term tracking algorithms is a general solution. To better handle the problem of target disappearing and reappearing in long-term visual tracking, this paper proposes a temporal global re-detection method based on interaction-fusion attention. Firstly, ResNet50 is used as the feature extraction network to obtain the depth features of the template and the search region. Then, a new interaction-fusion attention is added to extract the connection of different dimensionality of features. Finally, Temporal ROI Align is introduced to select candidate boxes, increasing the use of historical information by re-detection method, and improving the accuracy of target localization. STMTrack algorithm is selected as the short-term tracking algorithm, which works with the proposed re-detection method to construct a long-term tracking algorithm, and experiments are conducted on the UAV123, LaSOT, UAV20L, and VOT2018-LT datasets, and the effectiveness of this re-detection method can be seen from the experimental results. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Chemical detection

来源：评论

学校读者我要写书评

暂无评论

Text Matching application for integration between industry and education 14

Text Matching application for integration between industry a...

引用

14th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2022

作者： Luo, Yuxuan Li, Xiaoge School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9781665499781

A new talent training mode of collaboration between industry and education was proposed, which aims to reduce the gaps of talent definition between enterprise demand and college education. We formulates scenario as a text matching task of similarity between courses details and job position information, developed a ERNIE+DPCNN based model for the task. The model has been benchmarked on LCQMC dataset, the results show that it achieves the art-of state performance of Acc 0.8809, Recall 0.8745, and FX score 0.8739, We conducted many experiments about the text similarity calculation between domains of industry and educations. The experiment results show our approach has much potential to optimize the curriculum system while applying in this field. © 2022 IEEE

关键词： Industries Training Mechatronics Automation Collaboration Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

A knowledge-enhanced interest segment division attention network for click-through rate prediction

引用

Neural Computing and Applications 2024年第34期36卷 21817-21837页

作者： Liu, Zhanghui Chen, Shijie Chen, Yuzhong Su, Jieyang Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Research on Image Description Generation Method Based on G-AoANet 5

Research on Image Description Generation Method Based on G-A...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Qiao, Pingan Shen, Ruixue Li, Yuan Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an710121 China

ISBN: (纸本)9781450396899

Most of the image description generation methods in the attention-based encoder-decoder framework extract local features from images. Despite the relatively high semantic level of local features, it still has two problems to be solved, one is object loss, where some important objects may be lost when generating image descriptions, and the other is prediction error, as an object may be identified in the wrong class. In this paper, a G-AoANet model is proposed to solve the above problems. The model uses an attention mechanism to combine global features with local features. In this way, our model can selectively focus on both object and contextual information, improving the quality of the generated descriptions. Experimental results show that the model improves the initially reported best CIDEr-D and SPICE scores on the MS COCO dataset by 9.3% and 5.1% respectively. © 2022 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Blockchain Fragment Expansion Scheme Based on Community Detection and MSR Code 5

Blockchain Fragment Expansion Scheme Based on Community Dete...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Zhai, Sheping Tong, Tong Bai, Xifang Xi'an University of Posts and Telecommunications Shaanxi Provincial Key Laboratory of Network Data Analysis and Intelligent Processing China Xi'an University of Posts and Telecommunications China

ISBN: (纸本)9781450396899

Aiming at the current performance of blockchain system can not meet the actual needs of high-frequency data interaction in the era of information explosion, a blockchain fragment expansion scheme based on community detection and MSR code is proposed. Firstly, based on the random walk community detection algorithm and the blockchain node network, a node grouping method is proposed. Each group of nodes maintains a copy of the blockchain ledger to reduce the storage redundancy of blockchain. Secondly, the block data is divided by minimum storage regenerating codes (MSR), which further reduces the storage pressure of nodes, reduces the amount of data required for block requests, and reduces network pressure. Finally, a blockchain scalable fragment storage scheme is proposed. The simulation experiment and result analysis show that the blockchain fragment expansion scheme based on community detection and MSR has improved in terms of storage scalability, response efficiency and fault tolerance. © 2022 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

An Anti-Noise Hybrid Clustering Oversampling Technique for Imbalanced data Classification 5

An Anti-Noise Hybrid Clustering Oversampling Technique for I...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Pan, Xiaoying Feng, Congcong Liu, Chen Mu, Yuanzhen Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an710121 China

ISBN: (纸本)9781450396899

Oversampling techniques have always been favored in the field of imbalanced data classification. Noise processing plays an important role in the field of unbalanced data classification because the noise data directly affects the distribution of newly synthesized samples. We propose a new anti-noise hybrid clustering oversampling technique for imbalanced data classification to synthesize high-quality samples (ANCO). The algorithm is the first to propose a combination of noise filtering and optimization in an oversampling method. Firstly, based on the sample location information, the processing strategy of noise filtering and optimization is designed. Then, sample nearest neighbor interpolation is used to create a new sample. To compare the performance of our approach with representative oversampling, five datasets with variable imbalance rates in KEEL are chosen for testing. The results show that the ANCO algorithm improves the classifier's overall performance. © 2022 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：