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

作者： Gu, Yiren Shen, Hang Bai, Guangwei Wang, Tianjing Liu, Xuejun College of Computer Science and Technology Nanjing Tech University Nanjing211816 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

While much research has been devoted to algorithm improvement of the machine learning model for multimedia applications, relatively little research has focused on the acquisition of massive multimedia datasets with strict data demands for model training. In this paper, we propose a Quality-of-Information (QoI) aware incentive mechanism in multimedia crowdsensing, with the objective of promoting the growth of an initial training model. We begin with a reverse auction incentive model to maximize social welfare while meeting the requirements in quality, timeliness, correlation, and coverage. Then, we discuss how to achieve the optimal social welfare in the presence of an NP-hard winner determination problem. Lastly, we design an effective incentive mechanism to solve the auction problem, which is shown to be truthful, individually rational and computationally efficient. Our evaluation study is carried out using a real multimedia dataset. Extensive simulation results demonstrate that the proposed incentive mechanism produces close-to-optimal social welfare noticeably, while accompanied by accelerating the growth of the machine learning model with a high-QoI dataset. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

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

ISBN: (纸本)9798350331684

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. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Energy Consumption of IT System in Cloud data Center: Architecture, Factors and Prediction 16th

Energy Consumption of IT System in Cloud Data Center: Archit...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2019

作者： Lin, Haowei Xu, Xiaolong Wang, Xinheng Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China University of West London LondonW55RF United Kingdom

ISBN: (纸本)9783030307080

In recent years, as cloud data center has grown constantly in size and quantity, the energy consumption of cloud data center has increased dramatically. Therefore, it is of great significance to study the energy-saving issues of cloud data centers in depth. Therefore, this paper analyzes the architecture of energy consumption of IT system in cloud data centers and proposes a new framework for collecting energy consumption. Based on this framework, the factors affecting energy consumption are studied, and various parameters closely related to energy consumption are selected. Finally, the RBF neural network is used to model and predict the energy consumption of the cloud data centers, which is aim to prove the accuracy of the framework for collecting energy consumption and influencing factors. The experimental results show that these parameters under the framework for collecting energy consumption have better accuracy and adaptability to the prediction of energy consumption in cloud data centers than the previous model of energy consumption prediction. © 2019, IFIP International Federation for Information processing.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in cognitive wireless powered communication networks under outage constraint 4

Resource allocation in cognitive wireless powered communicat...

引用

4th IEEE International Conference on Computer and Communications, ICCC 2018

作者： Li, Qun Wang, Longqi Xu, Ding Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Wireless Communication Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781538683392

We investigate a multi-carrier cognitive wireless powered communication network (CWPCN), where the primary user (PU) is wirelessly powered by harvesting energy from the information signals from the secondary user (SU). The PU is protected by complying with the outage constraint which requires that a minimum rate is satisfied by the PU for a given outage probability. Both offline and online algorithms are proposed to jointly optimize time, subcarrier and power allocation to maximize the SU rate under the outage constraint. Simulation results are presented to verify the proposed algorithms. It is shown that the proposed algorithms outperform the benchmark algorithm with zero-outage constraint. It is also shown that the online algorithm achieves almost the same performance that the offline algorithm achieves. © 2018 IEEE.

关键词： Outages

来源：评论

学校读者我要写书评

暂无评论

Application and visualization of typical clustering algorithms in seismic data analysis

引用

Procedia Computer Science 2019年 151卷 171-178页

作者： Z. Fan X. Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China

Earthquake brings enormous loss of lives and properties to human beings due to its suddenness, destructiveness and inscrutability. The new techniques for analyzing seismic data can reveal the distribution of earthquakes, which helps us master the laws of earthquake disasters and reduce the risks brought by them. In this paper, we applied K-means and DBSCAN clustering algorithms to the analysis of seismic data. Their performances in fitting seismic belts with seismic datasets are compared. First, we map the positional parameters in the seismic data to coordinate points on a two-dimensional plane and then cluster them with the DBSCAN algorithm. In addition, we combine the magnitude and depth properties of seismic data, use the Elbow method to find the best K value, and then classifies the dataset by K-means algorithm. We visualize the results, and the distinction of each classification is clear. The experimental results show that the DBSCAN algorithm has a better effect on fitting the seismic belt, and the classification results of K-means algorithm for earthquakes are also in line with expectations.

关键词： Seismic Distribution Clustering K-means DBSCAN Visualization

来源：评论

学校读者我要写书评

暂无评论

Indoor Navigation Mechanism based on 5G network for Large Parking Garage 26

Indoor Navigation Mechanism based on 5G network for Large Pa...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

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

ISBN: (纸本)9798350331684

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. © 2023 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Secure communications for primary users in cognitive radio networks with collusive eavesdroppers

Secure communications for primary users in cognitive radio n...

引用

作者： Xu, Ding Li, Qun Wireless Communication Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

This letter studies physical-layer security in a cognitive radio (CR) network, where a primary user (PU) is eavesdropped by multiple collusive eavesdroppers. Under the PU secrecy outage constraint to protect the PU, the secondary users (SUs) are assumed to be allowed to transmit. The problem of joint SU scheduling and power control to maximize the SU ergodic transmission rate is investigated for both the scenarios of perfect and imperfect channel state information (CSI). It is shown that, although collusive eavesdroppers degrade the PU performance compared to noncollusive eavesdroppers, the SU performance is actually improved when the number of eavesdroppers is large. It is also shown that our proposed scheme with imperfect CSI can guarantee that the PU performance is unaffected by imperfect CSI. © 2018 The Institute of Electronics, Information and Communication Engineers.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

A Privacy Leak Detection Mechanism based on Service Binding 10

A Privacy Leak Detection Mechanism based on Service Binding

引用

10th International Symposium on System security, Safety, and Reliability, ISSSR 2024

作者： Wang, Boyang He, Jinling Du, Yuanhan Tang, Ming Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China

ISBN: (纸本)9798350362930

With the development of mobile technology, users gradually store financial information and personal privacy data on mobile terminals, which makes mobile security particularly important. In order to effectively improve the detection speed of application privacy leaks, this paper proposes a concept of service binding, binding a minimum privacy permission set for each service provided by the application. Use the service binding concept to make the static analysis phase track only the sensitive data flow paths between APIs that apply the service's privacy permissions. In order to make up for the lack of static analysis to predict the behavior of application privacy leakage, this paper proposes a static analysis that effectively combines machine learning algorithms, abstracts the path characteristics of the static data streams obtained from static analysis into feature vectors, and further uses machine learning algorithms for learning classification. The experimental demonstration and performance analysis results show that the privacy leak detection mechanism based on service binding has faster detection speed and higher accuracy than FlowDroid. © 2024 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Minimum Time Extrema Estimation for Large-Scale Radio-Frequency Identification Systems

引用

Journal of Computer Science & Technology 2020年第5期35卷 1099-1114页

作者： Xiao-Jun Zhu Li-Jie Xu Xiao-Bing Wu Bing Chen College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing 211106China Jiangsu Key Laboratory of Dig Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210049China Wireless Research Centre University of CanterburyChristchurch 8041New Zealand

We consider the extrema estimation problem in large-scale radio-frequency identification(RFID)systems,where there are thousands of tags and each tag contains a finite *** objective is to design an extrema estimation protocol with the minimum execution *** the standard binary search protocol wastes much time due to inter-frame overhead,we propose a parameterized protocol and treat the number of slots in a frame as an unknown *** formulate the problem and show how to find the best parameter to minimize the worst-case execution ***,we propose two rules to further reduce the execution *** first is to find and remove redundant *** second is to concatenate a frame from minimum value estimation with a frame from maximum value estimation to reduce the total number of *** show that,in a typical scenario,the proposed protocol reduces execution time by 79%compared with the standard binary search protocol.

关键词： radio-frequency identification(RFID)system maximum value estimation minimum value estimation time efficient protocol

来源：评论

学校读者我要写书评

暂无评论

FBOD: An Outlier Detection Algorithm based on data Features Suitable for processing Large-scale datasets on Distributed Platforms 10

FBOD: An Outlier Detection Algorithm based on Data Features ...

引用

10th International Symposium on System security, Safety, and Reliability, ISSSR 2024

作者： Zhao, Jinbo He, Jinling Song, Hu Cheng, Xinyun Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China

ISBN: (纸本)9798350362930

The primary objective of outlier detection is to identify values that are significantly different from other data in the dataset. However, most of the current algorithms are effective for small-scale data and their performance is highly dependent on the choice of parameters. To this, the paper proposes an innovative outlier detection algorithm, named FBOD, which is based on data features. Specifically, FBOD utilizes the number of combinations of attribute values in each tuple across the dataset as a key feature of the tuple. This feature reflects the degree of differentiation of each data tuple from the overall dataset. By identifying data features that are significantly different from objects in the entire dataset, FBOD can accurately determine outliers. Based on the knowledge of attribute importance in Rough Set Theory, FBOD can efficiently reduce the data dimensionality, so high-dimensional datasets can be handled by FBOD. Furthermore, this paper employs a distributed parallelism approach in the algorithm. The performance of FBOD is evaluated on several datasets, including standard datasets and artificial datasets, and is compared with common outlier detection algorithms. Experimental results indicate that, compared to existing typical algorithms, FBOD achieves higher outlier detection accuracy without relying on a prior knowledge of datasets or parameter selection. It also proves the suitability of FBOD for large-scale dataset processing on distributed platforms. © 2024 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：