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

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Feng, Zhengqian Yue, Xiyao Li, Wang Zhou, Mingle Han, Delong Li, Gang Shandong Scicom Information and Economy Research Institute CO.. Ltd China Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Deep learning technology has been widely applied in industrial quality inspection tasks to improve the accuracy of defect detection, object recognition, and classification. However, in the task of object detection, both feature-based and regression-based traditional knowledge distillation methods impose overly strict constraints on the student model. To address the above issues, this article proposes Global Fusion and Feature Restoration Knowledge Distillation(FRD). FRD integrates contextual information into the channel through a Global Fusion Module (GFM), and further utilizes attention mechanisms to adaptively focus on the distillation region after separating the foreground background. FRD also uses a Mask Feature Restoration (MFR) to mask and restore a portion of student features, improving the learnability of the model. At the same time, FRD adopts a comprehensive approach of multiple loss superposition constraints, rather than simply using MSE losses to imitate the features of teachers. Experiments have shown that FRD can effectively improve model performance in industrial defect detection tasks. On the aluminum surface defect dataset, FRD increased the mAP index of RetinaNet-Res50 from 57.7% to 61.7%. We also confirmed the effectiveness of FRD for general object detection on the Coco dataset. On a randomly selected COCO dataset containing 4000 images, FRD increased the mAP metric of RetinaNet-Res50 from 21.5% to 43.6%. © 2024 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

A Constructive Method Based on Dynamic Solution Space for Travelling Salesman Problem 11

A Constructive Method Based on Dynamic Solution Space for Tr...

引用

11th International Conference on Advanced Cloud and Big Data, CBD 2023

作者： Bai, Xiaoxin Luli, Luli Wu, Hanqian Southeast University School of Computer Science and Engineering China Southeast University School of Cyber Science and Engineering China Suzhou Centennail College China Southeast University Key Laboratory of Computer Network and Information Integration of Ministry of Education China

ISBN: (纸本)9798350345346

Neural combinatorial optimization (NCO) has emerged as a promising field to solve the combinatorial optimization problem (COP) as automatically learning the solvers less relying on domain-specific expert knowledge. Constructive Method (ConsM) is the most widely used approach in NCO for solving various COPs and their variations. However, few literature elucidates the underlying principles of ConsM, hindering further optimization. In this paper, we analyze the efficiency principle of ConsM for COPs from the perspective of discrete solution space and summarize its design principles. These principles can serve as guidelines for designing novel constructive policy. Based on these principles, we reviewed the existing ConsM models and identified that the design of existing decoder introduced certain noises, which negatively impacted the policy performance. Therefore, we designed a novel decoder in line with the aforementioned principles. Notably, our method can be applied to all ConsM models and yielded significant improvements compared to the original. We evaluated our method on Traveling Salesman Problem(TSP) and the experimental results verified the effectiveness and efficiency of our method, supporting our analysis of ConsM. In particular, we reduced the average optimality gap from 1.16% to 0.62% for TSP100 compared to Sym-NCOs, keeping the hyperparameters constant. © 2023 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

JTEA: Implementing Semi-Supervised Entity Alignment Using Joint Teaching Strategies

JTEA: Implementing Semi-Supervised Entity Alignment Using Jo...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Lu, Kai Zhao, Jing Ding, Lichao Hao, Zenghao Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Entity alignment(EA) aims to identify equivalent entities in different knowledge graphs or data sources and establish correspondences between them. In recent years, embedding-based methods have made significant progress in the field of entity alignment, yet the shortage of adequate training data (i.e., seed entity pairs) continues to be a primary challenge. Traditional semi-supervised methods typically address this issue by generating potential mappings (i.e., pseudo-mappings) for unlabeled entities. However, these methods often suffer from the influence of erroneous potential mappings or overlook the uncertainty of potential mappings. Therefore, we propose a novel semi-supervised entity alignment method called JTEA. This method combines seed entity pairs with potential mappings through end-to-end joint training, providing strong guidance for model training. In constructing potential mappings, we propose a bidirectional matching strategy (BMS), which generates more detailed potential mappings by jointly adjusting decisions in different directions and uses a joint matching confidence score to characterize its uncertainty. Furthermore, we also introduce a method of matching diversity alignment selection, aiming to screen out more reliable entity alignments to further improve the performance and stability of the model. We conducted a large number of experiments on the benchmark dataset to fully validate the effectiveness of the JTEA method. © 2024 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A generalized reliability analysis of 3-ary n-cubes 16

A generalized reliability analysis of 3-ary n-cubes

引用

16th International Conference on Communication Software and networks, ICCSN 2024

作者： Bai, Zefang Wang, Guijuan Ma, Meijie School of Mathematics and Statistics Jinan250353 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

ISBN: (纸本)9798331506322

Evaluating the reliability of interconnection networks is crucial. The edge-connectivity is a parameter used to assess reliability. In this paper, we discuss a conditional edge-connectivity called the h-extra g-component edge-connectivity. It combines the extra edge-connectivity and the component edge-connectivity. First, this paper proved that c λ3h(Qn3)=4nh-4eh(Qn3)-h for 1 ≤ h ≤ 3(1/2), n ≥ 3. Then, the paper given the upper bound of h-extra g-component edge-connectivity of the 3-ary n-cubes for g ∞ {4,3c3+1}, 1 ≤ c≤ [n/2] -1, n ≥ 3. © 2024 IEEE.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Generalization analysis for label-specific representation learning 24

Generalization analysis for label-specific representation le...

引用

Proceedings of the 38th International Conference on Neural information Processing Systems

作者： Yi-Fan Zhang Min-Ling Zhang School of Cyber Science and Engineering Southeast University Nanjing China and Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education China School of Computer Science and Engineering Southeast University Nanjing China and Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education China

ISBN: (纸本)9798331314385

Label-specific representation learning (LSRL), i.e., constructing the representation with specific discriminative properties for each class label, is an effective strategy to improve the performance of multi-label learning. However, the generalization analysis of LSRL is still in its infancy. The existing theory bounds for multilabel learning, which preserve the coupling among different components, are invalid for LSRL. In an attempt to overcome this challenge and make up for the gap in the generalization theory of LSRL, we develop a novel vector-contraction inequality and derive the generalization bound for general function class of LSRL with a weaker dependency on the number of labels than the state of the art. In addition, we derive generalization bounds for typical LSRL methods, and these theoretical results reveal the impact of different label-specific representations on generalization analysis. The mild bounds without strong assumptions explain the good generalization ability of LSRL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

引用

Digital Communications and networks 2025年第2期11卷 473-481页

作者： Qi Li Gaozhan Liu Qianqian Zhang Lidong Han Wei Chen Rui Li Jinbo Xiong School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal UniversityHangzhou 311121China Tongda College of Nanjing University of Posts and Telecommunications Yangzhou 225127China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China School of Computer Science and Technology Xidian UniversityXi'an 710071China State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal UniversityXining 810008China Faculty of Software Fujian Normal UniversityFuzhou 350108China

Ciphertext-Policy Attribute-Based Encryption(CP-ABE)enables fine-grained access control on ciphertexts,making it a promising approach for managing data stored in the cloud-enabled Internet of *** existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute ***,resource-constrained IoT devices,especially those adopting wireless communication,frequently encounter affordability issues regarding decryption *** this paper,we propose an efficient and fine-grained access control scheme with fully hidden policies(named FHAC).FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them.A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access *** attacks are thwarted by providing unauthorized users with invalid *** heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud ***,users can verify the correctness of multiple outsourced decryption results *** analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption.

关键词： Access control Policy hiding Verifiable outsourced computation Cloud IoT

来源：评论

学校读者我要写书评

暂无评论

FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring

引用

Journal of computer Science & Technology 2023年第5期38卷 970-984页

作者：胡春雨忽丽莎袁林陆佃杰吕蕾陈益强 Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250000China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 25000China Institute of Information Technology Hebei University of Economics and BusinessShijiazhuang 050061China School of Information Science and Engineering Shandong Normal UniversityJinan 250358China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power ***,most wearable health data is distributed across dfferent organizations,such as hospitals,research institutes,and companies,and can only be accessed by the owners of the data in compliance with data privacy *** first challenge addressed in this paper is communicating in a privacy-preserving manner among different *** second technical challenge is handling the dynamic expansion of the federation without model *** address the first challenge,we propose a horizontal federated learning method called Federated Extremely Random Forest(FedERF).Its contribution-based splitting score computing mechanism significantly mitigates the impact of privacy protection constraints on model *** on FedERF,we present a federated incremental learning method called Federated Incremental Extremely Random Forest(FedIERF)to address the second technical *** introduces a hardness-driven weighting mechanism and an importance-based updating scheme to update the existing federated model *** experiments show that FedERF achieves comparable performance with non-federated methods,and FedIERF effectively addresses the dynamic expansion of the *** opens up opportunities for cooperation between different organizations in wearable health monitoring.

关键词： federated learning incremental learning random forest wearable health monitoring

来源：评论

学校读者我要写书评

暂无评论

Malware Detection Method Based on TPE Optimized Stacking 3

Malware Detection Method Based on TPE Optimized Stacking

引用

3rd International Conference on High Performance Computing and Communication Engineering, HPCCE 2023

作者： Zhao, Dongbo Yuan, Zesong Xie, Nannan Jilin Province Key Laboratory of Network and Information Security School of Computer Science and Technology Changchun University of Science and Technology Changchun130022 China

ISBN: (数字)9781510674653

ISBN: (纸本)9781510674646

Fast detection and categorization of malware are increasingly important for securing hosts and networks. Although many Machine Learning models have been utilized to detect malware, single-model detection may not remain efficient in the face of diverse datasets. The continuously increasing size of malware need the distributed storage systems and distributed computing. The distributed methods and ensemble learning are introduced into malware detection, and an optimal combination of base classifiers suitable for stacking are designed. A hyperparameter optimization method based on the Tree-structured Parzen Estimator (TPE) approach to enhance malware detection. The proposed method is implemented on Apache Spark and Hadoop Distributed File System(HDFS). Experiments conducted on four independent datasets, including Android and Windows, demonstrate that the proposed method can achieve 99.41% accuracy on the Android dataset and 96.96% accuracy on the Windows dataset. © 2024 SPIE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised temporal action localization with proxy metric modeling

引用

Frontiers of computer Science 2023年第2期17卷 63-72页

作者： Hongsheng XU Zihan CHEN Yu ZHANG Xin GENG Siya MI Zhihong YANG NARI Group Corporation(State Grid Electric Power Research Institute) Nanjing 211106China School of Computer Science and Engineering and the Key Lab of Computer Network and Information Integration(Ministry of Education)Southeast UniversityNanjing 211189China School of Cyber Science and Engineering Southeast UniversityNanjing 211189China Purple Mountain Laboratories Nanjing 211111China

Temporal localization is crucial for action video *** the manual annotations are expensive and time-consuming in videos,temporal localization with weak video-level labels is challenging but *** this paper,we propose a weakly-supervised temporal action localization approach in untrimmed *** settle this issue,we train the model based on the proxies of each action *** proxies are used to measure the distances between action segments and different original action *** use a proxy-based metric to cluster the same actions together and separate actions from *** with state-of-the-art methods,our method achieved competitive results on the THUMOS14 and ActivityNet1.2 datasets.

关键词： temporal action localization weakly supervised videos proxy metric

来源：评论

学校读者我要写书评

暂无评论

Semantic Relation-Based Cross Attention network for Image-Text Retrieval

Semantic Relation-Based Cross Attention Network for Image-Te...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Zhou, Huanxiao Geng, Yushui Zhao, Jing Ma, Xishan Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Jinan China

ISBN: (纸本)9781665410205

Image-text retrieval refers to querying the text or image of another modality given an image or text, and its key lies in the ability to accurately measure the similarity between text and image. Most of the existing retrieval methods only utilize the intramodal relations of each modality or the intermodal relations of the two modalities to perform the retrieval task. To address the above problems, we integrate the intra-modal and inter-modal relations and propose a Semantic Relation-based Cross Attention network(SRCAN). In our proposed method, we first mine the possible intra-modal associations between regions in an image and between words in a text to obtain features with semantic relationships, and then capture the fine-grained associations between segments through the cross-attention mechanism. Finally, we balance the intra-modal and inter-modal relationships to improve the performance of the model. Our proposed method is experimentally validated on two datasets, Flickr30K and MS-COCO, and the experimental results show that our method achieves superior results. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：