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

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 365-377页

作者： Hu, Yuhao Xu, Xiaolong Qi, Lianyong Zhou, Xiaokang Xia, Xiaoyu Nanjing University of Information Science and Technology School of Software Nanjing210044 China College of computer science and technology Qingdao266850 China Shiga University Faculty of Data Science Hikone522-8522 Japan RMIT University School of Computing Technologies MelbourneVIC3000 Australia

Reliable artificial intelligence (AI) systems not only propose a challenge on providing intelligent services with high quality for customers but also require customers' privacy to be protected as much as possible during process of the services. Given the ultrahigh computing load brought by deep-learning-based intelligent services to edge devices and the ultralong distance between edge and cloud, low-latency requirement of intelligent services is hard to meet in single edge computing or cloud computing. Edge-cloud collaborative inference of deep neural networks (DNNs) is considered a feasible solution to the problem. However, former work has not reduced the inference latency to the greatest extent and has not considered privacy protection in distributed systems. To solve the problem, we first establish a novel queue mechanism. Then, the convolution layer split decisions are made based on deep reinforcement learning (DRL) to realize the parallel inference of convolutional neural networks (CNNs) for inference latency reduction. Next, for each CNN, the partition decision is made based on brute force algorithm to further reduce inference latency and protect customers' privacy. Finally, simulation results show that our method performs better than the existing other methods. © 2020 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Domain Reductions After Preprocessing: Effects on Dynamic Variable Ordering Heuristics in Constraint Satisfaction Search 23rd

Domain Reductions After Preprocessing: Effects on Dynamic V...

引用

23rd EPIA Conference on Artificial Intelligence, EPIA 2024

作者： Wallace, Richard J. Insight Centre for Data Analytics and Department of Computer Science University College Cork Cork Ireland

ISBN: (纸本)9783031734991

We still do not have an adequate understanding of heuristic methods used for solving constraint satisfaction problems (CSPs). An example involves the effects of preprocessing, an essential means of improving CSP search. The traditional explanation for its beneficial effect is that the resulting "problem reduction" leaves fewer possibilities to explore. Recently, however, it was shown that when dynamic variable ordering heuristics are used, other factors related to domain size reduction are much more important. This paper extends this analysis and explores some implications of this new perspective. The key idea is that pattern of domain reductions produced by preprocessing transmits information that guides heuristic decisions. Treating domain reduction as a code and the set of reductions as a message of length n transmitted to the search algorithm, we distinguish two factors, message discriminability and code quality, and show that greater problem reduction enhances both. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Online forecasting using neighbor-based incremental learning for electricity markets

引用

Neural Computing and Applications 2025年 1-18页

作者： Melgar-García, L. Gutiérrez-Avilés, D. Rubio-Escudero, C. Troncoso, A. Department of Artificial Intelligence Universidad Politécnica de Madrid Madrid28660 Spain Department of Computer Science University of Seville Avda. Reina Mercedes s/n Seville41012 Spain Data Science and Big Data Lab Pablo de Olavide University Seville41013 Spain

Electricity market forecasting is very useful for the different actors involved in the energy sector to plan both the supply chain and market operation. Nowadays, energy demand data are data coming from smart meters and have to be processed in real-time for more efficient demand management. In addition, electricity prices data can present changes over time such as new patterns and new trends. Therefore, real-time forecasting algorithms for both demand and prices have to adapt and adjust to online data in order to provide timely and accurate responses. This work presents a new algorithm for electricity demand and prices forecasting in real-time. The proposed algorithm generates a prediction model based on the k-nearest neighbors algorithm, which is incrementally updated in an online scenario considering both changes to existing patterns and adding new detected patterns to the model. Both time-frequency and error threshold based model updates have been evaluated. Results using energy demand from 2007 to 2016 and prices data for different time periods from the Spanish electricity market are reported and compared with other benchmark algorithms. © The Author(s) 2025.

关键词： Demand response

来源：评论

学校读者我要写书评

暂无评论

Ensemble of deep learning models with Walrus Optimization Algorithm for accurate botnet recognition and classification

引用

Iran Journal of computer science 2025年 1-18页

作者： Chacko, Ashwathy Anda Edwin, E. Bijolin Thanka, M. Roshni Ebenezer, V. Division of Computer Science and Engineering Karunya Institute of Technology and Sciences Coimbatore India Division of Data Science and Cyber Security Karunya Institute of Technology and Sciences Coimbatore India

The rapid growth of Internet of Things (IoT) networks has introduced significant security challenges, with botnet attacks being one of the most prevalent threats. These attacks exploit vulnerabilities in IoT devices, leading to severe disruptions and damage to critical infrastructures. Detecting botnet attacks in IoT environments is challenging due to the large volume of data, the dynamic nature of traffic, and the diverse attack patterns. To address these issues, we propose a novel approach called Walrus Optimized Ensemble Deep Learning for Anomaly-Based Recognition Classifier (WOAEDL-ABRC), which leverages a combination of advanced machine learning techniques for effective botnet detection. The methodology of this research involves four key components: (1) data preprocessing through min–max normalization to scale the features appropriately, (2) feature selection using the social cooperation search algorithm (SCSA) to identify the most informative attributes, (3) an ensemble deep learning model combining convolutional autoencoder (CAE), bidirectional gated recurrent unit (BiGRU), and deep belief network (DBN) for robust anomaly detection, and (4) hyperparameter optimization using the Walrus Optimization Algorithm (WAOA), which fine-tunes the model parameters for optimal performance. This ensemble approach ensures that the model benefits from the strengths of each individual technique while mitigating the weaknesses of others. The dataset used for this research includes network traffic data from IoT environments, consisting of various botnet attack scenarios and normal traffic patterns. The data undergoes extensive preprocessing and feature selection to reduce dimensionality and enhance the model’s performance. The implementation is carried out in Python using TensorFlow for deep learning, with the WAOA applied to optimize hyperparameters. The results demonstrate the effectiveness of the WOAEDL-ABRC in detecting botnet attacks, achieving superior accuracy, precision

关键词： Botnet recognition Deep learning Feature selection Internet of things Walrus Optimization Algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving Multiobjective Combinatorial Optimization via Learning to Improve Method

引用

IEEE Transactions on Emerging Topics in Computational Intelligence 2025年第3期9卷 2122-2136页

作者： Ye, Te Zhang, Zizhen Zhang, Qingfu Chen, Jinbiao Wang, Jiahai Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510275 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong

Recently, neural combinatorial optimization (NCO) methods have been prevailing for solving multiobjective combinatorial optimization problems (MOCOPs). Most NCO methods are based on the "Learning to Construct"(L2C) paradigm, where the trained model(s) can directly generate a set of approximate Pareto optimal solutions. However, these methods still suffer from insufficient proximity and poor diversity towards the true Pareto front. In this paper, following the "Learning to Improve"(L2I) paradigm, we propose weight-related policy network (WRPN), a learning-based improvement method for solving MOCOPs. WRPN is incorporated into multiobjective evolutionary algorithm (MOEA) frameworks to effectively guide the search direction. A shared baseline for proximal policy optimization is presented to reduce variance in model training. A quality enhancement mechanism is designed to further refine the Pareto set during model inference. Computational experiments conducted on two classic MOCOPs, i.e., multiobjective traveling salesman problem and multiobjective vehicle routing problem, indicate that our method achieves remarkable results. Notably, our WRPN module can be easily integrated into various MOEA frameworks such as NSGA-II, MOEA/D and MOGLS, providing versatility and applicability across different problem domains. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Evaluation of convolutional neural network models’ performance for estimating mango crop yield

International Journal of Systematic Innovation

引用

International Journal of Systematic Innovation 2025年第1期9卷 1-18页

作者： Neethi, M.V. Raviraj, P. Department of Computer Science and Engineering-Data Science ATME College of Engineering Affiliated to Visvesvaraya Technological University (VTU) Belagavi India Department of Computer Science and Engineering GSSS Institute of Engineering and Technology for Women Affiliated to Visvesvaraya Technological University (VTU) Belagavi India

In agriculture, crop yield estimation is essential;producers, industrialists, and consumers all benefit from knowing the early yield. Manual mango counting typically involves the utilization of human labor. Experts visually examine each sample to complete the process, which is time-consuming, difficult, and lacks precision. For commercial mango production to produce high-quality fruits from the orchard to the consumer, a quick, non-destructive, and accurate variety classification is required. Because of its effectiveness in computer vision, a convolutional neural network—one of the deep learning techniques—was chosen for this investigation. For yield prediction, a total of eight popular mango cultivars were utilized. A comparison with previously trained models was used to assess the proposed model. The performance of the classifiers was evaluated using evaluation metrics such as accuracy, loss, area under the receiver operating characteristic curve score, precision, recall, F1-score, sensitivity, specificity, positive predictive value, negative predictive value, and Cohen’s Kappa performance measure. In terms of performance evaluation criteria, it was found that the proposed approach outperformed the pre-trained models. The suggested model achieved 98.85% accuracy in the test set, which had 800 images. This outcome demonstrates the tangible applicability of the proposed methodology for mango crop estimation. © (2025), (Society of Sytematic Innovation). All rights reserved.

关键词： Convolutional Neural Networks Deep Learning Early Detection Machine Learning

来源：评论

学校读者我要写书评

暂无评论

Cloud Computing Network in Remote Sensing-Based Climate Detection Using Machine Learning Algorithms

引用

Remote Sensing in Earth Systems sciences 2025年第2期8卷 400-408页

作者： Srinivas, Jhade Raju, Ch VV Narasimha Sasikala, C. Bhaskar, Parumanchala Panyala, Amarendra Reddy Priya, Divya Department of Computer Science and Engineering - Data Science K G Reddy College of Engineering and Technology Moinabad Telangana Hyderabad India Information Technology Marri Laxman Reddy Institute of Technology and Management Dundigal Telangana Hyderabad 500043 India Dept of CSE Srinivasa Ramanujan Institute of Technology (Autonomous) Andhra Pradesh Ananthapuramu India Department of Computer Science and Engineering Santhiram Engineering College Nandyal India Department of Computer Science and Engineering (Data Science) Malla Reddy University Telangana Hyderabad India Department of Computer Science and Engineering MLR Institute of Technology Hyderabad India

Effective monitoring of the environment over a large area will require mobilization of a considerable amount of information. Otherwise, the use of traditional methods will prove to be costly and would take up so much time. Also, assessing the land cover changes between two times is one of the other methods which can be adopted to measure the environmental sustainability. Using ML techniques for predictive modeling in remote sensing has emerged as a useful approach in solving some of the environmental and climatic challenges. This research proposes a novel method in remote sensing image-based climate detection utilizing cloud computing and machine learning algorithms. Here, the cloud computing module is used in the collection of remote sensing images for the detection of climate changes. Then, the collected image is processed for noise removal as well as normalization. The processed image is segmented, and features are extracted utilizing a fuzzy K-clustering-based contour Gaussian model with graph cut Boltzmann CNN. Experimental analysis is carried out for various remote sensing-based climate change datasets in terms of training accuracy, random precision, AUC, recall, and F-measure. The proposed technique obtained 97% of training accuracy, 95% of random precision, 96% of recall, 93% of AUC, and 94% of F-measure. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2025.

关键词： Climate detection Cloud computing Contour Gaussian model Machine learning algorithms Remote sensing images

来源：评论

学校读者我要写书评

暂无评论

An electron-transfer-tuning strategy at the graphene/metal interface for improving acidic water electrolysis in proton exchange membrane electrolyzers

引用

Journal of Energy Chemistry 2025年第4期103卷 344-352页

作者： Yue Xu Shuaidong Li Yingjian He Fumiya Shiokawa Samuel Jeong Aimi Asilah Haji Tajuddin Zeyu Xi Yoshikazu Ito Jingzi Zhang Zeyun Cai Xi Lin Kailong Hu School of Materials Science and Engineering and Institute of Materials Genome & Big Data Harbin Institute of Technology Institute of Applied Physics Graduate School of Pure and Applied Sciences University of Tsukuba Institute of Special Environments Physical Sciences Harbin Institute of Technology School of Computer Science and Technology Harbin Institute of Technology

Graphene encapsulation has been shown to be an effective technique for improving the corrosion resistance of non-noble metal catalysts for the acidic water *** key challenge lies in enhancing the electrocatalytic activity of graphene-encapsulated metals while maintaining their durability in acidic ***,an electron-transfer-tuning strategy is investigated at the graphene/NiMo interface,aiming to improve the hydrogen evolution reaction（HER） performance of graphene-encapsulated NiMo *** doping of Ti,a low electronegativity element,into NiMo substrate was confirmed to increase electron transfer from the metal core toward the *** electron-rich state on graphene facilitates the adsorption of positively charged protons on graphene,thereby enabling a Pt/C-comparable performance in 0.5 M H2SO4,with only a 3.8% degradation in performance over a 120-h continuous *** proton exchange membrane（PEM） water electrolyzer assembled by the N-doped grapheneencapsulated Ti-doped NiMo exhibits a smaller cell voltage to achieve a current density of 2.0 A cm-2,in comparison to the Pt/C based *** study proposes a novel electron-transfer-tuning strategy to improve the HER activity of graphene-encapsulated non-noble metal catalysts without sacrificing durability in acidic electrolytes.

关键词： Acidic media Graphene encapsulation Hydrogen evolution Interface Proton exchange membrane

来源：评论

学校读者我要写书评

暂无评论

Optimizing Coverage in Wireless Sensor Networks Using the Tumbleweed Algorithm

Journal of Network Intelligence

引用

Journal of Network Intelligence 2025年第1期10卷 250-261页

作者： Zhang, Mengfei Chu, Shu-Chuan Liu, Nengxian Huang, Kuan-Chun Pan, Jeng-Shyang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China College of Computer and Data Science Fuzhou University Fuzhou350108 China Department of Industrial and Systems Engineering Chung Yuan Christian University Taoyuan320314 Taiwan School of Artificial Intelligence Nanjing University of Information Science and Technology Nanjing210044 China Department of Information Management Chaoyang University of Technology Taichung41349 Taiwan

Wireless sensor networks (WSNs) have found extensive applications across various fields, significantly enhancing the convenience in our daily lives. Hence, an in-creasing number of researchers are directing their attention toward the performance of sensor nodes, with a particular emphasis on addressing the coverage challenges in WSNs. Node coverage plays a crucial role in determining the detection performance of WSNs, making it imperative to attain maximum coverage with a given number of sensor nodes. This paper applies the Tumbleweed Algorithm (TA) to the coverage problem in WSNs and validates its effectiveness through simulation experiments. The results demonstrate its unique advantages in global search and avoiding local optima, providing a new solution for the WSN coverage problem and offering valuable references for future research and practical applications. The TA algorithm simulates the lifecycle of tumbleweed from seedling to mature plant and includes the concept of growth cycles. This paper compares the TA algorithm with PSO, GWO, DE, BOA, SCA, and AOA, setting different numbers of wireless sensor nodes and varying sensing radii for the experiments. The experimental results show that the TA algorithm significantly improves coverage rates under various configurations and consistently outperforms other commonly used algorithms. © 2025, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Tree-Based Genetic Programming for Evolutionary Analog Circuit with Approximate Shapley Value 44th

Tree-Based Genetic Programming for Evolutionary Analog Circ...

引用

44th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, SGAI 2024

作者： Shi, Xinming Minku, Leandro L. Yao, Xin School of Electronics Electrical Engineering and Computer Science Queen’s University Belfast Belfast United Kingdom School of Computer Science University of Birmingham Birmingham United Kingdom School of Data Science Lingnan University China

ISBN: (纸本)9783031779145

The automated design of analog circuits presents a significant challenge due to the complexity of circuit topology and parameter selection. Traditional evolutionary algorithms, such as Genetic Programming (GP), have shown potential in this domain but are often hindered by inefficient search processes and the large design space. Furthermore, fitness evaluation in the evolutionary design of circuits is often computationally very expensive. In this paper, we introduce a novel evolutionary framework that leverages approximate Shapley values to guide the optimization process in tree-based genetic programming for analog circuit design. Our approach addresses the computational challenges associated with computing Shapley values by introducing a two-stage evolutionary framework that includes a Shapley Value Library (SVlib) and a KNN-based prediction for efficient estimation of Shapley values. Our proposed work not only enhances the search efficiency by focusing on the most beneficial sub-circuits but also leads to more compact and efficient circuit designs. Furthermore, fitness evaluation in the evolutionary design of circuits is often computationally very expensive experiments, we verify that our framework accelerates evolutionary convergence and outperforms traditional methods in terms of circuit optimization. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：