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

Research Progress in Solar Flare Prediction Methods

Research in Astronomy and Astrophysics 2025年第3期25卷 280-309页

作者： Ke Han Zhen Liu Xian-Yi Zhao Yi-Fei Li De-Quan Zheng Jie Wan School of Computer and Information Engineering Harbin University of Commerce Faculty of Computing Harbin Institute of Technology School of Energy Science and Engineering Harbin Institute of Technology

Solar flares are one of the strongest outbursts of solar activity,posing a serious threat to Earth’s critical infrastructure,such as communications,navigation,power,and ***,it is essential to accurately predict solar flares in order to ensure the safety of human ***,the research focuses on two directions:first,identifying predictors with more physical information and higher prediction accuracy,and second,building flare prediction models that can effectively handle complex observational *** terms of flare observability and predictability,this paper analyses multiple dimensions of solar flare observability and evaluates the potential of observational parameters in *** flare prediction models,the paper focuses on data-driven models and physical models,with an emphasis on the advantages of deep learning techniques in dealing with complex and high-dimensional *** reviewing existing traditional machine learning,deep learning,and fusion methods,the key roles of these techniques in improving prediction accuracy and efficiency are *** prevailing challenges,this study discusses the main challenges currently faced in solar flare prediction,such as the complexity of flare samples,the multimodality of observational data,and the interpretability of *** conclusion summarizes these findings and proposes future research directions and potential technology advancement.

关键词： (Sun:) sunspots magnetohydrodynamics (MHD) Sun: activity Sun: flares Sun: magnetic fields

来源：评论

学校读者我要写书评

暂无评论

Hybrid IT? Algorithm for Large-Scale Colored Traveling Salesman Problem

引用

Chinese Journal of Electronics 2024年第6期33卷 1337-1345页

作者： Xueshi DONG College of Computer Science and Technology Qingdao University Beijing Key Laboratory of Urban Spatial Information Engineering School of Computer Science Wuhan University

In the fields of intelligent transportation and multi-task cooperation, many practical problems can be modeled by colored traveling salesman problem(CTSP). When solving large-scale CTSP with a scale of more than 1000dimensions, their convergence speed and the quality of their solutions are limited. This paper proposes a new hybrid IT?(HIT?) algorithm, which integrates two new strategies, crossover operator and mutation strategy, into the standard IT?. In the iteration process of HIT?, the feasible solution of CTSP is represented by the double chromosome coding, and the random drift and wave operators are used to explore and develop new unknown regions. In this process, the drift operator is executed by the improved crossover operator, and the wave operator is performed by the optimized mutation strategy. Experiments show that HIT? is superior to the known comparison algorithms in terms of the quality solution.

关键词： Transportation Traveling salesman problems Multitasking Encoding Standards Biological cells Convergence

来源：评论

学校读者我要写书评

暂无评论

Nonparametric Statistical Feature Scaling Based Quadratic Regressive Convolution Deep Neural Network for Software Fault Prediction

引用

computers, Materials & Continua 2024年第3期78卷 3469-3487页

作者： Sureka Sivavelu Venkatesh Palanisamy School of Computer Science Engineering and Information Systems Vellore Institute of TechnologyVellore632014India

The development of defect prediction plays a significant role in improving software quality. Such predictions are used to identify defective modules before the testing and to minimize the time and cost. The software with defects negatively impacts operational costs and finally affects customer satisfaction. Numerous approaches exist to predict software defects. However, the timely and accurate software bugs are the major challenging issues. To improve the timely and accurate software defect prediction, a novel technique called Nonparametric Statistical feature scaled QuAdratic regressive convolution Deep nEural Network (SQADEN) is introduced. The proposed SQADEN technique mainly includes two major processes namely metric or feature selection and classification. First, the SQADEN uses the nonparametric statistical Torgerson–Gower scaling technique for identifying the relevant software metrics by measuring the similarity using the dice coefficient. The feature selection process is used to minimize the time complexity of software fault prediction. With the selected metrics, software fault perdition with the help of the Quadratic Censored regressive convolution deep neural network-based classification. The deep learning classifier analyzes the training and testing samples using the contingency correlation coefficient. The softstep activation function is used to provide the final fault prediction results. To minimize the error, the Nelder–Mead method is applied to solve non-linear least-squares problems. Finally, accurate classification results with a minimum error are obtained at the output layer. Experimental evaluation is carried out with different quantitative metrics such as accuracy, precision, recall, F-measure, and time complexity. The analyzed results demonstrate the superior performance of our proposed SQADEN technique with maximum accuracy, sensitivity and specificity by 3%, 3%, 2% and 3% and minimum time and space by 13% and 15% when compared with the two sta

关键词： Software defect prediction feature selection nonparametric statistical Torgerson-Gower scaling technique quadratic censored regressive convolution deep neural network softstep activation function nelder-mead method

来源：评论

学校读者我要写书评

暂无评论

TRE-DSP: A traceable and revocable CP-ABE based data sharing scheme for IoV with partially hidden policy

引用

Digital Communications and Networks 2025年第2期11卷 455-464页

作者： Yousheng Zhou Rundong Peng Yuanni Liu Pandi Vijayakumar Brij Gupta College of Computer Science and Technology Chongqing University of Posts and Telecommunications College of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Department of Computer Science and Engineering University College of Engineering Department of Computer Engineering National Institute of Technology Kurukshetra

With the popularity of the Internet of Vehicles(IoV), a large amount of data is being generated every day. How to securely share data between the IoV operator and various value-added service providers becomes one of the critical issues. Due to its flexible and efficient fine-grained access control feature, Ciphertext-Policy Attribute-Based Encryption(CP-ABE) is suitable for data sharing in IoV. However, there are many flaws in most existing CP-ABE schemes, such as attribute privacy leakage and key misuse. This paper proposes a Traceable and Revocable CP-ABE-based Data Sharing with Partially hidden policy for IoV(TRE-DSP). A partially hidden access structure is adopted to hide sensitive user attribute values, and attribute categories are sent along with the ciphertext to effectively avoid privacy exposure. In addition, key tracking and malicious user revocation are introduced with broadcast encryption to prevent key misuse. Since the main computation task is outsourced to the cloud, the burden of the user side is relatively low. Analysis of security and performance demonstrates that TRE-DSP is more secure and practical for data sharing in IoV.

关键词： Privacy-preserving Attribute-based encryption Partially hidden policy Traceability User revocation Internet of vehicles

来源：评论

学校读者我要写书评

暂无评论

An efficient secure channel establishment through lightweight key distribution in e-health communication systems

引用

Multimedia Tools and Applications 2025年第11期84卷 9111-9131页

作者： Ebrahimi, Iman Nikooghadam, Morteza Department of Computer Engineering and Information Technology Imam Reza International University Mashhad Iran

E-healthcare has significantly improved healthcare services and overall health by utilizing digital technologies such as the internet, computers, and mobile devices. However, secure communication channels play a critical role in ensuring the safety and confidentiality of patients' information. Consequently, several user authentication and key agreement protocols have been developed to address this issue. Although numerous proposed protocols are robust against security attacks, researchers have reported vulnerabilities. In this study, we evaluate one such protocol and identify vulnerabilities to insider attacks, server impersonation attacks, and replay attacks. To address these vulnerabilities, we propose a two-factor mutual authentication and key agreement scheme that offers a secure, efficient, and effective solution with low computation cost, enhanced security, and superior performance against diverse security attacks. Our proposed technique guarantees the integrity, confidentiality, and availability of patient information while ensuring the authenticity of users during communication. We conducted thorough comparisons focusing on the practical implementation of ARM microcontrollers to assess computation efficiency. The total estimated execution time of our proposed scheme for registration and authentication phases is approximately 975.8 µs, which is the shortest among all related works. This finding illustrates that our proposed scheme is well-suited for applications in e-health, telemedicine, and healthcare systems. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

2P3FL:A Novel Approach for Privacy Preserving in Financial Sectors Using Flower Federated Learning

引用

computer Modeling in engineering & Sciences 2024年第8期140卷 2035-2051页

作者： Sandeep Dasari Rajesh Kaluri School of Computer Science Engineering and Information Systems Vellore Institute of TechnologyVellore632014India

The increasing data pool in finance sectors forces machine learning(ML)to step into new *** data has significant financial implications and is *** users data from several organizations for various banking services may result in various intrusions and privacy *** a result,this study employs federated learning(FL)using a flower paradigm to preserve each organization’s privacy while collaborating to build a robust shared global ***,diverse data distributions in the collaborative training process might result in inadequate model learning and a lack of *** address this issue,the present paper proposes the imple-mentation of Federated Averaging(FedAvg)and Federated Proximal(FedProx)methods in the flower framework,which take advantage of the data locality while training and guaranteeing global *** improves the privacy of the local *** analysis used the credit card and Canadian Institute for Cybersecurity Intrusion Detection Evaluation(CICIDS)***,recall,and accuracy as performance indicators to show the efficacy of the proposed strategy using FedAvg and *** experimental findings suggest that the proposed approach helps to safely use banking data from diverse sources to enhance customer banking services by obtaining accuracy of 99.55%and 83.72%for FedAvg and 99.57%,and 84.63%for FedProx.

关键词： Federated learning FedAvg FedProx flower framework privacy preservation financial sectors

来源：评论

学校读者我要写书评

暂无评论

CRAQL: a novel clustering-based resource allocation using the Q-learning in fog environment

引用

International Journal of Cloud Computing 2024年第3期13卷 243-266页

作者： Ahlawat, Chanchal Krishnamurthi, Rajalakshmi Department of Computer Science and Engineering Jaypee Institute of Information Technology Noida India

Fog computing is an emerging paradigm that provides services near the end-user. The tremendous increase in IoT devices and big data leads to complexity in fog resource allocation. Inefficient resource allocation can lead to resource starvation and unable to complete the task assignment within a specific time. Hence, to enhance the efficiency of the fog resources, it is critical to perform proper resource allocation. This work targets to provide the solution to the resource allocation problem with a novel clustering-based resource allocation using the Q-learning (CRAQL) model. For this purpose, the problem is defined as a decision-making problem and formulated as Markov decision process (MDP). Next, to find the optimal resource, an enhanced optimal resource allocation (EORA) algorithm is proposed and detailed study is performed to analyse the impact of various performance parameters. Simulation results show the comparison of the EORA versus conventional Brute force method by varying the performance parameters such as learning rate and number of trials. The experimental results exhibit optimal solutions with significant improvement in learning rate at an average probability of 0.5 within limited epochs. Copyright © 2024 Inderscience Enterprises Ltd.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional information-driven many-objective software remodularization approach

引用

Frontiers of computer Science 2023年第3期17卷 45-62页

作者： Amarjeet PRAJAPATI Anshu PARASHAR Amit RATHEE Department of Computer Science Engineering&Information Technology Jaypee Istitute of Information TechnologyNoida 201307India Department of Computer Science&Engineering Thapar Institute of Engineering&TechnologyPunjab 147004India Department of Computer Science Government College BarotaHaryana 131301India

Most of the search-based software remodularization(SBSR)approaches designed to address the software remodularization problem(SRP)areutilizing only structural information-based coupling and cohesion quality ***,in practice apart from these quality criteria,there require other aspects of coupling and cohesion quality criteria such as lexical and changed-history in designing the modules of the software ***,consideration of limited aspects of software information in the SBSR may generate a sub-optimal modularization ***,such modularization can be good from the quality metrics perspective but may not be acceptable to the *** produce a remodularization solution acceptable from both quality metrics and developers’perspectives,this paper exploited more dimensions of software information to define the quality criteria as modularization ***,these objectives are simultaneously optimized using a tailored manyobjective artificial bee colony(MaABC)to produce a remodularization *** assess the effectiveness of the proposed approach,we applied it over five software *** obtained remodularization solutions are evaluated with the software quality metrics and developers view of *** demonstrate that the proposed software remodularization is an effective approach for generating good quality modularization solutions.

关键词： software restructuring remodularization multiobjective optimization software coupling and cohesion

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence and Natural Language Processing Inspired Chabot Technologies

引用

Recent Advances in computer Science and Communications 2024年第1期17卷 11-20页

作者： Singh, Deepti Manju Jatain, Aman Netaji Subhash Institute of Technology New Delhi India Department of Computer Science and Engineering & Information Technology Jaypee Institute of Information Technology Noida India Department of Computer Science and Engineering Amity University Haryana India

Chatbots use artificial intelligence (AI) and natural language processing (NLP) algorithms to construct a clever system. By copying human connections in the most helpful way possi-ble, chatbots emulate individuals and serve as virtual assistants. They easily interface and respond to customers' requests. In the modern technical environment, these conversation agents or chatbots are considered the next-generation invention. Chatbot has become more popular in the business field right now as it can reduce customer service cost and handle multiple users at a time. There are many techniques used to involve such intelligent experts in daily business. A comprehensive analysis of the methods is needed to determine the viability of the different strategies. This paper tracks the progress of this invention and further clarifies the influence of chatbots on numerous businesses. Besides, a survey of the multiple chatbot methodologies suggested by various researchers is provid-ed. Along with the survey, a chatbot e-commerce customer service is designed to provide an efficient and accurate answer for any query based on the dataset of frequently asked questions. This chatbot can reduce customer service costs and can handle multiple customers at the same time. © 2024 Bentham Science Publishers.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Knowledge-aware Recommendation with Attention Mechanism and Contrastive Learning

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer Science 2025年第3期52卷 615-624页

作者： Chen, Cuihong Sun, Gang School of Information Engineering Anhui Business And Technology College Hefei China School of Computer and Information Engineering Fuyang Normal University Fuyang China

Knowledge graph (KG) is important in recommendation algorithms. For the past few years, graph neural networks (GNNs) models applied to knowledge-aware recommendation (KGR) have been a current research hotspot. However, GNN-based KGR models have some problems, eg. data sparsity, insufficient supervision indication, unbalanced information utilization, and insufficient knowledge extraction. This paper presents a knowledge-aware recommendation algorithm that integrates an attention mechanism with contrastive learning, thereby make the most of the rich entity information available in the KG. Through contrastive learning, the algorithm aims to derive more discriminative expressions for users and items, and the attention mechanism helps to identify key relationships between them. This dual way improves the accuracy and efficiency of recommendations. Firstly, by contrasting hierarchical structures within the KG, non-local graphs are constructed for users and items, facilitating the extraction of additional KG facts in KGR. Secondly, Intra-graph-level interactive contrastive learning is enforced within both non-local graphs to evaluate the levels of collaborative filtering alongside the KG part, so as to obtain more consistent information utilization. In addition, inter-graph-level interactive contrastive learning is implemented between non-local graphs to fully and effectively extract non-local KG indication. Finally, the attention mechanism is integrated to determine the consequence of node neighbors and adaptively propagate the embeddings from the neighbors of nodes. The proposed knowledge-aware recommendation algorithm (KGAC) in this paper, along with other recommendation algorithms, has been subjected to extensive experimentation across three benchmark data sets. The results of these tests confirm that KGAC outperforms other algorithms in terms of recommendation performance. © (2025), (International Association of Engineers). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：