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

arXiv 2023年

作者： Wang, Zhichao Chen, Xinhai Yan, Junjun Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology National University of Defense Technology Changsha410073 China

In CFD, mesh smoothing methods are commonly utilized to refine the mesh quality to achieve high-precision numerical simulations. Specifically, optimization-based smoothing is used for high-quality mesh smoothing, but it incurs significant computational overhead. Pioneer works improve its smoothing efficiency by adopting supervised learning to learn smoothing methods from high-quality meshes. However, they pose difficulty in smoothing the mesh nodes with varying degrees and also need data augmentation to address the node input sequence problem. Additionally, the required labeled high-quality meshes further limit the applicability of the proposed method. In this paper, we present GMSNet, a lightweight neural network model for intelligent mesh smoothing. GMSNet adopts graph neural networks to extract features of the node's neighbors and output the optimal node position. During smoothing, we also introduce a fault-tolerance mechanism to prevent GMSNet from generating negative volume elements. With a lightweight model, GMSNet can effectively smoothing mesh nodes with varying degrees and remain unaffected by the order of input data. A novel loss function, MetricLoss, is also developed to eliminate the need for high-quality meshes, which provides a stable and rapid convergence during training. We compare GMSNet with commonly used mesh smoothing methods on two-dimensional triangle meshes. The experimental results show that GMSNet achieves outstanding mesh smoothing performances with 5% model parameters of the previous model, and attains 13.56 times faster than optimization-based smoothing. © 2023, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

The dynamic allocation model for the resources of cloud services delivery networks

引用

Jisuanji Xuebao/Chinese Journal of Computers 2011年第12期34卷 2305-2318页

作者： Shi, Pei-Chang Wang, Huai-Min Yin, Gang Liu, Xue-Ning Yuan, Xiao-Qun Shi, Dian-Xi National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology Changsha 410073 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Electronics and Information Engineering Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

Cloud Services Delivery Networks (CSDN) constructs a layer distributed server overlay over the Internet, which uses the way to the nearest and on-demand approach providing services to end users. Facing the scale and diversification of the resource demand characteristics of the Internet cloud services, CSDN forms different logical sub-server overlay for different kinds of cloud services. However, most servers and bandwidth resources of CSDN are used to deliver the streaming and downloading kind of cloud services, and the dynamic allocation of their delivery resource is the main research emphasis in this paper. This paper first models the problem to be a multi-dimensional facility location problem, according to the two characteristics: the memory resource and bandwidth resource of this kind of application are the bottleneck resource;the hot contents of this kind of application can be delivered using the Peer-to-Peer mechanisms. After the model analyzed and its NP-Complete proved, we then propose a heuristic algorithm. Finally, using the service delivery cost savings as the performance metrics, while the actual system's operation trace is as the input, the effectiveness of the algorithm are comprehensively assessed.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Translation Non-negative Matrix Factorization with Fast Optimization

Translation Non-negative Matrix Factorization with Fast Opti...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yuanyuan Wang Naiyang Guan Bin Mao Xuhui Huang Zhigang Luo Department of Basic Courses Army Officer Academy Science and Technology on Parallel and Distributed Processing Laboratory College of Computer Science National University of Defense Technology College of Science National University of Defense Technology College of Computer Science National University of Defense Technology

ISBN: (纸本)9781479938414

Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. Since NMF leads to unsatisfactory reconstruction for the datasets that contain translations of large magnitude, it is required to develop translation NMF (TNMF) to first remove the translation and then conduct a decomposition. However, existing multiplicative update rule based algorithm for TNMF is not efficient enough. In this paper, we reformulate TNMF and show that it can be efficiently solved by using the state-of-the-art solvers such as NeNMF. Experimental results on face image datasets confirm both efficiency and effectiveness of the reformulated TNMF.

关键词： Non-negative matrix factorization (NMF) Translation transformation NeNMF

来源：评论

学校读者我要写书评

暂无评论

NR-MPI: A Non-stop and Fault Resilient MPI

NR-MPI: A Non-stop and Fault Resilient MPI

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Guang Suo Yutong Lu Xiangke Liao Min Xie Hongjia Cao State Key Laboratory of High Performance Computing National University of Defense Technology Changsha Hunan Province China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan Province China

Fault resilience has became a major issue for HPC systems, in particular in the perspective of future E-scale systems, which will consist of millions of CPU cores and other components. Fault tolerant MPI was proposed to offer support of software level fault tolerance approaches. However, the widely used MPI implementations, such as MPICH and Mvapich2, provide limited support for fault tolerance. This paper proposes NR-MPI, a Non-stop and Fault Resilient MPI. NR-MPI implements the semantics of FT-MPI based on MPICH. Specifically, this paper focuses on failure detection in MPI library, online failure recovery of communicators for multiple failures, friendly programming interface extending for NR-MPI. Furthermore, to support failure recovery of applications, NR-MPI implements data backup and restore interfaces based on double in-memory checkpoint/restart. We conduct experiments with NPB benchmarks on TH-1A supercomputer. Experimental results show that NR-MPI based fault tolerant programs can recover from failures online without restarting, and the overhead is small even for applications with tens of thousands of cores.

关键词： Fault tolerance Fault tolerant systems Libraries Resource management Context Programming Semantics

来源：评论

学校读者我要写书评

暂无评论

Modeling Full Information with Graph Network for Joint Entity-Relation Extraction 21

Modeling Full Information with Graph Network for Joint Entit...

引用

Proceedings of the 2021 4th International Conference on Algorithms, Computing and Artificial Intelligence

作者： Qian Wan Luona Wei Xinhai Chen Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China College of Systems Engineering National University of Defense Technology China Laboratory of Software Engineering for Complex Systems National University of Defense Technology China

ISBN: (纸本)9781450385053

Fully capturing contextual information and analyzing the association between entity semantics and type is helpful for joint extraction task: 1) The context can reflect the part of speech and semantics of entity. 2) The entity type is closely related to the relation between entities. Previous research used to simply embed the contextual information into shallow layer of the model, ignoring the association between entity semantics and type. In this paper, we propose a graph network with full-information modeling to explicitly model different-level information in the text. The contextual information of entity is dynamically embedded in each span representation to improve the reasoning ability. To capture the fine-grained association between the semantics and type of entity, the graph network uses the feature of entity types to generate edge information between different nodes. Experimental results show that our model outperforms previous models on the CoNLL04 dataset and obtains competitive results on the SciERC dataset in both entity recognition and relation extraction. Extensive additional experiments further verify the effectiveness of the model.

关键词： Natural Language processing Named Entity Recognition Graph Network Deep Learning Relation Extraction

来源：评论

学校读者我要写书评

暂无评论

Learning non-local image diffusion for image denoising

arXiv

引用

arXiv 2017年

作者： Qiao, Peng Dou, Yong Feng, Wensen Chen, Yunjin National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha410073 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing

Image diffusion plays a fundamental role for the task of image denoising. Recently proposed trainable nonlinear reaction diffusion (TNRD) model defines a simple but very effective framework for image denoising. However, as the TNRD model is a local model, the diffusion behavior of which is purely controlled by information of local patches, it is prone to create artifacts in the homogenous regions and over-smooth highly textured regions, especially in the case of strong noise levels. Meanwhile, it is widely known that the non-local selfsimilarity (NSS) prior stands as an effective image prior for image denoising, which has been widely exploited in many nonlocal methods. In this work, we are highly motivated to embed the NSS prior into the TNRD model to tackle its weaknesses. In order to preserve the expected property that end-to-end training is available, we exploit the NSS prior by a set of non-local filters, and derive our proposed trainable non-local reaction diffusion (TNLRD) model for image denoising. Together with the local filters and influence functions, the non-local filters are learned by employing loss-specific training. The experimental results show that the trained TNLRD model produces visually plausible recovered images with more textures and less artifacts, compared to its local versions. Moreover, the trained TNLRD model can achieve strongly competitive performance to recent state-of-theart image denoising methods in terms of peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM). Copyright © 2017, The Authors. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques

Optimal and near-optimal allocation of precedence-constraine...

引用

International Conference on parallel processing (ICPP)

作者： I. Ahmad Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a well-known NP-complete problem. However, optimal solutions are desired in many situations. In this paper we propose search-based algorithms for determining optimal schedules for moderately large problem sizes. The first algorithm which is based on the A* search technique uses a computationally efficient cost function for guiding the search with reduced complexity. We propose a number of state-pruning techniques to reduce the size of the search space. For further lowering the complexity, we parallelize the search. The parallel version is based on reduced interprocessor communication and is guided by static and dynamic load-balancing schemes to evenly distribute the search states to the processors. We also propose an approximate algorithm that guarantees a bounded deviation from the optimal solution but takes considerably shorter time. Based on an extensive experimental evaluation of the algorithms, we conclude that the parallel algorithm with pruning techniques is an efficient scheme for generating optimal solutions for medium to moderately large problems while the approximate algorithm is a useful alternative if slightly degraded solutions are acceptable.

关键词： Optimal scheduling Processor scheduling Computational efficiency Costs Concurrent computing Network topology Scheduling algorithm Computer science Laboratories Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

A distributed approach to consistent order delivery of concurrent events in asynchronous DVEs

ICETC 2010 - 2010 2nd International Conference on Education ...

引用

ICETC 2010 - 2010 2nd International Conference on Education technology and Computer 2010年 4卷 V495-V498页

作者： Zhou, Hangjun Zhang, Wei Peng, Yuxing Li, Sikun Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan 410073 China Department of Information Management Hunan College of Finance and Economics Changsha Hunan 410205 China

ISBN: (纸本)9781424463688

In large-scale asynchronous distributed virtual environments(DVEs), one of the difficult problems is to deliver the concurrent events in a consistent order at each node. Generally, the previous consistency control approaches can be classified into two categories: causal order and time stamped order. However, causal order approaches can merely preserve the cause-effect relation of events and time stamped order approaches seem intrinsically complex to be used in serverless large-scale asynchronous DVEs. In this paper, we proposed a novel distributed algorithm to identify the concurrent events and preserve the consistent order delivery of them at different nodes. Simulation studies are also carried out to compare the performance of this algorithm with that of the previous ones. The results show that the new algorithm can effectively deliver the concurrent events in consistent order at each node and is more efficient than the previous algorithms in large-scale asynchronous DVEs. © 2010 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A Distributed Relation Detection Approach in the Internet of Things

引用

Mobile Information Systems 2017年第1期2017卷

作者： Zhu, Weiping Lu, Hongliang Cui, Xiaohui Cao, Jiannong International School of Software Wuhan University Wuhan China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong

In the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure, computation bottleneck, and moving of objects. In this paper, we propose a distributed approach to detect relations among objects. We first build a system model for this problem that supports generic forms of relations and both physical time and logical time. Based on this, we design the Distributed Relation Detection Approach (DRDA), which utilizes a distributed spanning tree to detect relations using in-network processing. DRDA can coordinate the distributed tree-building process of objects and automatically change the depth of the routing tree to a proper value. Optimization among multiple relation detection tasks is also considered. Extensive simulations were performed and the results show that the proposed approach outperforms existing approaches in terms of the energy consumption. © 2017 Weiping Zhu et al.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approximation for Weapon-Target Assignment

An Efficient Approximation for Weapon-Target Assignment

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Lina Chen ChuanJun Ren Su Deng C4ISR Technology National Defense Science and Technology Key Laboratory National University of Defense Technology Changsha Hunan China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. We present firstly a technique founded on the use weapon cell, which enables one-to-many mapping about weapon-target to become one-to-one mapping. Next, we introduce a framework of solving the WTA problem. Based on this framework, an approximation algorithm that is grounded on the rules about weapon cells and targets is proposed. Finally, the simulative results show that the proposed algorithm indeed is very efficient.

关键词： Weapons Heuristic algorithms Algorithm design and analysis Resource management Artificial neural networks Genetic algorithms Operations research

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：