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

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Wang, Zewei Kong, Dechen Hu, Min Han, Ting Liu, Jun The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The China Mobile Research Institute China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Question answering methods are well-known for leveraging data bias, such as the language prior in visual question answering and the position bias in machine reading comprehension (extractive question answering). Current debiasing methods often come at the cost of significant in-distribution performance to achieve favorable out-of-distribution generalization ability, while non-debiasing methods sacrifice a considerable amount of out-of-distribution performance in order to obtain high in-distribution performance. Therefore, it is challenging for them to deal with the complicated changing real-world situations. In this paper, we propose a simple yet effective novel loss function with adaptive loose optimization, which seeks to make the best of both worlds for question answering. Our main technical contribution is to reduce the loss adaptively according to the ratio between the previous and the current optimization state on mini-batch training data. This loose optimization can be used to prevent non-debiasing methods from overlearning data bias while enabling debiasing methods to maintain slight bias learning. Experiments on the visual question answering datasets, including VQA v2, VQA-CP v1, VQA-CP v2, GQA-OOD, and the extractive question answering dataset SQuAD demonstrate that our approach enables QA methods to obtain state-of-the-art in- and out-of-distribution performance in most cases. The source code has been released publicly in https://***/reml-group/ALO. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

HSIGene: A Foundation Model for Hyperspectral Image Generation

arXiv

引用

arXiv 2024年

作者： Pang, Li Cao, Xiangyong Tang, Datao Xu, Shuang Bai, Xueru Zhou, Feng Meng, Deyu The School of Computer Science and Technology The Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China The School of Mathematics and Statistics Northwestern Polytechnical University Shaanxi Xi’an710021 China The National Laboratory of Radar Signal Processing Xidian University Xi’an710071 China The Key Laboratory of Electronic Information Countermeasure and Simulation of the Education Ministry of China Xidian University Xi’an710071 China The School of Mathematics and Statistics The Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Guangdong Guangzhou510555 China

Hyperspectral image (HSI) plays a vital role in various fields such as agriculture and environmental monitoring. However, due to the expensive acquisition cost, the number of hyperspectral images is limited, degenerating the performance of downstream tasks. Although some recent studies have attempted to employ diffusion models to synthesize HSIs, they still struggle with the scarcity of HSIs, affecting the reliability and diversity of the generated images. Some studies propose to incorporate multi-modal data to enhance spatial diversity, but spectral fidelity cannot be ensured. In addition, existing HSI synthesis models are typically uncontrollable or only support single-condition control, limiting their ability to generate accurate and reliable HSIs. To alleviate these issues, we propose HSIGene, a novel HSI generation foundation model which is based on latent diffusion and supports multi-condition control, allowing for more precise and reliable HSI generation. To enhance the spatial diversity of the training data while preserving spectral fidelity, we propose a new data augmentation method based on spatial super-resolution, in which HSIs are upscaled first, and thus abundant training patches could be obtained by cropping the high-resolution HSIs. In addition, to improve the perceptual quality of the augmented data, we introduce a novel two-stage HSI super-resolution framework, which first applies RGB bands super-resolution and then utilizes our proposed Rectangular Guided Attention network (RGAN) for guided HSI super-resolution. Experiments demonstrate that the proposed model is capable of generating a vast quantity of realistic HSIs for downstream tasks such as denoising and super-resolution. The code and models are available at https://***/LiPang/HSIGene. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

hcaPCG: A Heterogeneous and communication-avoid PCG with Jacobi preconditioner on SW26010-Pro architecture

hcaPCG: A Heterogeneous and communication-avoid PCG with Jac...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Yue Liu Li Wang Yanyan Chen Qi Liu Jingshan Pan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

Due to its efficiency and versatility, the preconditioned conjugate gradient algorithm has long been a staple in the realm of iterative linear system solvers. In this paper, we proposed an optimized preconditioned conjugate gradient algorithm tailored for the SW26010-Pro manycore processor, The main work includes: Optimizing data block sizes based on the processor’s storage structure; combining thread-level and data-level parallelism, utilizing manual SIMD to improve efficiency; optimizing the memory access pattern by employing direct memory access and overlapping of computation and communication; employing a shared-memory approach to store long vectors across all cores. Furthermore, we design an accelerated algorithm for reduction operations, to avoid data communication. Experimental results show that the hcaPCG yields up to 28.1× speedups on average compared to the original implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PIOD: An Efficient Parallel Iterative Algorithm for Solving Over-determined Equations

PIOD: An Efficient Parallel Iterative Algorithm for Solving ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Zhenguo Wei Yanlong Li Wei Du Lei Xiao Chaoshuai Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of over-determined equations plays a very important role in fields such as data fitting, signal processing, and machine learning. It is of great significance in predicting natural phenomena, optimizing engineering design, and other fields. However, there is currently no efficient method to solve over-determined equations, either being not accurate enough or consuming a lot of time. In this article, we propose a parallel iterative method for solving over-determined equations, called the PIOD algorithm. By using a sub-convergence condition to terminate the iterative calculation, we have developed a task partitioning strategy for the algorithm and implemented parallelization of the solution of over-determined equations on a distributed memory system. Our proposed algorithm achieves an average speedup of 152 ×times compared to the open-source Eigen solver. Additionally, it also achieves a parallel efficiency of over 30%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Quantum Temporal Difference Learning Method Based on Quantum World Model

A Quantum Temporal Difference Learning Method Based on Quant...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Peigen Zeng Ying He F. Richard Yu Jianbo Du College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shaanxi Key Laboratory of Information Communication Network and Security Xi’an University of Posts and Telecommunications Xi’an China School of Information Technology Carleton University Ottawa Canada

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Based on quantum parallelism theory and quantum phenomena such as superposition and entanglement, quantum reinforcement learning (QRL) has the potential to surpass classical reinforcement learning (RL). Although some excellent works have been done on QRL, existing RL methods encounter chanllenges when performing in environments with sparse rewards. In this paper, we provide a new perspective on conducting temporal difference (TD) learning in quantum computing, which can eliminate redundant exploration steps compared to classical methods. Specifically, we first use environment information to construct a world model with quantum circuits, enabling it to interact in a quantum way. Then, we perform the learning process by using the quantum world model and Grover’s algorithm to query backwards how to reach the recorded states with high TD-errors. Simulation results show that our proposed method has superior performance compared to classical RL algorithms.

关键词： Quantum entanglement Computational modeling Simulation Temporal difference learning Parallel processing Global communication Integrated circuit modeling Quantum circuit

来源：评论

学校读者我要写书评

暂无评论

Intelligent recommendation of related items based on naive bayes and collaborative filtering combination model

Intelligent recommendation of related items based on naive b...

引用

2020 International Conference on Machine Learning and Computer Application, ICMLCA 2020

作者： Wei, Wei Wang, Zhuo Fu, Changlong Damaševičius, Robertas Scherer, Rafal Wožniak, Marcin School of Computer Science and Engineering Xi'An University of Technology Xi'an710048 China Shaanxi Key Laboratory for Network Computing and Security Technology China

Nowadays, data plays a unique role in various fields. Based on the background of the era of big data, this paper collects user evaluations of certain commodities and labels the evaluations into positive emotions and negative emotions. We propose an intelligent recommendation algorithm based on Naive Bayes algorithm, which determines the user's preference for a product according to the user's opinion on a product, then uses the collaborative filtering algorithm to recommend other similar products according to the similarity between the product and other products, so as to realize the recommendation of other similar products. This can not only help users choose more goods in the environment, but also maximize the value of goods. In this paper, bayesian classifier was used for prediction, and the accuracy reached about 97%. © Published under licence by IOP Publishing Ltd.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algorithm on the New Sunway Supercomputer

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algori...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Qi Liu Yanlong Li Wei Du Zenghui Ren Yue Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of tridiagonal linear systems is used in in various fields and plays a crucial role in numerical simulations. However, there is few efficient solver for tridiagonal linear systems on the new Sunway supercomputer. Based on a three-dimensional heat conduction problem, we propose an adaptive heterogeneous tridiagonal matrix algorithm (AH-TDMA). Our major innovations include: (1) To address computational hotspots within AH-TDMA, a multi-level parallel approach involving MPI+Athread has been adopted. (2) An adaptive data partitioning scheme has been set up to achieve load balance. (3) Employing direct memory access and establishing shared space between registers and main memory, instead of employing discrete memory access, is done to enhance memory access efficiency. (4) The optimization of the loop structure has been made in adjusting the sequencing of the dual-layered loops to reduce communication overhead. The experimental results show that, with one core group, the AH-TDMA achieves a speedup of 99.6 times for hotspot and total time speedup up to 59.4 times compared to the Parallel and Scalable Library for Tridiagonal Matrix Algorithm (PaScal TDMA). The AH-TDMA is scalable up to 2048 core groups, with a parallel efficiency of 69.2%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Symbiosis Rather Than Aggregation: Towards Generalized Federated Learning via Model Symbiosis

引用

IEEE Internet of Things Journal 2025年

作者： Liu, Yuange Liu, Yuru Zhang, Weishan Zheng, Chaoqun Jiang, Wei Luo, Daobin Qiao, Qiao Meng, Lingzhao Zhao, Hongwei Yang, Su College of Computer Science and Technology Qingdao266580 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China Information Science Academy of China Electronics Technology Group Corporation Beijing100036 China Fudan University School of Computer Science Shanghai200433 China

Federated Learning (FL) faces significant challenges in scenarios with non-IID (non-independent and identically distributed) data distributions across participating clients. Traditional aggregation-based approaches often struggle with the inherent misalignment between local and global optimization objectives, leadingwhich leads to gradient divergence and suboptimal generalization performance. This paper proposes a novel FL framework that replaces conventional aggregation with a biologically inspired model symbiosis approach called FedSym, which employs a dual-level symbiotic mechanism. Ectosymbiosis performs coarse-grained hierarchical parameter recombinations through random layer-wise model combination, while endosymbiosis enables fine-grained intra-layer parameter fusion through weighted averaging, collectively steering model updates towards flatter loss landscapes. Our theoretical analysis demonstrates that FedSym's convergence rate is O(1T) under non-IID conditions, which matches the convergence properties of FedAvg. Extensive experimentsevaluations across multiple datasets and model architectures show that FedSym achieves substantial improvements over state-of-the-art FL methods, particularly in challenging scenarios with high data heterogeneity, and demonstrates robust performance across varying numbers of participating clients and federation scales. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Workflow Scheduling Method in Multi-Cluster Environments Using Tasks' Spatiotemporal Attributes

Workflow Scheduling Method in Multi-Cluster Environments Usi...

引用

Electronic Information Engineering and Computer Communication (EIECC), International Conference on

作者： Yudong Geng Jing Chen Honghua Yan Qingshui Hao Aimin Zhang Tianxiang Zhang Mingchao Ji Tonglin Fu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Shandong Greenthink Electric Power Technology Co. Ltd Jinan China

ISBN: (数字)9798331534622

ISBN: (纸本)9798331534639

Nowadays, computing resources are widely distributed and diverse, and the demand for efficient execution of various workflow tasks on wide-area resources has been raised. multi-objection scheduling method based on space-time attribute of tasks. A scheduling scheme is generated through the three stages of workflow scheduling queue generation, resource selection combined with task spatiotemporal attributes and task and resource matching, and the selected resources of workflow are run according to this scheduling scheme. This method constructs a scheduling problem model to minimize workflow completion time, cost and resource matching degree, and finds the optimal scheduling scheme to improve task execution efficiency. In the process of the experiment, the workflow is actually run in the multi-cluster environment, and the experiment proves that it has a good effect in reducing the completion time and cost of workflow.

关键词： Sequential analysis Costs Processor scheduling Filtering Optimal scheduling Scheduling Spatiotemporal phenomena

来源：评论

学校读者我要写书评

暂无评论

network Situation Awareness Model Based on Incomplete Information Game 5th

Network Situation Awareness Model Based on Incomplete Inform...

引用

5th International Conference on security and Privacy in New computing Environments, SPNCE 2022

作者： Zhang, Hongbin Yin, Yan Zhao, Dongmei Liu, Bin Wang, Yanxia Liu, Zhen School of Information Science and Engineering Hebei University of Science and Technology Shijiazhuang050000 China Hebei Key Laboratory of Network and Information Security Hebei Normal University Hebei Shijiazhuang050024 China School of Economics and Management Hebei University of Science and Technology Shijiazhuang050000 China Research Center of Big Data and Social Computing Hebei University of Science and Technology Shijiazhuang050000 China Hebei Geological Workers’ University Shijiazhuang050081 China

ISBN: (纸本)9783031306228

Game theory has been widely used in network security situational awareness. However, most of the currently proposed game-based offensive and defensive situational awareness methods are for traffic data, and there are fewer models or methods for analysis using vulnerability data. To overcome these issues, this paper proposes collecting periodic security vulnerability information in the network and utilizing the change in vulnerability status to achieve network security situational awareness. At this time, a network attack and defense game model based on incomplete information is proposed, which uses the state changes of the vulnerability life cycle to model the attack and defense behavior, calculates the benefits of both attack and defense through the evaluation of the exploitability of the vulnerability, and then quantifies the security situation value. We carried out the experiments using the vulnerability dataset, which was obtained by scanning the IP addresses of several enterprises in Hebei Province, China. The experimental results show that the approach of using network security vulnerabilities to assess network security status is feasible. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：