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

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

作者： Yuhua Qiu 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

Reasonable route planning for taxi can not only improve quality of customer experience, but also maximize the benefit of taxi drivers. Most current taxi planning schemes are designed to achieve the shortest route or the shortest time, not to achieve the best profit. In this paper, we propose a route planning scheme with best profit for taxi (RPSBPT). First, we define the optimal profit point and the profit per unit time function. Second, we design the workflow of data cleaning, sampling and partitioning for preprocessing the dataset of taxi trajectory. Then, we integrate the DBSCAN algorithm and the K-means algorithm to obtain the optimal profit points. Finally, the simulate anneal Algorithm (SA), the genetic algorithm (GA), and the ant colony optimization algorithm (ACO) are adopted respectively to plan route for taxi. We constructed the taxi route planning prototype system and applied the proposed route planning scheme to the system. Based on the system and the collected taxi trajectory data at the Jinjiang district of the Chengdu city, we performed a series of experiments to compare the performance of three heuristic algorithms, including optimal route length, algorithm stability, total profit and profitability per unit time. Experimental results show that ACO has the best performance.

关键词： Public transportation Planning Trajectory Clustering algorithms Genetic algorithms Urban areas Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison and Analysis on Typical Network Representation Learning Algorithms

Comparison and Analysis on Typical Network Representation Le...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Yang Wang Xiaolong Xu Yun Li 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

ISBN: (纸本)9781538676738;9781538676721

Large-scale complex networks show complex nonlinear relationships among objects, such as the social relationships in the real world, the citation relationship among papers and the interactions among proteins in biology. The analysis of complex network systems make it possible to reveal network structures, information disseminating laws, and communication patterns. Network representation learning (NRL) algorithms focus on mapping the original network structure information to a low-dimensional vector space through a series of operations under the premise of maximally retaining the network structure. In order to analyze current representative NRL algorithms effectively to provide valuable references for other researchers, we built an experimental platform to perform and test the NRL algorithms based on matrix factorization, the NRL algorithms based on shallow neural network and the NRL algorithms based on deep neural network, with datasets on Collaboration Network, Social Network and Citation Network. We implemented a series of comprehensive experiments, based on metrics include precision@k, micro-F1 and macro-F1. Our experiments include network reconstruction, vertex classification, and link prediction, and show readers principles, performances and applications of typical NRL algorithms.

关键词： Neural networks Prediction algorithms Task analysis Matrix decomposition data visualization Blogs Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Incentivizing the Biased Requesters: Truthful Task Assignment Mechanisms in Crowdsourcing

Incentivizing the Biased Requesters: Truthful Task Assignmen...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： Jia Xu Hui Li Yanxu Li Dejun Yang Tao Li Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing Jiangsu China School of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Department of Computer Science Colorado School of Mines Golden CO USA

ISBN: (纸本)9781509066001

Crowdsourcing has become an effective tool to utilize human intelligence to perform tasks that are challenging for machines. In the integrated crowdsourcing systems, the requesters are non- monopolistic and may show preferences over the workers. We are the first to design the incentive mechanisms, which consider the issue of stimulating the biased requesters in the competing crowdsourcing market. In this paper, we explore truthful task assignment mechanisms to maximize the total value of accomplished tasks for this new scenario. We present three models of crowdsourcing, which take the preferences of the requesters and the workload constraints of the workers into consideration. We design a task assignment mechanism, which follows the matching approach to solve the Valuation Maximizing Assignment (VMA) problem for each of the three models. Through both rigorous theoretical analyses and extensive simulations, we demonstrate that the proposed assignment mechanisms achieve computational efficiency, workload feasibility, preference (universal) truthfulness and constant approximation.

关键词： Crowdsourcing Computational modeling Cost accounting Mobile communication Aggregates Mechanical factors Knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Incentivizing the workers for truth discovery in crowdsourcing with copiers

arXiv

引用

arXiv 2019年

作者： Jiang, Lingyun Niu, Xiaofu Xu, Jia Yang, Dejun Xu, Lijie Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu210023 China Department of Computer Science Colorado School of Mines GoldenCO80401 United States

Crowdsourcing has become an efficient paradigm for performing large scale tasks. Truth discovery and incentive mechanism are fundamentally important for the crowdsourcing system. Many truth discovery methods and incentive mechanisms for crowdsourcing have been proposed. However, most of them cannot be applied to deal with the crowdsourcing with copiers. To address the issue, we formulate the problem of maximizing the social welfare such that all tasks can be completed with the least confidence for truth discovery. We design an incentive mechanism consisting truth discovery stage and reverse auction stage. In truth discovery stage, we estimate the truth for each task based on both the dependence and accuracy of workers. In reverse auction stage, we design a greedy algorithm to select the winners and determine the payment. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the proposed mechanisms achieve computational efficiency, individual rationality, truthfulness, and guaranteed approximation. Moreover, our truth discovery method shows prominent advantage in terms of precision when there are copiers in the crowdsourcing systems. Copyright © 2019, The Authors. All rights reserved.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Sybil-Proof Online Incentive Mechanisms for Crowdsensing

Sybil-Proof Online Incentive Mechanisms for Crowdsensing

引用

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

作者： Jian Lin Ming Li Dejun Yang Guoliang Xue Colorado School of Mines Golden CO USA Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Arizona State University Tempe AZ USA

ISBN: (纸本)9781538641293

Crowdsensing leverages the rapid growth of sensor-embedded smartphones and human mobility for pervasive information collection. To incentivize smartphone users to participate in crowdsensing, many auction-based incentive mechanisms have been proposed for both offline and online scenarios. It has been demonstrated that the Sybil attack may undermine these mechanisms. In a Sybil attack, a user illegitimately pretends multiple identities to gain benefits. Sybil-proof incentive mechanisms have been proposed for the offline scenario. However, the problem of designing Sybil-proof online incentive mechanisms for crowdsensing is still open. Compared to the offline scenario, the online scenario provides users one more dimension of flexibility, i.e., active time, to conduct Sybil attacks, which makes this problem more challenging. In this paper, we design Sybil-proof online incentive mechanisms to deter the Sybil attack for crowdsensing. Depending on users' flexibility on performing their tasks, we investigate both single-minded and multi-minded cases and propose SOS and SOM, respectively. SOS achieves computational efficiency, individual rationality, truthfulness, and Sybil-proofness. SOM achieves individual rationality, truthfulness, and Sybil-proofness. Through extensive simulations, we evaluate the performance of SOS and SOM.

关键词： Task analysis Smart phones Sensors Microsoft Windows Conferences Privacy Cost function

来源：评论

学校读者我要写书评

暂无评论

Joint Spatial-Temporal Trajectory Clustering Method for Mobile Social Networks

Joint Spatial-Temporal Trajectory Clustering Method for Mobi...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ji Tang Linfeng Liu Jiagao Wu Jian Zhou Yang Xiang School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728125848

As an important issue in the trajectory mining task, the trajectory clustering technique has attracted lots of the attention in the field of data mining. Trajectory clustering technique identifies the similar trajectories (or trajectory segments) and classifies them into the several clusters which can reveal the potential movement behaviors of nodes. At present, most of the existing trajectory clustering methods focus on some spatial properties of trajectories (such as geographic locations, movement directions), while the spatial-temporal properties (especially the combination of spatial distances and semantic distances) are ignored, and thus some vital information regarding the movement behaviors of nodes is probably lost in the trajectory clustering results. In this paper, we propose a Joint Spatial-Temporal Trajectory Clustering Method (JSTTCM), where some spatialtemporal properties of the trajectories are exploited to cluster the trajectory segments. Finally, the number of clusters and the silhouette coefficient are observed through simulations, and the results show that JSTTCM can cluster the trajectory segments appropriately.

关键词： Trajectory clustering Spatial-temporal properties Spatial distances Semantic distances trajectory Social Networks Clustering methods Social Media Ganglia

来源：评论

学校读者我要写书评

暂无评论

Multi-Dimension Training Scheme to Improve the Innovation Capacity of Postgraduate and Undergraduate Students Collaboratively

Multi-Dimension Training Scheme to Improve the Innovation Ca...

引用

Frontiers in Education (FIE) Conference

作者： Xiaolong Xu Jianhua Shen Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China College of Communication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781538611753;9781538611746

This Innovative Practice Work in Progress Paper presents a multi-dimension training scheme to improve the innovation capacity of postgraduate and undergraduate students collaboratively. The current training of postgraduate and undergraduate education schemes cannot form a mutually beneficial relation, not suitable for the training of innovation capacity on postgraduate and undergraduate students collaboratively. There are various problems that need to be addressed. The main strategy of the proposed scheme is utilizing real research programs to establish an integrated team mixed with both postgraduate and undergraduate students, focusing on stimulating their innovation capacity in scientific research. In the scheme, we designed a multi-level joint training mechanism based on the mixed pedagogy, the collaborative resource pool platform, the multi-role and team-based innovation talent incubation mechanism, and the preparatory postgraduate student selection and training goal achievement evaluation mechanism. We applied the scheme to the training process of postgraduate students from the majors of Software Engineering, Computer Software and Theory, Computer Application, Computer Technology and Electronic Information Engineering, and undergraduate students from the majors of Computer Science and Technology, Information security and Communication Engineering in Nanjing University of Posts and Telecommunications. The training results approve the feasibility and effectiveness of the scheme.

关键词： Training Technological innovation Collaboration Software Telecommunications Business

来源：评论

学校读者我要写书评

暂无评论

A Privacy Leak Detection Mechanism based on Service Binding

A Privacy Leak Detection Mechanism based on Service Binding

引用

International Symposium on System and Software Reliability (ISSSR)

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

ISBN: (数字)9798350362930

ISBN: (纸本)9798350362947

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.

关键词： Privacy data privacy Machine learning algorithms Accuracy Operating systems Static analysis Vectors

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Symposium on System and Software Reliability (ISSSR)

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

ISBN: (数字)9798350362930

ISBN: (纸本)9798350362947

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.

关键词： Accuracy Distributed databases Rough sets Feature extraction Safety Object recognition security

来源：评论

学校读者我要写书评

暂无评论

Overdue Prediction of Bank Loans Based on Deep Neural Network

Overdue Prediction of Bank Loans Based on Deep Neural Networ...

引用

2017 International Symposium on Computer Science and Artificial Intelligence（ISCSAI 2017）

作者： Li Xin Sun Guozi Li Huakang Jiangsu Key Lab of Big Data and Security and Intelligent Processing Nanjing University of Posts and Telecommunications Collaborative Innovation Center for Economics crime investigation and prevention technology State Key Laboratory of Mathematical Engineering and Advanced Computing

With the development of information technology, the application of big data in financial aspects becomes more and more deepening. However, in the aspect of bank loans, the accuracy of traditional user loan risk prediction models, such as KNN, Bayesian, are not benefit from the data *** paper proposes to use DNN algorithm to forecast the risk of user loan based on the difficulties of current overdue prediction and the excellent learning ability of DNN. This article uses user basic information, bank records, user browsing behavior, credit card billing records, and loan time information to evaluate whether users are delinquent. Firstly, this paper record bank records according to the transaction type, respectively, to generate income and spending data. Secondly, to sum the user browsing behavior also, and to record the average of credit card bill. In addition, in order to reduce the effect of eigenvalue size on the result, all characteristics are standardized. Finally, users who lack user information are discarded and the above fields are spliced. The spliced fields are the basic input for DNN. From the experimental results, DNN algorithm inc rease over 6% prediction than kNN, Bayes algorithm.

关键词： Overdue Prediction Bank Loans DNN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：