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

An Innovative Approach Using TKN-Cryptology for Identifying the Replay Assault

computers, Materials & Continua 2024年第1期78卷 589-616页

作者： Syeda Wajiha Zahra Muhammad Nadeem Ali Arshad Saman Riaz Muhammad Abu Bakr Ashit Kumar Dutta Zaid Alzaid Badr Almutairi Sultan Almotairi Department of Computer Science Alhamd Islamic UniversityIslamabad44000Pakistan Department of Computer Science and Technology University of Science and Technology BeijingBeijing100083China Department of Computer Science National University of TechnologyIslamabad44000Pakistan Department of Electrical Engineering National University of TechnologyIslamabad44000Pakistan Department of Computer Science and Information Systems College of Applied SciencesAlMaarefa UniversityRiyadh13713Saudi Arabia Department of Computer Science Faculty of Computer and Information SystemsIslamic University of MadinahMedinah42351Saudi Arabia Department of Information Technology College of Computer Sciences and Information Technology CollegeMajmaah UniversityAl-Majmaah11952Saudi Arabia Department of Natural and Applied Sciences Faculty of Community CollegeMajmaah UniversityMajmaah11952Saudi Arabia

Various organizations store data online rather than on physical *** the number of user’s data stored in cloud servers increases,the attack rate to access data from cloud servers also *** researchers worked on different algorithms to protect cloud data from replay *** of the papers used a technique that simultaneously detects a full-message and partial-message replay *** study presents the development of a TKN(Text,Key and Name)cryptographic algorithm aimed at protecting data from replay *** program employs distinct ways to encrypt plain text[P],a user-defined Key[K],and a Secret Code[N].The novelty of the TKN cryptographic algorithm is that the bit value of each text is linked to another value with the help of the proposed algorithm,and the length of the cipher text obtained is twice the length of the original *** the scenario that an attacker executes a replay attack on the cloud server,engages in cryptanalysis,or manipulates any data,it will result in automated modification of all associated values inside the *** mechanism has the benefit of enhancing the detectability of replay ***,the attacker cannot access data not included in any of the papers,regardless of how effective the attack strategy *** the end of paper,the proposed algorithm’s novelty will be compared with different algorithms,and it will be discussed how far the proposed algorithm is better than all other algorithms.

关键词： Replay attack malware message attack file encryption cryptology data security

来源：评论

学校读者我要写书评

暂无评论

Joint View Selection, Multigroup Multicast Beamforming, and DIBR for RIS-Aided Multi-View Videos

引用

IEEE Transactions on Mobile Computing 2025年第07期24卷 6376-6393页

作者： Lee, Chi-Han Yang, De-Nian Lee, Guang-Siang Wang, Chih-Hang Liao, Wanjiun National Taiwan University Department of Electrical Engineering Taiwan Academia Sinica Institute of Information Science The Research Center for Information Technology Innovation Taiwan Academia Sinica Research Center for Information Technology Innovation Taiwan National Chung Cheng University Department of Computer Science and Information Engineering Taiwan

The rapid development of multi-view videos (MVV) transmission is an irresistible trend. Concurrently, reconfigurable intelligent surface (RIS)-assisted wireless communication has drawn significant attention. We observe that the view selection based on the base station and the view synthesis based on depth-image-based rendering (DIBR) can effectively reduce power consumption. Therefore, this paper studies the view selection and synthesis for RIS-aided MVV in multigroup multicast beamforming. To deal with this complicated scenario, we investigate a problem, named the joint View selection, Multicast beamforming, and DIBR (JVMD), to minimize the total multicast beamforming power, the view transmission operation power, and view synthesis, subject to quality-of-service (QoS), RIS phase shifts, view selection, and DIBR constraints. Unfortunately, the mathematical model is a complicated mixed discrete-continuous optimization problem. To tackle this challenging problem, we designed an algorithm, named View selection, Beamforming, RIS phase, and DIBR (VBRD) algorithm. First, we deal with the discrete optimization problem of selecting the view. VBRD uses the dual-based approximation methodology to round back a primal's integer solution. Then, in the continuous optimization problem, we apply the alternating optimization (AO) method to determine beamforming, RIS phase, and DIBR. Finally, simulation results show the performance of exploiting view synthesis for RIS-assisted wireless communication. © 2002-2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

A color image encryption scheme based on a 2D coupled chaotic system and diagonal scrambling algorithm

引用

Chinese Physics B 2024年第7期33卷 233-243页

作者：苏静明方士辉洪炎温言 Anhui Mining Machinery and Electrical Equipment Coordination Innovation Center Anhui University of Science and TechnologyHuainan 232001China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China

A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.

关键词： color image encryption discrete cosine transform two-dimensional(2D)coupled chaotic system diagonal scrambling

来源：评论

学校读者我要写书评

暂无评论

Inductive Lottery Ticket Learning for Graph Neural Networks

引用

Journal of computer science & technology 2024年第6期39卷 1223-1237页

作者： Yong-Duo Sui Xiang Wang Tianlong Chen Meng Wang Xiang-Nan He Tat-Seng Chua School of Data Science University of Science and Technology of ChinaHefei 230027China Department of Electrical and Computer Engineering The University of Texas at AustinAustin 78712U.S.A School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China School of Computing National University of SingaporeSingapore

Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplored. The recent work Unified GNN Sparsification (UGS) studies lottery ticket learning for GNNs, aiming to find a subset of model parameters and graph structures that can best maintain the GNN performance. However, it is tailed for the transductive setting, failing to generalize to unseen graphs, which are common in inductive tasks like graph classification. In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity. To prune the input graphs, we design a predictive model to generate importance scores for each edge based on the input. To prune the model parameters, it views the weight’s magnitude as their importance scores. Then we design an iterative co-pruning strategy to trim the graph edges and GNN weights based on their importance scores. Although it might be strikingly simple, ICPG surpasses the existing pruning method and can be universally applicable in both inductive and transductive learning settings. On 10 graph-classification and two node-classification benchmarks, ICPG achieves the same performance level with 14.26%–43.12% sparsity for graphs and 48.80%–91.41% sparsity for the GNN model.

关键词： lottery ticket hypothesis graph neural networks neural network pruning

来源：评论

学校读者我要写书评

暂无评论

An Anchor-Aware Graph Autoencoder Fused with Gini Index Model for Link Prediction

引用

SN computer science 2024年第6期5卷 745页

作者： Kumar, Shambhu Bisht, Dinesh Jain, Arti Computer Science & amp Engineering and IT Jaypee Institute of Information Technology Department of Mathematics Jaypee Institute of Information Technology

Link prediction stands as a crucial network challenge, garnering attention over the past decade, with its significance heightened by the escalating volume of network data. In response to the pressing need for swift research focus, this study introduces an innovative approach—the Anchor-aware Graph Autoencoder integrated with the Gini Index (AGA-GI)—aimed at gathering data on the global placements of link nodes within the link prediction framework. The proposed methodology encompasses three key components: anchor points, node-to-anchor paths, and node embedding. Anchor points within the network are identified by leveraging the graph structure as an input. The determination of anchor positions involves computing the Gini indexes (GI) of nodes, leading to the generation of a candidate set of anchors. Typically, these anchor points are distributed across the network structure, facilitating substantial informational exchanges with other nodes. The location-based similarity approach computes the paths between anchor points and nodes. It identifies the shortest path, creating a node path information function that incorporates feature details and location similarity. The ultimate embedding representation of the node is then formed by amalgamating attributes, global location data, and neighbourhood structure through an auto-encoder learning methodology. The Residual Capsule Network (RCN) model acquires these node embeddings as input to learn the feature representation of nodes and transforms the link prediction problem into a classification task. The suggested (AGA-GI) model undergoes comparison with various existing models in the realm of link prediction. These models include Attributes for Link Prediction (SEAL), Embeddings, Subgraphs, Dual-Encoder graph embedding with Alignment (DEAL), Embeddings and Spectral Clustering (SC), Deep Walk (DW), Graph Auto-encoder (GAE), Variational Graph Autoencoders (VGAE), Graph Attention Network (GAT), and Graph Conversion Capsule Link (G

关键词： Capsule network Ideal Anchor Point Link prediction Path Estimation Portion Path information function Residual module Shortest path distance

来源：评论

学校读者我要写书评

暂无评论

Robust Deep Convolutional Solutions for Identifying Biotic Crop Stress in Wild Environments

IEEE Transactions on AgriFood Electronics

引用

IEEE Transactions on AgriFood Electronics 2024年第2期2卷 497-508页

作者： Pal, Chiranjit Mukherjee, Imon Chatterji, Sanjay Pratihar, Sanjoy Mitra, Pabitra Chakrabarti, Partha Pratim Indian Institute of Information Technology Kalyani Department of Computer Science and Engineering Kalyani741235 India Indian Institute of Technology Kharagpur Department of Computer Science and Engineering Kharagpur721302 India

In the realm of agricultural automation, the precise identification of crop stress holds immense significance for enhancing crop productivity. Existing methods primarily focus on controlled environments, which may not accurately reflect field conditions. Field-based leaf image analysis poses challenges due to varying image quality and sunlight intensity. Moreover, the complexity of crop stress images, with their random lesion distribution, diverse symptoms, and complex backgrounds, further complicates the analysis. To overcome these limitations, a lightweight hybrid convolutional neural network has been developed. This system integrates the powerful three-deep blocks model with an autoencoder running in parallel to highlight regions of crop stress effectively. To support this approach, we have introduced the Indian Rice Disease Dataset (IRDD) with labeled images. The proposed system reports an average true positive rate (TPR) of 0.8766 and an average positive predicted value of 0.8720 on IRDD, which are higher than other state-of-the-art crop disease detection models. The system is validated on benchmark datasets, yielding significant results: TPR of 0.9870 (rice), 0.9985 (tomato), and 0.8559 (corn). Furthermore, the proposed model outperforms recent state-of-the-art works on the benchmark PlantDoc dataset, showing its effectiveness in generalizing plant disease identification tasks. Finally, an ablation study has been carried out to explore the importance of the two parallel branches. Overall, this study acts as a bridge between advanced science and practical application, showcasing how interdisciplinary automation could revolutionize crop disease identification, improve agricultural efficiency, and reshape broader industrial practices. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A Study on the Inter-Pretability of Network Attack Prediction Models Based on Light Gradient Boosting Machine(LGBM)and SHapley Additive exPlanations(SHAP)

引用

computers, Materials & Continua 2025年第6期83卷 5781-5809页

作者： Shuqin Zhang Zihao Wang Xinyu Su School of Computer Science Zhongyuan University of TechnologyZhengzhou450000China School of Cyberspace Security Information Engineering UniversityZhengzhou450000China

The methods of network attacks have become increasingly sophisticated,rendering traditional cybersecurity defense mechanisms insufficient to address novel and complex threats *** recent years,artificial intelligence has achieved significant progress in the field of network ***,many challenges and issues remain,particularly regarding the interpretability of deep learning and ensemble learning *** address the challenge of enhancing the interpretability of network attack prediction models,this paper proposes a method that combines Light Gradient Boosting Machine(LGBM)and SHapley Additive exPlanations(SHAP).LGBM is employed to model anomalous fluctuations in various network indicators,enabling the rapid and accurate identification and prediction of potential network attack types,thereby facilitating the implementation of timely defense measures,the model achieved an accuracy of 0.977,precision of 0.985,recall of 0.975,and an F1 score of 0.979,demonstrating better performance compared to other models in the domain of network attack *** is utilized to analyze the black-box decision-making process of the model,providing interpretability by quantifying the contribution of each feature to the prediction results and elucidating the relationships between *** experimental results demonstrate that the network attack predictionmodel based on LGBM exhibits superior accuracy and outstanding predictive ***,the SHAP-based interpretability analysis significantly improves the model’s transparency and interpretability.

关键词： Artificial intelligence network attack prediction light gradient boosting machine(LGBM) SHapley Additive exPlanations(SHAP) interpretability

来源：评论

学校读者我要写书评

暂无评论

Traffic sign recognition model based on scale sequence features and high-order spatial interactions

引用

Neural Computing and Applications 2025年第5期37卷 3605-3620页

作者： Zhang, Gan Wang, Yafei Li, Wenju Fu, Xianping School of Information Science and Technology Dalian Maritime University Dalian116026 China School of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai201418 China Pengcheng Laboratory Shenzhen518055 China

Traffic sign recognition is an integral part of driver assistance systems play a crucial role in enhancing road safety. Due to a large number of challenging targets, such as occlusion, distortion, and small targets in actual scenes, existing methods still have bottlenecks in the accuracy of detection and recognition. Therefore, this paper proposes a real-time traffic sign recognition model based on scale sequence features (SSFs) and high-order spatial interactions (HOSIs) on the basis of YOLOv5. This model extracted scale-invariant SSF using a high-dimensional convolution on the underlying feature map to improve the detection effect of multi-scale targets. At the same time, recursive gated convolution modules are integrated into the feature pyramid network, expanding the interactions to arbitrary order and providing richer feature information for high-order convolutions. In addition, a cross-stage partial (CSP) structure is incorporated into the spatial pooling pyramid, which improves the structure’s performance without introducing excessive computational complexity. The experimental results show that the proposed model achieves 95.5% and 99.92% of mAP on Tsinghua–Tencent 100K (TT100K) and German Traffic Sign Recognition Benchmark (GTSRB), respectively, which surpass the performance of the most advanced model and meets the requirements of real-time detection. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

E-voting system using cloud-based hybrid blockchain technology

引用

Journal of Safety science and Resilience 2024年第1期5卷 102-109页

作者： Beulah Jayakumari S Lilly Sheeba Maya Eapen Jani Anbarasi Vinayakumar Ravi A.Suganya Malathy Jawahar Department of Information Technology Tagore Engineering College Chennai India School of Computer Science and Engineering SRM Institute of Science and Technology Ramapuram ChennaiIndia Department of Information Technology Jerusalem College of Engineering ChennaiIndia School of Computer Science and Engineering Vellore Institute of Technology Chennai India Center for Artificial Intelligence Prince Mohammad Bin Fahd UniversityKhobarSaudi Arabia Leather Process Technology Division CSIR-Central Leather Research Institute ChennaiIndia

With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election *** pandemic situations,citizens tend to develop panic about mass gatherings,which may influence the decrease in the number of *** urges a reliable,flexible,transparent,secure,and cost-effective voting *** proposed online voting system using cloud-based hybrid blockchain technology eradicates the flaws that persist in the existing voting system,and it is carried out in three phases:the registration phase,vote casting phase and vote counting phase.A timestamp-based authentication protocol with digital signature validates voters and candidates during the registration and vote casting *** smart contracts,third-party interventions are eliminated,and the transactions are secured in the blockchain ***,to provide accurate voting results,the practical Byzantine fault tolerance(PBFT)consensus mechanism is adopted to ensure that the vote has not been modified or ***,the overall performance of the proposed system is significantly better than that of the existing *** performance was analyzed based on authentication delay,vote alteration,response time,and latency.

关键词： E-voting Cloud Blockchain Smart contract Consensus mechanism

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study on Dynamic Lifelong Learning with GPT for Mitigating Catastrophic Forgetting in Aspect-Based Sentiment Analysis

引用

IEEE Access 2025年 13卷 90316-90332页

作者： Huang, Huang Mustafa, Mumtaz Begum Asemi, Adeleh University of Malaya Faculty of Computer Science and Information Technology Department of Software Engineering Kuala Lumpur50603 Malaysia Branch Faculty of Engineering Department of Computer Engineering Isfahan81551-39998 Iran

GPT is widely recognized as one of the most versatile and powerful large language models, excelling across diverse domains. However, its significant computational demands often render it economically unfeasible for individuals and small businesses, underscoring the need for efficient, domain-specific alternatives. In Aspect-Based Sentiment Analysis (ABSA), existing models are typically optimized for single domains, facing challenges in performing effectively across multiple domains. A key issue, known as "catastrophic forgetting,"arises when models trained on one domain lose previously learned knowledge upon exposure to new domain data. This leads to two significant problems: limited cross-domain generalization and difficulty in retaining prior knowledge while learning domain-specific information. To address these challenges, we introduce the Dynamic Lifelong Learning Aspect-Based Sentiment Analysis GPT (DllaGPT), a model designed to handle multiple domains while mitigating catastrophic forgetting. Leveraging datasets from four ABSA domains - Laptops, Restaurants, Tweets, and Finance - this study fine-tunes a pretrained GPT model from HuggingFace sequentially across domains. DllaGPT employs a mechanism to retain real data from earlier domains during new domain training, effectively preserving prior knowledge. Experimental results highlight that DllaGPT achieves an average accuracy of 0.85 and a Backward Transfer (BWT) score of -0.09 across the four domains, showcasing its high accuracy and robust lifelong learning capabilities. © 2013 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：