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

A novel image encryption algorithm based on new one-dimensional chaos and DNA coding

Multimedia Tools and Applications 2024年第36期83卷 84275-84297页

作者： Feng, Sijia Zhao, Maochang Liu, Zhaobin Li, Yuanyu Tianjin public emergency early warning information release center Tianjin Meteorology Information Center Tianjin300074 China School of Information Science & amp Technology Dalian Maritime University Dalian116026 China School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China

This paper introduces a new one-dimensional chaotic system and a new image encryption algorithm. Firstly, the new chaotic system is analyzed. The bifurcation diagram and Lyapunov exponent show that the system has strong chaotic characteristics and is suitable for the field of image encryption. The chaotic sequence generated by the system is used in image encryption, scrambled according to its sequence value, and several sequences required for DNA coding operation are generated. The encrypted image is obtained by encoding, decoding, and diffusion operation according to the sequence. The initial values and parameters of system are generated by Hash algorithm based on plain image, so it has strong sensitivity and can effectively resist attacks such as selective plaintext attack. Experimental results show that the algorithm has high security and robustness, and can resist common attacks. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Chaotic systems

来源：评论

学校读者我要写书评

暂无评论

On the Adversarial Robustness of Hierarchical Classification

On the Adversarial Robustness of Hierarchical Classification

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Wang, Ran Zeng, Simeng Wu, Wenhui Jia, Yuheng Ng, Wing W. Y. Wang, Xizhao School of Mathematical Sciences Shenzhen University Shenzhen518060 China College of Electronic and Information Engineering Shenzhen University Shenzhen518060 China School of Computer Science and Engineering Southeast University Nanjing211189 China School of Computer Science and Engineering South China University of Technology Guangzhou510006 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9781665410205

Deep neural networks (DNNs) have demonstrated remarkable success on various learning problems, but they face a formidable challenge in the form of adversarial attacks. Especially, when dealing with complex classification tasks for numerous classes with a hierarchical structure, the adversarial robustness of a DNN model may drop seriously. In this paper, we investigate the adversarial robustness of DNN models on such complex classification tasks. In response, we propose a two-stage hierarchical classification framework, which is composed of a coarse-grained classifier and a series of fine-grained classifiers. A data correction sampling module is designed between the two stages, in order to mitigate the influence of misclassification caused by the coarse-grained classifier;and a discriminative filter learning module is employed in the fine-grained classification, in order to gain better distinguish abilities among fine-grained categories. Experiments on the well-known dataset CIFAR-100 and a newly-constructed hierarchical dataset mini-ImageNet76 demonstrate that employing a hierarchical framework can effectively improve the model robustness on such complex classification tasks. © 2024 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Budget-aware Scheduling Algorithm Using Negative Offset Mechanism for Snake Optimization in Heterogeneous Cloud 22

Budget-aware Scheduling Algorithm Using Negative Offset Mech...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Zhang, Longxin Zhang, Yanfen Lu, Xiaotong Tan, Runti Huang, Xianming Chen, Jianguo Hunan University of Technology College of Computer Science Zhuzhou China Sun YatSen University School of Software Engineering Zhuhai519082 China

ISBN: (纸本)9798331509712

Cloud computing, as a cutting-edge computing paradigm, offers substantial data processing and storage capabilities. In a heterogeneous cloud environment, the diversity among cloud platforms results in varying task execution times, posing challenges in minimizing workflow makespan under budget constraints. On this basis, a novel meta-heuristic optimization algorithm, named snake optimizer (SO), is proposed for workflow scheduling in the cloud. Then, a negative offset mechanism is designed to dynamically guide the offset of individual positions during population update to prevent falling into local optimums, thereby optimizing the search for feasible solutions and improving the success rate. Finally, using the negative offset mechanism, a snake optimization budget-aware scheduling algorithm (NO-SO) is developed to schedule budget-constrained workflows in heterogeneous cloud computing environments and minimize the makespan. A series of comparative experiments conducted on real-world scientific workflows demonstrates that the NO-SO algorithm enhances the success rate in finding a feasible solution by 38.89% and 34.45% compared with the advanced MG-PRO algorithm and the original SO algorithm, respectively. Moreover, it achieves an average reduction in makespan of 30.30% and 32.19%. © 2024 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Air Pollutant (CO) Forecasting: A Hybrid Approach Using Gooseneck Barnacle Optimization and Artificial Neural Networks 4

Air Pollutant (CO) Forecasting: A Hybrid Approach Using Goos...

引用

4th IEEE International Conference on Artificial Intelligence in Cybersecurity, ICAIC 2025

作者： Ahmed, Marzia Mohamad, Ahmad Johari Hassan, Md Maruf Bhuiyan, Touhid Department of Software Engineering Dhaka Bangladesh Faculty of Electrical & Electronics Engineering Technology Malaysia Southeast University Department of Computer Science and Engineering Dhaka Bangladesh School of IT VA United States

ISBN: (纸本)9798331518882

Air quality forecasting is critical for environmental monitoring and public health, and in this study, we propose a hybrid approach utilizing Gooseneck Barnacle Optimization (GBO) and Artificial Neural Networks (ANN) to enhance predictive accuracy. The air quality dataset, comprising pollutant concentrations (CO, NOx, benzene) and meteorological factors (temperature, humidity), is sourced from the UCI Machine Learning Repository. GBO is employed to fine-tune the ANN's hyperparameters (especially the weight and bias), as well as the number of layers, neurons, and activation functions, to improve regression-based forecasting. The GBOANN model achieves a Mean Squared Error (MSE) of 0.562 and a Root Mean Squared Percentage Error (RMSPE) of 5.63%, outperforming other metaheuristic methods like BMO, SSA, DA, MVO, and EMA. This study demonstrates the GBO-ANN model's potential for accurate real-time air quality forecasting, offering a robust, sustainable solution. © 2025 IEEE.

关键词： Air Quality GBO Metaheuristic Neural Network Time series forecasting

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection via multiple graph fusion and feature weight learning

引用

science China(Information sciences) 2023年第5期66卷 56-72页

作者： Chang TANG Xiao ZHENG Wei ZHANG Xinwang LIU Xinzhong ZHU En ZHU School of Computer Science China University of Geosciences State Key Laboratory for Novel Software Technology Nanjing University School of Computer National University of Defense Technology National Supercomputing Center in Jinan Qilu University of Technology (Shandong Academy of Sciences) College of Mathematics Physics and Information Engineering Zhejiang Normal University

Unsupervised feature selection attempts to select a small number of discriminative features from original high-dimensional data and preserve the intrinsic data structure without using data labels. As an unsupervised learning task, most previous methods often use a coefficient matrix for feature reconstruction or feature projection, and a certain similarity graph is widely utilized to regularize the intrinsic structure preservation of original data in a new feature space. However, a similarity graph with poor quality could inevitably afect the final results. In addition, designing a rational and efective feature reconstruction/projection model is not easy. In this paper, we introduce a novel and efective unsupervised feature selection method via multiple graph fusion and feature weight learning（MGF2WL） to address these issues. Instead of learning the feature coefficient matrix, we directly learn the weights of diferent feature dimensions by introducing a feature weight matrix, and the weighted features are projected into the label space. Aiming to exploit sufficient relation of data samples, we develop a graph fusion term to fuse multiple predefined similarity graphs for learning a unified similarity graph, which is then deployed to regularize the local data structure of original data in a projected label space. Finally, we design a block coordinate descent algorithm with a convergence guarantee to solve the resulting optimization problem. Extensive experiments with sufficient analyses on various datasets are conducted to validate the efficacy of our proposed MGF2WL.

关键词： unsupervised feature selection graph fusion feature weight learning local structure preservation

来源：评论

学校读者我要写书评

暂无评论

Active Perception for Grasp Detection via Neural Graspness Field 38

Active Perception for Grasp Detection via Neural Graspness F...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Ma, Haoxiang Shi, Modi Gao, Boyang Huang, Di State Key Laboratory of Complex and Critical Software Environment School of Computer Science and Engineering Beihang University Beijing China Geometry Robotics

This paper tackles the challenge of active perception for robotic grasp detection in cluttered environments. Incomplete 3D geometry information can negatively affect the performance of learning-based grasp detection methods, and scanning the scene from multiple views introduces significant time costs. To achieve reliable grasping performance with efficient camera movement, we propose an active grasp detection framework based on the Neural Graspness Field (NGF), which models the scene incrementally and facilitates next-best-view planning. Constructed in real-time as the camera moves, the NGF effectively models the grasp distribution in 3D space by rendering graspness predictions from each view. For next-best-view planning, we aim to reduce the uncertainty of the NGF through a graspness inconsistency-guided policy, selecting views based on discrepancies between NGF outputs and a pre-trained graspness network. Additionally, we present a neural graspness sampling method that decodes graspness values from the NGF to improve grasp pose detection results. Extensive experiments on the GraspNet-1Billion benchmark demonstrate significant performance improvements compared to previous works. Real-world experiments show that our method achieves a superior trade-off between grasping performance and time costs. Code is available at https://***/mahaoxiang822/ActiveNGF. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparison of Standard Ant Colony Optimization, Dijkstra and A∗ Algorithms for Path Planning of Robot in an Indoor Environment 9

Comparison of Standard Ant Colony Optimization, Dijkstra and...

引用

9th International Conference on Mechanical engineering and Robotics Research, ICMERR 2025

作者： Sharan, Sudeep Ngoc Minh, Anh Tong Dominguez-Jimenez, Juan Jose Nauth, Peter Frankfurt University of Applied Sciences Faculty of Computer Science and Engineering Frankfurt am Main Germany UCASE Software Engineering Group School of Engineering University of Cádiz Cadiz Spain

ISBN: (纸本)9798331509262

The research topic of Path planning is extremely challenging area of concentration within the field of mobile robots. However, path planning algorithms for mobile robot tasks are contingent upon the environment and its level of complexity. This paper analyzes four distinct path planning methods for simulated indoor environment. The proposed algorithms include conventional Ant Colony methods, Ant System (AS), Ant Colony System (ACS), as well as standard methods Dijkstra and AStar (A*). We analyzed and examined these algorithms by employing various metrics/maps with complexity. The results indicate that the traditional path planning algorithm Dijkstra and A∗ approaches surpass the other ant colony techniques in terms of both computation time and path distance. © 2025 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A Comparative Analysis of Query Generation Methods for IoT Middleware Evaluation 17

A Comparative Analysis of Query Generation Methods for IoT M...

引用

IEEE Congress on Cybermatics: 17th IEEE International Conference on Internet of Things, iThings 2024, 20th IEEE International Conference on Green Computing and Communications, GreenCom 2024, 17th IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2024, 10th IEEE International Conference on Smart Data, SmartData 2024

作者： De Silva, Ravindi Zaslavsky, Arkady Loke, Seng W. Jayaraman, Prem Prakash Deakin University School of Information Technology Melbourne Australia Swinburne University of Technology Department of Computer Science and Software Engineering Melbourne Australia

ISBN: (纸本)9798350351637

The rapid expansion of Internet of Things (IoT) applications necessitates the demand for efficient IoT middleware platforms, especially Context Management Platforms (CMPs) for accessing real-time contextual information. Current IoT middleware evaluation methods lack accessibility, posing a significant challenge for standardized performance analysis of CMPs. This paper introduces a novel scenario-based context query generation approach for assessing the data retrieval performance of a CMP. The proposed approach enables scene creation using either IoT data or real-world images, employing both data-driven and image-driven scene generation methods. This paper presents the challenges, limitations, and applicability of each approach in scene generation through a qualitative evaluation. The scenes are transformed into scene graphs, enabling inference to identify situations. Both approaches generate queries reflecting dynamic real-world situations, allowing for random query loads to evaluate CMPs fairly. This paper validates the proposed approach using real-world IoT datasets and camera images with a focus on bicycle riding safety use cases. The evaluation provides insights into the contextual completeness of scene graph representations crucial for accurately capturing real-world situations. The proposed approach generates queries of varying complexity, with the only difference being the underlying mechanism of scenario generation, providing a streamlined and user-friendly method for evaluating the data retrieval performance of CMPs. © 2024 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Causal Label Enhancement

引用

IEEE Transactions on Knowledge and Data engineering 2025年第7期37卷 3933-3946页

作者： Liu, Xinyuan Zhu, Jihua Zheng, Qinghai Li, Zhongyu Tian, Zhiqiang Zhu, Mingchen Xi’an Jiaotong University School of Software Engineering Xi’an710049 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210008 China Fuzhou University College of Computer and Data Science Fuzhou350025 China University of California DavisCA95616 United States

Label enhancement (LE) is still a challenging task to mitigate the dilemma of the lack of label distribution. Existing LE work typically focuses on primarily formulating a projection between feature space and label distribution space from discriminative model perspective, which preserves the relevance consistency that the sign of recovered label distribution should be consistent with the logical label. Different from previous algorithms, we formulate this problem from a causal perspective and present a novel LE method via the structured causal model (LESCM). Specifically, the proposed LESCM deliberates establishing the causal graph with assuming that label distribution is a cause of feature and logical label, which naturally satisfies the definition of label distribution learning (LDL). With capturing the underlying causal relationships, we can significantly boost the interpretability and identifiability of label enhancement. Meanwhile, except for the relevance consistency, LESCM are encouraged to sustain the order consistency that assigns higher description degree of the recovered label distribution to the positive labels, as compared with the negative labels. Empirically, sufficient experiments on several label distribution learning data sets validate the effectiveness of LESCM. © 1989-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

BOAformer: Object Detection Network Based on Background-Object Attention Transformer 6

BOAformer: Object Detection Network Based on Background-Obje...

引用

6th International Conference on Communications, Information System and computer engineering, CISCE 2024

作者： Yang, Yong Liang, Chenbin Huang, Shuying Wang, Xiaozheng School of Computer Science and Technology Tiangong University Tianjin China School of Electronics and Information Engineering Tiangong University Tianjin China School of Software Tiangong University Tianjin China School of Control Science and Engineering Tiangong University Tianjin China

ISBN: (纸本)9798350353174

At present, deep learning has achieved great success in the field of object detection. To ensure that positive samples in the image are not missed, most deep-learning object detection methods set many prediction boxes and use the same prediction operation on them. Although these methods can obtain higher predictive values for high certainty objects, they may identify objects with lower certainty, such as small or fuzzy objects, as negative samples or miss them. To address this issue, this paper presents an object detection network based on background-object attention transformer (BOAformer), which improves the accuracy of object detection by establishing the relationship between background and object features. Firstly, the existing classification model is employed to obtain scores of object prediction boxes. On this basis, a scoring mechanism is designed to filter out high scoring object prediction boxes to reduce the computational complexity of the later network. Then, to improve the accuracy of object detection, BOAformer is constructed, which obtains auxiliary classification values of objects by learning the relationship between background and object features, and adds them to the initial detection results. Finally, many experiments are conducted to verify the effectiveness of BOAformer. The experimental results show that the designed network improves the accuracy of object detection and can detect small or lost objects in the background. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：