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

2023 International Conference on Remote Sensing, Mapping, and Geographic Systems, RSMG 2023

作者： Zhu, Tianxing Liu, Qin Zhang, Lixiang School of Software Engineering Tongji University Shanghai China School of Computer Science Northwestern Polytechnical University Xi’an China

ISBN: (纸本)9781510668898

The convolutional neural network (CNN) has been widely adopted in the processing of hyperspectral images (HSI) due to its remarkable capabilities in feature extraction. However, CNN-based methods for HSI classification still face the challenge of extracting spectral-spatial features that are more effective while considering all spectral bands. This paper reviews various spectral and spectral-spatial classifiers that have been developed to overcome the challenges of HSI classification, including the limitations of handcrafted features and the problems caused by spectral variability and nonlinearity. The paper proposes a novel method, the 3D ASPP Multi-Scale Feature Fusion Network (3A-MFFN), which simultaneously preserves high-resolution spatial detail information and high-level semantic information of HSI. The proposed network extracts and fuses multi-scale features for HSI classification using a multi-scale 3D ASPP convolution block to fuse different levels of feature output. The paper presents experiments and analysis to demonstrate the effectiveness of the proposed method. The results suggest that the 3A-MFFN algorithm can significantly enhance the classification accuracy of HSI with limited samples, making it a valuable contribution to the hyperspectral remote sensing community. © 2023 SPIE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Sensitive Information Protection Model Based on Bayesian Game

引用

computers, Materials & Continua 2022年第10期73卷 883-898页

作者： Yuzhen Liu Zhe Liu Xiaoliang Wang Qing Yang Guocai Zuo Frank Jiang School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan411201China Hunan Key Laboratory for Service computing and Novel Software Technology Xiangtan411201China College of computer and information engineering Hunan University of Technology and BusinessChangshaChina School of Computer Science and Information Engineering Guangzhou Maritime UniversityGuangzhouChina Hunan Software Vocational and Technical University XiangtanChina School of Engineering and IT University of New South WalesNSWAustralia

A game measurement model considering the attacker’s knowledge background is proposed based on the Bayesian game theory aiming at striking a balance between the protection of sensitive information and the quality of *** quantified the sensitive level of information according to the user’s personalized sensitive information protection *** on the probability distribution of sensitive level and attacker’s knowledge background type,the strategy combination of service provider and attacker was analyzed,and a game-based sensitive information protection model was *** the combination of strategies under Bayesian equilibrium,the information entropy was used to measure the leakage of sensitive ***,in the paper the influence of the sensitive level of information and the attacker’s knowledge background on the strategy of both sides of the game was considered *** on,the leakage of the user’s sensitive information was ***,the feasibility of the model was described by experiments.

关键词： Sensitive information game theory Bayesian equilibrium sensitive level information entropy

来源：评论

学校读者我要写书评

暂无评论

Research to Practice of Blended Learning in computer Programming Course 53

Research to Practice of Blended Learning in Computer Program...

引用

53rd IEEE ASEE Frontiers in Education International Conference, FIE 2023

作者： Zhang, Liang Chen, Tianyi Zong, Yue Zhang, Lijun School of Computer Science and Engineering Beihang University Beijing China School of Aeronautic Science and Engineering Beihang University Beijing China School of Software Beihang University Beijing China

ISBN: (纸本)9798350336429

This research to practice WIP paper presented a Blended Learning (BL) approach to teaching Data Structures and Programming in Python (DSPP) course. This approach increased students' learning engagement, academic performance, and course satisfaction. There is an intense need to study the BL approach in higher education, especially during the COVID-19 epidemic. Although BL pedagogy has achieved great success in college, there needs to be more quantitative research and practice in the computer programming course. This paper takes the DSPP course as an example to introduce the BL approach in detail. First, we designed the BL process for the computer programming course, which includes specific pre-class, in-class, and after-class activities. Second, we divide a course's knowledge and BL activities into remember, understand, apply, analyze, evaluate, and create levels according to Bloom's Taxonomy. So the knowledge and activities can be corresponding according to the cognitive level. We take a chapter in the DSPP course as an example to introduce it in detail. Third, to support the efficient implementation of BL activities, we have designed and developed several online learning systems, including an Online Judge system (OJ), Question&Anwser website (Q&A), and Peer Review Studio (PRS). To assess the effectiveness of the BL approach, we conducted the study at the DSPP course for undergraduate students in 2021 and 2023. In 2021, we taught the DSPP course in traditional pedagogy. In 2023, we began to implement BL pedagogy. By analyzing students' learning data, we compared the effect of the two pedagogy. We use the nonparametric independent-samples Kruskal-Wallis test to measure the changes in learning engagement, course performance, and student satisfaction. The results show that they were significantly improved in 2022. The course questionnaire of 2022 shows that most students prefer the BL approach. © 2023 IEEE.

关键词： Active Learning Blended Learning Bloom's Taxonomy computer programming Online Learning System

来源：评论

学校读者我要写书评

暂无评论

A quantum federated learning framework for classical clients

引用

science China(Physics,Mechanics & Astronomy) 2024年第5期67卷 1-10页

作者： Yanqi Song Yusen Wu Shengyao Wu Dandan Li Qiaoyan Wen Sujuan Qin Fei Gao State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 00876China Department of Physics The University of Western AustraliaPerthWA 6009Australia School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing100876China

Quantum federated learning(QFL)enables collaborative training of a quantum machine learning(QML)model among multiple clients possessing quantum computing capabilities,without the need to share their respective local ***,the limited availability of quantum computing resources poses a challenge for each client to acquire quantum computing *** raises a natural question:Can quantum computing capabilities be deployed on the server instead?In this paper,we propose a QFL framework specifically designed for classical clients,referred to as CC-QFL,in response to this *** each iteration,the collaborative training of the QML model is assisted by the shadow tomography technique,eliminating the need for quantum computing capabilities of ***,the server constructs a classical representation of the QML model and transmits it to the *** clients encode their local data onto observables and use this classical representation to calculate local *** local gradients are then utilized to update the parameters of the QML *** evaluate the effectiveness of our framework through extensive numerical simulations using handwritten digit images from the MNIST *** framework provides valuable insights into QFL,particularly in scenarios where quantum computing resources are scarce.

关键词： client server quantum

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Self-supervised Hypergraph Transformer with Alignment and Uniformity for Recommendation

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2024年第3期51卷 292-300页

作者： Yang, XianFeng Liu, Yang School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan China School of computer Science and Software Engineering University of Science and Technology Liaoning Anshan China

Graph neural networks have proven their effectiveness for user-item interaction graph collaborative filtering. However, most of the existing recommendation models highly depended on abundant and high-quality datasets and neglected the alignment and uniformity of embedding representation. The noisy and skewed distribution of data from real-world applications is ubiquitous. The alignment and uniformity are crucial for representation learning. In this paper, we propose SHTAU (self-supervised hypergraph transformer with alignment and uniformity for the recommendation) to address the problem. Specifically, we first perform a graph neural network on the user-item interaction graph, then captures the global collaboration relationship between users and items through the hypergraph transformer structure, and use the extracted global information to generate self-supervised signals for data enhancement on the user-item interaction graph to enhance the robustness of the recommendation algorithm. Simultaneously, alignment and uniformity auxiliary task update embeddings from different angles to improve performance. Extensive experiments are conducted on Yelp, Gowalla, MovieLens, Amazon-book and Tmall datasets. The experimental results show that SHTAU has obvious advantages over the baseline methods. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：