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

Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems

引用

Neural computing and Applications 2024年第19期36卷 11137-11170页

作者： Biswas, Saptadeep Shaikh, Azharuddin Ezugwu, Absalom El-Shamir Greeff, Japie Mirjalili, Seyedali Bera, Uttam Kumar Abualigah, Laith Department of Mathematics National Institute of Technology Agartala Tripura Agartala India Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom2520 South Africa Faculty of Natural and Agricultural Sciences School of Computer Science and Information Systems North-West University Vanderbijlpark South Africa Centre for Artificial Intelligence Research and Optimization Torrens University Australia Fortitude Valley BrisbaneQLD4006 Australia Research Center University of Tabuk Tabuk71491 Saudi Arabia Computer Science Department Al al-Bayt University Mafraq25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Applied Science Research Center Applied Science Private University Amman11931 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia College of Engineering Yuan Ze University Taoyuan32003 Taiwan MEU Research Unit Middle East University Amman11831 Jordan

This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Lévy dynamic random walk technique is utilized in EPDO. This modified Lévy flight with random walk reduces the algorithm’s running time for the test function’s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study. © The Author(s) 2024.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Correction to: A new emergency response of spherical intelligent fuzzy decision process to diagnose of COVID19

引用

Soft computing 2023年第6期27卷 3551页

作者： Shahzaib Ashraf Saleem Abdullah Alaa O Almagrabi Department of Mathematics Abdul Wali Khan University Mardan 23200 Pakistan. Department of Information Systems Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia.

[This corrects the article DOI: 10.1007/s00500-020-05287-8.].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Assistive Technical Communication of Montenegrin eServices: a Case Study

Assistive Technical Communication of Montenegrin eServices: ...

引用

International Scientific-Professional Conference on information Technology (IT)

作者： Aniko Simon Luka Laković Pavle Kovačević Peter A. Kara Ivana Ognjanović Ramo Šendelj Christoph Reich Milovan Roganović John Mantas Laszlo Bokor Sigma Technology 1093 Budapest Hungary Faculty for Information Systems and Technologies University of Donja Gorica 81000 Podgorica Montenegro Budapest University of Technology and Economics 1111 Budapest Hungary Department of Networked Systems and Services Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics 1111 Budapest Hungary Department of Computer Science School of Computer Science and Mathematics Faculty of Science Engineering and Computing Wireless Multimedia and Networking Research Group Kingston University London KT1 2EE UK Humanistic Studies University of Donja Gorica 81000 Podgorica Montenegro Institute of Data Science Cloud Computing and IT Security Furtwangen University 78120 Furtwangen Germany Clinic for Neurology Clinical Centre of Montenegro 81000 Podgorica Montenegro Faculty of Nursing School of Health Sciences National and Kapodistrian University of Athens 11527 Goudi Greece

With the advancement of information technology in the recent decades, digital and online services have become essential components of everyday life in Europe. Montenegro is no different in this regard. However, as digital literacy in the country is still in a developing phase in comparison with most countries of the EU, a higher portion of its citizens may rely on assistive technical communication. In this paper, we provide a case study on the assistive technical communication of Montenegrin eServices. The work addresses the sectors of online banking, healthcare services, higher education, national administrative services, and utilities. Our findings highlight the diversity in terms of implemented assistive technical communication, and distinguish usage contexts on the level of adequacy. Yet as the functionalities of Montenegrin eServices are expected to gradually expand in the upcoming years, assistive technical communication must aim to handle the higher extents of service complexity.

关键词： Online banking Education Europe Medical services Complexity theory information technology

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the Montenegrin Academic Digital Innovation Hub

Evaluation of the Montenegrin Academic Digital Innovation Hu...

引用

International Scientific-Professional Conference on information Technology (IT)

作者： Luka Laković Peter A. Kara Ivana Ognjanović Laszlo Bokor Ramo Šendelj Christoph Reich Milovan Roganović Emmanouil Zoulias Jevto Eraković Tanja Radusinović Nada Rakočević Aniko Simon Faculty for Information Systems and Technologies University of Donja Gorica 81000 Podgorica Montenegro Department of Networked Systems and Services Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics 1111 Budapest Hungary Department of Computer Science School of Computer Science and Mathematics Wireless Multimedia and Networking Research Group Faculty of Science Engineering and Computing Kingston University London KT1 2EE UK Humanistic Studies University of Donja Gorica 81000 Podgorica Montenegro Institute of Data Science Cloud Computing and IT Security Furtwangen University 78120 Furtwangen Germany Clinic for Neurology Clinical Centre of Montenegro 81000 Podgorica Montenegro Faculty of Nursing School of Health Sciences National and Kapodistrian University of Athens 11527 Goudi Greece Chamber of Economy of Montenegro 81000 Podgorica Montenegro Sigma Technology 1093 Budapest Hungary

In the era of global digitalization, digital innovation hubs have become essential, as they function as transforming forces. In this paper, we provide an analysis of the Montenegrin Academic Digital Innovation Hub by applying multi-criteria qualitative evaluation over several criteria: process flow of fully digitized operations of the Hub (with aspects of the innovation life-cycle, ethics, and security), resource management, strategic goals, and feasibility. The paper also proposes a model of comprehensive resource management via the perspective of smart specialization priorities of Montenegro.

关键词： Technological innovation Ethics Resource management Security information technology

来源：评论

学校读者我要写书评

暂无评论

Systematic investigation into generalization of COVID-19 CT deep learning models with Gabor ensemble for lung involvement scoring

arXiv

引用

arXiv 2021年

作者： Horry, Michael James Chakraborty, Subrata Pradhan, Biswajeet Fallahpoor, Maryam Hossein, Chegeni Paul, Manoranjan Center for Advanced Modelling and Geospatial Information Systems School of Information Systems & Modelling Faculty of Engineering and IT University of Technology Sydney SydneyNSW2007 Australia Imaging Center Mehr General Hospital Tehran Iran School of Computing and Mathematics Charles Sturt University BathurstNSW2795 Australia

The COVID-19 pandemic has inspired unprecedented data collection and computer vision modelling efforts worldwide, focusing on diagnosis and stratification of COVID-19 from medical images. Despite this large-scale research effort, these models have found limited practical application due in part to unproven generalization of these models beyond their source study. This study investigates the generalizability of key published models using the publicly available COVID-19 Computed Tomography data through cross dataset validation. We then assess the predictive ability of these models for COVID-19 severity using an independent new dataset that is stratified for COVID-19 lung involvement. Each inter-dataset study is performed using histogram equalization, and contrast limited adaptive histogram equalization with and without a learning Gabor filter. The study shows high variability in the generalization of models trained on these datasets due to varied sample image provenances and acquisition processes amongst other factors. We show that under certain conditions, an internally consistent dataset can generalize well to an external dataset despite structural differences between these datasets with f1 scores up to 86%. Our best performing model shows high predictive accuracy for lung involvement score for an independent dataset for which expertly labelled lung involvement stratification is available. Creating an ensemble of our best model for disease positive prediction with our best model for disease negative prediction using a min-max function resulted in a superior model for lung involvement prediction with average predictive accuracy of 75% for zero lung involvement and 96% for 75-100% lung involvement with almost linear relationship between these stratifications. Copyright © 2021, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Short-Term and Long-Term Context Aggregation Network for Video Inpainting 16th

Short-Term and Long-Term Context Aggregation Network for Vid...

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Li, Ang Zhao, Shanshan Ma, Xingjun Gong, Mingming Qi, Jianzhong Zhang, Rui Tao, Dacheng Kotagiri, Ramamohanarao School of Computing and Information Systems The University of Melbourne Melbourne Australia UBTECH Sydney AI Centre School of Computer Science Faculty of Engineering The University of Sydney Darlington2008 Australia School of Information Technology Deakin University Geelong Australia School of Mathematics and Statistics The University of Melbourne Melbourne Australia

ISBN: (纸本)9783030585471

Video inpainting aims to restore missing regions of a video and has many applications such as video editing and object removal. However, existing methods either suffer from inaccurate short-term context aggregation or rarely explore long-term frame information. In this work, we present a novel context aggregation network to effectively exploit both short-term and long-term frame information for video inpainting. In the encoding stage, we propose boundary-aware short-term context aggregation, which aligns and aggregates, from neighbor frames, local regions that are closely related to the boundary context of missing regions into the target frame (The target frame refers to the current input frame under inpainting.). Furthermore, we propose dynamic long-term context aggregation to globally refine the feature map generated in the encoding stage using long-term frame features, which are dynamically updated throughout the inpainting process. Experiments show that it outperforms state-of-the-art methods with better inpainting results and fast inpainting speed. © 2020, Springer Nature Switzerland AG.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

An Effective Fair Off-Line Electronic Cash Protocol using Extended Chaotic Maps with Anonymity Revoking Trustee

An Effective Fair Off-Line Electronic Cash Protocol using Ex...

引用

2021 IEEE International Conference on Communications, computing, Cybersecurity and Informatics, CCCI 2021

作者： Meshram, Chandrashekhar Obaidat, Mohammad S. Hsiao, Kuei-Fang Imoize, Agbotiname Lucky Meshram, Akshaykumar College of Chhindwara University Jayawanti Haksar Government Post Graduation College Department of Post Graduation Studies and Research in Mathematics M.P. Betul460001 India University of Sharjah College of Computing and Informatics United Arab Emirates University of Sharjah Department of Information Systems United Arab Emirates University of Lagos Faculty of Engineering Department of Electrical and Electronics Engineering Lagos100213 Nigeria Yeshwantrao Chavan College of Engineering Department of Applied Mathematics M.S. Nagpur India

ISBN: (纸本)9781665432085

Along with the proliferation of cyberspace and the beginning of electronic trade, many electronic cash protocols were suggested. Electronic cash allows digital coins to be exchanged with value guaranteed by the signature of the financial institution and the hidden identity of the client. A client can withdraw money from the financial institution in an electronic cash protocol and then anonymously and unlinkably spend each coin. The present article suggests a practical, fair offline electronic cash protocol using extended chaotic maps capable of coin locating and seller locating. Under certain conditions, the protocol's anonymity perchance was revoked from an offline trusted third party. The trustworthy third party verifies the financial institution's e-coin signature in our protocol and then logs the location of data that isn't part of the normal electronic cash protocol. © 2021 IEEE.

关键词： Electronic money

来源：评论

学校读者我要写书评

暂无评论

Optimal kernel choice for score function-based causal discovery 24

Optimal kernel choice for score function-based causal discov...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Wenjie Wang Biwei Huang Feng Liu Xinge You Tongliang Liu Kun Zhang Mingming Gong School of Mathematics and Statistics The University of Melbourne Australia and Department of Machine Learning Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Halicioğlu Data Science Institute (HDSI) University of California San Diego School of Computing and Information Systems The University of Melbourne Australia Huazhong University of Science and Technology China School of Computer Science Faculty of Engineering The University of Sydney Australia Department of Machine Learning Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates and Department of Philosophy Carnegie Mellon University

Score-based methods have demonstrated their effectiveness in discovering causal relationships by scoring different causal structures based on their goodness of fit to the data. Recently, Huang et al. (2018) proposed a generalized score function that can handle general data distributions and causal relationships by modeling the relations in reproducing kernel Hilbert space (RKHS). The selection of an appropriate kernel within this score function is crucial for accurately characterizing causal relationships and ensuring precise causal discovery. However, the current method involves manual heuristic selection of kernel parameters, making the process tedious and less likely to ensure optimality. In this paper, we propose a kernel selection method within the generalized score function that automatically selects the optimal kernel that best fits the data. Specifically, we model the generative process of the variables involved in each step of the causal graph search procedure as a mixture of independent noise variables. Based on this model, we derive an automatic kernel selection method by maximizing the marginal likelihood of the variables involved in each search step. We conduct experiments on both synthetic data and real-world benchmarks, and the results demonstrate that our proposed method outperforms heuristic kernel selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Achievable Rate Maximization Pattern Design for Reconfigurable MIMO Antenna Array

arXiv

引用

arXiv 2022年

作者： Wang, Haonan Li, Ang Liu, Ya-Feng Qin, Qibo Song, Lingyang Li, Yonghui The School of Information and Communications Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China The State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Xi'An China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Wireless Network RAN Research Department Shanghai Huawei Technologies Co. Ltd. Shanghai201206 China The School of Electrical Engineering and Computer Science Peking University Beijing100871 China The School of Electrical and Information Engineering The University of Sydney SydneyNSW2006 Australia

Reconfigurable multiple-input multiple-output can provide performance gains over traditional MIMO by reshaping the channels, i.e., introducing more channel realizations. In this paper, we focus on the achievable rate maximization pattern design for reconfigurable MIMO systems. Firstly, we introduce the matrix representation of pattern reconfigurable MIMO (PR-MIMO), based on which a pattern design problem is formulated. To further reveal the effect of the radiation pattern on the wireless channel, we consider pattern design for both the single-pattern case where the optimized radiation pattern is the same for all the antenna elements, and the multi-pattern case where different antenna elements can adopt different radiation patterns. For the single-pattern case, we show that the pattern design is equivalent to a redistribution of gains among all scattering paths, and an eigenvalue optimization based solution is obtained. For the multi-pattern case, we propose a sequential optimization framework with manifold optimization and eigenvalue decomposition to obtain near-optimal solutions. Numerical results validate the superiority of PR-MIMO systems over traditional MIMO in terms of achievable rate, and also show the effectiveness of the proposed solutions. Copyright © 2022, The Authors. All rights reserved.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

The application of proximal visible and near-infrared spectroscopy to estimate soil organic matter on the Triffa Plain of Morocco

引用

International Soil and Water Conservation Research 2020年第2期8卷 195-204页

作者： Ayoub Lazaar Abdul Mounem Mouazen Kamal EL Hammouti Michael Fullen Biswajeet Pradhan Muhammad Sohail Memon Karim Andich Abdelilah Monir Laboratory of Applied Geosciences Department of GeologyFaculty of ScienceMohammed First UniversityOujdaMorocco Division of Mechatronics Biostatistics and Sensors(MeBioS)Faculty of Bioscience EngineeringKasteelpark Arenberg 30B-3001 HeverleeBelgium Faculty of Science and Engineering University of WolverhamptonWolverhamptonWV11LYUnited Kingdom Center for Advanced Modelling and Geospatial Information Systems(CAMGIS) Faculty of Engineering and Information TechnologyUniversity of Technology SydneySydney2007NSWAustralia Faculty of Agricultural Engineering Sindh Agriculture UniversityTandojam70060Pakistan Laboratory of Applied Geomatics and Soil Science National Institute of Agronomic Research(INRA)OujdaMorocco Department of Mathematics EDP and Scientific Computing TeamMoulay Ismail UniversityMéknesMorocco

Soil organic matter (SOM) is a fundamental soil constituent. The estimation of this parameter in the laboratory using the classical method is complex time-consuming and requires the use of chemical re-agents. The objectives of this study were to assess the accuracy of two laboratory measurement setups of the VIS-NIR spectroscopy in estimating SOM content and determine the important spectral bands in the SOM estimation model. A total of 115 soil samples were collected from the non-root zone (0-20 cm) of soil in the study area of the Triffa Plain and then analysed for SOM in the laboratory by the Walkley-Black method. The reflectance spectra of soil samples were measured by two protocols, Contact Probe (CP) and Pistol Grip (PG)) of the ASD spectroradiometer (350-2500 nm) in the laboratory. Partial least squares regression (PLSR) was used to develop the prediction models. The results of coefficient of determination (R2) and the root mean square error (RMSE) showed that the pistol grip offers reasonable accuracy with an R2=0.93 and RMSE=0.13 compared to the contact probe protocol with an R2=0.85 and RMSE = 0.19. The near-Infrared range were more accurate than those in the visible range for pre-dicting SOM using the both setups (CP and PG). The significant wavelengths contributing to the pre-diction of SOM for (PG) setup were at:424, 597, 1432, 1484, 1830,1920, 2200, 2357 and 2430 nm, while were at 433, 587, 1380, 1431, 1929, 2200 and 2345 nm for (CP) setup.

关键词： Soil organic matter VIS-NIR spectroscopy Reflectance spectra SOM estimation SOM analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：