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

International Conference on Computer Supported Cooperative Work in Design

作者： Xiaolong Xu Qun Ding Licheng Lin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

With the increase of car ownership in China, the problem of difficult parking in cities has become more and more serious. In large parking garage, finding an ideal parking space has become a daily problem for people; especially during the peak usage period of parking garage, a large number of vehicles will be driven into the parking garage, which will bring congestion, and at the same time, the demand of a large number of users in the area will lead to network congestion under 4G network, and users cannot access the network to check and find parking spaces. Therefore, this paper proposes a global optimal navigation mechanism with 5G network based on the above mentioned problems by analyzing the congestion situation during the peak usage of the parking garage. This mechanism uses an optimal parking space selection model and a global optimal scheduling model that can avoid congestion. Based on the model proposed in this paper, we construct a navigation planning system based on mobile, front-end and back-end. With the ultra-low latency, ultrahigh transmission efficiency and reliability of 5G network, the mobile port can select the optimal parking space according to the user's preference, and the back-end can show the parking space and congestion in the parking garage in real time according to the actual situation of the parking garage. Finally, the performance of the model and system proposed in this paper is verified through experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impact of Feature Selection Methods on data Classification for IDS

Impact of Feature Selection Methods on Data Classification f...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC

作者： Shuai Jiang Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

The rapid increase of data has led to many security issues. Various new technologies and other sub-disciplines have been introduced into the research of intrusion detection system (IDS), which has become a hot topic in the current field of security. However, IDS utilizing traditional machine learning technology suffers from relatively low detection rate, large computational overhead, and high false positive rate, due to the large amount of redundancy and high correlation of network traffic data. Therefore, we select random forest (RF) to handle the classification of the network traffic data, and try the classic feature selection algorithms Extra-Trees (ET) and Chi-square (CHI) to reduce the detection time and improve the efficiency of IDS. The experimental results based on the NSL-KDD dataset indicate that ET-RF and CHI-RF outstand in accuracy and computational overhead. Meanwhile, RF with ET outperforms that with CHI.

关键词： Feature extraction Classification algorithms Intrusion detection Telecommunication traffic Support vector machines Random forests

来源：评论

学校读者我要写书评

暂无评论

ConvTrans-TPS: A Convolutional Transformer Model for Disk Failure Prediction in Large-Scale Network Storage Systems

ConvTrans-TPS: A Convolutional Transformer Model for Disk Fa...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Shicheng Xu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Disk failure is one of the most important reliability problems in large-scale network storage systems. Disk failure may lead to serious data loss and even disastrous consequences if the missing data cannot be recovered. Therefore, predicting disk failures is an important means of ensuring storage security in network storage systems. However, since the fault data in the fast degradation stage is smaller than the healthy data in the normal state, the mixture of healthy data and faulty data leads to extremely unbalanced data, which brings great challenges to finding hidden fault information, thus making fault prediction more accurate. Aiming at the above problems, a convolutional transformer model ConvTrans-TPS model for disk failure prediction in large-scale network storage systems is proposed. The ConvTrans-TPS model acquires dependencies between long-term sequence data through transformers and uses convolutional projections for attention computation to enhance attention to local contextual information. data augmentation to predict failures in the next 7 days. Validated by the analysis on the Backblaze dataset, the F1 is 0.96 and the Matthews correlation coefficient (MCC) is 0.92. Compared with the popular CNN-LSTM model in recent years, our proposed method improves F1 and MCC by 4% and 5%, respectively, improving the prediction accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temporal data Fusion at the Edge

Temporal Data Fusion at the Edge

引用

IEEE International Symposium on Parallel and Distributed processing with Applications and IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)

作者： Linfu Yang Bin Liu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728152103

As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge.

关键词： data privacy Gaussian processes Internet of Things sensor fusion data fusion Gaussian processes Internet of things data integration data privacy Sensor fusion Edge of a figure or solid data capture Privacy

来源：评论

学校读者我要写书评

暂无评论

HERMES: Pedestrian Real-Time Offline Positioning and Moving Trajectory Tracking System Based on MEMS Sensors

HERMES: Pedestrian Real-Time Offline Positioning and Moving ...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Xinxin Liu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728105499;9781728105482

With the development of positioning technology, sensor-based positioning has become the most commonly used positioning method because it is more low-cost and efficient with the popularity of smart phones. In this paper, we construct a pedestrian real-time offline positioning and moving trajectory tracking system (HERMES) which only relies on the sensors inside smart phones. In HERMES, based on Pedestrian Dead Reckoning (PDR) model, a stable and accurate pedestrian gait recognition is achieved through the rare double sliding window, the pedestrian step length is estimated in real time by a training pedestrian step length model, and the pedestrian real-time course angle is available through orientation sensor inside smart phones. Thus, if given a pedestrian's initial position, the system can implement the real-time offline pedestrian positioning and moving trajectory tracking. Experiments show the pedestrian gait recognition algorithm implemented in this paper has a high accuracy and the positioning effect is satisfactory. The moving trajectory tracked by the HERMES has a small deviation from the experimenter's actual trajectory.

关键词： Acceleration Real-time systems Gait recognition Smart phones Estimation Trajectory tracking Legged locomotion

来源：评论

学校读者我要写书评

暂无评论

Sequential online prediction in the presence of outliers and change points: An instant temporal structure learning approach

arXiv

引用

arXiv 2019年

作者： Liu, Bin Qi, Yu Chen, Ke-Jia School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing Jiangsu210023 China College of Computer Science and Technology Zhejiang University Hangzhou Zhejiang310058 China

In this paper, we consider sequential online prediction (SOP) for streaming data in the presence of outliers and change points. We propose an INstant TEmporal structure Learning (INTEL) algorithm to address this problem. Our INTEL algorithm is developed based on a full consideration to the duality between online prediction and anomaly detection. We first employ a mixture of weighted Gaussian process models (WGPs) to cover the expected possible temporal structures of the data. Then, on the basis of the rich modeling capacity of this WGP mixture, we develop an efficient technique to instantly learn (capture) the temporal structure of the data that follows a regime shift. This instant learning is achieved only by adjusting one hyper-parameter value of the mixture model. A weighted generalization of the product of experts (POE) model is used for fusing predictions yielded from multiple GP models. An outlier is declared once a real observation seriously deviates from the fused prediction. If a certain number of outliers are consecutively declared, then a change point is declared. Extensive experiments are performed using a diverse of real datasets. Results show that the proposed algorithm is significantly better than benchmark methods for SOP in the presence of outliers and change points. Copyright © 2019, The Authors. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Flight Path Optimization for UAVs to Provide Location Service to Ground Targets

Flight Path Optimization for UAVs to Provide Location Servic...

引用

IEEE Conference on Wireless Communications and Networking

作者： Youpeng Wang Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

We consider using UAVs to provide location service to ground targets. UAVs fly over the target area and broadcast their locations periodically via wireless signals. When a UAV flies along a straight line, a target will observe the strongest signal when the UAV is at the closest location, based on which it can infer its location. The problem is to minimize the flight length subject to the constraint that the transmission range of a UAV is limited and all targets in the area should be located. We formulate the problem and give an optimal flight path to cover a square with side length no greater than a certain value. In the general case when the given area cannot be covered by the square, we propose to divide UAVs into two groups, whose flight paths are either parallel or orthogonal. We conduct simulations to compare our approach with existing approaches. Results verify the superiority of our approach in terms of flight length and localization error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BLRGCN: A dynamic traffic flow prediction model based on spatiotemporal graph convolutional network

BLRGCN: A dynamic traffic flow prediction model based on spa...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Qiuhao Shi Xiaolong Xu Xuanyan Liu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Because of the complex topology of urban road and the dynamic changes of traffic information over time, how to accurately and efficiently predict traffic flow has become a difficult problem. In order to capture spatiotemporal dependence at the same time, in this paper we propose BLRGCN, a dynamic traffic flow prediction model based on spatiotemporal graph convolutional network. This model improves the performance of bidirectional long short-term memory network (Bi-LSTM) by using residual network (ResNet), which can directly connect the input short to the output of nonlinear layer, and then combines the improved Bi-LSTM with graph convolutional neural network (GCN). BLRGCN model uses graphs to construct the network information of urban roads. In the graph, nodes express roads and edges express relationship between roads. The attributes of nodes describe traffic information on roads. We use GCN to extract the topological features of road network to capture spatial dependence. Besides, the BLRGCN model uses Bi-LSTM to obtain the information of the whole input sequence and extract the dynamic change characteristics of traffic data on the road to capture the temporal dependence. Compared with other methods on two traffic datasets, BLRGCN model has improved RMSE index by 0.53%-37.03% and 23.69%-43.83% respectively. The MAE index was improved by 34.89%-37.78% and 7.80%-51.88%, the accuracy index was improved by 0.19%-82.53% and 4.55%- 10.45%, the R2 index was improved by 0.24%-25.65% and 16.67%-29.94%, and the var index is improved by 0.25%-24.24% and 16.99%-30.39% respectively, which indicates that BLRGCN model has good prediction performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Network data Classification Mechanism for Intrusion Detection System

Network Data Classification Mechanism for Intrusion Detectio...

引用

International Conference on Computer Supported Cooperative Work in Design

Intrusion detection system (IDS), as a network security device, monitors network data in real time and responds actively when it detects suspicious transmissions. However, suffered from the large amount of redundancy and high correlation of network data, the traditional IDS have defects in low detection rate and high computational overhead. In this paper, we propose a network data classification mechanism (CPEL). data preprocessing of network traffic data is first performed using correlation-based feature selection (CFS) and principal component analysis (PCA). CFS selects the best features in the data, PCA to dimensionality reduction and denoising. Then, we use multiple classifiers to perform anomaly detection, and select the best three classifiers according to the classification effect. On this basis, we use the majority vote as the ensemble learning (EL) method of combination rules to further improve the performance of the classifier. Experimental results on the benchmark NSL-KDD and WSN-DS datasets indicate that this mechanism outperforms a single algorithm in accuracy and detection rate. In the meantime, computational overhead is remarkably reduced.

关键词： Dimensionality reduction Wireless sensor networks Redundancy Intrusion detection Telecommunication traffic Feature extraction Real-time systems

来源：评论

学校读者我要写书评

暂无评论

FP-WDDQN: An improved deep reinforcement learning algorithm for adaptive traffic signal control

FP-WDDQN: An improved deep reinforcement learning algorithm ...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Xiao Zhang Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Current adaptive traffic signal control methods based on centralized deep reinforcement learning are not applicable in large-scale adaptive traffic control environment. The scalability problem is overcome by assigning global control to each local RL agent through multi-intelligence reinforcement learning, but the environment now becomes partially visible ami non-stationarity from the perspective of each local agent due to limited communication between agents. In this paper, we propose a multi-agent framework called Forgetful Priority Weighed Double Deep Q-learning (FP-WDDQN). We firstly extend Weighted Double Deep Q-Learning(WDDQN) to the multi agent domain, so as to reduce the error caused by the algorithm's underestimation of the target network and get more accurate Q-value. Then we propose a new algorithm based on Forgetful Experience Mechanism(FEM) and Priority Experience Replay Mechanism(PERM). This mechanism makes WDDQN choose experience based on Temporal Difference (TD) error and Identify the importance of experience with FEM. It makes WDDQN preferentially select experience with high TD-error in the process of sampling and training its network based on FEM and TD-error, which improved the model training efficiency and stabilized the learning process. In this paper, we construct an urban traffic network with seven intersections in the simulation platform called Simulation of Urban MObility(SUMO), and the proposed FP-WDDQN is compared against Independent Double Deep Q-learning(IDDQN), WDDQN and Multi-agent Advantage Actor Critic (MA2C) under the condition of simulating the traffic dynamics of peak hours. Experiment shows FP-WDDQN has better performance than other algorithms in vehicle speed, intersection delay and intersection waiting queue length.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：