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

Dynamic Chaotic Encryption Using Bit Division Multiplexing and Geometric Shaping

IEEE Photonics Technology Letters 2025年第12期37卷 647-650页

作者： Lei, Yi Ding, Yinchen Yin, Xuran Chen, Bin Guo, Zhongyi Hefei University of Technology School of Computer Science and Information Engineering China

Optical wireless communication (OWC) techniques offer ultra-broad spectrum to mitigate the bandwidth-hungry in radio frequency for wireless connections. However, security risk is a critical issue that should receive significant attention. In this Letter, a dynamic chaotic encryption scheme is proposed for OWC systems to improve physical-layer security. In this scheme, the dynamic key is generated from the transmitted information, which is used to intercept the static chaotic sequence to encrypt the information at the two levels: bit and symbol. Further, bit division multiplexing in combination with geometric shaping is proposed to co-transmit the encrypted information and dynamic key, where the optimization objective is to minimize the bit-error ratio of the decrypted information. The effectiveness of the proposed dynamic chaotic encryption scheme is demonstrated via a 64-point constellation transmission, where each symbol carries 2-bit dynamic key and 4-bit encrypted information for transmission. © 2025 IEEE. All rights reserved.

关键词： Optical communication

来源：评论

学校读者我要写书评

暂无评论

Multi-label, Classification-based Prediction of Breast Cancer Metastasis Directions

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2025年第1期52卷 1-10页

作者： Wang, Tingting Fan, Qi Tan, Liang Zhang, Beier School of Computer and Software Engineering Anhui Institute of Information Technology China School of Computer Science and Technology Huaibei Normal University China School of Computer and Software Engineering Anhui Institute of Information Technology China School of Computer Science and Technology Huaibei Normal University China

Predicting the metastatic direction of primary breast cancer (BC), thus assisting physicians in precise treatment, strict follow-up, and effectively improving the prognosis. The clinical data of 293,946 patients with primary BC diagnosed between 2010 and 2015 were collected from the Surveillance, Epidemiology, and End Results database. Multiple interpolations and Multi-label Synthetic Minority Over-sampling Technique methods were used for data analysis, and machine learning model was established for multi-label classification. Finally, Surgical information, lymph node status, distant metastasis, tumor size, chemotherapy, histological type, and radiotherapy had significant influence as inputs. Compared with the k-nearest neighbor model, average accuracies of the decision tree and random forest (RF) models increased from 88.84% to 93.59% and 94.14%, respectively. Their average precision, recall rate, F1 score, area under the receiver operating characteristic curve and weighted-F1 increased from 87.24% to 95.85% and 94.74%, 87.73% to 90.40% and 91.76%, 87.07% to 92.16% and 93.45%, 97.11% to 99.53% and 99.95%, 82.13% to 89.44% and 90.48%, respectively. In conclusion, the RF model, which showed the best performance, can be used in multi-label prediction of BC metastasis directions, and can assist physicians in diagnosing and treating patients with primary BC. © (2025), (International Association of Engineers). All rights reserved.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving recommendation with coarse-grained spatiotemporal contexts

引用

science China(information sciences) 2025年第4期68卷 66-81页

作者： Lei CHEN Chen GAO Jiahuan LEI Xiaoyi DU Xinlei SHI Hengliang LUO Depeng JIN Yong LI Meng WANG Department of Electronic Engineering BNRist Tsinghua University Meituan Inc. School of Computer Science and Information Engineering Hefei University of Technology

The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of users, typically operate in a fully server-based manner, requiring on-device users to upload their behavioral data, including fine-grained spatiotemporal contexts, to the server, which has sparked public concern regarding privacy. Consequently, user devices only upload coarse-grained spatiotemporal contexts for user privacy protection. However, previous research mostly focuses on modeling fine-grained spatiotemporal contexts using knowledge graph convolutional models, which are not applicable to coarse-grained spatiotemporal contexts in privacy-constrained recommender systems. In this paper, we investigate privacy-preserving recommendation by leveraging coarse-grained spatiotemporal contexts. We propose the coarse-grained spatiotemporal knowledge graph for privacy-preserving recommendation(CSKG), which explicitly models spatiotemporal co-occurrences using common-sense knowledge from coarse-grained contexts. Specifically, we begin by constructing a spatiotemporal knowledge graph tailored to coarse-grained spatiotemporal contexts. Then we employ a learnable metagraph network that integrates common-sense information to filter and extract co-occurrences. CSKG evaluates the impact of coarsegrained spatiotemporal contexts on user behavior through the use of a knowledge graph convolutional network. Finally, we introduce joint learning to effectively learn representations. By conducting experiments on two real large-scale datasets,we achieve an average improvement of about 11.0% on two ranking metrics. The results clearly demonstrate that CSKG outperforms state-of-the-art baselines.

关键词： privacy-preserveing coarse-grained spatiotemporal contexts recommender systems

来源：评论

学校读者我要写书评

暂无评论

Edge-aware Feature Aggregation Network for Polyp Segmentation

引用

Machine Intelligence Research 2025年第1期22卷 101-116页

作者： Tao Zhou Yizhe Zhang Geng Chen Yi Zhou Ye Wu Deng-Ping Fan PCA Lab Key Laboratory of Intelligent Perception and Systems for High-dimensional Information of Ministry of EducationSchool of Computer Science and EngineeringNanjing University of Science and TechnologyNanjing210094China School of Computer Science and Engineering Northwestern Polytechnical University(NPU)Xi’an710129China School of Computer Science and Engineering Southeast UniversityNanjing211189China Computer Vision Lab ETH ZürichZürich8092Switzerland

Precise polyp segmentation is vital for the early diagnosis and prevention of colorectal cancer(CRC)in clinical ***,due to scale variation and blurry polyp boundaries,it is still a challenging task to achieve satisfactory segmentation performance with different scales and *** this study,we present a novel edge-aware feature aggregation network(EFA-Net)for polyp segmentation,which can fully make use of cross-level and multi-scale features to enhance the performance of polyp ***,we first present an edge-aware guidance module(EGM)to combine the low-level features with the high-level features to learn an edge-enhanced feature,which is incorporated into each decoder unit using a layer-by-layer ***,a scale-aware convolution module(SCM)is proposed to learn scale-aware features by using dilated convolutions with different ratios,in order to effectively deal with scale ***,a cross-level fusion module(CFM)is proposed to effectively integrate the cross-level features,which can exploit the local and global contextual ***,the outputs of CFMs are adaptively weighted by using the learned edge-aware feature,which are then used to produce multiple side-out segmentation *** results on five widely adopted colonoscopy datasets show that our EFA-Net outperforms state-of-the-art polyp segmentation methods in terms of generalization and *** implementation code and segmentation maps will be publicly at https://***/taozh2017/EFANet.

关键词： Colorectal cancer polyp segmentation edge-aware guidance module scale-aware convolution module cross-level fusion module

来源：评论

学校读者我要写书评

暂无评论

A Review on Lung Cancer Classification Using Deep Learning Techniques

引用

IEEE Access 2025年 13卷 76161-76184页

作者： Malarvannan, S. Angulakshmi, M. Vellore Institute of Technology School of Computer Science Engineering and Information Systems Tamil Nadu Vellore India

Cancer of the lung system is arguably the second largest factor in the worldwide fatality explosion. It originates from smoking too much and tobacco use. Cell growth that is uncontrolled in the lung region will hurt human survival. The exponential increase in medical reports might challenge the manual interpretation of disease prediction. Therefore, using computer Aided Diagnosis (CAD) approaches, a tumor might be detected early from an appropriate appearance. This study thoroughly evaluates various lung cancer detection methods for classifying a nodule. The area of lung cancer prediction is becoming increasingly popular due to the many benefits of automated medical diagnosis using Deep Learning techniques. This study discusses potential deep learning (DL) strategies for lung disease applications, an overview of DL approaches, and novel elements of the methods under investigation. Classification and segmentation are the two main deep learning techniques for lung cancer detection and screening which are the focus of this review. We will also talk about the benefits and drawbacks of contemporary deep learning models. The resulting study demonstrates the significant potential of deep learning approaches for exact and efficient computerized lung cancer monitoring and detection employing CT scans. Following this study, an overview of prospective further studies is given, focused on enhancing deep learning to advance automated techniques for diagnosing lung cancer. © 2013 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Robust federated contrastive recommender system against targeted model poisoning attack

引用

science China(information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

Preamble slice orderly queue access scheme in cell-free dense communication systems

引用

Digital Communications and Networks 2025年第1期11卷 126-135页

作者： Jun Sun Mengzhu Guo Jian Liu School of Telecommunications and Information Engineering Nanjing University of Posts and TelecommunicationsNanjing 210003China School of Computer and Communication Engineering University of Science and TechnologyBeijing 100083China

High reliability applications in dense access scenarios have become one of the main goals of 6G *** solve the access collision of dense Machine Type Communication(MTC)devices in cell-free communication systems,an intelligent cooperative secure access scheme based on multi-agent reinforcement learning and federated learning is proposed,that is,the Preamble Slice Orderly Queue Access(PSOQA)*** this scheme,the preamble arrangement is combined with the access *** preamble arrangement is realized by preamble slices which is from the virtual preamble *** access devices learn to queue orderly by deep reinforcement *** orderly queue weakens the random and avoids collision.A preamble slice is assigned to an orderly access queue at each access *** orderly queue is determined by interaction information among multiple *** the federated reinforcement learning framework,the PSOQA scheme is implemented to guarantee the privacy and security of ***,the access performance of PSOQA is compared with other random contention schemes in different load *** results show that PSOQA can not only improve the access success rate but also guarantee low-latency tolerant performances.

关键词： Machine type communication Random access Reinforcement learning Access success probability Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Generative Model-Based Network Framework for Ecological Data Reconstruction

引用

computers, Materials & Continua 2025年第1期82卷 929-948页

作者： Shuqiao Liu Zhao Zhang Hongyan Zhou Xuebo Chen School of Electronic and Information Engineering University of Science and Technology LiaoningAnshan114051China School of Computer Science and Software Engineering University of Science and Technology LiaoningAnshan114051China

This study examines the effectiveness of artificial intelligence techniques in generating high-quality environmental data for species introductory site selection *** Strengths,Weaknesses,Opportunities,Threats(SWOT)analysis data with Variation Autoencoder(VAE)and Generative AdversarialNetwork(GAN)the network framework model(SAE-GAN),is proposed for environmental data *** model combines two popular generative models,GAN and VAE,to generate features conditional on categorical data embedding after SWOT *** model is capable of generating features that resemble real feature distributions and adding sample factors to more accurately track individual sample *** data is used to retain more semantic information to generate *** model was applied to species in Southern California,USA,citing SWOT analysis data to train the *** show that the model is capable of integrating data from more comprehensive analyses than traditional methods and generating high-quality reconstructed data from them,effectively solving the problem of insufficient data collection in development *** model is further validated by the Technique for Order Preference by Similarity to an Ideal Solution(TOPSIS)classification assessment commonly used in the environmental data *** study provides a reliable and rich source of training data for species introduction site selection systems and makes a significant contribution to ecological and sustainable development.

关键词： Convolutional Neural Network(CNN) VAE GAN TOPSIS data reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Bearing Fault Diagnosis Method Based on Hierarchical Belief Rule Base With Power Set

引用

IEEE Access 2025年 13卷 70324-70339页

作者： Yan, Xingchi Li, Ning Yu, Yan He, Wei Wang, Duo Harbin Normal University School of Computer Science and Information Engineering Harbin150025 China

As one of the most critical components in rotating machinery, bearings play a vital role in ensuring the stable operation of the equipment. Due to the influence of complex environments, there is uncertainty in the process of bearing fault diagnosis. The Belief Rule Base (BRB) is a modeling method that can effectively handle uncertainty issues. However, in the process of bearing fault diagnosis, with the increase of bearing use time, bearing wear will become more and more serious. When extracting data feature values, different types of fault feature values have similarities, which makes it difficult to distinguish and represent the type of fault in the diagnosis process, resulting in local ignorance. The traditional BRB model cannot solve the local ignorance problem, and with the increase of the number of rules, it will lead to the explosion of rule combinations. To solve the above problems, this paper proposes a Hierarchical Belief Rule Base with power set, Firstly, a Hierarchical Belief Rule Base (HBRB) model is selected to solve the problem of combination rule explosion, and then HBRB is extended to the power set identification framework. Because the power set recognition framework can more effectively represent the ignorant information in the complex system, and solve the local ignorance problem in the bearing fault diagnosis, then, the evidential reasoning algorithm is used to establish the reasoning process of the model. Finally, the parameters of the model are optimized using the projection covariance matrix adaptive evolutionary strategy algorithm. The experimental results show that the proposed method can identify different fault categories with high accuracy, effectively solve the local ignorance problem in bearing faults diagnosis, and has good generalization ability. © 2013 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Summary Graph Induced Invariant Learning for Generalizable Graph Learning

引用

IEEE Transactions on Knowledge and Data engineering 2025年第6期37卷 3739-3752页

作者： Ning, Xuecheng Wang, Yujie Yu, Kui Miao, Jiali Cao, Fuyuan Liang, Jiye Hefei University of Technology School of Computer Science and Information Engineering Hefei230002 China Shanxi University School of Computer and Information Technology Taiyuan030006 China

As a promising strategy to achieve generalizable graph learning tasks, graph invariant learning emphasizes identifying invariant subgraphs for stable predictions on biased unknown distribution by selecting the important edges/nodes based on their contributions to the predictive tasks (i.e., subgraph predictivity). However, the existing approaches solely relying on subgraph predictivity face a challenge: the learned invariant subgraph often contains numerous spurious nodes and shows poor connectivity, undermining the generalization power of Graph Neural Networks (GNNs). To tackle this issue, we propose a summary graph-induced Invariant Learning (SIL) model that innovatively adopts a summary graph to leverage both the subgraph connectivity and predictivity for learning strong connected and accurate invariant subgraphs. Specifically, SIL first learns a summary graph containing multiple strongly connected supernodes while maintaining structure consistency with the original graph. Second, the learned summary graph is disentangled into an invariant supernode and spurious counterparts to eliminate the interference of highly predictive edges and nodes. Finally, SIL identifies a potential invariant subgraph from the invariant supernode to accomplish generalization tasks. Additionally, we provide a theoretical analysis of the summary graph learning mechanism, guaranteeing that the learned summary graph is consistent with the original graph. Experimental results validate the effectiveness of the SIL model. © 1989-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：