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

arXiv 2021年

作者： Li, Kaiwen Zhang, Tao Wang, Rui Wang, Yuheng Han, Yi College of Systems Engineering National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Multi-Energy System Intelligent Interconnection Technology HKL-MSI2T Changsha410073 China Graduate College National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha410073 China

This paper introduces a new deep learning approach to approximately solve the Covering Salesman Problem (CSP). In this approach, given the city locations of a CSP as input, a deep neural network model is designed to directly output the solution. It is trained using the deep reinforcement learning without supervision. Specifically, in the model, we apply the Multi-head Attention to capture the structural patterns, and design a dynamic embedding to handle the dynamic patterns of the problem. Once the model is trained, it can generalize to various types of CSP tasks (different sizes and topologies) with no need of re-training. Through controlled experiments, the proposed approach shows desirable time complexity: it runs more than 20 times faster than the traditional heuristic solvers with a tiny gap of optimality. Moreover, it significantly outperforms the current state-of-the-art deep learning approaches for combinatorial optimization in the aspect of both training and inference. In comparison with traditional solvers, this approach is highly desirable for most of the challenging tasks in practice that are usually large-scale and require quick decisions. Copyright © 2021, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Qualitative action recognition by wireless radio signals in human-machine systems

arXiv

引用

arXiv 2017年

作者： Lv, Shaohe Lu, Yong Dong, Mianxiong Wang, Xiaodong Dou, Yong Zhuang, Weihua National Laboratory of Parallel and Distributed Processing National University of Defense Technology ChangshaHunan China Department of Information and Electronic Engineering Muroran Institute of Technology 27-1 Mizumoto-cho Muroran Hokkaido050-8585 Japan Department of Electrical and Computer Engineering University of Waterloo WaterlooON Canada

—Human-machine systems required a deep understanding of human behaviors. Most existing research on action recognition has focused on discriminating between different actions, however, the quality of executing an action has received little attention thus far. In this paper, we study the quality assessment of driving behaviors and present WiQ, a system to assess the quality of actions based on radio signals. This system includes three key components, a deep neural network based learning engine to extract the quality information from the changes of signal strength, a gradient based method to detect the signal boundary for an individual action, and an activity-based fusion policy to improve the recognition performance in a noisy environment. By using the quality information, WiQ can differentiate a triple body status with an accuracy of 97%, while for identification among 15 drivers, the average accuracy is 88%. Our results show that, via dedicated analysis of radio signals, a fine-grained action characterization can be achieved, which can facilitate a large variety of applications, such as smart driving assistants. Copyright © 2017, The Authors. All rights reserved.

关键词： Man machine systems

来源：评论

学校读者我要写书评

暂无评论

parallel 3D deterministic particle transport on Intel MIC architecture

Parallel 3D deterministic particle transport on Intel MIC ar...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Qinglin Wang Zuocheng Xing Jie Liu Xiaogang Qiang Chunye Gong Jiang Jiang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China H.H. Wills Physics Laboratory University of Bristol Bristol UK Science and Technology on Space Physics Libratory Beijing China School of Microelectronics Shanghai Jiao Tong University Shanghai China

Single-node computation speed is essential in large-scale parallel solutions of particle transport problems. The Intel Many Integrated Core (MIC) architecture supports more than 200 hardware threads as well as 512-bit double precision float-point vector operations. In this paper, we use the native model of MIC in the parallelization of the simulation of one energy group time-independent deterministic discrete ordinates particle transport in 3D Cartesian geometry (Sweep3D). The implementation adopts both hardware threads and vector units in MIC to efficiently exploit multi-level parallelism in the discrete ordinates method when keeping good data locality. Our optimized implementation is verified on target MIC and can provide up to 1.99 times speedup based on the original MPI code on Intel Xeon E5-2660 CPU when flux fixup is off. Compared with the prior on NVIDIA Tesla M2050 GPU, the speedup of up to 1.23 times is obtained. In addition, the difference between the implementations on MIC and GPU is discussed as well.

关键词： Computer architecture Microwave integrated circuits Graphics processing units Tin Computational modeling Legged locomotion Equations

来源：评论

学校读者我要写书评

暂无评论

Analysis and evaluation method for linpack benchmark

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 102-107页

作者： Du, Yun-Fei Yang, Can-Qun Wang, Feng Yi, Hui-Zhan School of Computer National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The basic algorithm of HPL was introduced. Two optimization methods of communication, i.e., advanced-lookahead and dynamic broadcasting algorithm, were proposed. The performances of the two optimization methods were evaluated on the Tianhe-2 system, and compared with the performance of traditional HPL. The Linpack evaluating methods were discussed, the choice methods of the key parameters affecting the performance were given, and the effect of the high-speed interconnection network on Linpack performance was analyzed. The results showed that the higher the node performance, the greater the effect of the network bandwidth and latency on the performances of HPL. ©, 2014, Northeastern University. All right reserved.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk

Approximate Maximum Common Sub-graph Isomorphism Based on Di...

引用

International Conference on Pattern Recognition

作者： Kai Lu Yi Zhang Kai Xu Yinghui Gao Richard C. Wilson Science and Technology on Parallel and Distributed Processing Laboratory and College of Computer National University of Defense Technology Changsha P.R. China College of Electronic Science and Engineering National University of Defense Technology Changsha P.R. China Department of Computer Science University of York York UK

Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for example in scene matching, video indexing, chemical similarity and shape analysis. In this paper, a novel algorithm Qwalk is proposed for approximate MCS, utilizing the discrete-time quantum walk. Based on the new observation that isomorphic neighborhood group matches can be detected quickly and conveniently by the destructive interference of a quantum walk, the new algorithm locates an approximate solution via merging neighborhood groups. Experiments show that Qwalk has better accuracy, universality and robustness compared with the state-of-the-art approximate MCS methods. Meanwhile, Qwalk is a general algorithm to solve the MCS problem approximately while having modest time complexity.

关键词： Approximation algorithms Interference Algorithm design and analysis Accuracy Time complexity Quantum computing Noise

来源：评论

学校读者我要写书评

暂无评论

Quantification of transducer misalignment in ultrasound tongue imaging

arXiv

引用

arXiv 2020年

作者： Csapó, Tamás Gábor Xu, Kele Department of Telecommunications and Media Informatics Budapest University of Technology and Economics Budapest Hungary MTA-ELTE Lendület Lingual Articulation Research Group Budapest Hungary National Key Lab of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer National University of Defense Technology Changsha China

In speech production research, different imaging modalities have been employed to obtain accurate information about the movement and shaping of the vocal tract. Ultrasound is an affordable and non-invasive imaging modality with relatively high temporal and spatial resolution to study the dynamic behavior of tongue during speech production. However, a longstanding problem for ultrasound tongue imaging is the transducer misalignment during longer data recording sessions. In this paper, we propose a simple, yet effective, misalignment quantification approach. The analysis employs MSE distance and two similarity measurement metrics to identify the relative displacement between the chin and the transducer. We visualize these measures as a function of the timestamp of the utterances. Extensive experiments are conducted on a Hungarian and Scottish English child dataset. The results suggest that large values of Mean Square Error (MSE) and small values of Structural Similarity Index (SSIM) and Complex Wavelet SSIM indicate corruptions or issues during the data recordings, which can either be caused by transducer misalignment or lack of gel. Copyright © 2020, The Authors. All rights reserved.

关键词： Ultrasonics

来源：评论

学校读者我要写书评

暂无评论

Improved conjugate residual algorithm for large symmetric linear systems

引用

Jisuanji Xuebao/Chinese Journal of Computers 2006年第3期29卷 495-499页

作者： Liu, Jie Liu, Xing-Ping Chi, Li-Hua Hu, Qing-Feng National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Institute of Applied Physics and Computation Mathematics Beijing 100088 China

The conjugate residual (CR) algorithm is a Krylov subspace algorithm that can be used to obtain fast solutions for symmetric linear systems with very large and very sparse coefficient matrices. By changing the computation sequence in the CR algorithm, this paper proposes an improved Conjugate Residual (ICR) algorithm. The numerical stability of ICR algorithm is same as CR algorithm, but the synchronization overhead that represents the bottleneck of the parallel performance is effectively reduced by a factor of two. And all inner products of a single iteration step are independent and communication time required for inner product can be over lapped efficiently with computation time of vector updates. From the theoretical and experimental analysis it is found that ICR algorithm is faster than CR algorithm as the number of processors in creases. The experiments performed on a 64-processor cluster indicate that ICR is approximately 30% faster than CR.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

HPDedup: A hybrid prioritized data deduplication mechanism for primary storage in the cloud

arXiv

引用

arXiv 2017年

作者： Wu, Huijun Wang, Chen Fu, Yinjin Sakr, Sherif Zhu, Liming Lu, Kai Data61 CSIRO University of New South Wales Australia PLA University of Science and Technology China Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Laboratory of High-end Server & Storage Technology College of Computer National University of Defense Technology Changsha China

—Eliminating duplicate data in primary storage of clouds increases the cost-efficiency of cloud service providers as well as reduces the cost of users for using cloud services. Most existing primary deduplication techniques either use inline caching to exploit locality in primary workloads or use post-processing deduplication running in system idle time to avoid the negative impact on I/O performance. However, neither of them works well in the cloud servers running multiple services or applications for the following two reasons: Firstly, the temporal locality of duplicate data writes may not exist in some primary storage workloads thus inline caching often fails to achieve good deduplication ratio. Secondly, the post-processing deduplication allows duplicate data to be written into disks, therefore does not provide the benefit of I/O deduplication and requires high peak storage capacity. This paper presents HPDedup, a Hybrid Prioritized data Deduplication mechanism to deal with the storage system shared by applications running in co-located virtual machines or containers by fusing an inline and a post-processing process for exact deduplication. In the inline deduplication phase, HPDedup gives a fingerprint caching mechanism that estimates the temporal locality of duplicates in data streams from different VMs or applications and prioritizes the cache allocation for these streams based on the estimation. HPDedup also allows different deduplication threshold for streams based on their spatial locality to reduce the disk fragmentation. The post-processing phase removes duplicates whose fingerprints are not able to be cached due to weak temporal locality from disks. The hybrid deduplication mechanism significantly reduces the amount of redundant data written to the storage system while maintaining inline data writing performance. Our experimental results show that HPDedup clearly outperforms the state-of-the-art primary storage deduplication techniques in terms of inline

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling algorithm for real-time multiprocessor systems based on grouping and properly choosing policies

引用

Jisuanji Xuebao/Chinese Journal of Computers 2006年第1期29卷 81-91页

作者： Bin, Xue-Lian Yang, Yu-Hai Jin, Shi-Yao Department of Information and Command Automation Air Force Radar Academy Wuhan 430019 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Dynamic scheduling algorithms for real-time multiprocessor are important components of real-time systems. In this paper, a new algorithm, named Group-Proper (GP), is presented based on analysis of the shortcomings of myopic algorithm and thrift algorithm. GP algorithm includes two policies: grouping policy and properly choosing policy (PCP). Grouping policy is aimed to increase the utilization of resources. PCP is aimed to enlarge the utilization of CPU. On the condition of ensuring not missing the deadlines of tasks with smaller heuristic value, grouping policy prior chooses the task accessing resources in the shared mode to extend. If a task needn't access resources or the earliest available times of resources required by it are earlier than that of the CPU, PCP assigns the task to the CPU with the earliest available time. Otherwise, PCP assigns the task to the CPU with the closest available times to that of the resources required by it. Simulation results show that acceptance ratio of GP algorithm is higher than that of myopic and thrift.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Realization and optimization DGEMM on ARMv8 64-bit multi-core processor

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 37-43页

作者： Jiang, Hao Wang, Feng Zuo, Ke Li, Kuan Yang, Can-Qun College of Computer Science National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The double-precision matrix-matrix multiplication (DGEMM) on ARMv8 64-bit multi-core processor architecture was realized and optimized, and the optimal model for the purpose of maximizing the compute-to-memory access ratio was built to design DGEMM kernel. The ARM 64-bit memory accessing instruction, Cache pre-fetching instruction and NEON vector FMA instruction were utilized through instruction reordering and loop unrolling to construct the kernel assembly codes. The blocking and packing algorithms and parallel methods from GotoBLAS (OpenBLAS) were chosen, and the results showed that the floating-point peak efficiency can achieve 82% with one thread and 80% with eight threads, respectively. As the fastest DGEMM implementation on ARMv8 64-bit processor, it improves the peak performance by 8.3% and 16.7% compared to ATLAS. ©, 2014, Northeastern University. All right reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：