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

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

来源：评论

学校读者我要写书评

暂无评论

CRAWL: A Trace Routing Algorithm Based on Hybrid Two-Layer Topology 33rd

CRAWL: A Trace Routing Algorithm Based on Hybrid Two-Layer T...

引用

33rd International Conference on Advanced Information Networking and Applications, AINA 2019

作者： Zheng, Li-ming Long, Wen-feng Liu, Yu-Jia Sun, Wei-dong Department of Message Communication Armed Police Officer Academy Chengdu China National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9783030150341

Data distribution is a key technology for resources convergence and sharing in distributed environment. To better meet the requirement for real time data distribution in the dynamic network, a trace routing algorithm named CRAWL based on the hybrid two-layered topology is put forward. The algorithm contains an overlay topology named CBDLO, upper of which consists of multiple distributed balanced binary trees corresponding to different properties and the lower of which is an unstructured topology. CRAWL forwards the data on the lower unstructured topology in the form of random walk, so that the data can be sent to the corresponding upper topology entry. It also includes a matching algorithm named CDM for the parallel matching data properties on the upper distributed and balanced binary tree and transmitting the matched data to the nodes that are interested in the data. The experimental results show that the algorithm can effectively support large-scale data distribution in a dynamical network, reduce distribution overhead and matching delays. © 2019, Springer Nature Switzerland AG.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Survey on Approaches and Applications of Knowledge Representation Learning

A Survey on Approaches and Applications of Knowledge Represe...

引用

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Chenchen Li Aiping Li Ye Wang Hongkui Tu Yichen Song College of Computer National University of Defense Technology ChangSha China College of Computer Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology ChangSha China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

Knowledge representation learning (KRL) is one of the important research topics in artificial intelligence and Natural language processing. It can efficiently calculate the semantics of entities and relations in a low-dimensional space, and effectively solve the problem of data sparsity, which significantly improve the performance of knowledge acquisition, fusion and reasoning and so on. Starting from the five perspectives of distance-based, semantic matching, bilinear-based, neural network model and additional information model, this paper first introduces the overall framework and specific model design, and then correspondingly introduces the experimental evaluation tasks, metrics and benchmark datasets of each model. On this basis, how to apply KRL to various downstream tasks is summarized.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Learning for Social Network Information Cascade Analysis: a survey

Deep Learning for Social Network Information Cascade Analysi...

引用

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Liqun Gao Bin Zhou Yan Jia Hongkui Tu Ye Wang Chenguang Chen Haiyang Wang Hongwu Zhuang College of Computer National University of Defense Technology ChangSha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology ChangSha China

The following topics are dealt with: learning (artificial intelligence); text analysis; natural language processing; pattern classification; graph theory; data mining; security of data; social networking (online); fea...

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure and Fast Decision Tree Evaluation on Outsourced Cloud Data 2nd

Secure and Fast Decision Tree Evaluation on Outsourced Cloud...

引用

2nd International Conference on Machine Learning for Cyber Security, ML4CS 2019

作者： Liu, Lin Su, Jinshu Chen, Rongmao Chen, Jinrong Sun, Guangliang Li, Jie School of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China National University of Defense Technology Changsha China

ISBN: (纸本)9783030306182

Decision trees are famous machine learning classifiers which have been widely used in many areas, such as healthcare, text classification and remote diagnostics, etc. The service providers usually host a decision tree model on the cloud server and provide some classification service for clients to use such a model remotely. In such a scenario, the model is a valuable asset to the cloud which should not be disclosed to the clients, while the query data and classification results are private to the client. To solve such a problem, we propose several building blocks, i.e., secure comparison and secure polynomial calculation, in a two-cloud model. Based on these building blocks, we design a privacy-preserving decision tree evaluation scheme. Compared with the most recent works, our scheme can fully protect the tree model and clients’ data privacy simultaneously. Besides, our scheme also supports offline service users which is essential to the system’s scalability. Moreover, through theoretical analysis and real-world experimental test, it is oblivious that our scheme is quite efficient. © 2019, Springer Nature Switzerland AG.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Research on Integrated Detection of SQL Injection Behavior Based on Text Features and Traffic Features

Research on Integrated Detection of SQL Injection Behavior B...

引用

作者： Ming Li Bo Liu Guangsheng Xing Xiaodong Wang Zhihui Wang College of Intelligence Science and Technology National University of Defence Technology National Key Laboratory of Parallel and Distributed Processing College of Computer Science and Technology National University of Defence Technology

With the rapid development of Internet technology, various network attack methods come out one after the other. SQL injection has become one of the most severe threats to Web applications and seriously threatens various Web application services and users' data security. There are both traditional detection methods and emerging methods based on deep learning technology with higher detection accuracy for the detection of SQL injection. However, they are all for detecting a single statement and cannot determine the stage of the attack. To further improve the effect of SQL injection detection, this paper proposes an integrated detection framework for SQL injection behavior based on both text features and traffic features. We propose a SQL-LSTM model based on deep learning technology as the detection model at the text features level. Meanwhile,the features of the data traffic are merged. By this integrated method, the detection effect of SQL injection is further improved.

关键词： SQL injection Integrated method SQL-LSTM Traffic features

来源：评论

学校读者我要写书评

暂无评论

Clustering-preserving Network Flow Sketching

Clustering-preserving Network Flow Sketching

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Yongquan Fu Dongsheng Li Siqi Shen Yiming Zhang Kai Chen Science and Technology Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology SING Lab Hong Kong University of Science and Technology

ISBN: (数字)9781728164120

ISBN: (纸本)9781728164137

Network monitoring is vital in modern clouds and data center networks that need diverse traffic statistics ranging from flow size distributions to heavy hitters. To cope with increasing network rates and massive traffic volumes, sketch based approximate measurement has been extensively studied to trade the accuracy for memory and computation cost, which unfortunately, is sensitive to hash *** paper presents a clustering-preserving sketch method to be resilient to hash collisions. We provide an equivalence analysis of the sketch in terms of the K-means clustering. Based on the analysis result, we cluster similar network flows to the same bucket array to reduce the estimation variance and use the average to obtain unbiased estimation. Testbed shows that the framework adapts to line rates and provides accurate query results. Real-world trace-driven simulations show that LSS remains stable performance under wide ranges of parameters and dramatically outperforms state-of-the-art sketching structures, with over 10 3 to 10 5 times reduction in relative errors for per-flow queries as the ratio of the number of buckets to the number of network flows reduces from 10% to 0.1%.

关键词： Monitoring Arrays Estimation error Adaptation models Approximation error Data centers

来源：评论

学校读者我要写书评

暂无评论

ME-TCAM: Memory-Efficient Ternary Content Addressable Memory Based on Multipumping-Enabled LUTRAM on FPGA

ME-TCAM: Memory-Efficient Ternary Content Addressable Memory...

引用

Intelligent Computing and Human-computer Interaction (ICHCI), International Conference on

作者： Zilin Shi Hui Yang Rulin Liu Jinli Yan Peng Qiao Baosheng Wang College of Computer Science and Technology National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) National University of Defense Technology Changsha China

Static random access memory (SRAM) on field programmable gate arrays (FPGAs) can be emulated to offer ternary content addressable memory (TCAM) functionality. However, SRAM-based TCAM wastes storage resources. This is due to the limited capacity of the physical addresses in the SRAM unit. This work proposes a LUTRAM-based TACM scheme on the FPGA called Memory-Efficient TCAM (ME-TCAM). METCAM divides SRAM unit into multiple virtual blocks mapping to a portion of the TCAM table to store the more address information of the TCAM table. Operation on SRAM block means that increasing the overall emulated TCAM bits/SRAM. Moreover, ME-TCAM exploits Xilinx primitives to conFigure lookup tables (LUTs) as 32 × 2 lookup table RAMs (LUTRAMs). We implement ME-TCAM using LUTRAM with a size of 512 × 48 and 1024 × 144 on a Virtex-7 FPGA device. Compared with the state-of-the-art research DUR, ME-TCAM achieves at least 2.6 times more memory efficiency.

关键词： Human computer interaction Associative memory Memory management Random access memory Logic gates Table lookup parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Convolutional neural network-based age estimation using B-mode ultrasound tongue image

arXiv

引用

arXiv 2021年

作者： Xu, Kele Csapó, Tamás Gábor Feng, Ming 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 Department of Telecommunications and Media Informatics Budapest University of Technology and Economics Budapest Hungary MTA-ELTE Lendület Lingual Articulation Research Group Budapest Hungary Tongji University Shanghai China

Ultrasound tongue imaging is widely used for speech production research, and it has attracted increasing attention as its potential applications seem to be evident in many different fields, such as the visual biofeedback tool for second language acquisition and silent speech interface. Unlike previous studies, here we explore the feasibility of age estimation using the ultrasound tongue image of the speakers. Motivated by the success of deep learning, this paper leverages deep learning on this task. We train a deep convolutional neural network model on the UltraSuite dataset. The deep model achieves mean absolute error (MAE) of 2.03 for the data from typically developing children, while MAE is 4.87 for the data from the children with speech sound disorders, which suggest that age estimation using ultrasound is more challenging for the children with speech sound disorder. The developed method can be used a tool to evaluate the performance of speech therapy sessions. It is also worthwhile to notice that, although we leverage the ultrasound tongue imaging for our study, the proposed methods may also be extended to other imaging modalities (e.g. MRI) to assist the studies on speech production. © 2021, CC BY-NC-SA.

关键词： Ultrasonics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：