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

International Conference on Computer and Communications (ICCC)

作者： Zhe Zhang Jie Liu Lihua Chi Xinhai Chen Science and Technology on Parallel and Distributed Processing Laboratory & Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (数字)9781728186351

ISBN: (纸本)9781728186368

Punctuation restoration in speech recognition has a wide range of application scenarios. Despite the widespread success of neural networks methods at performing punctuation restoration for English, there have been only limited attempts for Chinese punctuation restoration. Due to the differences between Chinese and English in terms of grammar and basic semantic units, existing methods for English is not suitable for Chinese punctuation restoration. To tackle this problem, we propose a hybrid model combining the kernel of Bidirectional Encoder Representations from Transformers (BERT), Convolution Neural Network (CNN) and Recurrent Neural Network (RNN). This model employs a flexible structure and special CNN design which can extract word-level features for Chinese language. We compared the performance of the hybrid model with five widely-used punctuation restoration models on the public dataset. Experimental results demonstrate that our hybrid model is simple and efficient. It outperforms other models and achieves an accuracy of 69.1%.

关键词： Recurrent neural networks Computational modeling Bit error rate Semantics Speech recognition Feature extraction Task analysis

来源：评论

学校读者我要写书评

暂无评论

A clustering-based approach for mining dockerfile evolutionary trajectories

引用

science China(Information sciences) 2019年第1期62卷 211-213页

作者： Yang ZHANG Huaimin WANG Vladimir FILKOV Key Laboratory of Parallel and Distributed Computing National University of Defense Technology College of Computer National University of Defense Technology DECAL Lab University of California Computer Science Department University of California

Dear editor,Docker1), as a de-facto industry standard [1], enables the packaging of an application with all its dependencies and execution environment in a light-weight, self-contained unit, i.e., *** launching the container from Docker image, developers can easily share the same operating system, libraries, and binaries [2]. As the configuration file, the dockerfile plays an important role,

关键词： A clustering-based approach for mining dockerfile evolutionary trajectories

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analysis of single-event transient sensitivity in fully depleted silicon-on-insulator MOSFETs

引用

Nuclear science and Techniques 2018年第4期29卷 108-113页

作者： Jing-Yan Xu Shu-Ming Chen Rui-Qiang Song Zhen-Yu Wu Jian-Jun Chen College of Computer National University of Defense Technology National Laboratory for Parallel and Distributed Processing National University of Defense Technology

Based on 3 D-TCAD simulations, single-event transient(SET) effects and charge collection mechanisms in fully depleted silicon-on-insulator(FDSOI) transistors are investigated. This work presents a comparison between28-nm technology and 0.2-lm technology to analyze the impact of strike location on SET sensitivity in FDSOI devices. Simulation results show that the most SET-sensitive region in FDSOI transistors is the drain region near the gate. An in-depth analysis shows that the bipolar amplification effect in FDSOI devices is dependent on the strike locations. In addition, when the drain contact is moved toward the drain direction, the most sensitive region drifts toward the drain and collects more charge. This provides theoretical guidance for SET hardening.

关键词： Single-event transient Charge collection Bipolar amplification Fully depleted silicon-on-insulator

来源：评论

学校读者我要写书评

暂无评论

Correlation-based software search by leveraging software term database

引用

Frontiers of Computer science 2018年第5期12卷 923-938页

作者： Zhixing LI Gang YIN Tao WANG Yang ZHANG Yue YU Huaimin WANG National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha 410073 China

Internet-scale open source software （OSS） pro- duction in various communities generates abundant reusable resources for software developers. However, finding the de- sired and mature software with keyword queries from a considerable number of candidates, especially for the fresher, is a significant challenge because current search services often fail to understand the semantics of user queries. In this paper, we construct a software term database （STDB） by analyzing tagging data in Stack Overflow and propose a correlationbased software search （CBSS） approach that performs correlation retrieval based on the term relevance obtained from STDB. In addition, we design a novel ranking method to optimize the initial retrieval result. We explore four research questions in four experiments, respectively, to evaluate the effectiveness of the STDB and investigate the performance of the CBSS. The experiment results show that the proposed CBSS can effectively respond to keyword-based software searches and significantly outperforms other existing search services at finding mature software.

关键词： software retrieval software term database open source software

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Fault-tolerant Reinforcement Learning with Noisy Environments

Multi-agent Fault-tolerant Reinforcement Learning with Noisy...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Canhui Luo Xuan Liu Xinning Chen Juan Luo College of Computer Science and Electronic Engineering Hunan University P. R. China The Science and Technology on Parallel and Distributed Processing Laboratory (PDL) P. R. China

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

Multi-agent reinforcement learning system is used to solve the problem that agents achieve specific goals in the interaction with the environment through learning policies. Almost all existing multi-agent reinforcement learning methods assume that the observation of the agents is accurate during the training process. It does not take into account that the observation may be wrong due to the complexity of the actual environment or the existence of dishonest agents, which will make the agent training difficult to succeed. In this paper, considering the limitations of the traditional multi-agent algorithm framework in noisy environments, we propose a multi-agent fault-tolerant reinforcement learning (MAFTRL) algorithm. Our main idea is to establish the agent's own error detection mechanism and design the information communication medium between agents. The error detection mechanism is based on the autoencoder, which calculates the credibility of each agent's observation and effectively reduces the environmental noise. The communication medium based on the attention mechanism can significantly improve the ability of agents to extract effective information. Experimental results show that our approach accurately detects the error observation of the agent, which has good performance and strong robustness in both the traditional reliable environment and the noisy environment. Moreover, MAFTRL significantly outperforms the traditional methods in the noisy environment.

关键词： Training Fault tolerance Working environment noise Fault tolerant systems Reinforcement learning Robustness Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Hybrid Routing: Towards Resilient Routing in Anonymous Communication Networks

Hybrid Routing: Towards Resilient Routing in Anonymous Commu...

引用

IEEE International Conference on Communications (ICC)

作者： Yusheng Xia Rongmao Chen Jinshu Su Chen Pan Han Su College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Anonymous communication networks (ACNs) are intended to protect the metadata during communication. As classic ACNs, onion mix-nets are famous for strong anonymity, in which the source defines a static path and wraps the message multi-times with the public keys of nodes on the path, through which the message is relayed to the destination. However, onion mix-nets lacks in resilience when the static on-path mixes fail. Mix failure easily results in message loss, communication failure, and even specific attacks. Therefore, it is desirable to achieve resilient routing in onion mix-nets, providing persistent routing capability even though node failure. The state-of-theart solutions mainly adopt mix groups and thus need to share secret keys among all the group members which may cause single point of failure. To address this problem, in this work we propose a hybrid routing approach, which embeds the onion mix-net with hop-by-hop routing to increase routing resilience. Furthermore, we propose the threshold hybrid routing to achieve better key management and avoid single point of failure. As for experimental evaluations, we conduct quantitative analysis of the resilience and realize a local T-hybrid routing prototype to test performance. The experimental results show that our proposed routing strategy increases routing resilience effectively, at the expense of acceptable latency.

关键词： Routing Resilience Public key Peer-to-peer computing Encryption

来源：评论

学校读者我要写书评

暂无评论

Improving unsupervised domain adaptation by reducing bi-level feature redundancy

arXiv

引用

arXiv 2020年

作者： Wang, Mengzhu Zhang, Xiang Lan, Long Wang, Wei Tan, Huibin Luo, Zhigang Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China Institute for Quantum State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China DUT-RU International School of Information Science & Engineering Dalian University of Technology DalianLiaoning116000 China Department of Science and Technology on Parallel and Distributed Processing National University of Defense Technology Changsha China

Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignore this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific features with a transferable decorrelated normalization module, which preserves specific domain information whilst easing the side effect of feature redundancy on the sequel domain-invariance. In the second level, domain-invariant feature redundancy caused by domain-shared representation is further mitigated via an alternative brand orthogonality for better generalization. These two novel aspects can be easily plugged into any BN-based backbone neural networks. Specifically, simply applying them to ResNet50 has achieved competitive performance to the state-of-the-arts on five popular benchmarks. Our code will be available at https://***/dreamkily/gUDA. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Succinct representations in collaborative filtering: A case study using wavelet tree on 1,000 cores 20

Succinct representations in collaborative filtering: A case ...

引用

20th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2019

作者： Peng, Xiangjun Wang, Qingfeng Sun, Xu Gong, Chunye Wang, Yaohua User-Centric Computing Group University of Nottingham Ningbo China China Department of Computer Science and Technology National University of Defense Technology China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China

ISBN: (纸本)9781728126166

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results. © 2019 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

CoEdge: A Collaborative Architecture for Efficient Task Offloading among Multiple Edge Service Providers

引用

IEEE Internet of Things Journal 2025年

作者： Xie, Xingrui Cheng, Geyao Liu, Han Luo, Lailong Ren, Bangbang Guo, Deke National University of Defense Technology National Key Laboratory of Information Systems Engineering Hunan Changsha410073 China National University of Defense Technology State Key Laboratory of Complex and Critical Software Environment College of Information and Communication Hubei Wuhan430019 China National University of Defense Technology National Key Laboratory of Information Systems Engineering National Laboratory for Parallel and Distributed Processing Hunan Changsha410073 China

Edge computing is an emerging paradigm poised to process a substantial portion of latency-sensitive and computation-intensive tasks through edge service providers (ESPs). However, these ESPs typically operate independently and locally to serve their registered users. When processing burst tasks, the ESPs have to either scale up their respective capacities by introducing additional hardware or compromise user experience by rejecting some user requests, leading to high commercial investment or service degradation. Inspired by the promise of the win-win situation for ESPs and users, we envision a novel task offloading strategy that realizes the following rationales simultaneously: 1) collaborative service, 2) rapid response, and 3) sustainable profitability, while the existing methods fail to achieve them at one shot. To this end, we report CoEdge, a collaborative architecture for efficient task offloading among multiple ESPs in the edge network, aiming at simultaneously minimizing service delay for users and enhancing service profit for ESPs. To achieve this, CoEdge employs a central optimizer to implement a two-stage strategy that determines the task scheduling and service pricing hierarchically. We then formulate these problems and prove their NP-hardness. Additionally, we also propose efficient approximate algorithms to accommodate large-scale computing scenarios with low complexity. Experimental results using real-world datasets demonstrate that our CoEdge can significantly reduce service delay by 2.87x to 4.15x for users and considerably increase service profit by 32% for ESPs. © 2014 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：