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

International Journal of Systematic Innovation 2025年第2期9卷 14-25页

作者： Kareem, Shahab Wahhab Awla, Hoshang Qasim Mohammed, Amin Salih Department of Technical Information Systems Engineering Erbil Technical Engineering College Erbil Polytechnic University Erbil Iraq Department of Computer Technical Engineering Al-Qalam University College Kirkuk Iraq Department of Computer Science Faculty of Science Soran University Soran Iraq Department of Software and Informatics Salahaddin University Erbil Iraq

Bayesian networks are powerful analytical models in machine learning, used to represent probabilistic relationships among variables and create learning structures. These networks are made up of parameters that show conditional probabilities and a structure that shows how random variables interact with each other. The structure is shown by a directed acyclic graph. Despite the NP-hard nature of learning Bayesian network structures, there has been significant progress in improving the accuracy of approximation solutions. The main focus is on score-based search strategies, which make use of functions to evaluate network models and identify structures with high scores. This study is significantly focused on structure learning Bayesian networks using the Bayesian Dirichlet equivalent uniform scoring function and metaheuristic search strategies. To this end, this paper presents the sparrow optimization algorithm (SOA), a new metaheuristic algorithm derived from the foraging behavior of sparrows. SOA performs a concurrent optimization in the solution space by simultaneously performing a local and global search that leads to the discovery of near-optimal structures. The results from our experiments on several benchmark datasets show that SOA yields overall better performance than SA and greedy search algorithms. In particular, it is claimed that by applying the proposed approach of SOA, the convergence speed is significantly higher compared with the existing ones;F1 score is 0.35 and 0.05 for the Hamming distance with better results. Given these results, signed operators prove to be very efficient in SOA’s Bayesian network structure learning as a concept, especially for real-world use. © (2024), (Society of Sytematic Innovation). All Rights Reserved.

关键词： Bayesian Network Global and Local Search Search and Score Sparrow Search Optimization Algorithm Structure Learning

来源：评论

学校读者我要写书评

暂无评论

Color image restoration by filtering methods: a review

引用

Soft Computing 2024年第13-14期28卷 7755-7782页

作者： Salamat, Nadeem Missen, Malik Muhammad Saad Akhtar, Nadeem Mustahsan, Muhammad Surya Prasath, V.B. Department of Mathematics Khawaja Fareed University of Engineering and Information Technology Rahim Yar Khan64200 Pakistan Department of Computer Science and IT The Islamia University of Bahawalpur Bahawalpur63100 Pakistan Division of Biomedical Informatics Cincinnati Children’s Hospital Medical Center CincinnatiOH45229 United States Department of Computer Science Pediatrics and Biomedical Informatics University of Cincinnati CincinnatiOH45221 United States

Digital images are corrupted with noise, and image denoising is an important step in image processing modules. In this review, the latest developments in filtering methods for color image restoration are analyzed. These algorithms are compared in terms of objective image quality measures and divided into major classes, such as spatial domain, switching and wavelet filtering methods. These classes are based on the particular methodology used in image denoising algorithms and further subdivided to show their classification in terms of noise models utilized, application style, and stages the filters applied in images. In particular, we present a review of filtering methods in color image denoising, published over the past two decades. Our classification and succinct descriptions of color image restoration by these mathematical filtering techniques and their characterizations can help choose the appropriate ones for various downstream image processing tasks. © The Author(s) 2024.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Sobol Sequence Optimization for Hardware-Efficient Vector Symbolic Architectures

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 937-950页

作者： Aygun, Sercan Najafi, Hassan University of Louisiana at Lafayette School of Computing and Informatics LafayetteLA70503 United States Case Western Reserve University Electrical Computer and Systems Engineering Department ClevelandOH44106 United States

Hyperdimensional computing (HDC) is an emerging computing paradigm with significant promise for efficient and robust learning. In HDC, objects are encoded with high-dimensional vector symbolic sequences called hypervectors. The quality of hypervectors, defined by their distribution and independence, directly impacts the performance of HDC systems. Despite a large body of work on the processing parts of HDC systems, little to no attention has been paid to data encoding and the quality of hypervectors. Most prior studies have generated hypervectors using inherent random functions, such as MATLAB’s or Python’s random function. This work introduces an optimization technique for generating hypervectors by employing quasi-random sequences. These sequences have recently demonstrated their effectiveness in achieving accurate and low-discrepancy data encoding in stochastic computing systems. The study outlines the optimization steps for utilizing Sobol sequences to produce high-quality hypervectors in HDC systems. An optimization algorithm is proposed to select the most suitable Sobol sequences via indexes for generating minimally correlated hypervectors, particularly in applications related to symbol-oriented architectures. The performance of the proposed technique is evaluated in comparison to two traditional approaches of generating hypervectors based on linear-feedback shift registers and MATLAB random functions. The evaluation is conducted for three applications: 1) language;2) headline;and 3) medical image classification. Our experimental results demonstrate accuracy improvements of up to 10.79%, depending on the vector size. Additionally, the proposed encoding hardware exhibits reduced energy consumption and a superior area-delay product. © 2024 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Evaluation of RIS-Enabled B5G/6G Indoor Positioning and Mapping using Ray Tracing Models 11

Evaluation of RIS-Enabled B5G/6G Indoor Positioning and Mapp...

引用

11th Workshop on Satellite Navigation Technology, NAVITEC 2024

作者： Kompostiotis, Dimitris Vordonis, Dimitris Paliouras, Vassilis Alexandropoulos, George C. Grec, Florin University of Patras Electrical and Computer Engineering Department Greece National and Kapodistrian University of Athens Department of Informatics and Telecommunications Greece Noordwijk Netherlands

ISBN: (纸本)9798350356854

A Reconfigurable Intelligent Surface (RIS) can significantly enhance network positioning and mapping, acting as an additional anchor point in the reference system and improving signal strength and measurement diversity through the generation of favorable scattering conditions and virtual line-of-sight paths. In this paper, we present a comprehensive framework aimed at user localization and scatterer position estimation in an indoor environment with multipath effects. Our approach leverages beam sweeping through codebook-based beamforming at an 1-bit RIS to scan the environment, applies signal component extraction mechanisms, and utilizes a super-resolution algorithm for angle-based positioning of both connected users and scatterers. To validate the system's effectiveness, accurate 3D ray tracing models are employed, ensuring the robustness and effectiveness of the proposed approach in practical scenarios. © 2024 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Fine-Tuned Attribute Weighted Naïve Bayes with Modified Partial Instances Reduction for Gaming Disorder Classification

HighTech and Innovation Journal

引用

HighTech and Innovation Journal 2025年第1期6卷 67-80页

作者： Latubessy, Anastasya Wardoyo, Retantyo Musdholifah, Aina Kusrohmaniah, Sri Doctoral Program Department of Computer Science and Electronics Faculty of Mathematics and Natural Science Universitas Gadjah Mada Yogyakarta55281 Indonesia Department of Informatics Engineering Faculty of Engineering Universitas Muria Kudus Indonesia Department of Computer Science and Electronics Faculty of Mathematics and Natural Science Universitas Gadjah Mada Yogyakarta55281 Indonesia Department of Psychology Faculty of Psychology Universitas Gadjah Mada Yogyakarta55281 Indonesia

Fine Tuning Attribute Weighted Naïve Bayes (FTAWNB) is a reliable modified Naïve Bayes model. Even though it is able to provide high accuracy on ordinal data, this model is sensitive to outliers. To improve the performance of FTAWNB, this research modified the Partial Instances Reduction (PIR) technique to make the FTAWNB more adaptive to outliers. Nevertheless, in contrast to the original PIR technique, which substitutes missing values for data values deemed outliers, the PIR technique suggested in this study replaces data values deemed outliers using a Naïve Bayes weighting approach. The attribute values from the outlier data are replaced with the highest probability values for the attributes in the actual class. This PIR technique is referred to as modified PIR. The FTAWNB model with modified PIR has been evaluated using the Gaming Disorder dataset. Replacing the four attributes with the least amount of information resulted in accuracy gains of 99.74%, an increase of 1.53% over the FTAWNB model. The experimental result shows that adding the modified PIR technique to the FTAWNB model can handle the outlier in the data, proving it by increasing the performance in terms of accuracy, precision, and recall without pruning the dataset used. © 2025, Ital Publication. All rights reserved.

关键词： Attribute Weighted Classification Fine-Tune Gaming Disorder Instances Reduction Naïve Bayes

来源：评论

学校读者我要写书评

暂无评论

Improving SVM Performance in Determining Cost and Kernel Parameter Values Through Grid Search 2

Improving SVM Performance in Determining Cost and Kernel Par...

引用

2nd International Conference on Technology Innovation and Its Applications, ICTIIA 2024

作者： Sylvia, Visca Lydia, Maya Silvi Nasution, Benny Benyamin Universitas Sumatera Utara Faculty of Computer Science and Information Technology Medan Indonesia Politeknik Negeri Medan Department of Computer Engineering and Informatics Medan Indonesia

ISBN: (纸本)9798350351613

The purpose of this study is to improve the performance of Support Vector Machine (SVM) algorithm in sentiment analysis of trainee reviews through parameter optimization using Grid Search. Trainee reviews were taken from the Vocational and Productivity Training Center (BBPVP) Medan, which is the context of this study. The method used includes collection and preprocessing of review data, followed by the application of SVM for sentiment analysis. Grid Search is used to optimize the cost and kernel parameters of SVM. The results show that after optimization, the resulting SVM model shows significant performance improvement compared to the model before optimization. Accuracy increased from 68.75% to 71.96%, with improvements in other metrics such as precision, recall, and F1 score. These findings suggest that Grid Search is an effective method to optimize SVM parameters in sentiment analysis, providing a more accurate evaluation of the effectiveness of training programs at BBPVP Medan. This research makes an important contribution by applying hyperparameter optimization to SVM and suggests the application of this method for similar analysis in the future. © 2024 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Performance and Implementation Comparison of Knuth-Morris-Pratt and Boyer-Moore String Search Algorithms 2

Performance and Implementation Comparison of Knuth-Morris-Pr...

引用

2nd International Conference on Advanced Innovations in Smart Cities, ICAISC 2025

作者： Saleh, Taj Ergin, Fatma Corut Malkawi, Malek Alhajj, Reda Department of Computer Engineering Marmara University Istanbul Turkey Department of Computer Engineering Istanbul Medipol University Istanbul Turkey Department of Computer Science University of Calgary Alberta Canada Department of Heath Informatics University of Southern Denmark Odense Denmark

ISBN: (纸本)9798331506995

String search algorithms play an important role in many research areas such as data mining and bioinformatics. While there exist a number of algorithms that handles the topic, we are exploring the the Knuth-Morris-Pratt (KMP) and Boyer-Moore algorithms due to their efficiency and versatility. In this work, we compared the algorithms in terms of characteristics, performance and implementation details. We also tested both the algorithms with various patterns and texts that differs in size. We also analyzed the performance of the algorithms on 4 different processors to understand the technological advancements effects on their performance. Our findings suggest that the BM algorithm perform better with large texts and patterns, while the KMP algorithm is better suited for smaller ones. Also, while newer processor generally exhibit improved performance, the significance of these enhancements may vary. Thus, we should rather be looking specific architectural advancements within generations rather than focusing solely on the generational gap. © 2025 IEEE.

关键词： String searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Resource Based Automatic Calibration System (RBACS) Using Kubernetes Framework

引用

Intelligent Automation & Soft Computing 2023年第1期35卷 1165-1179页

作者： Tahir Alyas Nadia Tabassum Muhammad Waseem Iqbal Abdullah S.Alshahrani Ahmed Alghamdi Syed Khuram Shahzad Department of Computer Science Lahore Garrison UniversityLahore54000Pakistan Department of Computer Science&IT Virtual University of PakistanLahore54000Pakistan Department of Software Engineering The Superior UniversityLahore54000Pakistan Department of Computer Science&Artificial Intelligence College of Computer Science&EngineeringUniversity of Jeddah21493Saudi Arabia Department of Software Engineering College of Computer Science and EngineeringUniversity of Jeddah21493Saudi Arabia Department of Informatics&Systems University of Management&TechnologyLahore54000Pakistan

Kubernetes,a container orchestrator for cloud-deployed applications,allows the application provider to scale automatically to match thefluctuating intensity of processing *** cluster technology is used to encapsulate,isolate,and deploy applications,addressing the issue of low system reliability due to interlocking ***-based platforms usually entail users define application resource supplies for eco container *** is a constant problem of over-service in data centers for cloud service *** operating costs and incompetent resource utilization can occur in a waste of *** revolutionized the orchestration of the container in the cloud-native *** can adaptively manage resources and schedule containers,which provide real-time status of the cluster at runtime without the user’s *** clusters face unpredictable traffic,and the cluster performs manual expansion configuration by the *** to operational delays,the system will become unstable,and the service will be *** work proposed an RBACS that vigorously amended the distribution of containers operating in the entire Kubernetes *** allocation pattern is analyzed with the Kubernetes *** estimate the overall cost of RBACS,we use several scientific benchmarks comparing the accomplishment of container to remote node migration and on-site *** experiments ran on the simulations to show the method’s effectiveness yielded high precision in the real-time deployment of resources in eco *** to the default baseline,Kubernetes results in much fewer dropped requests with only slightly more supplied resources.

关键词： Docker container virtualization cloud resource kubernetes

来源：评论

学校读者我要写书评

暂无评论

Non-stationary Domain Generalization: Theory and Algorithm 40

Non-stationary Domain Generalization: Theory and Algorithm

引用

40th Conference on Uncertainty in Artificial Intelligence, UAI 2024

作者： Pham, Thai-Hoang Zhang, Xueru Zhang, Ping Department of Computer Science and Engineering The Ohio State University United States Department of Biomedical Informatics The Ohio State University United States

Although recent advances in machine learning have shown its success to learn from independent and identically distributed (IID) data, it is vulnerable to out-of-distribution (OOD) data in an open world. Domain generalization (DG) deals with such an issue and it aims to learn a model from multiple source domains that can be generalized to unseen target domains. Existing studies on DG have largely focused on stationary settings with homogeneous source domains. However, in many applications, domains may evolve along a specific direction (e.g., time, space). Without accounting for such non-stationary patterns, models trained with existing methods may fail to generalize on OOD data. In this paper, we study domain generalization in non-stationary environment. We first examine the impact of environmental non-stationarity on model performance and establish the theoretical upper bounds for the model error at target domains. Then, we propose a novel algorithm based on adaptive invariant representation learning, which leverages the non-stationary pattern to train a model that attains good performance on target domains. Experiments on both synthetic and real data validate the proposed algorithm. © 2024 Proceedings of Machine Learning Research. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

A fusion of machine learning and cryptography for fast data encryption through the encoding of high and moderate plaintext information blocks

引用

Multimedia Tools and Applications 2025年第8期84卷 5349-5375页

作者： Shafique, Arslan Mehmood, Abid Alawida, Moatsum Elhadef, Mourad Rehman, Mujeeb Ur School of Biomedical Engineering University of Glasgow Glasgow United Kingdom Department of Computer Sciences Abu Dhabi University Abu Dhabi United Arab Emirates Cyber Technology Institute School of Computer Science and Informatics De Montfort University Leicester United Kingdom

Within the domain of image encryption, an intrinsic trade-off emerges between computational complexity and the integrity of data transmission security. Protecting digital images often requires extensive mathematical operations for robust security. However, this computational burden makes real-time applications unfeasible. The proposed research addresses this challenge by leveraging machine learning algorithms to optimize efficiency while maintaining high security. This methodology involves categorizing image pixel blocks into three classes: high-information, moderate-information, and low-information blocks using a support vector machine (SVM). Encryption is selectively applied to high and moderate information blocks, leaving low-information blocks untouched, significantly reducing computational time. To evaluate the proposed methodology, parameters like precision, recall, and F1-score are used for the machine learning component, and security is assessed using metrics like correlation, peak signal-to-noise ratio, mean square error, entropy, energy, and contrast. The results are exceptional, with accuracy, entropy, correlation, and energy values all at 97.4%, 7.9991, 0.0001, and 0.0153, respectively. Furthermore, this encryption scheme is highly efficient, completed in less than one second, as validated by a MATLAB tool. These findings emphasize the potential for efficient and secure image encryption, crucial for secure data transmission in rea-time applications. © The Author(s) 2024.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：