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

Evolutionary optimization of Yagi–Uda antenna design using grey wolf optimizer

Neural Computing and Applications 2025年第6期37卷 4155-4183页

作者： Braik, Malik Sheta, Alaa Aljahdali, Sultan El-Hefnawi, Fatma Al-Hiary, Heba Elashmawi, Walaa H. Computer Science Department Al-Balqa Applied University Salt Jordan Department of Computer Science Southern Connecticut State University New HavenCT United States Computer Science Department Taif University Taif Saudi Arabia Microwave Department Electronics Research Institute Giza Egypt Department of Computer Information System Al-Balqa Applied University Salt Jordan Department of Computer Science Faculty of Computers & Informatics Suez Canal University Ismailia Egypt Department of Computer Science Faculty of Computer Science Misr International University Cairo Egypt

Meta-heuristic optimization algorithms have become widely used due to their outstanding features, such as gradient-free mechanisms, high flexibility, and great potential for avoiding local optimal solutions. This research explored the grey wolf optimizer (GWO) to find the ideal configuration for a six-element Yagi–Uda antenna. The GWO algorithm adjusted the lengths of the antenna wires and the spacings between them. The goal was to maximize the antenna’s ability to transmit signals (throughput gain). Optimal antenna selection relies on various parameters, including gain, bandwidth, impedance matching, frequency, side-lobe levels, etc. The optimization of a six-element Yagi–Uda antenna presents a challenging engineering design problem due to its multimodal and nonlinear nature. Achieving optimal performance hinges on the intricate interplay between the lengths of the constituent elements and the spacing configurations. To this end, a multiobjective function was adopted to design this antenna. The performance of several meta-heuristic algorithms, including genetic algorithms, biogeography-based optimization, simulated annealing, and grey wolf optimizer, was compared. The GWO-based approach has performed better than its competitors. This optimized antenna design based on GWO reported a gain of 14.21 decibel. Therefore, the GWO-based method optimizes antennas that can be further investigated for other antenna design problems. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

RT-PPS: Real-time privacy-preserving scheme for cloud-hosted IoT data

引用

Journal of High Speed Networks 2025年第1期31卷 71-89页

作者： Elhoseny, Mohamed Riad, Khaled College of Computing and Informatics University of Sharjah Sharjah27272 United Arab Emirates Faculty of Computers and Information Mansoura University Mansoura35516 Egypt Computer Science Department College of Computer Sciences & Information Technology King Faisal University Al-Ahsa 31982 Saudi Arabia Mathematics Department Faculty of Science Zagazig University Zagazig44519 Egypt

The Internet of Things (IoT) is a rapidly growing network of devices that can communicate with each other and with cloud-based services. These devices generate vast amounts of data that can be used to provide valuable insights into user behavior, environmental conditions, and other important factors. However, as this data is collected and processed by cloud-hosted services, there is a growing concern about privacy and security. Without adequate protection, sensitive information could be exposed to hackers or other malicious actors, putting both individuals and organizations at risk. To address this challenge, real-time privacy-preserving techniques can be used to protect IoT data without compromising its value. This paper introduces an efficient Real-time privacy-preserving scheme (RT-PPS) for cloud-hosted IoT data. RT-PPS employs multi-authority attribute-based encryption on a hybrid cloud environment to keep data secure and private, while still allowing it to be processed and analyzed by cloud-hosted services. RT-PPS has efficient response time and resource consumption, which gives it the ability to handle a huge number of concurrent users at the same time without notable delay. The proposed RT-PPS has been validated through extensive experimental evaluation on a variety of configurations. Moreover, the proposed scheme has been computationally compared with the state-of-the-artwork. RT-PPS has shown excellent performance, effectiveness, and efficiency. The RT-PPS encryption time for a 1 GB dataset while considering 1024 slices is approximately 1000 ms. Also, the RT-PPS decryption time for a 1 GB ciphertext while considering 1024 slices are approximately 235 ms. Finally, RT-PPS is proven secure against any polynomial-time attacks and their variations that have at most a negligible advantage in the introduced security model. Moreover compared to most of the state-of-the-artwork, RT-PPS reduced the ciphertext size and lowered the computations in the encryption, key g

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Fusing Object Detections to Obtain Geolocated Salient Points Using Aerial Images 17th

Fusing Object Detections to Obtain Geolocated Salient Point...

引用

17th International Conference on Multi-disciplinary Trends in Artificial Intelligence, MIWAI 2024

作者： Rudol, Piotr Wzorek, Mariusz Doherty, Patrick Department of Computer and Information Science Linköping University Linköping Sweden Faculty of Informatics Mahasarakham University Mahasarakham44150 Thailand

ISBN: (纸本)9789819606948

This paper addresses the problem of vision-based object geolocation using Unmanned Aerial Vehicles in Search and Rescue settings. It focuses on the task of automatically and accurately geolocating objects of different classes, focusing on human bodies, to provide a map of the detected objects as salient locations. Such maps can be used by responders to plan rescue operations or by other robotic platforms where geolocation is necessary, such as with delivery of medical supplies. The proposed solution strategy leverages recent developments in the field of Convolutional Neural Networks for vision-based object detection with a method for fusing detections. Occupancy probabilities of locations in the environment containing objects of specific classes, or lack thereof, are also computed. This is achieved by taking advantage of a novel sensor model for fusing vision-based detections using both positive and negative observations. The method is validated in simulation as well as with real field experiments. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Enhanced Federated Learning Framework based on Deep Learning and Neutrosophic Set for Android Malware Classification

引用

Neutrosophic Sets and Systems 2025年 82卷 781-799页

作者： Abdellah, Mohamed Refaat Oudah, Hasan H. Badawy, Ahmed Mohamed Ahmed Mohamed, Abdelfattah Abdelfattah M. Bedier, Shady Ahmed Metwaly, Ahmed A. Eassa, Mohamed Abdelhafeez, Ahmed The Department of Computer Science College of Information Technology Misr University for Science and Technology Cairo Egypt College of Arts Department of Journalism Ahl Al Bayt University Karbala Iraq Cybersecurity Department Faculty of Computers and Artificial Intelligence Helwan University Egypt Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Department of Computer Science Faculty of Computers and Informatics Zagazig University Zagazig44519 Egypt Applied Science Research Center Applied Science Private University Amman Jordan

Malware detection is one of the critical tasks of cybersecurity, especially considering the growing popularity of mobile devices. The integrity and security of mobile ecosystems rely on the capacity to identify malware quickly and precisely, as security hacks against these devices become increasingly frequent. Due to the requirement for massive volumes of data aggregation, traditional centralized machine learning (ML) techniques for malware detection face challenges with data sharing, computational complexity, and privacy. This research addresses these challenges by proposing a novel model, called "CNN-Fed", which is based on Convolutional Neural Networks (CNN) with Federated Learning (Fed). The main goal of this work is to create a global classifier for Android malware detection that is highly accurate and does not require centralised data aggregation. Using four benchmark datasets—Drebin, Malgenome, Kronodroid, and Tuandromd—the CNN-Fed model is trained across many clients in a federated setting under the suggested architecture. Then we use multi-criteria decision-making (MCDM) methodology to evaluate the number of clients and number of rounds. We use two MCDM methods such as Entropy methodology to compute the criteria weights and the CoCoSo methodology to rank the alternatives. We use the interval-valued neutrosophic sets (IVNSs) to deal with uncertainty and vague information. We use five criteria such as accuracy, F1-score, precision, recall, and FP and six of alternatives refer to the number of clients and number of rounds. The results show the best alternative has a larger number of clients and rounds. © 2025, University of New Mexico. All rights reserved.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Advanced Feature Extraction and Machine Learning Techniques for Classifying Steam Game Feedback

International Journal of Interactive Mobile Technologies

引用

International Journal of Interactive Mobile Technologies 2025年第1期19卷 107-125页

作者： Al Tawil, Arar Fathi, Hanaa Alzoubi, Sharaf Shaban, Amneh Almazaydeh, Laiali H. Faculty of Information Technology Applied Science Private University Amman Jordan College of Computer Science and Informatics Amman Arab University Amman Jordan College of Engineering AbuDhabi University Abu Dhabi United Arab Emirates

The gaming industry produces vast amounts of user-generated feedback, making it challenging for developers to efficiently analyze and respond to real-time reviews. This study addresses the problem of classifying large-scale unstructured user feedback from Steam reviews. In this paper an approach that integrates traditional machine learning models and deep learning models is proposed. XGBoost is used to manage feature-rich datasets, reducing overfitting. Long-short-term memory (LSTM) and Bi-directional LSTM are used to enhance the accuracy and robustness of classification. Feature extraction techniques, such as sentiment analysis and topic modeling, are employed to enrich the dataset and improve model performance. The experimental results show that the XGBoost model achieved the highest performance with an accuracy of 0.9499 and a ROC-AUC score of 0.6113, demonstrating superior performance in distinguishing between positive and negative feedback. In comparison, deep learning models such as LSTM and Bi-directional LSTM showed lower ROC-AUC scores, indicating less effectiveness in handling the classification task. This approach offers game developers a reliable and scalable solution for classifying user sentiment, leading to better game improvements based on user reviews. © 2025 by the authors of this article.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Noisy (Binary) Searching: Simple, Fast and Correct 42

Noisy (Binary) Searching: Simple, Fast and Correct

引用

42nd International Symposium on Theoretical Aspects of computer Science, STACS 2025

作者： Dereniowski, Dariusz Lukasiewicz, Aleksander Uznański, Przemyslaw Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Poland Institute of Computer Science University of Wroclaw Poland Computer Science Institute Charles University Prague Czech Republic

ISBN: (纸本)9783959773652

This work considers the problem of the noisy binary search in a sorted array. The noise is modeled by a parameter p that dictates that a comparison can be incorrect with probability p, independently of other queries. We state two types of upper bounds on the number of queries: the worst-case and expected query complexity scenarios. The bounds improve the ones known to date, i.e., our algorithms require fewer queries. Additionally, they have simpler statements, and work for the full range of parameters. All query complexities for the expected query scenarios are tight up to lower order terms. For the problem where the target prior is uniform over all possible inputs, we provide an algorithm with expected complexity upperbounded by (log2 n + log2 δ−1 + 3)/I(p), where n is the domain size, 0 ≤ p 0 is the failure probability, and I(p) is the information gain function. As a side-effect, we close some correctness issues regarding previous work. Also, en route, we obtain new and improved query complexities for the search generalized to arbitrary graphs. This paper continues and improves the lines of research of Burnashev-Zigangirov [Prob. Per. Informatsii, 1974], Ben-Or and Hassidim [FOCS 2008], Gu and Xu [STOC 2023], and Emamjomeh-Zadeh et al. [STOC 2016], Dereniowski et al. [SOSA@SODA 2019]. © Dariusz Dereniowski, Aleksander Lukasiewicz, and Przemyslaw Uznański.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Sampling-Based Motion Planning for Guide Robots Considering User Pose Uncertainty 25th

Sampling-Based Motion Planning for Guide Robots Considering...

引用

25th Annual Conference on Towards Autonomous Robotic Systems, TAROS 2024

作者： Mosquera-Maturana, Juan Sebastian Hernández Vega, Juan David Romero Cano, Victor Faculty of Engineering Universidad Autónoma de Occidente Cali Colombia School of Computer Science and Informatics Cardiff University Cardiff United Kingdom

ISBN: (纸本)9783031720581

In this paper, we propose a framework to address the problem of guiding a person within a semi-structured environment in a socially acceptable manner that prioritises safety and comfort. We propose an algorithm based on the optimal Rapidly exploring Random Tree (RRT*) algorithm for path planning. Our proposal utilises Dubins curves and takes into account the user during path planning to generate a navigation path that allows the robot to follow a feasible path that can also be navigated by the user. A comparative analysis against standard path planning based on the RRT* algorithm and the Social Force Model validates the efficacy of our proposed algorithm. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Microrobots

来源：评论

学校读者我要写书评

暂无评论

Analysing Zero-Shot Readability-Controlled Sentence Simplification 31

Analysing Zero-Shot Readability-Controlled Sentence Simplifi...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Barayan, Abdullah Camacho-Collados, Jose Alva-Manchego, Fernando School of Computer Science and Informatics Cardiff University United Kingdom Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia

ISBN: (纸本)9798891761964

Readability-controlled text simplification (RCTS) rewrites texts to lower readability levels while preserving their meaning. RCTS models often depend on parallel corpora with readability annotations on both source and target sides. Such datasets are scarce and difficult to curate, especially at the sentence level. To reduce reliance on parallel data, we explore using instruction-tuned large language models for zero-shot RCTS. Through automatic and manual evaluations, we examine: (1) how different types of contextual information affect a model's ability to generate sentences with the desired readability, and (2) the trade-off between achieving target readability and preserving meaning. Results show that all tested models struggle to simplify sentences (especially to the lowest levels) due to models' limitations and characteristics of the source sentences that impede adequate rewriting. Our experiments also highlight the need for better automatic evaluation metrics tailored to RCTS, as standard ones often misinterpret common simplification operations, and inaccurately assess readability and meaning preservation. © 2025 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Model of Benevolence for Trust in Multi-agent System 18th

The Model of Benevolence for Trust in Multi-agent System

引用

18th International KES Conference on Agents and Multi-Agent Systems: Technologies and Applications, KES-AMSTA 2024

作者： Zurek, Tomasz Wyner, Adam van Engers, Tom Complex Cyber Infrastructure Informatics Institute Faculty of Science University of Amsterdam Amsterdam Netherlands Department of Computer Science Swansea University Swansea United Kingdom

ISBN: (纸本)9789819764686

The problem of understanding trust relations in modern society is extremely interesting nowadays. In our project, we are going to use Multi-agent systems (MAS) to model and reproduce experiments from social sciences to better understand how the relation of trust is shaped in society. In order to perform such experiments it is necessary to accurately represent trust and trustworthiness in MAS. In this paper, we introduce the model and an experimental implementation of benevolence, one of the most important components of trustworthiness. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Benevolence Computational trust Multi-agent system

来源：评论

学校读者我要写书评

暂无评论

Modified U-Net with attention gate for enhanced automated brain tumor segmentation

引用

Neural Computing and Applications 2025年第7期37卷 5521-5558页

作者： Saifullah, Shoffan Dreżewski, Rafal Yudhana, Anton Wielgosz, Maciej Caesarendra, Wahyu Faculty of Computer Science AGH University of Krakow Krakow30-059 Poland Department of Informatics Universitas Pembangunan Nasional Veteran Yogyakarta Yogyakarta55281 Indonesia Department of Electrical Engineering Universitas Ahmad Dahlan Yogyakarta55191 Indonesia Faculty of Computer Science Electronics and Telecommunications AGH University of Krakow Krakow30-059 Poland Faculty of Mechanical Engineering Opole University of Technology 76 Proszkowska St. Opole45-758 Poland

This study addresses the formidable challenges encountered in automated brain tumor segmentation, including the complexities of irregular shapes, ambiguous boundaries, and intensity variations across MRI modalities. Manual segmentation, plagued by subjectivity and time constraints, further exacerbates the problem. To address these issues, we propose a modified U-Net architecture with an integrated attention gate. The proposed model demonstrates high performance, with notable Dice Similarity Coefficient (DSC) and Jaccard Index (JI) values across various tumor classes, consistently exceeding 0.93 and 0.87, respectively. Incorporating Contrast-Limited Adaptive Histogram Equalization and Histogram Equalization improves segmentation accuracy, particularly in cases of Meningioma. Comparative analyses against established models reveal a DSC of 0.9521 and a JI of 0.9093, underscoring the superiority of our method. Validation in the BraTS 2021 dataset underscores the robustness of the method, achieving high DSC and JI scores in four MRI modalities, with the T2 modality demonstrating the highest performance (DSC: 0.9216, JI: 0.8556). While acknowledging these achievements, we recognize challenges related to dataset specificity and computational intensity associated with the attention gate. Future research efforts should address these issues to improve the generalizability and applicability of the method in real-world scenarios. In addition to presenting a novel automated brain tumor segmentation method, this study contributes comprehensive result values and comparative analyses with previous research, providing valuable insights into the evolving landscape of medical image analysis. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：