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

FACNet: Feature alignment fast point cloud completion network

Computational Visual Media 2025年第1期11卷 141-157页

作者： Xinxing Yu Jianyi Li Chi-Chong Wong Chi-Man Vong Yanyan Liang School of Computer Science and Engineering Faculty of Innovation EngineeringMacao University of Science and TechnologyTaipaMacaoChina Faculty of Science and Technology University of MacaoTaipaMacaoChina

Point cloud completion aims to infer complete point clouds based on partial 3D point cloud *** previous methods apply coarseto-fine strategy networks for generating complete point ***,such methods are not only relatively time-consuming but also cannot provide representative complete shape features based on partial *** this paper,a novel feature alignment fast point cloud completion network(FACNet)is proposed to directly and efficiently generate the detailed shapes of *** aligns high-dimensional feature distributions of both partial and complete point clouds to maintain global information about the complete *** its decoding process,the local features from the partial point cloud are incorporated along with the maintained global information to ensure complete and time-saving generation of the complete point *** results show that FACNet outperforms the state-of-theart on PCN,Completion3D,and MVP datasets,and achieves competitive performance on ShapeNet-55 and KITTI ***,FACNet and a simplified version,FACNet-slight,achieve a significant speedup of 3–10 times over other state-of-the-art methods.

关键词： 3D point clouds shape completion geometry processing deep learning

来源：评论

学校读者我要写书评

暂无评论

Weighted rank aggregation based on ranker accuracies for feature selection

引用

Soft Computing 2025年第4期29卷 1981-2001页

作者： Abdolrazzagh-Nezhad, Majid Kherad, Mahdi Faculty of Engineering Department of Computer Engineering Bozorgmehr University of Qaenat Qaen Iran Department of Computer Science Faculty of Computer and Industrial Engineering Birjand University of Technology Birjand Iran Faculty of Engineering Department of Computer Engineering University of Qom Qom Iran

Rank aggregation is the combination of several ranked lists from a set of candidates to achieve a better ranking by combining information from different sources. In feature selection problem, due to the heterogeneity of methods, there are some base rankers (Filter-based methods) that are of diverse quality and usually the ground truth of ratings is not available. Existing rank aggregation methods that take the diverse quality of base rankers into account do not have any explicit approach for appropriate weighting, require prior assumptions, and suffers from high computational complexity. In this paper, to overcome these challenges, an efficient unsupervised method is introduced for estimating the base rankers’ qualities and aggregating the rankers based on the estimated weights. We first compute the ratio of disagreement between base rankers in ordering different element pairs and then estimate the accuracies in a way that to minimize the discrepancy between these computed ratios and their analytical counterparts. We use the weighted majority voting method for obtaining the aggregated results. To resolve the probable inconsistencies in the final aggregation, the result is formed as a graph, and a greedy algorithm is used to find an acyclic subgraph with the highest weigh. To demonstrate the performance of the proposed method, nine standard UCI datasets are used. The obtained results by the proposed method have higher values of classifier measures than the existing baseline Feature Selection methods and rank aggregation-based multi-filter methods in the most datasets. The experiments show that rank aggregation-based Feature Selection methods outperform individual methods. The proposed method also shows the weight of each Filter-based Feature Selection method, in which the MRMR method has a higher weight than other methods. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Impact of machine learning-based imputation techniques on medical datasets- a comparative analysis

引用

Multimedia Tools and Applications 2025年第9期84卷 5905-5925页

作者： Tiwaskar, Shweta Rashid, Mamoon Gokhale, Prasad Department of Computer Engineering Faculty of Science and Technology Vishwakarma University Pune India

In the realm of medical datasets, particularly when considering diabetes, the occurrence of data incompleteness is a prevalent issue. Unveiling valuable patterns through medical data analysis is crucial for early and precise medical predictions. However, the quality of data and the proper handling of missing data hold significant significance. To address this challenge, imputation stands as a robust approach. The main goal of this paper aims to provide a comprehensive investigation into the effects brought about by Machine Learning (ML) based imputation techniques, specifically K Nearest Neighbor Imputation (KNNI), Multiple Imputation by Chained Equations (MICE), and MissForest. Results of all three techniques are compared with the complete dataset for five missing rates (10% to 50%), and evaluated using four categories of evaluation criteria i.e. (1) model performance, (2) imputation error rate (Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), Coefficient of Determination (R^2) values), (3) Pearson correlation analysis and, (4) model selection basis (Bayesian information criterion (BIC), Akaike information criterion (AIC), values). Model performance includes accuracy, precision, recall, F1 score, and Matthews Correlation Coefficient (Mcoff) score of four ML classifiers viz. (a) Random Forest (RF), (b) Support vector machine (SVM), (c) AdaBoost, (d) XGBoost (XGB). For all missing rate cases, the MissForest technique is better than the KNNI and MICE in accuracy and Mcoff in 80% of cases, precision in 40% of cases, recall in 60% of cases, F1 score, MAE, RMSE, R^2 in 100% of cases, AIC in 80% of cases, and BIC values in 100% of cases. Also, the correlation analysis confirms that the MissForest imputation preserves association between the variables, like the complete dataset. Overall, our findings suggest that MissForest is a better machine learning-based imputation technique for handling missing data in diabetes research. © The Author(s), under exclusive lice

关键词： Adaptive boosting

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

Science China(Information Sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Research Progress in Solar Flare Prediction Methods

引用

Research in Astronomy and Astrophysics 2025年第3期25卷 280-309页

作者： Ke Han Zhen Liu Xian-Yi Zhao Yi-Fei Li De-Quan Zheng Jie Wan School of Computer and Information Engineering Harbin University of Commerce Faculty of Computing Harbin Institute of Technology School of Energy Science and Engineering Harbin Institute of Technology

Solar flares are one of the strongest outbursts of solar activity,posing a serious threat to Earth’s critical infrastructure,such as communications,navigation,power,and ***,it is essential to accurately predict solar flares in order to ensure the safety of human ***,the research focuses on two directions:first,identifying predictors with more physical information and higher prediction accuracy,and second,building flare prediction models that can effectively handle complex observational *** terms of flare observability and predictability,this paper analyses multiple dimensions of solar flare observability and evaluates the potential of observational parameters in *** flare prediction models,the paper focuses on data-driven models and physical models,with an emphasis on the advantages of deep learning techniques in dealing with complex and high-dimensional *** reviewing existing traditional machine learning,deep learning,and fusion methods,the key roles of these techniques in improving prediction accuracy and efficiency are *** prevailing challenges,this study discusses the main challenges currently faced in solar flare prediction,such as the complexity of flare samples,the multimodality of observational data,and the interpretability of *** conclusion summarizes these findings and proposes future research directions and potential technology advancement.

关键词： (Sun:) sunspots magnetohydrodynamics (MHD) Sun: activity Sun: flares Sun: magnetic fields

来源：评论

学校读者我要写书评

暂无评论

VoteDroid: a new ensemble voting classifier for malware detection based on fine-tuned deep learning models

引用

Multimedia Tools and Applications 2025年第12期84卷 10923-10944页

作者： Bakır, Halit Faculty of Engineering and Natural Sciences Department of Computer Engineering Sivas University of Science and Technology Sivas Turkey

In this work, VoteDroid a novel fine-tuned deep learning models-based ensemble voting classifier has been proposed for detecting malicious behavior in Android applications. To this end, we proposed adopting the random search optimization algorithm for deciding the structure of the models used as voter classifiers in the ensemble classifier. We specified the potential components that can be used in each model and left the random search algorithm taking a decision about the structure of the model including the number of each component that should be used and its location in the structure. This optimization method has been used to build three different deep learning models namely CNN-ANN, pure CNN, and pure ANN. After selecting the best structure for each DL model, the selected three models have been trained and tested using the constructed image dataset. Afterward, we suggested hybridizing the fine-tuned three deep-learning models to form one ensemble voting classifier with two different working modes namely MMR (Malware Minority Rule) and LMR (Label Majority Rule). To our knowledge, this is the first time that an ensemble classifier has been fine-tuned and hybridized in this way for malware detection. The results showed that the proposed models were promising, where the classification accuracy exceeded 97% in all experiments. © The Author(s) 2024.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence-inspired comprehensive framework for desertification prediction

International Journal of Cognitive Computing in Engineering

引用

International Journal of Cognitive Computing in engineering 2025年 6卷 462-476页

作者： Alsubai, Shtwai Mosleh, Mogeeb A.A. Al-Hadhrami, Suheer A. Bhatia, Munish College of Computer Engineering and Sciences Prince Sattam bin Abdulaziz University Alkharj Saudi Arabia Faculty of Engineering & Computing University of Science & Technology Aden Yemen Faculty of Engineering and Information Technology Taiz Univeristy Taiz Yemen Department of Computer Engineering College of Engineering Al Mukalla Hadhramout Yemen Department of Computer Applications National Institute of Technology Kurukshetra India

Desertification greatly affects land deterioration, farming efficiency, economic growth, and health, especially in Gulf nations. Climate change has worsened desertification, making developmental issues in the area even more difficult. This research presents an enhanced framework utilizing the Internet of Things (IoT) for ongoing monitoring, data gathering, and analysis to evaluate desertification patterns. The framework utilizes Bayesian Belief Networks (BBN) to categorize IoT data, while a low-latency processing method on edge computing platforms enables effective detection of desertification trends. The classified data is subsequently analyzed using an Artificial Neural Network (ANN) optimized with a Genetic Algorithm (GA) for forecasting decisions. Using cloud computing infrastructure, the ANN-GA model examines intricate data connections to forecast desertification risk elements. Moreover, the Autoregressive Integrated Moving Average (ARIMA) model is employed to predict desertification over varied time intervals. Experimental simulations illustrate the effectiveness of the suggested framework, attaining enhanced performance in essential metrics: Temporal Delay (103.68 s), Classification Efficacy—Sensitivity (96.44 %), Precision (95.56 %), Specificity (96.97 %), and F-Measure (96.69 %)—Predictive Efficiency—Accuracy (97.76 %) and Root Mean Square Error (RMSE) (1.95 %)—along with Reliability (93.73 %) and Stability (75 %). The results of classification effectiveness and prediction performance emphasize the framework's ability to detect high-risk zones and predict the severity of desertification. This innovative method improves the comprehension of desertification processes and encourages sustainable land management practices, reducing the socio-economic impacts of desertification and bolstering at-risk ecosystems. The results of the study hold considerable importance for enhancing regional efforts in combating desertification, ensuring food security, and formulatin

关键词： Life on land Climate action Desertification Internet of things Artificial neural network

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm for Accelerating Modular Exponentiation with Periodic Bit Pattern Exponents

引用

KSII Transactions on Internet and Information Systems 2025年第4期19卷 1267-1285页

作者： Somsuk, Kritsanapong Panit, Nirundon Phromloungsri, Ravee Department of Computer and Communication Engineering Faculty of Technology and Engineering Udon Thani Rajabhat University UDRU Udon Thani Thailand

This paper presents a novel approach to improve the efficiency of modular exponentiation computation. In fact, modular exponentiation is essential in public key cryptography, as it can be applied to many algorithms, including RSA, which has been selected for the implementation in this study. In addition, Periodic Left-to-Right Binary Exponentiation (PLR-BE) is introduced, utilizing exponents characterized by periodic bit patterns to reduce the modular multiplication operations. In fact, the proposed method improves the conventional binary exponentiation algorithm by leveraging the repetitive nature of periodic bit patterns, enabling the reutilization of results and thus reducing computational overhead. The implementation of PLR-BE is demonstrated in conjunction with the Chinese Remainder Theorem (CRT) in RSA. This algorithm is called Modified RSA with Periodic Patterns of Sub-private Keys (MRSA-PP). The experimental results show that PLR-BE outperforms the compared techniques, including Left-to-Right Binary Exponentiation (LR-BE) and Right-to-Left Binary Exponentiation (RL-BE), particularly for exponents with high Hamming weights. The efficiency improvements are especially pronounced in the decryption phase of the MRSA-PP. Although, the proposed method does not reduce key sizes, it substantially decreases the time to complete the computation. Furthermore, the proposed method is adaptable and can be applied to other algorithms requiring modular exponentiation for the computation to decrease computation resources. Copyright © 2025 KSII.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

JLOS: a Cooperative UAV-Based Optical Wireless Communication With Multi-Agent Reinforcement Learning

引用

IEEE Transactions on Network and Service Management 2025年第2期22卷 1345-1356页

作者： Liu, Jiangang Luo, Hanjiang Tao, Hang Liu, Jiahong Zhou, Jiehan Shandong University of Science and Technology College of Computer Science and Engineering Qingdao China University of Oulu Faculty of Information Technology and Electrical Engineering Oulu Finland

In maritime Internet of Things (IoT) systems, leveraging a swarm of Unmanned Aerial Vehicles (UAVs) and optical communication can achieve a variety of potential maritime missions. However, due to the high directionality of the optical beam and interference from the marine environment, the optical link via UAVs as relays is prone to interruption. To address this challenge, we propose a Joint Link Optimization Scheme (JLOS) that includes Wind Disturbance Resistance (WDR) and Adaptive Beamwidth Adjustment (ABA). In WDR, we first model the problem as a Partially Observed Markov Decision Process (POMDP), and then design a collaborative Multi-Agent Reinforcement Learning (MARL) approach to control a swarm of UAVs in windy conditions, to maintain mechanical stability and prevent link interruption. Furthermore, in ABA, to reduce uncertainties from control activities and environmental factors like sunlight and fog, we design an adaptive algorithm using distributed MARL. It adjusts beamwidth based on historical UAV locations and link Bit Error Ratio (BER) to improve communication reliability. Numerical simulations confirm its effectiveness in enhancing robust data transmission. © 2004-2012 IEEE.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust security risk estimation for android apps using nearest neighbor approach and hamming distance

引用

Soft Computing 2025年第2期29卷 593-611页

作者： Deypir, Mahmood Zoughi, Toktam Faculty of Computer Engineering Shahid Sattari Aeronautical University of Science and Technology Tehran Iran Tehran Iran

Nowadays, Android-based devices such as smart phones, tablets, smart watches, and virtual reality headsets have found increasing use in our daily lives. Along with the development of various applications for these devices, new malicious apps are released by intruders, which are more difficult to identify and deal with because they exploit more sophisticated techniques. Although methods have been provided to calculate the security risk and identify malicious apps in Android operating system, but with the expansion of the level and depth of the threats, the need for more effective methods in this context is still required. In this paper, we have devised a new algorithm to calculate the security risk of Android apps, which can be used to identify malicious apps from benign ones. In this algorithm, to estimate the security risk of an unknown input app, its nearest neighbors to malicious apps and its nearest neighbors to normal apps are computed separately using Hamming distance. Then, the security risk of the input app can be computed using a simple formulation. After implementing this algorithm, its parameter for the number of neighbors using various real datasets is adjusted. The extensive experiments conducted on these data show the superiority of the proposed method over the previously proposed ones in terms of detection rate. Our additional experimentations show the robustness of the proposed algorithm in adversarial situations. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：