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

Prediction of Bandwidth of Metamaterial Antenna Using Pearson Kernel-Based Techniques

computers, Materials & Continua 2024年第3期78卷 3449-3467页

作者： Sherly Alphonse S.Abinaya Sourabh Paul School of Computer Science and Engineering Vellore Institute of TechnologyChennai600127India School of Electronics Engineering Vellore Institute of TechnologyChennai600127India

The use of metamaterial enhances the performance of a specific class of antennas known as metamaterial *** radiation cost and quality factor of the antenna are influenced by the size of the *** antennas allow for the circumvention of the bandwidth restriction for small *** parameters have recently been predicted using machine learning algorithms in existing *** learning can take the place of the manual process of experimenting to find the ideal simulated antenna *** accuracy of the prediction will be primarily dependent on the model that is *** this paper,a novel method for forecasting the bandwidth of the metamaterial antenna is proposed,based on using the Pearson Kernel as a standard *** with these new approaches,this paper suggests a unique hypersphere-based normalization to normalize the values of the dataset attributes and a dimensionality reduction method based on the Pearson kernel to reduce the dimension.A novel algorithm for optimizing the parameters of Convolutional Neural Network(CNN)based on improved Bat Algorithm-based Optimization with Pearson Mutation(BAO-PM)is also presented in this *** prediction results of the proposed work are better when compared to the existing models in the literature.

关键词： Antenna pearson optimization bandwidth metamaterial

来源：评论

学校读者我要写书评

暂无评论

Improved Symbiotic organisms search for path planning of unmanned combat aerial vehicles

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第4期14卷 4289-4311页

作者： Rajmohan, Shathanaa Ramasubramanian, N. Computer Science and Engineering Indian Institute of Information Technology Chittoor Sri City India Computer Science and Engineering National Institute of Technology Tiruchirappalli India

Unmanned Combat Aerial Vehicles (UCAVs) are becoming a critical part of the military to automate complex missions with minimum risk and increased efficiency. Path planning is a necessary routine for UCAVs to guide them from the initial position to a pre − determined target. The focus of this work is to devise an algorithm to automatically plan the path for UCAVs in a 3D environment that is hostile and contains obstacles. In this work, an improved symbiotic organisms search algorithm with a novel adaptive peaking mechanism is proposed for 3D path planning. The new algorithm has been designed so that the search environment can be efficiently explored and to ensure quick convergence. The performance of the proposed algorithm is analysed with respect to the UCAV path planning and the results and statistical analysis show that the proposed algorithm outperforms other existing algorithms and also achieves an 11% speedup in exploration time. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Blind image authentication using singular value decomposition with enhanced robustness by augmenting hamming code

引用

International Journal of computers and Applications 2024年第11期46卷 1020-1044页

作者： Ghosh, Bibek Ranjan Mandal, Jyotsna Kumar Das, Swarnadeep Laha, Ayantanu Saha, Rajarshi Banerjee, Siddhartha Narendrapur India Department of Computer Science & Engineering Kalyani University Kalyani India Department of Computer Science & Engineering University of Calcutta Kolkata India Department of Computer Science Ramakrishna Mission Vivekananda Educational and Research Institute Howrah India

Singular value decomposition (SVD) based image authentication has widespread applications for digital media protection including forensic and medical domains due to the high stability and robustness of singular values under small perturbations. However, most of these techniques are non-blind and have high redundancies for the extraction of secret data. The proposed scheme employs a blind extraction strategy by utilizing the intrinsic relationship of coefficient pairs of the U matrix of the host image blocks. This relationship is utilized to hide a secret binary bit after computing a threshold value in constant time. The host image underwent block-wise decomposition and hash-based randomization of blocks, followed by block-wise SVD for embedding secret bits in the U matrix. Hamming coded watermark is embedded for high precision extraction under active attacks. High imperceptibility and strong robustness are observed under attacks when tested across general purpose as well as image datasets and the system outperforms many existing works. Experimental observation shows the average PSNR between the host and marked image and average NCC between embedded and extracted watermark to be 36.98 dB and 0.999 respectively for the SIPI dataset whereas 52.7 dB and 1 respectively for the X-Ray dataset. The system exhibited high robustness under Salt-and-pepper noise (SAPN), Gaussian Noise (GAUN), Cropping (CRP), Median Filtering (MF), Histogram Equalization (HEQ), and Jpeg Compression (JPC) with average NCC values of 0.998, 1, 0.932, 0.999 and 0.967 respectively for X-Ray dataset. The time complexity O (M × N) is observed for both embedding and extraction algorithms for a host image of size M × N. © 2024 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Median filters

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Review on the Prediction of Video Frame and Motion Contents

A Comprehensive Review on the Prediction of Video Frame and ...

引用

2024 International Conference on Integration of Emerging Technologies for the Digital World, ICIETDW 2024

作者： Mohana Priya, P. Ulagapriya, K. Vels Institute of Science Technology and Advanced Studies Department of Computer Science and Engineering Chennai India

ISBN: (数字)9798331541170

ISBN: (纸本)9798331541187

The capability of predicting, or analyzing the future outcomes of motion pictures using intelligent systems is the video frame prediction process. Video frame prediction is a significant and challenging aspect of computer Vision (CV) applications. Video prediction plays a vital role in terms of robotics and Artificial Intelligence (AI) applications in detecting the future frames of a video, depending on which, the decision-making process can be carried out. The existing video frame prediction processes include pixel law based and motion-based predictions, which have been proven to be ambiguous. This leads to inaccurate predictions and indirectly deteriorates the performance of the real time applications. This paper performs a detailed review of the existing methodologies, their merits, pitfalls and challenges that create havoc in the video frame prediction process. In addition, this paper performs a detailed analysis on the existing datasets that assist in the video prediction process. This review summarizes various methodologies and datasets along with their performance analysis, which will open research possibilities in the field of video frame prediction. © 2024 IEEE.

关键词： Artificial Intelligence computer Vision Datasets Robotics Video frame prediction

来源：评论

学校读者我要写书评

暂无评论

Custom Transformer-Based Approach for Enhanced Bengali Automatic Speech Recognition 1

Custom Transformer-Based Approach for Enhanced Bengali Autom...

引用

1st International Conference on Innovations in Communications, Electrical and computer engineering, ICICEC 2024

作者： Deepa, R. Jayalakshmi, V. Thilakavathy, P. Manikandan, G. Surendran, R. SRM Institute of Science and Technology School of Computing Department of Computing Technologies Chennai India SRM Institute of Science and Technology Department of Computer Science and Applications Ramapuram Chennai India Vels Institute of Science and Engineering Vels Institute of Science Technology and Advanced Studies Chennai India Anna University St. Joseph's College of Engineering Department of Artificial Intelligence and Machine Learning Chennai India Saveetha Institute of Medical and Technical Sciences Saveetha School of Engineering Department of Computer Science and Engineering Chennai India

ISBN: (数字)9798350376517

ISBN: (纸本)9798350376517

Automated speech recognition (ASR) systems struggle with Bengali, which is the fifth most spoken language. Bengali has a varied morphology, many dialects, and limited high-quality annotated voice data. Traditional voice recognition techniques work well however struggle with Bengali phonetics and syntax. This method eliminates the need for large amounts of tagged data and the difficulties of differentiating sounds in different languages, both issues are addressed by this procedure. The research in this paper offers an Intellectual Bengali Speech Recognition System using Deep Learning Techniques (IBSRS-DLT). The model in this system uses transformer architecture and attention processes to manage Bengali speech pattern long-range dependencies. The IBSRS-DLT outperforms standard models in recognition accuracy using a pre-trained transformer model modified for phonetic and lexical correctness and fine-tuned on Bengali datasets. After training on a vast Bengali speech corpus, real-world datasets and rigorous simulations confirm the system. IBSRS-DLT can be used for automatic transcription, voice-controlled devices, and Bengali virtual assistants, such applications are efficient and accessible. The simulation showed a considerable boost in recognition speed and a decrease in keyword mistakes compared to current methods. This paper shows that deep learning can solve linguistic issues in ASR systems, enabling scalable regional language detection. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive Neighborhood Adjustment Strategy Based On MOHHO and NSGA-III Algorithms for Feature Selection

引用

IAENG International Journal of Applied Mathematics 2024年第5期54卷 917-935页

作者： Papasani, Anusha Durgam, Revathi Devarakonda, Nagaraju Computer Science and Engineering Department Koneru Lakshmaiah Education Foundation AndhraPradesh Vaddeswaram522502 India Computer Science and Engineering Department AVN Institute of Engineering and Technology Telangana Hyderabad501510 India Science and Engineering Department VIT-AP University AP Amaravati522237 India

The efficiency of multi-objective evolutionary algorithms (MOEAs) in tackling issues with multiple objectives is examined. However, it is noted that current MOEA-based feature selection techniques often converge towards the center of the Pareto front due to inadequate selection forces. The study proposes the utilization of a novel approach known as MOEA/D, which partitions complex multi-objective problems into smaller, more feasible single-objective sub-problems. Each sub-problem may then be addressed using an equal amount of computational resources. The predetermined size of the neighborhood used by MOEA/D may lead to a delay in the algorithm's merging and reduce the effectiveness of the failure. The paper proposes the Adaptive Neighbourhood Adjustment Strategy (ANAS) as a novel approach to improve the efficiency of multi-objective optimisation algorithms in order to tackle this issue. The ANAS algorithm allows for adaptive adjustment of the subproblem neighborhood size, hence enhancing the trade-off between merging and variety. In the following section of the study, a novel feature selection technique called MOGHHNS3/D-ANA is introduced. This technique utilizes ANAS to expand the potential solutions for a particular subproblem. The approach evaluates the chosen features using the Regulated Extreme Learning Machine (RELM) classifier on sixteen benchmark datasets. The experimental results demonstrate that MOGHHNS3/D-ANA outperforms four commonly employed multi-objective techniques in terms of accuracy, precision, recall, F1 score, coverage, hamming loss, ranking loss, and training time, error. The APBI approach in decomposition-based multi-objective optimization focuses on handling constraints by adjusting penalty parameters to guide the search towards feasible solutions. On the other hand, the ANA approach focuses on dynamically adjusting the neighborhood size or search direction based on the proximity of solutions in the detached space to adapt the search process.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Secure SSI framework using the optimized Orkey identity schema

引用

International Journal of Information Technology (Singapore) 2024年第6期16卷 4007-4014页

作者： Pandu N, K. Kumar, A. Sasi Department of Computer Science and Engineering Srinivas University Institute of Engineering and Technology Srinivas University Department of Computer Science amd Engineering Yenepoya Institute of Technology VTU

In the era of digital transformation and increasing concerns regarding data privacy, the concept of Self-Sovereign Identity (SSI) has attained substantial recognization. SSI offers individuals greater control over their personal information and reduces reliance on centralized authorities for identity verification. However, existing SSI frameworks face challenges in terms of scalability, privacy, and competence. This paper introduces a noivel Secure SSI Framework based on the Optimized OrKey Identity Schema (OIS) for Inter-organizational business processes (IOBP). The Optimized OrKey Identity Schema optimizes data storage and retrieval, reducing the computational overhead associated with identity verification. The pigeon's communicative and mimicry behavior of pigeon-inspired optimization (PIO) as well as the flamingo's foraging and migratory patterns of the Flamingo Search Algorithm (FSA) served as the basis for the proposed Flamieon-inspired optimization method. A Verifiable Data Credential is introduced to combine the elements of verifiable credentials and the Blockchain method to improve the security and trustworthiness of sharing data and verification in a decentralized manner. The proposed OIS methods achieve a value of 4.00% for Anonymization, 9989.57 for Gas ratio, 7445.70 KB for Memory usage, 17.32% for Network hash rate, 5.07 ms for Transaction latency, and 41,234.82 ms for Transaction Time. © Bharati Vidyapeeth's institute of computer Applications and Management 2024.

关键词： BC technology Flamieon-inspired optimization OrKey identity schema Self-sovereign identity Verifiable data credential

来源：评论

学校读者我要写书评

暂无评论

Manhattan-based k-member clustering and enhanced rabbit optimization algorithm for k-anonymization in social network

引用

Multimedia Tools and Applications 2024年第30期83卷 74739-74756页

作者： Sivasankari, K. Maheswari, K. M. Uma Department of computer science and engineering SRM Institute of Science and Technology Ramapuram Chennai India Department of computing technologies School of Computing College of Engineering and Technology SRM Institute of Science and Technology Kattankulathur India

Online social networks are becoming more and more popular, according to recent trends. The user's primary concern is the secure preservation of their data and privacy. A well-known method for preventing individual identity in publicly accessible datasets is K-anonymization. Existing anonymity techniques' primary drawback is that they're susceptible to similarity and attribute disclosure attacks. Furthermore, a large amount of data has been lost in the given database. To address this limitation, the proposed model integrated an anonymizing algorithm with Manhattan-based k-member clustering and an enhanced rabbit optimization algorithm (MKCAEROA). The Manhattan distance-based k member (MKCA) clustering algorithm is employed in this case to cluster the initial database. The resulting clusters are then further optimized, and the original database is made anonymous, using the enhanced rabbit optimization algorithm (EROA). In the suggested model, EROA is included to satisfy the specified anonymity constraints while concurrently minimizing the clustering error rate and the generated information loss. When compared to existing approaches, the experimental results demonstrate that the suggested method provides the highest clustering accuracy with the least amount of information loss. The MATLAB workbench will be used to implement the suggested model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Authorization of Aadhar data using Diffie Helman key with enhanced security concerns

引用

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 8639-8658页

作者： Karthika, K. Rangasamy, Devi Priya Anna University Chennai India Department of Computer Science and Engineering KPR Institute of Engineering and Technology Coimbatore India

In today’s digital era, the security of sensitive data such as Aadhaar data is of utmost importance. To ensure the privacy and integrity of this data, a conceptual framework is proposed that employs the Diffie-Hellman key exchange protocol and Hash-based Message Authentication Code (HMAC) to enhance the security. The proposed system begins with the preprocessing phase, which includes removing noise, standardizing formats and validating the integrity of the data. Next, the data is segmented into appropriate sections to enable efficient storage and retrieval in the cloud. Each segment is further processed to extract meaningful features, ensuring that the relevant information is preserved while reducing the risk of unauthorized access. For safeguarding the stored Aadhaar data, the system employs the Diffie-Hellman key exchange protocol which allows the data owner and the cloud service provider to establish a shared secret key without exposing it to potential attackers. Additionally, HMAC is implemented to verify the identity of users during the login process. HMAC enhances security by leveraging cryptographic hash functions and a shared secret key to produce a distinct code for each login attempt. This mechanism effectively protects the confidentiality and integrity of stored data. The combination of Diffie-Hellman key exchange and HMAC authentication provides a robust security framework for Aadhaar data. It ensures that the data remains encrypted and inaccessible without the secret key, while also verifying the identity of users during the login process. This comprehensive approach helps preventing unauthorized access thereby protecting against potential attacks, instilling trust and confidence in the security of Aadhaar data stored in the cloud. Results of the article depict that the proposed scheme achieve 0.19 s of encryption time and 0.05 s of decryption time. © 2024 – IOS Press. All rights reserved.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Leveraging Deep Learning Models for Machine-Generated Text Detection Using Transformer-Based Models

Leveraging Deep Learning Models for Machine-Generated Text D...

引用

2024 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems, ICSES 2024

作者： Suthanthiradevi, P. Revathy, G. Rejini, K. Muthu Lakshmi, V. School of Computing Srm institute of Science and Technology Department of Data Science and Business Systems Kattankulathur Chennai India Vels Institute of science Technology and Advanced studies Department of Computer science and engineering Chennai117 India Amrita college of Engineering and Technology Department of Computer Science Engineering Nagercoil India St. Joseph's College of Engineering Department of Computer Science and Engineering OMR Chennai India

ISBN: (纸本)9798331543617

GPT is a large language model (LLM) derived from natural language processing that can generate a human-like text using machine learning. However, these models raise questions about authenticity and reliability of material, particularly in fields such as journalism, social media, and academia, despite their usefulness for automating text-based tasks. Detecting machine-generated text is thus an important difficulty in ensuring content integrity. This study investigates the use of huge language models as a technique for recognizing machine-generated material. The author proposes a comprehensive detection model by evaluating the language patterns, syntactic structures, and stylistic traits that separate AI-generated literature from human writing. In addition, this research investigate the possibilities of fine-tuning models designed expressly for text identification tasks and evaluate their performance using LLM - Detect AI Generated Text datasets. In digital ecosystems, LLMs are effective at detecting AI-generated text, providing a novel approach for content moderation, academic integrity checks, and synthetic media detection. An increasingly AI-powered future will require a model that can discriminate between human and machine-generated writing in real-time. According to experimental findings, the CNN architecture's design combined with the use of DistilBERT embeddings allows for the effective and efficient classification of AI generated text data, achieving an exceptional 98% accuracy rate. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：