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

4th International Conference on Consumer Electronics and Computer Engineering, ICCECE 2024

作者： Xiong, Bingbing Shi, Wenxi Fu, Yanyun Zhu, Zhansheng Wang, Deyong Jia, Bin School of Computer Science and Technology Xinjiang University Urumqi China Xinjiang Lianhaichuangzhi Information Technology Co. Ltd. Key Laboratory of Big Data of Xinjiang Social Security Risk Beijing China Beijing Academy of Science and Technology Beijing China Xinjiang Lianhaichuangzhi Information Technology Co. Ltd. Key Laboratory of Big Data of Xinjiang Social Security Risk Urumqi China

ISBN: (纸本)9798350384062

This paper solves the challenge that the target is submerged in the background in the border security scenario, and proposes the enhancement of YOLOv5 algorithm. EfficientViT replaces the DarkNet backbone, leveraging Transformer models for improved feature extraction. Modifications to the Spatial Pyramid Pooling-Fast (SPPF) module enhance the algorithm's robustness to scale variations. Introducing SCYLLA-IoU (SIoU) in the loss function improves model convergence speed and accuracy. Validated on a custom border security dataset, the enhancements show an improved average precision mean (mAP) of 48.3%, a 2.2 percentage point increase over the original YOLOv5s model. © 2024 IEEE.

关键词： Border security Target Detection Transformer YOLOv5

来源：评论

学校读者我要写书评

暂无评论

A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory

引用

Mathematical Biosciences and Engineering 2024年第2期21卷 2626-2645页

作者： Hua, Mingfeng Xu, Taihua Yang, Xibei Chen, Jianjun Yang, Jie School of Computer Jiangsu University of Science and Technology Zhenjiang212100 China Key Laboratory of Oceanographic Big Data Mining Application of Zhejiang Province Zhejiang Ocean University Zhoushan316022 China School of Physics and Electronic Science Zunyi Normal University Zunyi563002 China

Calculating single-source shortest paths (SSSPs) rapidly and precisely from weighted digraphs is a crucial problem in graph theory. As a mathematical model of processing uncertain tasks, rough sets theory (RST) has been proven to possess the ability of investigating graph theory problems. Recently, some efficient RST approaches for discovering different subgraphs (e.g. strongly connected components) have been presented. This work was devoted to discovering SSSPs of weighted digraphs by aid of RST. First, SSSPs problem was probed by RST, which aimed at supporting the fundamental theory for taking RST approach to calculate SSSPs from weighted digraphs. Second, a heuristic search strategy was designed. The weights of edges can be served as heuristic information to optimize the search way of k-step R-related set, which is an RST operator. By using heuristic search strategy, some invalid searches can be avoided, thereby the efficiency of discovering SSSPs was promoted. Finally, the W3SP@R algorithm based on RST was presented to calculate SSSPs of weighted digraphs. Related experiments were implemented to verify the W3SP@R algorithm. The result exhibited that W3SP@R can precisely calculate SSSPs with competitive efficiency. © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum security analysis of SM4 algorithm 6

Quantum security analysis of SM4 algorithm

引用

6th International Conference on Wireless Communications and Smart Grid, ICWCSG 2024

作者： Yang, Hao Wang, Chunhong Tang, Xueming Cui, Yongquan Lu, Songfeng Cai, Dunbo Qian, Ling Zhang, Runqing Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Wuhan Maritime Communication Research Institute Wuhan430010 China Software Technology Co. Ltd. Suzhou215153 China

ISBN: (纸本)9781510682962

The security of commercial encryption algorithms has always been a focus of attention. The SM4 algorithm, a commercial cryptographic standard, has been recognized by ISO/IEC as an international standard and has shown excellent performance on classical computers. However, with the development of quantum computing, traditional encryption algorithms are facing new challenges. This paper investigates the quantum realization of SM4 algorithm. By applying the Grover algorithm to the SM4 algorithm, we conducted a quantum exhaustive attack and provided an estimation of the required quantum resources. This study offers a novel perspective on the application of quantum computing in breaking commercial encryption algorithms, which holds significant implications for the future development of quantum secure communication and cryptography. © 2024 SPIE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-time stealth transmission via dither-based bias control

Real-time stealth transmission via dither-based bias control

引用

2023 Conference on Lasers and Electro-Optics, CLEO 2023

作者： Wang, Yuanxiang Shao, Weidong Zhong, Linsheng Dai, Xiaoxiao Yang, Qi Deng, Lei Liu, Deming Cheng, Mengfan Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Optical and Electronic Information Huazhong University of Science and Technology Wuhan430074 China

We report a real-time 1 kbps stealthy transmission in the 10 Gbps QPSK public communication. The stealth data is embedded in dither signals of bias control. The scheme is compatible with existing optical transmission ... 详细信息

ISBN: (纸本)9781957171258

关键词： Light transmission

来源：评论

学校读者我要写书评

暂无评论

Improving Adaptive Runoff Forecasts in data-Scarce Watersheds Through Personalized Federated Learning 27th

Improving Adaptive Runoff Forecasts in Data-Scarce Watershe...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Xie, Zaipeng Zhang, Xiangqin Wang, Yunfei Jie, Xuanyao Fang, Wenhao Cai, Yanping Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China College of Computer Science and Software Engineering Hohai University Nanjing China

ISBN: (纸本)9783031781827

Runoff forecasting plays a crucial role in water resource management and flood mitigation, but it often faces significant challenges due to data deficiency and decentralized datasets. Inadequate hydrological data in many watersheds hinders the development of accurate prediction models, while organizational barriers and concerns about data privacy lead to information silos, preventing effective collaborative modeling. To address these issues, we propose FedHydroDSW, a novel personalized federated learning framework for runoff forecasting in data-scarce watersheds. Our approach enables decentralized model training across multiple organizations without requiring direct data sharing, thus preserving data privacy. FedHydroDSW incorporates unique model similarity metrics and parameter adaptation methods, utilizing insights from data-rich areas to refine forecasts in data-scarce regions. Experiments on the CAMELS dataset show that FedHydroDSW significantly outperforms standalone and conventional federated learning methods, with an average 30.1% increase in NSE, and reductions of 28% in RAE and 26.6% in RMSE across multiple data-scarce basins. By enabling secure cross-silo learning, our FedHydroDSW strategy paves the way toward more equitable runoff forecasting globally. The customized training and pattern recognition techniques represent major progress in deploying federated intelligence for impactful hydrological predictions. Our code is publicly available at https://***/xyjie37/FedHydroDSW. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Mining User–Item Interactions via Knowledge Graph for Recommendation

引用

ACM Transactions on Recommender Systems 2025年第3期3卷 1-19页

作者： Shenghao Liu Lingyun Lu Bang Wang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Smart Internet Technology School of Electronic Information and Communications Huazhong University of Science and Technology (HUST) Wuhan China

Introducing a Knowledge Graph (KG) to facilitate a recommender system has become a tendency in recent years. Many existing methods leverage KGs to obtain side information of items to promote item representation learning for enhancing recommendation performance. However, they ignore that KGs also may contribute to better user representation learning. To solve this issue, we propose a novel algorithm, the KIGR (Knowledge-aware Interaction Graph for Recommendation), to mine user–item interactions via KGs for assisting user representation learning. Specifically, a user–item interaction is encoded by attentively summing up the relation embedding about the item in the KG. Then, an unsupervised learning method is used to group the user–item interactions into different latent types. Further, a user–item interaction graph is divided into several subgraphs, which is referred to as a Knowledge-aware Interaction Graph, making each subgraph only contain one latent type of interaction. Finally, user representation is the fusion of user interest embedding, which is learned on the knowledge-aware interaction graph, whereas item representation is learned on the KG. Experimental results on MovieLens, LastFM and Amazon-Book validate that the proposed KIGR has a superior performance compared with the state-of-the-art algorithms.

关键词： Recommendation system knowledge graph graph neural network

来源：评论

学校读者我要写书评

暂无评论

Traffic flow of connected and automated vehicles at lane drop on two-lane highway: An optimization-based control algorithm versus a heuristic rules-based algorithm

引用

Chinese Physics B 2023年第1期32卷 380-391页

作者：刘华清姜锐田钧方朱凯旋 Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Ministry of TransportBeijing Jiaotong UniversityBeijing 100044China College of Management and Economics Tianjin UniversityTianjin 300072China Suzhou Institute of Technology Jiangsu University of Science and TechnologyZhangjiagang 215600China

This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic rules-based algorithm(HRA). In the OCA, the average speed of each vehicle is maximized. In the HRA, virtual vehicle and restriction of the command acceleration caused by the virtual vehicle are introduced. It is found that(i) capacity under the HRA(denoted as C_(H)) is smaller than capacity under the OCA;(ii) the travel delay is always smaller under the OCA, but driving is always much more comfortable under the HRA;(iii) when the inflow rate is smaller than C_(H), the HRA outperforms the OCA with respect to the fuel consumption and the monetary cost;(iv) when the inflow rate is larger than C_(H), the HRA initially performs better with respect to the fuel consumption and the monetary cost, but the OCA would become better after certain time. The spatiotemporal pattern and speed profile of traffic flow are presented, which explains the reason underlying the different performance. The study is expected to help for better understanding of the two different types of algorithm.

关键词： traffic flow connected and automated vehicles(CAVs) lane drop optimization-based control algorithm Heuristic rules-based algorithm

来源：评论

学校读者我要写书评

暂无评论

Task Separation and Knowledge Sharing for Class Incremental Learning 5

Task Separation and Knowledge Sharing for Class Incremental ...

引用

5th International Conference on Intelligent Computing and Human-Computer Interaction, ICHCI 2024

作者： Zhang, Jiali Qiao, Xiaoyan School of Computer Science and Technology Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China School of Mathematics and Information Science Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China

ISBN: (纸本)9798350368284

Methods based on dynamically expanding architectures can effectively mitigate catastrophic forgetting in class incremental learning (CIL), but they often overlook information sharing and integration between subnetworks, leading to performance degradation and increased parameter count and memory consumption as the network expands. To address these complex issues, we introduce a new method called Task Separation and Knowledge Sharing (TSKS), which transfers knowledge at both the logical and feature levels through Hybrid Knowledge Distillation (HKD). In logical distillation, we combine Global Knowledge Distillation (GKD) and Task Knowledge Distillation (TKD) to establish connections between tasks. To prevent the model from favoring new classes, we design an Attention- Based Feature Fusion (ABFF) mechanism to capture important features. Additionally, we introduce a Soft-Margin Auxiliary Loss (SMAL) to help the model learn new concepts. Extensive experiments show that TSKS outperforms existing models on CIFAR100 and ImageNet100, regardless of whether memory samples are used. Notably, TSKS demonstrates superior performance in memory-free settings, indicating a reduced reliance on rehearsal memory. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Detecting DTI Using Graph Embedding and Multi-Head Attention Mechanism

Detecting DTI Using Graph Embedding and Multi-Head Attention...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lin, Xiaoli Chen, Yaoyu Yang, Wenli Yu, HaiPing Wu, Zimo Zhang, Xiaolong Wuhan University of Science and Technology Hubei Key Laboratory of Intelligent Information Processing and Real-Time Industrial System School of Computer Science and Technology Wuhan China China Graphics Society School of Information Wuhan Vocational College Professional Committee of Graphics and Big Data Wuhan China

ISBN: (纸本)9798350386226

Drug-target interaction (DTI) prediction has an important role in drug discovery, significantly expediting the drug design and development process. This paper proposes a new model, ERW-BiAN, that seamlessly integrates graph embedding representations with deep learning network. Specifically, we utilize an improved graph embedding model, ERW, to generate comprehensive feature vectors for each node within the knowledge graph. Subsequently, these feature vectors are fed into the BiAN model, which leverages an attention mechanism to assign precise weights to sequences. Experimental results demonstrate the superior accuracy and predictive prowess of ERW-BiAN in DTI prediction tasks. Furthermore, the case about COVID-19 shows that ERW-BiAN has the better application potential for predicting drug-target interactions. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Glare-SNet: Unsupervised Glare Suppression Balance Network 27th

Glare-SNet: Unsupervised Glare Suppression Balance Network

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Li, Pei Zuo, Chengyu Wei, Wangjuan Pan, Xiaoying Wang, Zhanhao 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 China Shaanxi Key Laboratory of Intelligent Media Computing and interaction Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an China

ISBN: (纸本)9783031781681

In light of the problems associated with glare and halo effects in low-light images, as well as the inadequacy of existing processing algorithms in handling details, a glare suppression balance network based on unsupervised learning has been designed and implemented in this study. A network that perceives brightness through light decomposition has been proposed, and an illumination learning network has been designed. The idea of integration has been employed to form an unsupervised glare suppression balance network, aiming to tackle the issues of glare and the accompanying halo effects. Through objective and subjective evaluations of real images, it has been proven that the method introduced in this paper surpasses other methods in suppressing glare and enhancing the overall quality of low-light images. Furthermore, it has been shown to exhibit good performance and effectiveness in target detection. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：