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

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huirong Zhang Jianwen Cao Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781509032068

In this paper, a preconditioning algorithm for sparse, symmetric, diagonally dominant (SDD) linear systems is proposed by using combinatorial techniques. Firstly, we construct preconditioners by finding a subgraph based on the relationship between SDD matrices and undirected graphs. The subgraph is built by augmenting a low-stretch spanning tree with some extra high stretch edges. Then we implement the algorithm for building a low stretch tree and give a parallel implementation of the subgraph preconditioning algorithm based on PETSc software. Finally, numerical experiments arising from both elliptic PDEs and Laplacian systems of network graphs are tested to evaluate the performance of our algorithm. Numerical experiments show that preconditioners constructed by our algorithm are more efficient than incomplete Choleskey factorization preconditioners and Vaidya's preconditioners. Besides, based on the tree structure, our preconditioners perform respectable parallel scalability.

关键词： Laplace equations Symmetric matrices Linear systems software algorithms software Buildings Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Pinning consensus analysis of multi-agent networks with arbitrary topology

引用

Chinese Physics B 2013年第9期22卷 183-189页

作者：纪良浩廖晓峰陈欣 State Key Laboratory of Power Transmission Equipment & System Security and New Technology College of Computer ScienceChongqing University Chongqing key Laboratory of Computational Intelligence (Chongqing University of Posts and Telecommunications) School of Software Engineering Chongqing University

In this paper the pinning consensus of multi-agent networks with arbitrary topology is investigated. Based on the properties of M-matrix, some criteria of pinning consensus are established for the continuous multi-agent network and the results show that the pinning consensus of the dynamical system depends on the smallest real part of the eigenvalue of the matrix which is composed of the Laplacian matrix of the multi-agent network and the pinning control gains. Meanwhile, the relevant work for the discrete-time system is studied and the corresponding criterion is also obtained. Particularly, the fundamental problem of pinning consensus, that is, what kind of node should be pinned, is investigated and the positive answers to this question are presented. Finally, the correctness of our theoretical findings is demonstrated by some numerical simulated examples.

关键词： multi-agent pinning control consensus synchronization

来源：评论

学校读者我要写书评

暂无评论

Optimizing SpMV for diagonal sparse matrices on GPU

Optimizing SpMV for diagonal sparse matrices on GPU

引用

40th International Conference on parallel Processing, ICPP 2011

作者： Sun, Xiangzheng Zhang, Yunquan Wang, Ting Zhang, Xianyi Yuan, Liang Rao, Li Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769545103

Sparse Matrix-Vector multiplication (SpMV) is an important computational kernel in scientific applications. Its performance highly depends on the nonzero distribution of sparse matrices. In this paper, we propose a new storage format for diagonal sparse matrices, defined as Compressed Row Segment with Diagonal-pattern (CRSD). In CRSD, we design diagonal patterns to represent the diagonal distribution. As the Graphics Processing Units (GPUs) have tremendous computation power and OpenCL makes them more suitable for the scientific computing, we implement the SpMV for CRSD format on the GPUs using OpenCL. Since the OpenCL kernels are complied at runtime, we design the code generator to produce the codelets for all diagonal patterns after storing matrices into CRSD format. Specifically, the generated codelets already contain the index information of nonzeros, which reduces the memory pressure during the SpMV operation. Furthermore, the code generator also utilizes property of memory architecture and thread schedule on the GPUs to improve the performance. In the evaluation, we select four storage formats from prior state-of-the-art implementations (Bell and Garland, 2009) on GPU. Experimental results demonstrate that the speedups reach up to 1.52 and 1.94 in comparison with the optimal implementation of the four formats for the double and single precision respectively. We also evaluate on a two-socket quad-core Intel Xeon system. The speedups reach up to 11.93 and 12.79 in comparison with CSR format under 8 threads for the double and single precision respectively. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Guided Spatio-Temporal Learning Method for 4K Video Super-Resolution 5

Guided Spatio-Temporal Learning Method for 4K Video Super-Re...

引用

5th ACM International Conference on Multimedia in Asia, MMAsia 2023

作者： Jiang, Qin Wang, Qinglin Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology China

ISBN: (纸本)9798400702051

4K Video Super-Resolution (VSR) presents a challenging task in video processing, as most existing VSR models have high computational complexity, limiting their application to high-resolution videos, particularly for 4K resolution videos. To address this issue, we propose a novel Guided Spatio-Temporal Video Super-Resolution network (GST-VSR) designed to perform 4K VSR on a single GPU. The proposed method comprises two key components: the Spatio-Temporal Alignment Network (STAN) and the Super-resolution Reconstruction Network (SRN), which work together to enhance the quality of the output frames. The STAN is responsible for extracting highly relevant features in frames and aligning the reference frame with the neighboring frames at the feature level to maintain temporal consistency. The SRN fuses high-quality features into the final high-resolution frames. Unlike existing methods, our proposed approach does not require explicit optical flow estimation, making it more efficient and less computationally demanding. To facilitate the training and testing of the compared models, we have established a new dataset, Pixabay-Set, consisting of 145 videos suitable for the 4K VSR task. Experimental results on the test dataset show that the proposed method achieves competitive performance compared to state-of-the-art models. In summary, our proposed GST-VSR network provides an effective solution to the challenging task of 4K VSR. © 2023 Copyright held by the owner/author(s).

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Rank-Then-Score: Enhancing Large Language Models for Automated Essay Scoring

arXiv

引用

arXiv 2025年

作者： Cai, Yida Liang, Kun Lee, Sanwoo Wang, Qinghan Wu, Yunfang MOE Key Laboratory of Computational Linguistics Peking University China School of Software and Microelectronics Peking University China School of Computer Science Peking University China School of Artificial Intelligence Beijing Normal University China

In recent years, large language models (LLMs) achieve remarkable success across a variety of tasks. However, their potential in the domain of Automated Essay Scoring (AES) remains largely underexplored. Moreover, compared to English data, the methods for Chinese AES is not well developed. In this paper, we propose Rank-Then-Score (RTS), a fine-tuning framework based on large language models to enhance their essay scoring capabilities. Specifically, we fine-tune the ranking model (Ranker) with feature-enriched data, and then feed the output of the ranking model, in the form of a candidate score set, with the essay content into the scoring model (Scorer) to produce the final score. Experimental results on two benchmark datasets, HSK and ASAP, demonstrate that RTS consistently outperforms the direct prompting (Vanilla) method in terms of average QWK across all LLMs and datasets, and achieves the best performance on Chinese essay scoring using the HSK dataset. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

C1-Conforming Quadrilateral Spectral Element Method for Fourth-Order Equations

引用

Communications on Applied Mathematics and Computation 2019年第3期1卷 403-434页

作者： Huiyuan Li Weikun Shan Zhimin Zhang State Key Laboratory of Computer Science/Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100190China School of Science Henan University of TechnologyZhengzhou 450001HenanChina Beijing Computational Science Research Center Beijing 100193China Department of Mathematics Wayne State UniversityDetroitMI 48202USA

This paper is devoted to Professor Benyu Guo's open question on the C1-conforming quadrilateral spectral element method for fourth-order equations which has been endeavored for years. Starting with generalized Jacobi polynomials on the reference square, we construct the C1-conforming basis functions using the bilinear mapping from the reference square onto each quadrilateral element which fall into three categories-interior modes, edge modes, and vertex modes. In contrast to the triangular element, compulsively compensatory requirements on the global C1-continuity should be imposed for edge and vertex mode basis functions such that their normal derivatives on each common edge are reduced from rational functions to polynomials, which depend on only parameters of the common edge. It is amazing that the C1-conforming basis functions on each quadrilateral element contain polynomials in primitive variables, the completeness is then guaranteed and further confirmed by the numerical results on the Petrov-Galerkin spectral method for the non-homogeneous boundary value problem of fourth-order equations on an arbitrary quadrilateral. Finally, a C1-conforming quadrilateral spectral element method is proposed for the biharmonic eigenvalue problem, and numerical experiments demonstrate the effectiveness and efficiency of our spectral element method.

关键词： Quadrilateral spectral element method Fourth-order equations Mapped polynomials C1-conforming basis Polynomial inclusion Completeness

来源：评论

学校读者我要写书评

暂无评论

Design and optimization of a SiC thermal emitter/absorber composed of periodic microstructures based on a non-linear method

引用

Chinese Physics B 2015年第9期24卷 276-283页

作者：王卫杰赵振国赵艺周海京符策基 Institute of Applied Physics and Computational Mathematics Software Center for High Performance Numerical Simulation of CAEP Complicated Electromagnetic Environment Laboratory of CAEP LTCS and Department of Mechanics and Engineering Science College of EngineeringPeking University

Spectral and directional control of thermal emission based on excitation of confined electromagnetic resonant modes paves a viable way for the design and construction of microscale thermal emitters/absorbers. In this paper, we present numerical simulation results of the thermal radiative properties of a silicon carbide（Si C） thermal emitter/absorber composed of periodic microstructures. We illustrate different electromagnetic resonant modes which can be excited with the structure,such as surface phonon polaritons, magnetic polaritons and photonic crystal modes, and the process of radiation spectrum optimization based on a non-linear optimization algorithm. We show that the spectral and directional control of thermal emission/absorption can be efficiently achieved by adjusting the geometrical parameters of the structure. Moreover, the optimized spectrum is insensitive to 3% dimension modification.

关键词： silicon carbide radiative heat transfer photonic crystal optimization method

来源：评论

学校读者我要写书评

暂无评论

An insightful program performance tuning chain for GPU computing

An insightful program performance tuning chain for GPU compu...

引用

12th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2012

作者： Jia, Haipeng Zhang, Yunquan Long, Guoping Yan, Shengen Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China College of Information Science and Engineering Ocean University of China China State Key Laboratory of Computing Science Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642330773

It is challenging to optimize GPU kernels because this progress requires deep technical knowledge of the underlying hardware. Modern GPU architectures are becoming more and more diversified, which further exacerbates the already difficult problem of performance optimization. This paper presents an insightful performance tuning chain for GPUs. The goal is to help non-expert programmers with limited knowledge of GPU architectures implement high performance GPU kernels directly. We achieve it by providing performance information to identify GPU program performance bottlenecks and decide which optimization methods should be adopted, so as to facilitate the best match between algorithm features and underlying hardware characteristics. To demonstrate the usage of tuning chain, we optimize three representative GPU kernels with different compute intensity: Matrix Transpose, Laplace Transform and Integral on both NVIDIA and AMD GPUs. Experimental results demonstrate that under the guidance of our tuning chain, performance of those kernels achieves 7.8~42.4 times speedup compared to their naïve implementations on both NVIDIA and AMD GPU platforms. © 2012 Springer-Verlag.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

UniDegree: A GPU-based graph representation for SSSP 15th

UniDegree: A GPU-based graph representation for SSSP

引用

15th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2015

作者： Zhang, Changyou Wang, Feng Huang, Kun Liu, Zhiyou Chen, Yifeng Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing100190 China HCST Key Lab School of EECS Peking University Beijing100085 China School of Computer Beijing Institute of Technology Beijing100081 China

ISBN: (纸本)9783319271217

GPU is the mainstream co-processor computers of heterogeneous architecture. parallel graph algorithms are fundamental for many data-driven applications to be solved on heterogeneous clusters. SSSP (Single Source Shortest Path) algorithm is one of the most important one. We proposed a graph representation structure with unified vertex’s degree. This method ensures the data block size consistency. And then, the transferring in memory on this representation makes the data reading in cohesion for CUDA thread blocks. Thirdly, vertex renumbering optimizes the locality of graph vertices to make the relaxing operation more efficient. With data of New York road, we implemented SSSP algorithms of delta-stepping on Nvida Tesla K20x GPU device. The experimental results show that the best unified-degree is approximate to the mode of vertex-degree of the graph. For example of the New York road map, all degrees were unified into 4-degree that results to the biggest speed-up of SSSP algorithm. © Springer International Publishing Switzerland 2015.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Investigating the Existence of Holey Latin Squares via Satisfiability Testing 20th

Investigating the Existence of Holey Latin Squares via Sa...

引用

20th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2023

作者： Liu, Minghao Han, Rui Jia, Fuqi Huang, Pei Ma, Feifei Zhang, Hantao Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China Stanford University StanfordCA United States Computer Science Department The University of Iowa Iowa CityIA52242 United States University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819970216

Holey Latin square (HLS) is a special combinatorial design of interest to mathematicians and is helpful in the construction of many important structures in design theory. In this paper, we investigate the existence of HLSs satisfying the seven kinds of identities with automated reasoning techniques. We formulate this problem as propositional logic formulae. Since state-of-the-art SAT solvers have difficulty solving many HLS problems, we further propose a symmetry breaking method, called partially ordered HLS (POHLS), to eliminate isomorphic solutions. We have achieved the following goals through experimental evaluation. First, we have solved a dozen of open problems interested by mathematicians. Second, we identify the impact of different encodings. Third, we demonstrate the advantages of SAT solver over other FOL-based solvers. Fourth, we show that the proposed POHLS reduction can improve the efficiency of solving and find the complementarity between two types of symmetry breaking techniques. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：