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

An Asynchronous Clustering and Mobile data Gathering Schema Based on Timer Mechanism in Wireless Sensor Networks

Computers, Materials & Continua 2019年第3期58卷 711-725页

作者： Jin Wang Yu Gao Wei Liu Wenbing Wu Se-Jung Lim Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer&Communication EngineeringChangsha University of Science&TechnologyChangsha410114China School of Information Science and Engineering Fujian University of TechnologyFuzhou350000China College of Information Engineering Yangzhou UniversityYangzhou225000China Department of Computer Engineering Chonnam National UniversityYeosu596597Korea.

Recently,Wireless sensor networks(WSNs)have become very popular research topics which are applied to many *** provide pervasive computing services and techniques in various potential applications for the Internet of Things(IoT).An Asynchronous Clustering and Mobile data Gathering based on Timer Mechanism(ACMDGTM)algorithm is proposed which would mitigate the problem of“hot spots”among sensors to enhance the lifetime of *** clustering process takes sensors’location and residual energy into consideration to elect suitable cluster ***,one mobile sink node is employed to access cluster heads in accordance with the data overflow time and moving time from cluster heads to *** experimental results display that the presented method can avoid long distance communicate between sensor ***,this algorithm reduces energy consumption effectively and improves package delivery rate.

关键词： Internet of things wireless sensor networks clustering mobile data collection timer.

来源：评论

学校读者我要写书评

暂无评论

A Fast and Effective Multiple Kernel Clustering Method on Incomplete data

引用

Computers, Materials & Continua 2021年第4期67卷 267-284页

作者： Lingyun Xiang Guohan Zhao Qian Li Gwang-Jun Kim Osama Alfarraj Amr Tolba Changsha Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha410114China Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems Changsha University of Science and TechnologyChangsha410114China Faculty of Engineering and Information Technology Global Big Data Technologies CentreUniversity of Technology SydneyUltimoNSW2007Australia Department of Computer Engineering Chonnam National UniversityGwangju61186Korea Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Department of Mathematics and Computer Science Faculty of ScienceMenoua UniversityShebin-El-kom32511Egyp

Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be ***,multiple kernel clustering for incomplete data is a critical yet challenging *** the existing absent multiple kernel clustering methods have achieved remarkable performance on this task,they may fail when data has a high value-missing rate,and they may easily fall into a local *** address these problems,in this paper,we propose an absent multiple kernel clustering(AMKC)method on incomplete *** AMKC method rst clusters the initialized incomplete ***,it constructs a new multiple-kernel-based data space,referred to as K-space,from multiple sources to learn kernel combination ***,it seamlessly integrates an incomplete-kernel-imputation objective,a multiple-kernel-learning objective,and a kernel-clustering objective in order to achieve absent multiple kernel *** three stages in this process are carried out simultaneously until the convergence condition is *** on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is signicantly better than state-of-the-art ***,the proposed method gains fast convergence speed.

关键词： Multiple kernel clustering absent-kernel imputation incomplete data kernel k-means clustering

来源：评论

学校读者我要写书评

暂无评论

Efficient differentiated storage architecture for large-scale flow tables in openflow networks 21

Efficient differentiated storage architecture for large-scal...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Xiong, Bing Wu, Rengeng Liao, Zhuofan Wang, Jin School of Computer AND Communication Engineering Changsha University of Science AND Technology Changsha410114 China Department of Computer and Information Sciences Temple University Philadelphia19122 United States Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science AND Technology Changsha China

ISBN: (纸本)9781728120584

As a novel network paradigm, Software Defined Networking (SDN) decouples control logic functions from data forwarding devices, and introduces a separate control plane to manipulate underlying switches via southbound interfaces like OpenFlow. However, it leads to large-scale flow tables and poses serious challenges on their storage resources and lookup performance in OpenFlow switches. This paper is thus motivated to propose an efficient differentiated storage architecture for large-scale flow tables in OpenFlow networks. Firstly, we investigate into the impact of wildcards in match fields on packet-in-batch property within a flow based on network traffic locality. Then, packet flows are dynamically distinguished into active ones and idle ones in terms of their short-term states. Subsequently, we store the match fields of active flows and idle flows respectively in TCAM and SRAM, and the content fields of both types of flows in DRAM, to effectively relieve the insufficiency of TCAM capacity. Finally, we evaluate the performance of our proposed flow table storage architecture with real network traffic traces by experiments. The experimental results indicate that our proposed storage architecture obviously outperforms the traditional one applying the elephant/mice flow differentiation method in terms of TCAM hit rates and average flow table access time. © 2019 IEEE.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Efficient trajectory data privacy protection scheme based on laplace's differential privacy

Efficient trajectory data privacy protection scheme based on...

引用

作者： Gu, Ke Yang, Lihao Liu, Yongzhi Yin, Bo School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha410114 China School of Information Science and Engineering Central South University Changsha410083 China

Now many applications of trajectory (location) data have facilitated people's daily life. However, publishing trajectory data may divulge individual sensitive information so as to influence people's normal life. On the other hand, if we cannot mine and share trajectory data information, trajectory data will lose its value to serve our society. Currently, because the records of trajectory data are discrete in database, some existing privacy protection schemes are difficult to protect trajectory data. In this paper, we propose a trajectory data privacy protection scheme based on Laplace's differential privacy mechanism. In the proposed scheme, the algorithm first selects the protected points from the user's trajectory data;secondly, the algorithm builds the polygons according to the protected points and the adjacent and high frequent accessed points selected from the accessed point database, then the algorithm calculates the polygon centroids;finally, the noises are added to the polygon centroids by the Laplace's differential privacy method, and the new polygon centroids are used to replace the protected points, and then the algorithm constructs and issues the new trajectory data. The experiments show that the running time of the proposed algorithms is fast, the privacy protection of the scheme is effective and the data usability of the scheme is higher. © 2018 Slovene Society Informatika. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

RSSD: Object Detection via Attention Regions in SSD Detector

RSSD: Object Detection via Attention Regions in SSD Detector

引用

IEEE International Conference of Safety Produce Informatization (IICSPI)

作者： Shuren Zhou Jia Qiu Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha China

ISBN: (数字)9781728145662

ISBN: (纸本)9781728145679

This paper designs a module of attention regions in SSD detector for accurate and efficient object detection (RSSD). Different from previous one-stage detection method like SSD which just simply applied the multi-scale head-features and directly extracted from backbone network, for classification and regression, our method aims to strengthen the characterization of head-features further. The parallel encode-to-decode structure is constructed and a computation method of regional distribution on features (R-Softmax) is proposed. What's more, in order to reduce time-costs, the down-sampling layers are shared with the multi-scale layers from backbone network. Our detector performs better on PASCAL VOC datasets (e.g., 78.4% mAP V.S. SSD 76.4% on VOC 07test) and costs 0.001s per image more than SSD.

关键词： Object detection Training Convolution Feature extraction Detectors Proposals Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Incremental algorithms for the maximum internal spanning tree problem

引用

Science China(Information Sciences) 2021年第5期64卷 77-84页

作者： Xianbin ZHU Wenjun LI Yongjie YANG Jianxin WANG School of Computer Science and Engineering Central South University Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Chair of Economic Theory Saarland University

The maximum internal spanning tree（MIST） problem is utilized to determine a spanning tree in a graph G,with the maximum number of possible internal *** incremental maximum internal spanning tree（IMIST） problem is the incremental version of MIST whose feasible solutions are edge-sequences e1,e2,…,en-1such that the first k edges form trees for all k ∈ [n-1].A solution's quality is measured using maxk∈[n-1]opt（G,k）/|In（Tk）| with lower being ***,opt（G,k） denotes the number of internal vertices in a tree with k edges in G,which has the largest possible number of internal vertices,and |In（Tk）| is the number of internal vertices in the tree comprising the solution's first k *** first obtained an IMIST algorithm with a competitive ratio of 2,followed by a 12/7-competitive algorithm based on an approximation algorithm for MIST.

关键词： maximum internal spanning tree incremental problem approximation algorithm competitive ratio

来源：评论

学校读者我要写书评

暂无评论

LogADCH: Hyperspheric-Based Log Message Anomaly Detection And Classification

LogADCH: Hyperspheric-Based Log Message Anomaly Detection An...

引用

Frontiers of Robotics and Software Engineering (FRSE), International Conference on

作者： Shiming He Jinpan Xiao Bowen Chen Ying Lei School of Computer and Communication Engineering the Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science & Technology Changsha China

Web services have been integrated with all walks of life in society. Abnormalities in the network and services seriously affect user experience and company revenue. The system log records various information of the system, and the information-rich log messages usually show different anomalies. It is particularly important to accurately and timely identify the anomalies of the log messages and classify the anomalies. In addition, most of the current existing work only detects anomalies and does not classify them, and a few existing works require anomaly labels to classify anomalies. Based on these potential challenges, we propose an unsupervised hypersphere-based log message anomaly detection and classification method, LogADCH. We use the hypersphere loss function to let the BERT model learn compact representations of log messages and perform anomaly detection. Finally, K-Means clustering is performed on the semantic feature vectors detected as anomalies to form clusters of different types of anomalies. Compared with other works, LogADCH further classifies the abnormal types after detecting the abnormal logs, helping the operation and maintenance personnel to quickly locate the fault. We compare our method with other methods on two public datasets, and the experimental results show that LogADCH has superior performance in anomaly detection as well as anomaly classification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Completion time-a ware flow scheduling in heterogenous networks 1

引用

15th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2015

作者： He, Shiming Xie, Kun Zhang, Dafang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook NY United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In China, the expressway isn’t free. When a vehicle exits, the exit toll station needs to calculate the toll according to the vehicle trajectory obtained by sending a trajectory query task to the trajectory center remotely. For the accurate of toll and keep the exit smoothly, transmitting the trajectory result reliably and in time is a key issue. There are three heterogenous networks in expressway, Fibernet, Telecommunications Network and 3G. We concurrently exploit three heterogenous networks by allocating the trajectory result into three sub-flows where each sub-flow is transmitted in one kind of networks. But existing multipath transfer solution(FMTCP) doesn’t consider the difference of completed time among all sub-flows and can’t make sure the completed time in time. Therefore, we formulate the sub-flows schedule as a integer programming problem, which is proved to be NP-hard problem, and propose a Completion time-aware Flow Scheduling scheme (CaFS) which calculates the size of sub-flows. For the reliably, it exploits generation-based network coding. For the transmission in time, CaFS allocates the size of sub-flow into suitable generation and scheduling the generations. The simulation results demonstrate that, comparing with the FMTCP, CaFS improves 31. 9% in completion time and 30% in task finished rate. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Fast Multivariate Time Series Anomaly Detection Based on Matrix Completion

Fast Multivariate Time Series Anomaly Detection Based on Mat...

引用

Frontiers of Robotics and Software Engineering (FRSE), International Conference on

作者： Shiming He Tongzhijian Yi Bo Yang Chenxi Guo School of Computer and Communication Engineering the Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science & Technology Changsha China

Increasingly complex systems contain large numbers of devices that generate great number of multivariate time series that are monitored and recorded. For anomaly detection of these complex time series, deep learning technology is often used to build a learning model for anomaly detection. The method based on deep learning usually takes a long time to train data in practice, and the online service system is deployed or changed very frequently, which makes the online service system need to frequently spend a lot of time updating the anomaly detection model. To overcome this challenge, this paper proposes a fast multivariate time series anomaly detection (FMAD) approach based on matrix completion. After sampling the primitive low-rank matrix, FMAD uses matrix completion to reconstruct the original low-rank matrix to detect anomalies in multivariate time series. We conducted related experimental analysis and discussion. The experimental results on three real data sets show that FMAD has improved the problem of too long model training time and improved the detection efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A characteristic-preserving steganographic method based on revision identifiers

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2016年第9期11卷 29-38页

作者： Xiang, Lingyun Sun, Caixia Liao, Niandong Wang, Weizheng Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology ChangshaHunan Province410114 China School of Computer and Communication Engineering Changsha University of Science and Technology ChangshaHunan Province410114 China

Since the majority of the available steganographic schemes in OOXML format documents suffered the disadvantages of unsatisfactory anti-detection capability and security level, a characteristic-preserving steganographic method with high security is proposed in this paper. The proposed method embeds secret information by replacing the last three bytes of the values of the revision identifiers in the main document body of the OOXML format document, while preserving the normal characteristics of the document. Meanwhile, position marks are added to track the locations of the embedded information. In order to keep the internal data consistency of the document, the newly created values are added into other related parts. Experimental results show that the method not only possesses good imperceptibility and anti-detection capability, but also has high security and large embedding capacity. © 2016 SERSC.

关键词： Anti-detection Characteristic-preserving OOXML Revision identifier Steganography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：