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

30th International Conference on software Engineering and Data Engineering, SEDE 2021, co-located with the 34th International Conference on Computer Applications in Industry and Engineering, CAINE 2021

作者： Gabriel, Edgar Biddle, Nicholas Roos Whitmire, Shane Tran Casey, Allen Parallel Software Technologies Laboratory Department of Computer Science University of Houston HoustonTX77204-3010 United States

Converting source code from one programming language to another is a problem that occurs regularly in real life, but has attracted limited attention and has not been investigated systematically. This paper presents the challenges of translating a large source code from one high-level programming language to another, and the solutions developed to resolve these problems. Furthermore, the paper introduces a systematic classification of the occurring challenges during the translation process and elaborates on the ability to handle them without manual intervention by a programmer. A detailed performance comparison between the two language versions of the code is being performed. © 2021, EasyChair. All rights reserved.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

parallel Construction of Approximate kNN Graph

Parallel Construction of Approximate kNN Graph

引用

第11届分布式计算及其应用国际学术研讨会

作者： Dilin Wang Yanmei Zheng Jianwen Cao Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences

Building k-nearest neighbor(kNN) graphs is a necessary step in such areas as data mining and machine learning. So in this paper, we attempt to study the kNN furthermore, we first propose a parallel algorithm for approximate kNN graph construction and then apply the kNN graph to the application of clustering. Experiments show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation easier. Finally, we compare the results of agglomerative clustering methods by using our parallel algorithm to illustrate the applicability of this method.

关键词： Approximate kNN MPI/OpenMP parallel algorithms Clustering

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in computational Photography

引用

Chinese Journal of Electronics 2019年第1期28卷 1-5页

作者： DAI Qionghai WU Jiamin FAN Jingtao XU Feng CAO Xun Department of Automation Tsinghua University Beijing Key Laboratory of Multi-dimension & Multi-scale Computational Photography (MMCP) Tsinghua University School of Software Tsinghua University School of Electronic Science and Engineering Nanjing University

Traditional photography focuses on the optimization of lenses for a perfect imaging ***, with the great developments of computational resources and optical modulation devices, we can achieve more powerful imaging abilities with concise *** photography is such an emerging interdisciplinary field by incorporating computational strategy in traditional imaging system to break the limitations in various dimensions such as spectrum, time and space. Recent advances in different aspects have aroused great interests and introduced tremendous applications in biology, material science and computer vision.

关键词： computational photography Gigapixel imaging Super-resolution imaging Compressive sensing Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

The Research and Analysis of Hungarian Algorithm in the Structure Index Reduction for DAE

The Research and Analysis of Hungarian Algorithm in the Stru...

引用

第11届分布式计算及其应用国际学术研讨会

作者： Yan Zeng Xuesong Wu Jianwen Cao Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences

Modeling of complex physical systems with Modelica usually leads to the high-index differential algebraic equation system(DAE), index reduction is an important part of solving the high-index DAE. The structure index reduction algorithm is one of the popular methods, but in special cases, it fails. Combinatorial relaxation algorithm can detect and correct the breakdown situation. And the maximum weight matching of bipartite graph is an important part of the combinatorial relaxation algorithm. In order to choose the proper method for the large-scale, dense bipartite graph, this paper provides three implementations of the Hungarian algorithm. The experiment results and the theory show that the BFS single-augmented method is better than others.

关键词： Modelica Bipartite Graph DAE Hungarian Algorithm Augmenting Path

来源：评论

学校读者我要写书评

暂无评论

An Improved KM Algorithm for Computing Structural Index of DAE System

An Improved KM Algorithm for Computing Structural Index of D...

引用

第12届分布式计算及其应用国际学术研讨会

This paper proposes an improved KM algorithm to computing the structural index of linear time-invariant Differential Algebraic Equation(DAE) systems. The problem is of practical significance in index reduction based on structural index of DAE system and combinatorial relaxation theory. This improved KM algorithm combines greedy idea and classical KM algorithm. It first computes matches as much as possible using greedy technology, and then call KM algorithm to search the matches for the unmatched vertices during the step of greedy technology. The improved KM algorithm reduces the running time bound by a factor of, the number of matches searched using greedy algorithm. Generally, the time complexity is, the optimal time is.

关键词： DAE Index Reduction Structural Index Bipartite Graph Greedy KM Algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for Solving Eigenproblem

An Efficient Algorithm for Solving Eigenproblem

引用

13th International Symposium on Distributed Computing and Applications to Business,Engineering & science（DCABES 2014）

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

In this paper, we consider second order elliptic ODE eigenproblems on general grids. We construct an efficient algorithm for computing the eigenvalue by using weighted mean combination of the linear finite element method and corresponding 2nd-order finite difference *** first take the arithmetic mean of the two methods. Then we compute the quasi-optimal combined parameters for different eigenvalues to improve our efficient algorithm. The algorithm we construct convergence faster and have higher accuracy than the linear finite element method and corresponding 2nd-order finite difference method. Some numerical examples tested on both uniform meshes and nonuniform meshes are given to illustrate the computational cost of different numerical methods for solving eigenvalue *** efficiency, all the matrices use sparse storage in our algorithm.

关键词： Efficient algorithm combinatorial quasioptimal eigenproblem.

来源：评论

学校读者我要写书评

暂无评论

N-Fold Darboux Transformation and Bidirectional Solitons for Whitham-Broer-Kaup Model in Shallow Water

引用

Communications in Theoretical Physics 2010年第3期53卷 413-422页

作者：王雷高以天盖晓玲孟得新吕兴于鑫 Ministry-of-Education Key Laboratory of Fluid Mechanics and National Laboratory for Computational Fluid Dynamics Beijing University of Aeronautics and Astronautics State Key Laboratory of Software Development Environment Beijing University of Aeronautics and Astronautics School of Science Beijing University of Posts and Telecommunications

Under investigation in this paper is the Whitham-Broer-Kaup (WBK) system, which describes the dispersive long wave in shallow water. Through a variable transformation, the WBK system is casted into a general Broer-Kaup system whose Lax pair can be derived by the Ablowitz-Kaup-Newell-Segur technology. With symbolic computation, based on the aforementioned Lax pair, the N-fold Darboux transformation is constructed with a gauge transformation and the multi-soliton solutions are obtained. Finally, the elastic interactions of the two-soliton solutions (including the head-on and overtaking collisions) for the WBK system are graphically studied. Those multi-soliton collisions can beused to illustrate the bidirectional propagation of the waves in shallow water.

关键词： Whitham Broer-Kaup system Bidirectional solitons Multi-soliton solutions N-fold Darboux transformation Lax pair

来源：评论

学校读者我要写书评

暂无评论

Automatic FFT Performance Tuning on OpenCL GPUs

Automatic FFT Performance Tuning on OpenCL GPUs

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Yan Li Yunquan Zhang Haipeng Jia Guoping Long Ke Wang Laboratory of Parallel Software and Computational Science Institute of Software State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Information Science and Engineering Ocean University of China Qingdao China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China

Many fields of science and engineering, such as astronomy, medical imaging, seismology and spectroscopy, have been revolutionized by Fourier methods. The fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. The emerging class of high performance computing architectures, such as GPU, seeks to achieve much higher performance and efficiency by exposing a hierarchy of distinct memories to programmers. However, the complexity of GPU programming poses a significant challenge for programmers. In this paper, based on the Kronecker product form multi-dimensional FFTs, we propose an automatic performance tuning framework for various OpenCL GPUs. Several key techniques of GPU programming on AMD and NVIDIA GPUs are also identified. Our OpenCL FFT library achieves up to 1.5 to 4 times, 1.5 to 40 times and 1.4 times the performance of clAmdFft 1.0 for 1D, 2D and 3D FFT respectively on an AMD GPU, and the overall performance is within 90% of CUFFT 4.0 on two NVIDIA GPUs.

关键词： Graphics processing unit Instruction sets Vectors Memory management Kernel Programming

来源：评论

学校读者我要写书评

暂无评论

Darboux Transformation and Soliton Solutions for a Variable-Coefficient Modified Kortweg-de Vries Model from Fluid Mechanics, Ocean Dynamics, and Plasma Mechanics

引用

Communications in Theoretical Physics 2010年第4期53卷 673-678页

作者：盖晓玲高以天孟得新王雷孙志远吕兴冯茜王明振于鑫朱顺辉 Ministry-of-Education Key Laboratory of Fluid Mechanics and National Laboratory for Computational Fluid Dynamics Beijing University of Aeronautics and Astronautics State Key Laboratory of Software Development Environment Beijing University of Aeronautics and Astronautics School of Science Beijing University of Posts and Telecommunications

This paper is to investigate a variable-coefficient modified Kortweg-de Vries （vc-mKdV） model, which describes some situations from fluid mechanics, ocean dynamics, and plasma mechanics. By the AblowRz-Kaup-NewellSegur procedure and symbolic computation, the Lax pair of the vc-MKdV model is derived. Then, based on the aforementioned Lax pair, the Darboux transformation is constructed and a new one-soliton-like solution is obtained as weft Features of the one-soliton-like solution are analyzed and graphically discussed to illustrate the influence of the variable coefficients in the solitonlike propagation.

关键词： variable-coefficient modified Kortweg-de Vries model, Lax pair, Darboux trans brmation, soliton solutions

来源：评论

学校读者我要写书评

暂无评论

Research of register pressure aware loop unrolling optimizations for compiler 3

Research of register pressure aware loop unrolling optimizat...

引用

3rd International Conference on Circuits and Systems, CAS 2018

作者： Liu, Xuehua Ding, Liping Li, Yanfeng Chen, Guangxuan Du, Jin Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Digital Forensics Lab Institute of Software Application Technology Guangzhou and Chinese Academy of Sciences Guangzhou China Zhejiang Police College Hangzhou China Yunnan Police College Kunming China

Register pressure problem has been a known problem for compiler because of the mismatch between the infinite number of pseudo registers and the finite number of hard registers. Too heavy register pressure may results in register spilling and then leads to performance degradation. There are a lot of optimizations, especially loop optimizations suffer from register spilling in compiler. In order to fight register pressure and therefore improve the effectiveness of compiler, this research takes the register pressure into account to improve loop unrolling optimization during the transformation process. In addition, a register pressure aware transformation is able to reduce the performance overhead of some fine-grained randomization transformations which can be used to defend against ROP attacks. Experiments showed a peak improvement of about 3.6% and an average improvement of about 1% for SPEC CPU 2006 benchmarks and a peak improvement of about 3% and an average improvement of about 1% for the LINPACK benchmark. © 2018 The Authors, published by EDP sciences.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：