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

SSRN 2023年

作者： Xu, Yang Xu, Xiaolong Xiao, Fu 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

Few-shot text classification aims to learn transferable knowledge from a limited dataset to perform classification tasks in unseen domains. Recently, metric-based meta-learning methods have demonstrated their advantages in few-shot text classification. However, the influence of randomly sampling support set on prototype quality has often been overlooked by these methods. In this paper, we propose a Label-Guided Contrastive Capsule Network (LGCCN) to address this issue. LGCCN leverages label information to guide supervised contrastive learning, using labels as anchors to enhance the clustering process, resulting in higher-quality sentence vectors. Furthermore, LGCCN employs label-guided dynamic routing process to iteratively generate a prototype, significantly mitigating the impact of random support set sampling. We conducted extensive experiments on four datasets, comparing LGCCN with recent methods. The results reveal that LGCCN, compared to the recent best work, has achieved an improvement of 10.1% and 2.1% in classification accuracy for 1-shot and 5-shot tasks, respectively. Additionally, ablation studies validate the effectiveness of each module in our approach. © 2023, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Variance Minimization Approach to Temporal-Difference Learning

arXiv

引用

arXiv 2024年

作者： Chen, Xingguo Gong, Yu Yang, Shangdong Wang, Wenhao Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China College of Electronic Engineering National University of Defense Technology China

Fast-converging algorithms are a contemporary requirement in reinforcement learning. In the context of linear function approximation, the magnitude of the smallest eigenvalue of the key matrix is a major factor reflecting the convergence speed. Traditional value-based RL algorithms focus on minimizing errors. This paper introduces a variance minimization (VM) approach for value-based RL instead of error minimization. Based on this approach, we proposed two objectives, the Variance of Bellman Error (VBE) and the Variance of Projected Bellman Error (VPBE), and derived the VMTD, VMTDC, and VMETD algorithms. We provided proofs of their convergence and optimal policy invariance of the variance minimization. Experimental studies validate the effectiveness of the proposed algorithms. © 2024, CC BY-SA.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yu Jiang Xiaolong Xu Kunda Lin Weihua Duan 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: (纸本)9781665408790

In order to select a composition scheme that meets user's needs and high performance from large-scale web services in the edge cloud, this paper proposes a trusted service composition optimization scheme called TSC-ECFA for edge cloud, which applies the predation strategy to the firefly algorithm (FA) and divides the services with the same input and output into one category, reducing the number of combinations to search for feasible solutions. The cotangent chaos theory is used to generate the initial firefly population and disturb the location of the individual to improve the overall search efficiency of FA. This paper also improves the step factor and attractiveness formula of FA to give full play to the detection ability of the step factor in the early stage of the algorithm, and balance the local search and the global search. Considering that the QoS attribute values of the service are vulnerable to be tampered with, the blockchain is used to store the QoS attribute values to ensure the tamper-proof and reliability of the QoS attribute value. Finally, simulation experiments compare the number of iterations and optimization of the three algorithms. The experimental results show that the comprehensive performance of TSC-ECFA is better than other algorithms.

关键词： Chaos Web services Conferences Sociology Quality of service Reliability theory Blockchains

来源：评论

学校读者我要写书评

暂无评论

RPSBPT: A Route Planning Scheme with Best Profit for Taxi

RPSBPT: A Route Planning Scheme with Best Profit for Taxi

引用

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

来源：评论

学校读者我要写书评

暂无评论

A Novel Gradient Descent Least-Squares (GDLSs) Algorithm for Efficient Gridless Line Spectrum Estimation With Applications in Tomographic SAR Imaging

A Novel Gradient Descent Least-Squares (GDLSs) Algorithm for...

引用

作者： Shi, Ruizhe Zhang, Zhe Qiu, Xiaolan Ding, Chibiao University of Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering Beijing100190 China Suzhou Aerospace Information Research Institute Suzhou Key Laboratory of Intelligent Aerospace Big Data Application Technology Suzhou Jiangsu215123 China CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Beijing100190 China

This article presents a novel efficient method for gridless line spectrum estimation problems with single snapshot and sparse signals, namely the gradient descent least-squares (GDLS) method. Conventional single-snapshot (a.k.a. single-measure vector or SMV) line spectrum estimation methods either rely on smoothing techniques that sacrifice the range and/or azimuth resolution or adopt the sparsity constraint and utilize the compressed sensing (CS) method by defining prior grids and resulting in the off-grid problem. Recently emerged atomic norm minimization (ANM) methods achieved gridless SMV line spectrum estimation, but its computational complexity is extremely high;thus, it is practically infeasible in real applications with large problem scales. Our proposed GDLS method reformulates the line spectrum estimations problem into a least-squares (LSs) estimation problem and solves the corresponding objective function via a gradient descent algorithm in an iterative fashion with efficiency. The convergence guarantee, computational complexity, and performance analysis for evenly distributed antenna array cases are discussed in this article. Numerical simulations show that the proposed GDLS algorithm outperforms the state-of-the-art methods, for example, CS and ANM, in terms of estimation performances. It can completely avoid the off-grid problem, and its computational complexity is significantly lower than ANM. Our method has been tested in tomographic SAR (TomoSAR) imaging applications via simulated and real experimental data. Results show the great potential of the proposed method in terms of better cloud point performance and eliminating the gridding effect. © 1980-2012 IEEE.

关键词： Spectrum analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：