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

Optimization of Deep Learning Model for Plant Disease Detection Using Particle Swarm Optimizer

computers, Materials & Continua 2022年第5期71卷 4019-4031页

作者： Ahmed Elaraby Walid Hamdy Madallah Alruwaili Department of Computer Science Faculty of Computers and InformationSouth Valley UniversityQenaEgypt Department of Math. &Computer Science Faculty of SciencePort Said UniversityEgypt College of Computer and Information Sciences Jouf UniversitySakakaAljoufKingdom of Saudi Arabia

Plant diseases are a major impendence to food security,and due to a lack of key infrastructure in many regions of the world,quick identification is still *** losses owing to illnesses are a severe problem for both large farming structures and rural communities,motivating our *** of the large range of diseases,identifying and classifying diseases with human eyes is not only time-consuming and labor intensive,but also prone to being mistaken with a high error *** learning-enabled breakthroughs in computer vision have cleared the road for smartphone-assisted plant disease and *** proposed work describes a deep learning approach for detection plant ***,we proposed a deep learning model strategy for detecting plant disease and classification of plant leaf *** our research,we focused on detecting plant diseases in five crops divided into 25 different types of classes(wheat,cotton,grape,corn,and cucumbers).In this task,we used a public image database of healthy and diseased plant leaves acquired under realistic *** our work,a deep convolutional neural model AlexNet and Particle Swarm optimization was trained for this task we found that the metrics(accuracy,specificity,Sensitivity,precision,and Fscore)of the tested deep learning networks achieves an accuracy of 98.83%,specificity of 98.56%,Sensitivity of 98.78%,precision of 98.67%,and F-score of 98.47%,demonstrating the feasibility of this approach.

关键词： Deep neural networks plant diseases detection classification AlexNet PSO

来源：评论

学校读者我要写书评

暂无评论

The Impact of GPU on Containerized computer Vision Applications on Edge Nodes 8

The Impact of GPU on Containerized Computer Vision Applicati...

引用

8th IEEE International Conference on Edge Computing and Communications, EDGE 2024

作者： Alqaisi, Osamah I. Tosun, Ali Saman Korkmaz, Turgay University of Texas at San Antonio Department of Computer Science San AntonioTX78249 United States The University of North Carolina at Pembroke Dep. of Math. and Computer Science NC28372 United States

ISBN: (纸本)9798350368499

Edge computing revolutionizes computer vision, but faces challenges due to computational demands and complexities in deployment and platform integration. In addressing these hurdles, container technology emerges as a crucial solution, particularly in mitigating deployment and security issues. However, the impact of GPU acceleration on containerized computer vision applications remains understudied. This paper explores containerized computer vision applications across ARM edge devices, analyzing performance on different CPUs and GPUs. Insights cover processing time, CPU usage, memory utilization, and application performance, highlighting the importance of ARM processor selection. Integrating CPU and GPU enhances execution time but leads to significant memory usage increases. Workload escalation strains the GPU, resulting in slowed processing, and its performance becomes comparable to that of the CPU. Furthermore, the performance of computer vision applications varies with different containers. These findings underscore the delicate balance between CPU and GPU utilization and the pivotal role of algorithm selection in optimizing containerized computer vision applications on edge devices. © 2024 IEEE.

关键词： ARM processors

来源：评论

学校读者我要写书评

暂无评论

A Robust Cold-Start Approach Using Phylogram 10

A Robust Cold-Start Approach Using Phylogram

引用

10th International Conference on Optimization and Applications, ICOA 2024

作者： Da Silva, Breno Caetano Franco, Jorge Luiz Branco, Hermes Manoel Galvão Castelo Tokuda, Eric Delbem, Alexandre Claudio Botazzo Federal Institute of Maranhão Computer Science Department Teresina Brazil Inst. of Math. and Computer Science University of São Paulo São Carlos Brazil Federal University of Piaui Electrical Engineering Department Teresina Brazil

ISBN: (纸本)9798350387353

In Active Learning (AL) applications, it is crucial to develop a model that efficiently represents data using a limited number of labeled samples. In this context, an oracle is often employed to label samples that are deemed representative and informative. However, one of the primary limitations of AL lies in the need for an initial set of labeled samples, which may not be representative of the entire data space. To address this issue, cold-start strategies are implemented with the goal of selecting an appropriate initial set of samples for labeling, ensuring that the initial model is robust and effective. We propose a novel approach - PhyIL - that harness the advantages of phylogram analysis and community detection techniques to smartly perform the cold-start selection in AL. The method facilitates the choice of samples that best represent the diversity and complexity of the data, which is fundamental for the subsequent success of the active learning process. We evaluated the proposed approach using nine real-world databases and nine traditional ML models. The findings indicate that PhyIL offers an effective and viable solution for the initial sample selection, when compared to the random selection. © 2024 IEEE.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs 37

A Theory of Link Prediction via Relational Weisfeiler-Leman ...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Huang, Xingyue Romero, Miguel Ceylan, Ismail Ilkan Barceló, Pablo Department of Computer Science University of Oxford Oxford United Kingdom Department of Computer Science Universidad Católica de Chile Chile CENIA Chile Chile Inst. for Math. and Comp. Eng. Universidad Católica de Chile Chile IMFD Chile Chile

ISBN: (纸本)9781713899921

Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the context of knowledge graphs. Our goal is to provide a systematic understanding of the landscape of graph neural networks for knowledge graphs pertaining to the prominent task of link prediction. Our analysis entails a unifying perspective on seemingly unrelated models and unlocks a series of other models. The expressive power of various models is characterized via a corresponding relational Weisfeiler-Leman algorithm. This analysis is extended to provide a precise logical characterization of the class of functions captured by a class of graph neural networks. The theoretical findings presented in this paper explain the benefits of some widely employed practical design choices, which are validated empirically. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

On the Parallelizability of Approval-Based Committee Rules

arXiv

引用

arXiv 2025年

作者： Fitzsimmons, Zack Hassan, Zohair Raza Hemaspaandra, Edith Dept. of Math. and Computer Science College of the Holy Cross WorcesterMA01610 United States Department of Computer Science Rochester Institute of Technology RochesterNY14623 United States

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for these rules with polynomial-time algorithms exist. The Method of Equal Shares, an important ABC rule with desirable properties, is also computable in polynomial time. However, when working with very large elections, polynomial time is not enough and parallelization may be necessary. We show that computing a winning committee using these ABC rules (including the Method of Equal Shares) is P-hard, thus showing they cannot be parallelized. In contrast, we show that finding a winning committee can be parallelized when the votes are single-peaked or single-crossing for the important ABC rule Chamberlin-Courant. Copyright © 2025, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

The Impact of GPU on Containerized computer Vision Applications on Edge Nodes

The Impact of GPU on Containerized Computer Vision Applicati...

引用

IEEE International Conference on Edge Computing (EDGE)

作者： Osamah I. Alqaisi Ali Şaman Tosun Turgay Korkmaz Department of Computer Science University of Texas at San Antonio San Antonio TX USA Dep. of Math. and Computer Science The University of North Carolina at Pembroke NC USA

ISBN: (数字)9798350368499

ISBN: (纸本)9798350368505

关键词： Performance evaluation computer vision Graphics processing units Containers Complexity theory Security Faces

来源：评论

学校读者我要写书评

暂无评论

Protocol Design Rules from Hiding Patterns to Avoid Steganographic Channels in Wireless Communication

Protocol Design Rules from Hiding Patterns to Avoid Steganog...

引用

2025 IEEE Wireless Communications and Networking Conference, WCNC 2025

作者： Keller, Jörg Spiekermann, Daniel Walter, Markus Fac. Math. & Computer Science Fernllniversität in Hagen Hagen Germany Univ. of Appl. Science & Arts Dortmund Computer Science Department Dortmund Germany Federal Office for Information Security Bonn Germany

ISBN: (纸本)9798350368369

Covert channels for the transmission of stegano-graphic messages are not only possible in classic internet protocols but also in wireless communications such as 4G and 5G air interface. Hiding patterns collect the central ideas behind these channels. We therefore derive rules for protocol design, conformance to which disables at least the most frequently used covert channel approaches. Starting from 5G, we investigate where 6G standardization might take such rules into account to better protect 6G protocols against covert channels from the beginning © 2025 IEEE.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Protocol Design Rules from Hiding Patterns to Avoid Steganographic Channels in Wireless Communication

Protocol Design Rules from Hiding Patterns to Avoid Steganog...

引用

IEEE Conference on Wireless Communications and Networking

作者： Jörg Keller Daniel Spiekermann Markus Walter Fac. Math. & Computer Science Fernllniversität in Hagen Hagen Germany Computer Science Department Univ. of Appl. Science & Arts Dortmund Dortmund Germany Federal Office for Information Security Bonn Germany

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

关键词： 6G mobile communication Wireless communication Steganography Protocols 5G mobile communication Standardization Bandwidth Communication channels Timing Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Generalized paths and cycles in semicomplete multipartite digraphs

arXiv

引用

arXiv 2024年

作者： Bang-Jensen, Jørgen Wang, Yun Yeo, Anders Dept. of Math. and Computer Science University of Southern Denmark Odense Denmark Dept. of Math. and Computer Science University of Southern Denmark Odense Denmark School of Mathematics Shandong University Jinan250100 China Department of Mathematics and Applied Mathematics University of Johannesburg Auckland Park2006 South Africa

A digraph is semicomplete if it has no pair of non-adjacent vertices. It is complete if every pair of distinct vertices induce a 2-cycle. It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph D = (V, A), a cost function w: A → {0, 1} and a natural number K;decide whether D has a directed Hamiltonian cycle of cost at most K. We study the following variant of this problem for {0, 1}-weighted semicomplete digraphs where the set of arcs which have cost 1 form a collection of vertex-disjoint complete digraphs. A digraph is semicomplete multipartite if it can be obtained from a semicomplete digraph D by choosing a collection of vertex-disjoint subsets X1, . . ., Xc of V (D) and then deleting all arcs both of whose end-vertices lie inside some Xi. Let D be a semicomplete digraph with a cost function w as above, where w(a) = 1 precisely when a is an arc inside one of the subsets X1, . . ., Xc and let D∗ be the corresponding semicomplete multipartite digraph that we obtain by deleting all arcs inside the Xi’s. Then every cycle C of D corresponds to a generalized cycle Cg of D∗ which is either the cycle C itself if w(C) = 0 or a collection of two or more paths that we obtain by deleting all arcs of cost 1 on C. Similarly we can define a generalized path P g in a semicomplete multipartite digraph. The purpose of this paper is to study structural and algorithmic properties of generalized paths and cycles in semicomplete multipartite digraphs. This allows us to identify classes of directed {0, 1}-weighted TSP instances that can be solved in polynomial time as well as others for which we can get very close to the optimum in polynomial time. Along with these results we also show that two natural questions about properties of cycles meeting all partite sets in semicomplete multipartite digraphs are *** Codes 05C20, 05c38, 05c45, 05c85 © 2024, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A New Clustering Approach based on Trust and Rat Swarm Algorithm for WSN Applications

A New Clustering Approach based on Trust and Rat Swarm Algor...

引用

2023 International Conference on Advances in Intelligent Computing and Applications, AICAPS 2023

作者： Osamy, Walid Salim, Ahmed Ali, Amel Al Khedr, Ahmed M. Faculty of Computers and Artificial Intelligence Benha University Computer Science Department Benha Egypt Zagazig University Math. Department Faculty of Science Zagazig Egypt Qassim University Department of Cs College of Sci. and Arts Al-Methnab Saudi Arabia Sharjah University Dept. of Information Systems Sharjah27272 United Arab Emirates Sharjah University Dept. of Computer Science Sharjah27272 United Arab Emirates

ISBN: (纸本)9798350333817

In this paper, a clustering approach called CATRSO is proposed. The selection of cluster heads (CH) is performed by considering the trust value of the nodes in order to select the most trustworthy nodes as CH and Rat Swarm Optimizer is employed for CH selection process. The trust value of the nodes and remaining energy are taken into account while designing the fitness function. In addition, a chain routing approach is employed between CHs for energy savings. The results demonstrate that the CATRSO technique is successful in selecting the most trustworthy nodes as CH and outperforms earlier efforts in the literature in terms of energy efficiency, average network lifetime, and trustworthiness of selected CHs. © 2023 IEEE.

关键词： Rats

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：