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

International Workshop on Quality of Service

作者： Xuan Liu Quan Yang Shigeng Zhang Bin Xiao The Science and Technology on Parallel and Distributed Processing Laboratory (PDL) P. R. China College of Computer Science and Electronic Engineering Hunan University P. R. China School of Computer Science and Engineering Central South University P. R. China The Hong Kong Polytechnic University Hong Kong

ISBN: (数字)9781728168876

ISBN: (纸本)9781728168883

Radio frequency identification (RFID) has been widely used in many smart applications. In many scenarios, it is essential to know the ordering of a set of RFID tags. For example, to quickly detect misplaced books in smart libraries, we need to know the relative ordering of the tags attached to the books. Although several relative RFID localization algorithms have been proposed, they usually suffer from large localization latency and cannot support applications that require real-time detection of tag (product) positions like automatic manufacturing on an assembly line. Moreover, existing approaches face significant degradation in ordering accuracy when the tags are close to each other. In this paper, we propose RLLL, an accurate Relative Localization algorithm for RFID tags with Low Latency. RLLL reduces localization latency by proposing a novel geometry-based approach to identifying the V-zone in the phase reading sequence of each tag. Moreover, RLLL uses only the data in the V-zone to calculate relative positions of tags and thus avoids the negative effects of low-quality data collected when the tag is far from the antenna. Experimental results with commercial RFID devices show that RLLL achieves an ordering accuracy of higher than 0.986 with latency less than 0.8 seconds even when the tags are spaced only 7 mm from adjacent tags, in which case the state-of-the-art solutions only achieve ordering accuracy of lower than 0.8 with localization latency larger than 3 seconds.

关键词： RFID tags Manufacturing Antenna arrays Quality of service Libraries

来源：评论

学校读者我要写书评

暂无评论

A Unique Vertex Deleting Algorithm for Graph Isomorphism

A Unique Vertex Deleting Algorithm for Graph Isomorphism

引用

International Symposium on Image and Data Fusion (ISIDF)

作者： Baida Zhang Yuhua Tang Junjie Wu Linqi Huang National laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan P. R. China School of Resources and Safety Engineering Central South University Changsha P. R. China

Graph isomorphism problem has applications in many fields, such as chemistry, computer science, electronics, and network theory. But the exponential complexity of the algorithm makes the testing is time consuming. In this paper, a new algorithm named Unique Vertex Delete (UVD for short) is presented to speed up the process of isomorphic testing. The main idea of UVD algorithm is deleting vertex continuously to reduce the scale of the problem, and new field is added for each vertex to indicate the information of deleted neighbor vertices. Theoretical analysis and experiments show that the UVD algorithm consistently and significantly outperforms existing state-of-the-art approaches.

关键词： Algorithm design and analysis Testing Educational institutions Polynomials Software algorithms Complexity theory Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Big data collaborative artificial intelligence and high-performance computing to drive physical design of fusion

Big data collaborative artificial intelligence and high-perf...

引用

Cloud Computing, Big Data Applications and Software Engineering (CBASE), International Conference on

作者： Pan Liu Gongjie Liu Jie Liu Chencheng Liu Wenbin Xiong Zhangcun Tang Yinzhao Zhou Yonggang Wang Zhouming Yuan Tianfu Innovation Energy Establishment Chengdu China Beijng PARATERA Technology Corp. Ltd Beijing China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China Central South University of Forestry and Technology Changsha China Nuclear and Radiation Safety Center MEE Beijing China University of Electronic Science and Technology of China Chengdu China

Controlled thermonuclear fusion has always been a dream pursued by mankind. However, the physical processes of controlled thermonuclear fusion are complex, requiring numerical simulations with high performance computing, and the amount of data generated by the physical processes on spatial, temporal and temperature scales is too large to be captured, managed, processed and collated in a reasonable time frame by mainstream software tools to achieve more aggressive fusion physical design. The data are too large to be captured, managed, processed, and collated into more aggressive targets for fusion physical design in a reasonable time by mainstream software tools. At the same time, the failure of fusion ignition can be caused by the distortion of various key physical quantities, and only by decomposing the process step by step and clarifying the changes of key physical quantities in the fusion physics process, can an effective mechanism be formed to prevent the distortion of key physical quantities from causing ignition failure in experimental physics. Big data in collaboration with artificial intelligence and high performance computing to drive the physical design of fusion is a novel avenue. By data acquisition with and pre-processing, this allows the creation of small sample libraries and deep learning. With supervised learning function convergence, incorporating solid/fluid computational methods, further network layering and cell expansion, the parameters of the physical model conforming to Lawson’s criterion will become experimental physical parameters, and we find the new approach in Data capacity, Model combination approach, Type of material, Calculation speed, Optimisation of design iteration times, etc. are superior to the traditional approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Complexity-Reduced Block-Selective Algebraic Multigrid Method for Implicitly Coupled Velocity-Pressure System on High Performance Computers

SSRN

引用

SSRN 2023年

作者： Liang, Yuechao Guo, Xiao-Wei Li, Chao Yuan, Fan Song, Min Zhang, Qingyang Chen, Xinhai 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 Changsha410073 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Mathematics and Computational Sciences Xiangtan University Xiangtan411105 China College of Computer Science and Technology National University of Defense Technology Changsha410073 China

The implicitly coupled pressure-based algorithm is widely acknowledged for its superior convergence and robustness in solving incompressible flow problems. However, the increased expansion scale of equations and difficulty in solving the resulting equation system has limited the widespread use of the coupling algorithm. This paper presents an optimized block-SAMG method, referred to as Red-SAMG, to significantly reduce computational complexity and memory consumption. Our approach employs a parallel modified independent set algorithm, allowing each process to perform matrix coarsening individually. An aggressive coarsening strategy further reduces complexity to address larger-scale problems. We conducted numerical experiments on a serial two-dimensional backward-facing step case and a parallel three-dimensional tunnel between rod bundles in the reactor core problem. The results demonstrate that the Red-SAMG method with aggressive coarsening reduces solution time by 12\% on the backward-facing step case. For large-scale three-dimensional problems under the same parallel conditions, the Red-SAMG method shortens the solution time by 14\% compared to the existing SAMG method. The Red-SAMG method with aggressive coarsening further reduces solution time by 49\%. Our optimized Red-SAMG method effectively reduces the complexity of the linear system arising from the implicitly coupled algorithm. The aggressive coarsening strategy also represents a significant advancement in improving the computational efficiency of the SAMG method. © 2023, The Authors. All rights reserved.

关键词： Coarsening

来源：评论

学校读者我要写书评

暂无评论

Deep reinforcement learning for combinatorial optimization: Covering salesman problems

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Weakly hard real-time schedule algorithm based on cutting down

引用

Ruan Jian Xue Bao/Journal of Software 2008年第7期19卷 1837-1846页

作者： Wu, Tong Jin, Shi-Yao Liu, Hua-Feng Chen, Ji-Ming National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China National Laboratory of Industrial Control Technology Zhejiang University Hangzhou 310027 China

Nowadays, weakly hard real-time is attracted in the research of real-time system. Existing weakly hard real-time scheduling algorithms cannot guarantee the meeting ratio of executing sequence of which the length is larger than fixed window-size. Therefore, this paper, based on the (m, p) constraint, proposes an algorithm which is named as CDBS (cut-down based scheduling). Since the discrimination of the satisfiability of (m, p) constraint needs to go over the whole executing sequence of the task, it's very difficult and infeasible. For this reason, this paper brings an efficient algorithm of cutting down the sequence, proves the correctness of the algorithm. We use proper data structures so that the complexity of judgment is not relevant to the length of sequence. Experiments show the efficiency. Furthermore, we compare CDBS with other classical algorithms, such as EDF, DBP, DWCS, and the results show its competence.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Audio Visual Speech Recognition with Multimodal Recurrent Neural Networks

Audio Visual Speech Recognition with Multimodal Recurrent Ne...

引用

International Joint Conference on Neural Networks

作者： Weijiang Feng Naiyang Guan Yuan Li Xiang Zhang Zhigang Luo Institute of Software College of Computer National University of Defense Technology Changsha Hunan P.R. China 410073 Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha Hunan P.R. China 410073

ISBN: (纸本)9781509061839

Studies on nowadays human-machine interface have demonstrated that visual information can enhance speech recognition accuracy especially in noisy environments. Deep learning has been widely used to tackle such audio visual speech recognition (AVSR) problem due to its astonishing achievements in both speech recognition and image recognition. Although existing deep learning models succeed to incorporate visual information into speech recognition, none of them simultaneously considers sequential characteristics of both audio and visual modalities. To overcome this deficiency, we proposed a multimodal recurrent neural network (multimodal RNN) model to take into account the sequential characteristics of both audio and visual modalities for AVSR. In particular, multimodal RNN includes three components, i.e., audio part, visual part, and fusion part, where the audio part and visual part capture the sequential characteristics of audio and visual modalities, respectively, and the fusion part combines the outputs of both modalities. Here we modelled the audio modality by using a LSTM RNN, and modelled the visual modality by using a convolutional neural network (CNN) plus a LSTM RNN, and combined both models by a multimodal layer in the fusion part. We validated the effectiveness of the proposed multimodal RNN model on a multi-speaker AVSR benchmark dataset termed AVletters. The experimental results show the performance improvements comparing to the known highest audio visual recognition accuracies on AVletters, and confirm the robustness of our multimodal RNN model.

关键词： Visualization Hidden Markov models Speech recognition Recurrent neural networks Feature extraction Logic gates Data models

来源：评论

学校读者我要写书评

暂无评论

A performance study of CSMA in wireless networks with successive interference cancellation

A performance study of CSMA in wireless networks with succes...

引用

IEEE International Conference on Communications (ICC)

作者： Shaohe Lv Weihua Zhuang Xiaodong Wang Chi Liu Xiaofeng Hu Yipin Sun Xingming Zhou Institute of Network Information and Security National University of Defense Technology Changsha China Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada Central South University Changsha China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

Successive interference cancellation (SIC) is an effective way of multipacket reception to combat interference. As conventional CSMA (Carrier Sense Multiple Access) is designed for single packet reception, it is unclear whether or not CSMA performs well to exploit the SIC capability. In this paper, we analyze the performance of a simple CSMA protocol in a network with SIC. For a given link, we derive the residing areas of an interfering node when simultaneous transmission is allowed and when the interference is harmful, respectively. We show that, though SIC provides many new transmission opportunities, CSMA cannot effectively exploit them. There is a fundamental tradeoff in a CSMA protocol between exploiting the transmission opportunities from SIC and capturing the harmful interference. In many cases, when CSMA achieves its best performance, almost all new transmission opportunities are not exploited. It is therefore very necessary to design a new distributed access protocol in wireless networks with SIC.

关键词： Silicon carbide Multiaccess communication Interference Receivers Propagation losses Protocols Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Excitement Surfeited Turns to Errors: Deep Learning Testing Framework Based on Excitable Neurons

arXiv

引用

arXiv 2022年

作者： Jin, Haibo Chen, Ruoxi Zheng, Haibin Chen, Jinyin Cheng, Yao Yu, Yue Liu, Xianglong College of Information Engineering Zhejiang University of Technology Hangzhou China Institute of Cyberspace Security Zhejiang University of Technology Hangzhou China Huawei International Singapore National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China State Key Laboratory of Software Development Environment Beihang University Beijing China

Despite impressive capabilities and outstanding performance, deep neural networks (DNNs) have captured increasing public concern about their security problems, due to their frequently occurred erroneous behaviors. Therefore, it is necessary to conduct a systematical testing for DNNs before they are deployed to real-world applications. Existing testing methods have provided fine-grained metrics based on neuron coverage and proposed various approaches to improve such metrics. However, it has been gradually realized that a higher neuron coverage does not necessarily represent better capabilities in identifying defects that lead to errors. Besides, coverage-guided methods cannot hunt errors due to faulty training procedure. So the robustness improvement of DNNs via retraining by these testing examples are unsatisfactory. To address this challenge, we introduce the concept of excitable neurons based on Shapley value and design a novel white-box testing framework for DNNs, namely DeepSensor. It is motivated by our observation that neurons with larger responsibility towards model loss changes due to small perturbations are more likely related to incorrect corner cases due to potential defects. By maximizing the number of excitable neurons concerning various wrong behaviors of models, DeepSensor can generate testing examples that effectively trigger more errors due to adversarial inputs, polluted data and incomplete training. Extensive experiments implemented on both image classification models and speaker recognition models have demonstrated the superiority of DeepSensor. Compared with the state-of-the-art testing approaches, DeepSensor can find more test errors due to adversarial inputs (∼ ×1.2), polluted data (∼ ×5) and incompletely-trained DNNs (∼ ×1.3). Additionally, it can help DNNs build larger l2-norm robustness bound (∼ ×3) via retraining according to CLEVER's certification. We further provide interpretable proofs for effectiveness of DeepSensor via excitable neuro

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：