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

Fortifying Healthcare Data Security in the Cloud:A Comprehensive Examination of the EPM-KEA Encryption Protocol

computers, Materials & Continua 2024年第5期79卷 3397-3416页

作者： Umi Salma Basha Shashi Kant Gupta Wedad Alawad SeongKi Kim Salil Bharany Computer Science and Information Technology Jazan UniversityJazanSaudi Arabia CSE Eudoxia Research UniversityNew CastleUSA Department of Information Technology College of Computer ScienceQassim UniversityBuraydahSaudi Arabia National Center of Excellence in Software Sangmyung UniversitySeoulKorea Department of Computer Science and Engineering Lovely Professional UniversityPhagwaraPunjabIndia

A new era of data access and management has begun with the use of cloud computing in the healthcare *** the efficiency and scalability that the cloud provides, the security of private patient data is still a majorconcern. Encryption, network security, and adherence to data protection laws are key to ensuring the confidentialityand integrity of healthcare data in the cloud. The computational overhead of encryption technologies could leadto delays in data access and processing rates. To address these challenges, we introduced the Enhanced ParallelMulti-Key Encryption Algorithm (EPM-KEA), aiming to bolster healthcare data security and facilitate the securestorage of critical patient records in the cloud. The data was gathered from two categories Authorization forHospital Admission (AIH) and Authorization for High Complexity *** use Z-score normalization forpreprocessing. The primary goal of implementing encryption techniques is to secure and store massive amountsof data on the cloud. It is feasible that cloud storage alternatives for protecting healthcare data will become morewidely available if security issues can be successfully fixed. As a result of our analysis using specific parametersincluding Execution time (42%), Encryption time (45%), Decryption time (40%), Security level (97%), and Energyconsumption (53%), the system demonstrated favorable performance when compared to the traditional *** suggests that by addressing these security concerns, there is the potential for broader accessibility to cloudstorage solutions for safeguarding healthcare data.

关键词： Cloud computing healthcare data security enhanced parallel multi-key encryption algorithm(EPM-KEA)

来源：评论

学校读者我要写书评

暂无评论

Enhanced Steganalysis for Color Images Using Curvelet Features and Support Vector Machine

引用

computers, Materials & Continua 2024年第1期78卷 1311-1328页

作者： Arslan Akram Imran Khan Javed Rashid Mubbashar Saddique Muhammad Idrees Yazeed Yasin Ghadi Abdulmohsen Algarni Faculty of Computer Science and Information Technology Department of Computer ScienceSuperior UniversityLahore54000Pakistan Machine Learning Code(MLC)Lab Meharban HouseHouse Number 209Zafar ColonyOkara56300Pakistan Information Technology Services University of OkaraOkara56310Pakistan Department of Computer Science&Engineering University of Engineering&Technology LahoreNarowal CampusNarowal51601Pakistan Department of Computer Science and Software Engineering Al Ain UniversityAl Ain11671Abu Dhabi Department of Computer Science King Khalid UniversityAbha61421Saudi Arabia

Algorithms for steganography are methods of hiding data transfers in media *** machine learning architectures have been presented recently to improve stego image identification performance by using spatial information,and these methods have made it feasible to handle a wide range of problems associated with image *** with little information or low payload are used by information embedding methods,but the goal of all contemporary research is to employ high-payload images for *** address the need for both low-and high-payload images,this work provides a machine-learning approach to steganography image classification that uses Curvelet transformation to efficiently extract characteristics from both type of *** Vector Machine(SVM),a commonplace classification technique,has been employed to determine whether the image is a stego or *** Wavelet Obtained Weights(WOW),Spatial Universal Wavelet Relative Distortion(S-UNIWARD),Highly Undetectable Steganography(HUGO),and Minimizing the Power of Optimal Detector(MiPOD)steganography techniques are used in a variety of experimental scenarios to evaluate the performance of the *** WOW at several payloads,the proposed approach proves its classification accuracy of 98.60%.It exhibits its superiority over SOTA methods.

关键词： Curvelets fast fourier transformation support vector machine high pass filters steganography

来源：评论

学校读者我要写书评

暂无评论

A Neural Computing-Based Access Control Protocol for AI-Driven Intelligent Flying Vehicles in Industry 5.0-Assisted Consumer Electronics

引用

IEEE Transactions on Consumer Electronics 2024年第1期70卷 3573-3581页

作者： Mahmood, Khalid Tariq, Tayyaba Sangaiah, Arun Kumar Ghaffar, Zahid Saleem, Muhammad Asad Shamshad, Salman National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan National Yunlin University of Science and Technology Department of Computer Science and Information Engineering Douliu64002 Taiwan National Yunlin University of Science and Technology International Graduate School of AI Douliu64002 Taiwan Lebanese American University Department of Electrical and Computer Engineering Byblos1102 2801 Lebanon University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China The University of Lahore Department of Software Engineering Lahore54590 Pakistan

The continuous revolution in Artificial Intelligence (AI) has played a significant role in the development of key consumer applications, including Industry 5.0, autonomous decision-making, fault diagnosis, etc. In practice, autonomous and intelligent robots and flying vehicles (i.e., drones) are also becoming the integral part of Industry 5.0. These vehicles are attaining significant importance nowadays because of their applications in consumer electronics. However, there may be numerous privacy issues in such an infrastructure. Nevertheless, neural computing-driven security solutions have played a significant role in overcoming the security and privacy issues of AI-driven intelligent flying vehicles. Motivated by these facts, this article presents a neural computing-based access control protocol for AI-driven flying vehicles to prevent all possible security threats. A detailed security evaluation of the devised protocol is done formally using the extensively recognized Real-Or-Random (ROR) oracle model. Similarly, the informal security analysis ensures the resistance of our scheme against various potential attacks under the assumptions of CK and DY adversarial models. Moreover, detailed performance scrutiny of the devised protocol with various existing schemes shows the robustness and supremacy of our scheme in terms of computation, communication overhead, and security attributes. © 1975-2011 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Deploying Hybrid Ensemble Machine Learning Techniques for Effective Cross-Site Scripting(XSS)Attack Detection

引用

computers, Materials & Continua 2024年第10期81卷 707-748页

作者： Noor Ullah Bacha Songfeng Lu Attiq Ur Rehman Muhammad Idrees Yazeed Yasin Ghadi Tahani Jaser Alahmadi School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430073China Department of Computer Science and Engineering University of Engineering and TechnologyLahore54000Pakistan Department of Computer Science and Software Engineering Al Ain UniversityAl Ain12555Abu Dhabi Department of Information Systems College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityRiyadh84428Saudi Arabia

Cross-Site Scripting(XSS)remains a significant threat to web application security,exploiting vulnerabilities to hijack user sessions and steal sensitive *** detection methods often fail to keep pace with the evolving sophistication of cyber *** paper introduces a novel hybrid ensemble learning framework that leverages a combination of advanced machine learning algorithms—Logistic Regression(LR),Support Vector Machines(SVM),eXtreme Gradient Boosting(XGBoost),Categorical Boosting(CatBoost),and Deep Neural Networks(DNN).Utilizing the XSS-Attacks-2021 dataset,which comprises 460 instances across various real-world trafficrelated scenarios,this framework significantly enhances XSS attack *** approach,which includes rigorous feature engineering and model tuning,not only optimizes accuracy but also effectively minimizes false positives(FP)(0.13%)and false negatives(FN)(0.19%).This comprehensive methodology has been rigorously validated,achieving an unprecedented accuracy of 99.87%.The proposed system is scalable and efficient,capable of adapting to the increasing number of web applications and user demands without a decline in *** demonstrates exceptional real-time capabilities,with the ability to detect XSS attacks dynamically,maintaining high accuracy and low latency even under significant ***,despite the computational complexity introduced by the hybrid ensemble approach,strategic use of parallel processing and algorithm tuning ensures that the system remains scalable and performs robustly in real-time *** for easy integration with existing web security systems,our framework supports adaptable Application Programming Interfaces(APIs)and a modular design,facilitating seamless augmentation of current *** innovation represents a significant advancement in cybersecurity,offering a scalable and effective solution for securing modern web applications against evolving threats.

关键词： Cross-site scripting machine learning XSS detection stacking ensemble learning hybrid learning

来源：评论

学校读者我要写书评

暂无评论

A fast and highly scalable frequent pattern mining algorithm

引用

Future Generation computer Systems 2024年 160卷 854-868页

作者： Cheng, Wan-Shu Lin, Yi-Ting Huang, Peng-Yu Chen, Ju-Chin Lin, Kawuu W. Department of Computer Science and Information Management Providence University Taichung Taiwan Department of Computer Science and Information Engineering National Kaohsiung University of Science and Technology Kaohsiung Taiwan

As the use of big data and its potential benefits become more widespread, public and private organizations around the world have realized the imperative of incorporating comprehensive and robust technologies into their business processes. In particular, companies are implementing more and more intelligent systems into their business processes, resulting in an exponential increase in the amount of data being collected and used in everyday life on a quarterly basis. Therefore, an algorithm that can efficiently explore the frequent patterns from big data will be able to productively analyze and utilize the generated data to better optimize resources and even develop new business models. Thus, in this urban data era, it is not only essential to make more efficient and accurate decisions to improve business profitability and customer satisfaction, but also a highly challenging core issue. In this study, a new approach, scalable FP mining, is proposed for the first time to achieve a certain level of performance and more efficient memory utilization despite large amounts of data. Experiment results for different data characteristics show that the best performance of the proposed method requires only 48.9% of the DP algorithm's execution time. In further experiments with increased exploration difficulty, the optimal execution time is only 37%. On specific associated databases, the proposed method maintains stable and excellent performance with 12.7% for different data characteristics. The experimental results with increasing exploration difficulty at each stage demonstrate the stability, robustness, and reliability of the proposed SFP, especially under high data complexity and exploration difficulty. © 2024

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE Internet of Things Journal 2025年第12期12卷 22443-22462页

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO-LSTM method effectively mitigates hot spot problems and offers superior performance compared to traditional strategies. © 2014 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The use of knapsack 0/1 in prioritizing software requirements and Markov chain to predict software success

引用

International Journal of Information technology (Singapore) 2024年第3期16卷 1967-1979页

作者： Armah, Isaac Aduhene Hayfron-Acquah, James Ben Takyi, Kate Gyening, Rose-Mary Owusuaa Mensah Eshun, Michael Department of Computer Science Kwame Nkrumah University of Science and Technology Kumasi Ghana

Requirements prioritization is one of the most valuable aspects of software engineering. This is primarily due to the fact that resources, be it time, skillset, or budget, are limited. Existing complex methodologies, such as analytical heuristic process (AHP) and planning game, face low adoption in the industry, promoting the need for more accessible techniques. This research introduces a novel contribution to software engineering by offering a simple and scalable approach to requirement prioritization (RP) and software acceptance prediction. The proposed approach consists of two key methods, knapsack 0/1 and Markov, to optimize RP and predict software acceptance respectively. By considering constraints, organizations can make enlightened decisions on handling requirements and optimize their minimum viable product. The results showcase significant time efficiency, with an average worst-case time of 5.645s for 10,000 requirements and an upper bound of 0.023s for the Markov prediction. This study aims to provide practitioners with a practical solution for prioritizing requirements and predicting software outcomes from user acceptance tests. By simplifying the process and offering compelling time complexity, this approach contributes to the enhancement of software development practices. © 2023, The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of computer Applications and Management.

关键词： Knapsack 0/1 Markov processes Requirements prioritization Software development Testing

来源：评论

学校读者我要写书评

暂无评论

Score Calculation with Local and Global Features for Visual Place Recognition

Score Calculation with Local and Global Features for Visual ...

引用

2024 IEEE Region 10 Conference, TENCON 2024

作者： Ikeda, Iori Adachi, Miho Miyamoto, Ryusuke Graduate School of Science and Technology Department of Computer Science Japan School of Science and Technology Meiji University Department of Computer Science Kawasaki Japan

ISBN: (纸本)9798350350821

Visual place recognition (VPR) seems effective for the localization process in visual navigation of a robot because a robot can recognize locations and poses using only visual information if the accuracy of VPR is sufficient. However, to apply VPR for actual scenarios where multiple locations to be distinguished are in a captured image, the classification accuracy should be improved. To solve this problem, we propose a novel method for likelihood computation in location matching composed of two kinds of components corresponding to local and global features. Experimental results using a novel dataset composed of actual images taken around the course of the Tsukuba Challenge showed that the proposed method improved accuracy by 1-6 % compared to conventional reranking methods using only local features. © 2024 IEEE.

关键词： Machine vision

来源：评论

学校读者我要写书评

暂无评论

Lifetime Maximization Using Grey Wolf Optimization Routing Protocol with Statistical Technique in WSNs

Informatica (Slovenia)

引用

Informatica (Slovenia) 2023年第5期47卷 75-82页

作者： Khudor, Baida'a Abdul Qader Hussein, Dheyaa Mezaal Kheerallah, Yousif Abdulwahab Alkenani, Jawad Alshawi, Imad S. Department of Computer Science College of Computer Science and Information Technology University of Basrah Basrah Iraq University of Technology Office of the President of the University Basra Iraq Department of Computer Science Shatt Al-Arab University College Basra Iraq

The main challenge in Wireless Sensor Networks (WSNs) is to maximize the lifespan of sensor nodes powered by low-cost batteries with limited power. Energy conservation is crucial, and routing mechanisms play a vital role in preserving energy. Energy-efficient routing methods can save battery power and extend the network's lifespan. This study introduces the Grey Wolf Optimization Routing Protocol (GWORP), enhanced with a novel routing mechanism that detects the statistically optimal path. It enables the discovery and reuse of an ideal route from the source to the destination, ensuring balanced energy consumption across WSN nodes and reducing path discovery time. GWORP outperforms the PSORP (Particle Swarm Optimization Routing Protocol) algorithm, significantly reducing energy usage and minimizing end-to-end latency. The findings suggest that GWORP could potentially increase the network lifespan by approximately 73% compared to PSORP. © 2023 Slovene Society Informatika. All rights reserved.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Improving Robustness of Time-Aware Shaper in Time-Sensitive Networking

引用

IEEE Internet of Things Journal 2025年第13期12卷 25211-25223页

作者： Ma, Yanying Zhang, Tong Feng, XiaoQin Liu, Ping Yang, Hao Ren, Fengyuan Lanzhou University School of Information Science and Engineering Lanzhou730000 China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology Nanjing211106 China School of Information Science and Engineering Lanzhou China Tsinghua University Department of Computer Science and Technology Lanzhou Beijing730000 and 100084 China

Deterministic delivery of scheduled traffic (ST) is critical in time-sensitive networking (TSN). The time-aware shaper (TAS) defined by IEEE 802.1Qbv is the enabler to ensure deterministic end-to-end delays of ST flows. However, TAS does not consider the emergency sporadic flows that commonly exist in automotive and industrial control applications. Therefore, TAS cannot resist the interference of emergency sporadic traffic on normal scheduled traffic. In this paper, we improve the TAS’s time slot allocation and queue occupancy rule and propose a combined scheduling strategy composed of dynamic local regulation and static global planning. Dynamic local regulation executes the earliest deadline first (EDF) discipline at switching nodes to adjust ST frames’ transmission dynamically. Static global planning calculates the offset of ST flows at the source and guarantees bounded delay and jitter. Furthermore, we formalize the offset optimizing problem with considering the EDF, delay, and jitter constraints. Finally, we implement our prototype on OMNet++ 6.0.1. Simulation results further demonstrate that the combined strategy has bounded latency and jitter in the presence of emergency sporadic flows. Besides, the comparison experiments show that our design is superior to eTAS in terms of the jitter and end-to-end delay. © 2014 IEEE.

关键词： Timing jitter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：