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

arXiv 2019年

作者： Long, Jun Sun, WuQing Raymond, Osolo Ian Yang, Zhan School of Information Science and Engineering Central South University Changsha410083 China Network Resources Management and Trust Evaluation Key Laboratory of Hunan Province

Human Activity Recognition (HAR) using deep neural network has become a hot topic in human-computer interaction. Machine can effectively identify human naturalistic activities by learning from a large collection of sensor data. Activity recognition is not only an interesting research problem, but also has many real-world practical applications. Based on the success of residual networks in achieving a high level of aesthetic representation of the automatic learning, we propose a novel Asymmetric Residual network, named ARN. ARN is implemented using two identical path frameworks consisting of (1) a short time window, which is used to capture spatial features, and (2) a long time window, which is used to capture fine temporal features. The long time window path can be made very lightweight by reducing its channel capacity, yet still being able to learn useful temporal representations for activity recognition. In this paper, we mainly focus on proposing a new model to improve the accuracy of HAR. In order to demonstrate the effectiveness of ARN model, we carried out extensive experiments on benchmark datasets (i.e., OPPORTUNITY, UniMiB-SHAR) and compared with some conventional and state-of-the-art learning-based methods. Then, we discuss the influence of networks parameters on performance to provide insights about its optimization. Results from our experiments show that ARN is effective in recognizing human activities via wearable datasets. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Deep attention-guided Hashing

arXiv

引用

arXiv 2018年

作者： Yang, Zhan Raymond, Osolo Ian Sun, WuQing Long, Jun School of Information Science and Engineering Central South University Changsha410083 China Network Resources Management and Trust Evaluation Key Laboratory of Hunan Province

With the rapid growth of multimedia data (e.g., image, audio and video etc.) on the web, learning-based hashing techniques such as Deep Supervised Hashing (DSH) have proven to be very efficient for large-scale multimedia search. The recent successes seen in Learning-based hashing methods are largely due to the success of deep learning-based hashing methods. However, there are some limitations to previous learning-based hashing methods (e.g., the learned hash codes containing repetitive and highly correlated information). In this paper, we propose a novel learning-based hashing method, named Deep Attention-guided Hashing (DAgH). DAgH is implemented using two stream frameworks. The core idea is to use guided hash codes which are generated by the hashing network of the first stream framework (called first hashing network) to guide the training of the hashing network of the second stream framework (called second hashing network). Specifically, in the first network, it leverages an attention network and hashing network to generate the attention-guided hash codes from the original images. The loss function we propose contains two components: the semantic loss and the attention loss. The attention loss is used to punish the attention network to obtain the salient region from pairs of images;in the second network, these attention-guided hash codes are used to guide the training of the second hashing network (i.e., these codes are treated as supervised labels to train the second network). By doing this, DAgH can make full use of the most critical information contained in images to guide the second hashing network in order to learn efficient hash codes in a true end-to-end fashion. Results from our experiments demonstrate that DAgH can generate high quality hash codes and it outperforms current state-of-the-art methods on three benchmark datasets, CIFAR-10, NUS-WIDE, and ImageNet. Copyright © 2018, The Authors. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Secrecy and covert communications against UAV surveillance via multi-hop networks

arXiv

引用

arXiv 2019年

作者： Wang, Hui-Ming Zhang, Yan Zhang, Xu Li, Zhetao School of Electronic and Information Engineering Xi'an Jiaotong University Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi'an710049 China Key Laboratory of Hunan Province for Internet of Things and Information Security College of Information Engineering Xiangtan University Hunan China

The deployment of unmanned aerial vehicle (UAV) for surveillance and monitoring gives rise to the confidential information leakage challenge in both civilian and military environments. The security and covert communication problems for a pair of terrestrial nodes against UAV surveillance are considered in this paper. To overcome the information leakage and increase the transmission reliability, a multi-hop relaying strategy is deployed. We aim to optimize the throughput by carefully designing the parameters of the multi-hop network, including the coding rates, transmit power, and required number of hops. In the secure transmission scenario, the expressions of the connection probability and secrecy outage probability of an end-to-end path are derived and the closed-form expressions of the optimal transmit power, transmission and secrecy rates under a fixed number of hops are obtained. In the covert communication problem, under the constraints of the detection error rate and aggregate power, the sub-problem of transmit power allocation is a convex problem and can be solved numerically. Simulation shows the impact of network settings on the transmission performance. The trade-off between secrecy/covertness and efficiency of the multi-hop transmission is discussed which leads to the existence of the optimal number of hops. Copyright © 2019, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

A deep hashing method based on attention module for image retrieval

A deep hashing method based on attention module for image re...

引用

International Conference on Intelligent Computation Technology and Automation, ICICTA

作者： Jun Long Xiangxiang Wei Qianqian Qi Ye Wang The School of Computer Science and Engineering Central South University Changsha China Network Resources Management and Trust Evaluation Key Laboratory of Hunan Province Changsha China

Hashing retrieval technique has received widespread attention since its low storage consumption and fast retrieval speed. Image retrieval based on deep hashing method uses image features with high-level semantic information and discriminative expression capabilities. However, there are still some limitations: (1) Compared with the traditional feature vector, the length of the learned hash codes is short, and each bit of the code is -1 or 1, the discrimination capability of feature representation is limited; (2) the existing deep hash algorithms cannot directly learn the discrete hash codes using sign activation function, therefore, they use relaxation-based scheme to learn the hash codes, resulting in a large quantization error. In order to solve the above problems, a deep hashing retrieval algorithm incorporate with attention model is proposed. This algorithm embeds spatial and channel attention models in the feature extraction network, and uses a novel activation function in the hash layer. In addition, a novel triple loss function is further proposed to improve the learning capability of the network. Finally, experimental results on the two benchmark databases, i.e., CIFAR-10 and MINIST datasets, show the effectiveness and superiority compared with the baselines.

关键词： Codes Quantization (signal) Automation Databases Computational modeling Image retrieval Semantics

来源：评论

学校读者我要写书评

暂无评论

Scholars influence evaluation based on time series heterogeneous network

Scholars influence evaluation based on time series heterogen...

引用

International Conference on Measuring Technology and Mechatronics Automation, ICMTMA

作者： Ye Wang Zhen Ding Xiang Xiang Wei Jun Long The School of Computer Science and Engineering Central South University Changsha China Network Resources Management and Trust Evaluation Key Laboratory of Hunan Province Changsha China

In recent years, with the rapid development of network and data mining, multi-source heterogeneous data related to academics has also shown an exponential growth. As an important research field of academic big data, the objectivity of academic influence evaluation methods and rationality plays an important role in the evaluation of scientific and technological talents, academic groups, and national scientific research strength. Traditional methods are generally measured based on the amount of papers published by scholars and the total frequency of citations. Although these methods are simple to calculate the influence of scholar, they ignore the importance of the cooperative network of scholar and the evolution of academic networks over time. In order to solve the above limitations, this paper constructs a derivation of scholars' paper relationship network and scholars' cooperation network, taking into account the importance of time in the network, from the perspectives of the journal where the scholar publishes papers, the location of the author, and the number of citations of the paper. In this paper, a method is designed to calculate the academic influence of the scholars, making the calculation result more reasonable.

关键词： Computer science Mechatronics Automation network topology Time series analysis Cooperative systems Big Data

来源：评论

学校读者我要写书评

暂无评论

Microservice Auto-Scaling Algorithm Based on Workload Prediction in Cloud-Edge Collaboration Environment

Microservice Auto-Scaling Algorithm Based on Workload Predic...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social computing (CPSCom) Green computing and Communications (GreenCom)

作者： Zijun Peng Bing Tang Wei Xu Qing Yang Ehsanullah Hussaini Yuqiang Xiao Haiyan Li School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan China Center of Network and Education Technology Guangzhou Maritime University Guangzhou China

Cloud computing centrally consolidates hardware and computing resources, offering efficient and cost-effective services. However, as cloud computing centers are predominantly built and operated in a fully centralized fashion, the increased distance between these centers and users can lead to a decline in service quality. Real-time interaction and high business continuity are crucial in scenarios like traffic monitoring, AR/VR applications, and the Internet of Things (IoT). Edge computing is better suited to meet the demands of such latency-sensitive business needs. By analyzing and processing massive data directly at edge computing nodes, which focus on network edge devices, reliance on transmission resources is reduced, consequently improving the overall quality and performance of services. Nevertheless, resource-constrained edge nodes require efficient utilization of available infrastructure capacity to ensure specific service level objectives (SLO) for applications. Therefore, this paper introduces XScale, a cloud-edge collaborative system that enables microservices to adaptively scale elastically. XScale applies a Bi-LSTM with an attention mechanism to forecast the workload of microservices. When combined with mechanisms designed to handle burst traffic and a cloud-edge collaborative load forwarding strategy, it achieves both adaptive elastic scaling and proactive load forwarding. Experimental results, obtained using real-world microservice workloads, indicate that the XScale system can significantly reduce SLO violations by 88%, increase resource utilization by 15%, and decrease average response time by 21% when compared to existing advanced reactive scaling methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Routing Strategy for SDN Large Flow Based on Deep Reinforcement Learning

Routing Strategy for SDN Large Flow Based on Deep Reinforcem...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Yu Ke Junli Wang Chungang Yan Jiamin Yao Key Laboratory of Embedded System and Service Computing Collaborative Innovation Center for Financial Network Security (Tongji University) Ministry of Education National (Province-Ministry Joint) Tongji University Shanghai China

With the expansion of network scale, traditional routing strategies in Software-Defined networking (SDN) have difficulty adapting to fast traffic variability. The large flow in the network occupies 80% of the network traffic. An unreasonable schedule of the large flow will lead to the emergence of bottleneck links and reduce the network performance. To solve the above problems, this paper proposes a different routing method, called Routing Strategy for SDN Large Flow Based on Deep Reinforcement Learning (RSDRL). Considering the links in the network that can carry large flow are limited, RSDRL can schedule large flow firstly and generate routing strategies adaptively. At the same time, in order to avoid the occurrence of congestion, RSDRL quantifies the degree of congestion in the network to implement routing. Experiments show that the proposed model has better Quality of Service (QoS) performance under the test traffic, realizing a reasonable schedule of traffic.

关键词： Deep learning Training Knowledge engineering Schedules Adaptation models Reinforcement learning Quality of service

来源：评论

学校读者我要写书评

暂无评论

Accurate Recovery of Internet Traffic Data: A Sequential Tensor Completion Approach

Accurate Recovery of Internet Traffic Data: A Sequential Ten...

引用

作者： Xie, Kun Wang, Lele Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Guangxing Cao, Jiannong Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University Changsha410006 China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100864 China Department of Electrical and Computer Engineering State University of New York at Stony Brook Stony BrookNY11794 United States Network Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing100864 China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

The inference of traffic volume of the whole network from partial traffic measurements becomes increasingly critical for various network engineering tasks, such as capacity planning and anomaly detection. Previous studies indicate that the matrix completion is a possible solution for this problem. However, as a 2-D matrix cannot sufficiently capture the spatial-temporal features of traffic data, these approaches fail to work when the data missing ratio is high. To fully exploit hidden spatial-temporal structures of the traffic data, this paper models the traffic data as a 3-way traffic tensor and formulates the traffic data recovery problem as a low-rank tensor completion problem. However, the high computation complexity incurred by the conventional tensor completion algorithms prevents its practical application for the traffic data recovery. To reduce the computation cost, we propose a novel sequential tensor completion algorithm, which can efficiently exploit the tensor decomposition result based on the previous traffic data to derive the tensor decomposition upon arriving of new data. Furthermore, to better capture the changes of data correlation over time, we propose a dynamic sequential tensor completion algorithm. To the best of our knowledge, we are the first to propose sequential tensor completion algorithms to significantly speed up the traffic data recovery process. This facilitates the modeling of Internet traffic with the tensor to well exploit the hidden structures of traffic data for more accurate missing data inference. We have done extensive simulations with the real traffic trace as the input. The simulation results demonstrate that our algorithms can achieve significantly better performance compared with the literature tensor and matrix completion algorithms even when the data missing ratio is high. © 1993-2012 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

A Dual-stage Attention Based SDN Traffic Prediction Method

A Dual-stage Attention Based SDN Traffic Prediction Method

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Chenjing Gao Junli Wang Chungang Yan Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China

Traffic matrix is the main research object of traffic prediction in software-defined networking. Accurate and timely traffic matrix prediction plays an important role in avoiding network congestion. While various methods have been proposed in previous studies to solve the SDN traffic prediction problem, few of them consider both inter- and intra-flow features. In this paper, we propose a dual-stage attention based Traffic Prediction method for the SDN traffic matrix prediction task. First, our method uses temporal pattern attention as the inter-flow attention mechanism before the encoding stage to realize adaptive feature extraction. Then, temporal attention is introduced as the intra-flow attention mechanism before the decoding stage to capture long-term temporal dependencies. Finally, we use the autoregressive module to handle the highly dynamic SDN traffic volume. Experimental results show that our proposed SDN traffic prediction method can capture more traffic features and improve the SDN traffic matrix prediction performance to some extent.

关键词： network topology Time series analysis Prediction methods Machine learning Feature extraction Graph neural networks Encoding

来源：评论

学校读者我要写书评

暂无评论

FedDDB: Clustered Federated Learning based on Data Distribution Difference 22

FedDDB: Clustered Federated Learning based on Data Distribut...

引用

Proceedings of the 2022 5th International Conference on Algorithms, computing and Artificial Intelligence

作者： Chengyu You Zihao Lu Junli Wang Chungang Yan Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education China and National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University China

ISBN: (纸本)9781450398336

Clustered federated learning is a federated learning method based on multi-task learning. It groups similar clients into the same clusters and shares model parameters to solve the problem that the joint model is trapped in local optima on Non-IID data. Most of the existing clustered federated learning methods are based on the difference of model parameters for clients clustering. During the client model training process, the model parameters are biased and the clustering result is affected due to insufficient samples and missing eigenvalues in the dataset. In this paper, we develop a clustered federated learning method based on data distribution difference (FedDDB) in the dataset level. The method in this paper focuses on the distribution of label probability and eigenvalues, analyzes the difference of data distribution difference between clients and measures the distance between datasets which is used for client clustering. Every cluster will be trained independently and in parallel on the cluster center model. At the beginning of each round of training, the client clustering process needs to be repeated. We conduct relevant experiments and demonstrate the effectiveness of our method.

关键词： Clustering method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：