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

Generative AI-Driven Incentive Mechanism for Semantic Communications in RSMA Networks

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Liu, Dongqing Liu, Yongwen Zhang, Lei Hafid, Abdelhakim Khoukhi, Lyes Li, Mingyuan Liu, Yutao Dong, Yadong The First Affiliated Hospital of Zhengzhou University National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou China Zhengzhou University of Light Industry Software Engineering College Zhengzhou China Henan University of Technology College of Electrical Engineering Zhengzhou China University of Montreal Department of Computer Science and Operational Research Canada GREYC Laboratory ENSICAEN Normandie University France

This paper proposes a framework integrating Rate Splitting Multiple Access (RSMA), semantic communications, and generative AI for optimizing next-generation wireless networks. We present a unified model that combines RSMA with semantic communications to enhance both spectral efficiency and semantic fidelity. Our system model focuses on a downlink semantic communication system with a multi-antenna base station serving multiple single-antenna users. A dynamic contract-based incentive mechanism is developed to address user heterogeneity and information asymmetry in semantic RSMA scenarios. We introduce a diffusion model-based approach for joint optimization of resource allocation and contract design in RSMA systems. The semantic encoding process extracts key information, i.e., free-space detection, interest points, object attributes, and spatial relationships, from image data. A loss function is designed to train the semantic encoder and RSMA scheme, incorporating semantic extraction, partitioning, reconstruction, and task specific components. Our framework includes a multi-objective performance evaluation that considers both conventional metrics and semantic accuracy in a multi-user RSMA environment. We also define a multi-component semantic accuracy metric to assess the quality and utility of the extracted semantic information. Extensive simulation results demonstrate the superiority of our proposed framework over existing approaches in terms of system throughput, energy efficiency, and semantic fidelity across various network scenarios and user distributions. © 2015 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

AI Personalized Mental Health Monitoring System using Machine Learning, and Natural Language Processing

AI Personalized Mental Health Monitoring System using Machin...

引用

Data Science, Agents & Artificial Intelligence (ICDSAAI), International Conference on

作者： S. Mohamed Jamal Irfan G. Dhivya N. Raghavendran M. C. Babu T. Jasperline R. Saravanakumar Department of Computer Applications Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Department of Artificial Intelligence and Date Science RMK College of Engineering and Technology Chennai Tamil Nadu India Artificial Intelligence and Data Sciences Chennai Institute of Technology Chennai Tamil Nadu India Department of Computer Science and Engineering Dr. G. U. Pope College of Engineering Tuticorin Tamil Nadu India Iconix Software Solution Tirunelveli Tamil Nadu India

ISBN: (数字)9798331537555

ISBN: (纸本)9798331537562

This study introduces an AI-driven customized mental health monitoring system that uses machine learning (ML) and natural language processing (NLP) to provide ongoing mental health evaluation and assistance. The system uses user-generated textual data, including journal entries, chat logs, and social media postings, to assess emotional states, stress levels, and mental health issues. The system uses sophisticated natural language processing methods to identify linguistic patterns associated with mental health problems such as depression, anxiety, and others. The machine learning algorithms customize monitoring by adjusting to the unique characteristics of each user and use past data to provide customized suggestions and preemptive alerts. The technology aims to enhance human interaction and function as a proactive tool in mental health treatment by providing real-time information. The system extracts emotional indicators from textual input using sentiment analysis methods and pre-trained natural language processing models such as BERT. The results are used with user demographics and history to build machine learning classifiers, such as Random Forest (RF) and Support Vector Machine (SVM), which predict mental health disorders. Supervised learning is used to develop the model, and suggestions are progressively improved using a tailored feedback system. The SVM and RF algorithms demonstrated an 88% and 92%accuracy rate in forecasting mood swings and early warning indicators of mental health disorders when evaluated on a set of anonymized mental health information. The 30% increase in user involvement demonstrated the efficacy of tailored suggestions in proactive mental health treatment.

关键词： Support vector machines Machine learning algorithms Accuracy Social networking (online) Supervised learning Mental health Natural language processing Monitoring Random forests Classification tree analysis

来源：评论

学校读者我要写书评

暂无评论

3D CT Liver Images Lesion Extraction and Classification for Using 3D-CNN with GLRLM

3D CT Liver Images Lesion Extraction and Classification for ...

引用

Advanced Computing Technologies (ICoACT), International Conference on

作者： S. Jayarathna R. Sowmiya G. Nallasivan G. Sahaana S. Ashok R. Saravanakumar Master of Computer Applications Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Computer Applications Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Department of Computer Science and Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai Tamil Nadu India Department of Artificial Intelligence & Data Science Dhanalakshmi College of Engineering Chennai Tamil Nadu India Department of Electronics and Communication Engineering Vel Tech Multi Tech Dr. Rangarajan Dr. Sakunthala Engineering College Chennai Tamil Nadu India Iconix Software Solution Tirunelveli Tamil Nadu India

ISBN: (数字)9798331509859

ISBN: (纸本)9798331509866

The imaging technique known as computed tomography (CT) is often considered to be the most reliable way for non-invasive diagnosis. Through the use of three-dimensional (3D) computed tomography images, we were able to categorize aggressive tumors that were found in the liver for the aim of this research. When it comes to the three-dimensional (3D) CT image, the dimension reduction is accomplished by the use of principal component analysis (PCA). The Random Forest Algorithm is responsible for identifying the abnormal hepatic region, and a median filter is used to reduce the amount of noise occurring. Methods of data augmentation are also employed in this process. To extract Gray Level Run Length Matrix (GLRLM) features, using Pyradiomics python package. These features are then fed into a 3D-CNN classifier to classify malignant tumors and haemangiomas. Our model was found to have greater performance after being compared to the findings of other models. This was revealed after the comparison was made. For the training dataset, our model has an accuracy of 97.2%, and for the test dataset, it has an accuracy of 98.25%. This accuracy is determined by the performance metrics that our model incorporates.

关键词： Training Solid modeling Accuracy Three-dimensional displays Computed tomography Liver Feature extraction Data augmentation Data models Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Extracting and Classifying 3D Medical Image Texture Characteristics using GLCM and LBP-Based Techniques

Extracting and Classifying 3D Medical Image Texture Characte...

引用

Data Science, Agents & Artificial Intelligence (ICDSAAI), International Conference on

作者： R. Srinath R. Sharmila N. Raghavendran M. C. Babu K. Ramanan R. Saravanakumar Department of Computer Applications Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Department of Artificial Intelligence and Date Science RMK College of Engineering and Technology Chennai Tamil Nadu India Department of Artificial Intelligence and Data Sciences Chennai Institute of Technology Chennai Tamil Nadu India Iconix Software Solution Tirunelveli Tamil Nadu India

ISBN: (数字)9798331537555

ISBN: (纸本)9798331537562

Recent advances in 3D sensor technology have advanced 3D imaging systems. This sparks interest in 3D picture feature extraction and categorization. According to the literature, textural content is essential to visuals. In this case, we extract texture characteristics from three-dimensional photos to improve feature differentiation. Category of volumetric data with texture is possible using this method. We employ feature vectors from Local Binary Patterns (LBP) and Gray-Level Co-occurrence Matrix methods to achieve this. The visual pattern and volumetric data contrast, homogeneity, and local anisotropy are described. The proposed approach was tested using a publicly accessible dataset of modified volumetric textured pictures. Generative Adversarial Networks (GAN) and recurrent Neural Networks (RNN) are classified. Our solution outperforms manually constructed techniques for extracting texture characteristics from 3D and 2D data and standard deep-learning networks. Even with few photographs per class, the recommended method improves class distinction and yields good results. Show exceptional accuracy. Integrating the Gray Level Co-occurrence Matrix (GLCM) with Local Binary Patterns (LBP) improved classification performance. The GLCM approach, which captures spatial relationships, and the LBP method, which depicts local texture, was advantageous. This hybrid method improved feature extraction and classification, notably for complex 3D medical pictures with subtle texture changes.

关键词： Deep learning Visualization Three-dimensional displays Machine learning algorithms Recurrent neural networks Liver Feature extraction Generative adversarial networks Classification algorithms Tumors

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

2D matrix based indexing with color spectralhistogram for efficient image retrieval

引用

Journal of Systems engineering and Electronics 2016年第5期27卷 1122-1134页

作者： maruthamuthu ramasamy john sanjeev kumar athisayam Department of Software Engineering RVS College of EngineeringDindigul 624005India Department of Computer Applications Thiagarajar College of EngineeringMadurai 625015India

A novel content based image retrieval （CBIR） algorithmusing relevant feedback is presented. The proposed frameworkhas three major contributions： a novel feature descriptor calledcolor spectral histogram （CSH） to measure the similarity betweenimages; two-dimensional matrix based indexing approach proposedfor short-term learning （STL）; and long-term learning （LTL）.In general, image similarities are measured from feature representationwhich includes color quantization, texture, color, shapeand edges. However, CSH can describe the image feature onlywith the histogram. Typically the image retrieval process starts byfinding the similarity between the query image and the imagesin the database; the major computation involved here is that theselection of top ranking images requires a sorting algorithm to beemployed at least with the lower bound of O（n log n）. A 2D matrixbased indexing of images can enormously reduce the searchtime in STL. The same structure is used for LTL with an aim toreduce the amount of log to be maintained. The performance ofthe proposed framework is analyzed and compared with the existingapproaches, the quantified results indicates that the proposedfeature descriptor is more effectual than the existing feature descriptorsthat were originally developed for CBIR. In terms of STL,the proposed 2D matrix based indexing minimizes the computationeffort for retrieving similar images and for LTL, the proposed algorithmtakes minimum log information than the existing approaches.

关键词： content based image retrieval （CBIR） color spectralhistogram （CSH） short-term learning （STL） long-term learning（LTL） similarity measures.

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pricing based Near-Optimal Resource Allocation for Elastic Edge Offloading

引用

IEEE Transactions on Mobile Computing 2025年

作者： Xia, Yun Xue, Hai Zhang, Di Mumtaz, Shahid Xu, Xiaolong Rodrigues, Joel J. P. C. University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Zhengzhou University School of Electrical and Information Engineering Henan International Joint Laboratory of Intelligent Health Information System National Telemedicine Center National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou450001 China Nottingham Trent University Department of Engineering NottinghamNG1 4FQ United Kingdom Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Nanjing University of Information Science and Technology School of Software Nanjing210044 China Amazonas State University Manaus Brazil

In mobile edge computing (MEC), task offloading can significantly reduce task execution latency and energy consumption of end user (EU). However, edge server (ES) resources are limited, necessitating efficient allocation to ensure the sustainable and healthy development for MEC system. In this paper, we propose a dynamic pricing mechanism based near-optimal resource allocation for elastic edge offloading. First, we construct a resource pricing model and accordingly develop the utility functions for both EU and ES, the optimal pricing model parameters are derived by optimizing the utility functions. In the meantime, our theoretical analysis reveals that the EU's utility function reaches a local maximum within the search range, but exhibits barely growth with increased resource allocation beyond this point. To this end, we further propose the Dynamic Inertia and Speed-Constrained particle swarm optimization (DISC-PSO) algorithm, which efficiently identifies the near-optimal resource allocation. Comprehensive simulation results validate the effectiveness of DISC-PSO algorithm, demonstrating that it significantly outperforms existing schemes by reducing the average number of iterations to reach a near-optimal solution by 86.88%, increasing the EU utility function value by 0.13%, and decreasing the variance of results by 96.78%. © 2025 IEEE. All rights reserved.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Based Phishing Attacks Detection Using Multiple Datasets

International Journal of Interactive Mobile Technologies

引用

International Journal of Interactive Mobile Technologies 2023年第5期17卷 71-83页

作者： Aljammal, Ashraf H. taamneh, Salah Qawasmeh, Ahmad Salameh, Hani Bani Department of Computer Science and Applications The Hashemite University Zarqa Jordan Department of Software Engineering The Hashemite University Zarqa Jordan

Nowadays, individuals and organizations are increasingly targeted by phishing attacks, so an accurate phishing detection system is required. Therefore, many phishing detection techniques have been proposed as well as phishing datasets have been collected. In this paper, three datasets have been used to train and test machine learning classifiers. The datasets have been archived by Phish-Tank and UCI Machine Learning Repository. Furthermore, Information Gain algorithm have been used for features reduction and selection purpose. In addition, six machine learning classifiers have been evaluated, namely NaiveBayes, ANN, DecisionStump, KNN, J48 and RandomForest. However, the classifiers have been trained and tested over the three datasets in two stages. The first stage is using all features included in each dataset while the second stage using selected features by IG algorithm. At the first stage RandomForest classifier has shown the best performance over Dataset-1 and Dataset-2, while J48 has shown the best performance over Dataset-3. On the other hand, after features selection, the RandomForest classifier was the superior among the other five classifiers over Dataset-1 and Dataset-2 with accuracy of 98% and 93.66% respectively. While ANN classifier has shown the best performance with accuracy of 88.92% over Dataset-3. Because of the few number of instances as well as features in Dataset-3 comparing to the other two dataset;the performance of the classifiers has been affected © 2023, International Journal of Interactive Mobile *** Rights Reserved.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

A full-featured efficient clustering mechanism for improving QoS in MANETs

引用

International Journal of Networking and Virtual Organisations 2018年第2-4期19卷 105-132页

作者： Marcel, Gatete Kovalan, A. School of Computer Sciences and Applications Periyar Maniammai University ThanjavurTamil Nadu India Department of Mathematics and Computer Applications Division of Software Engineering Periyar Maniammai University ThanjavurTamil Nadu India

Due to the dynamicity of MANET’s topology and its infrastructureless nature, various problems arise from those inherent properties which degrade the QoS. Those negative issues are the energy constraints, problems related to broadcasting, high node mobility, unpartitioned network, and various challenges faced during the path discovery, route selection, packet scheduling and packet transmission processes, and security issues. To find an efficient solution to all those problems, in this paper, we propose a robust algorithm;Full-featured secure routing clustering algorithm with energy-aware and scheduling capabilities for highly increasing QoS in MANET (FSR-CAES), an efficient clustering technique which is a combination of numerous algorithms, each one containing one of the previously mentioned problems. The simulation results are provided with the NS-2 simulator varying the number of nodes and the evaluating parameters namely the routing overhead, packet delivery ratio, Normalised routing load, and the average end-to-end delay while comparing the performance of our proposed scheme with neighbour coverage-based probabilistic rebroadcast (NCPR), a routing protocol specialised in providing high QoS in MANETs as it is efficient in reducing the routing overhead in the network. The outcomes prove that our proposed scheme outperforms NCPR for all the studied scenarios for small, medium, and large MANETs. Copyright © 2018 Inderscience Enterprises Ltd.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Snapshot boosting: a fast ensemble framework for deep neural networks

引用

Science China(Information Sciences) 2020年第1期63卷 77-88页

作者： Wentao ZHANG Jiawei JIANG Yingxia SHAO Bin CUI Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications Department of Computer Science Beijing Key Lab of Intelligent Telecommunications Software and Multimedia School of Computer ScienceBeijing University of Posts and Telecommunications Key Lab of High Confidence Software Technologies Department of Computer SciencePeking University

Boosting has been proven to be effective in improving the generalization of machine learning models in many fields. It is capable of getting high-diversity base learners and getting an accurate ensemble model by combining a sufficient number of weak learners. However, it is rarely used in deep learning due to the high training budget of the neural network. Another method named snapshot ensemble can significantly reduce the training budget, but it is hard to balance the tradeoff between training costs and diversity. Inspired by the ideas of snapshot ensemble and boosting, we propose a method named snapshot boosting. A series of operations are performed to get many base models with high diversity and accuracy, such as the use of the validation set, the boosting-based training framework, and the effective ensemble strategy. Last, we evaluate our method on the computer vision(CV) and the natural language processing(NLP) tasks, and the results show that snapshot boosting can get a more balanced trade-off between training expenses and ensemble accuracy than other well-known ensemble methods.

关键词： ensemble learning deep learning boosting neural network snapshot ensemble

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：