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

Personalized Privacy-Preserving Routing Mechanism Design in Payment Channel Network

Journal of Computer Science & Technology 2024年第6期39卷 1380-1400页

作者： Peng-Cheng Zhao Li-Jie Xu Jia Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China

Payment Channel Network(PCN)provides the off-chain settlement of *** is one of the most promising solutions to solve the scalability issue of the *** routing techniques in PCN have been ***,both incentive attack and privacy protection have not been considered in existing *** this paper,we present an auction-based system model for PCN routing using the Laplace differential privacy *** formulate the cost optimization problem to minimize the path cost under the constraints of the Hashed Time-Lock Contract(HTLC)tolerance and the channel *** propose an approximation algorithm to find the top K shortest paths constrained by the HTLC tolerance and the channel capacity,i.e.,top K-restricted shortest ***,we design the probability comparison function to find the path with the largest probability of having the lowest path cost among the top K-restricted shortest paths as the final ***,we apply the binary search to calculate the transaction fee of each *** both theoretical analysis and extensive simulations,we demonstrate that the proposed routing mechanism can guarantee the truthfulness and individual rationality with the probabilities of 1/2 and 1/4,*** can also ensure the differential privacy of the *** experiments on the real-world datasets demonstrate that the privacy leakage of the proposed mechanism is 73.21%lower than that of the unified privacy protection mechanism with only 13.2%more path cost compared with the algorithm without privacy protection on average.

关键词： blockchain payment channel network routing mechanism differential privacy personalized privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

FDSR-INT: A Flexible On-Demand In-Band Telemetry Approach for Aerial Computing Networks

引用

IEEE Internet of Things Journal 2025年

作者： Xu, Jinghan Xu, Xiaolong Zhao, Juan Gao, Honghao Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing The School of Computer Science Nanjing210023 China Jinling Institute of Technology School of Computer Science Nanjing211169 China Shanghai University School of Computer Engineering and Science Shanghai200444 China Gachon University College of Future Industry Gyeonggi-Do 461-701 Korea Republic of

In-band network telemetry (INT) is a new network measurement technique that provides real-time, fine-grained packet-level network measurements. However, standard INT lacks the flexibility to perform configurable on-demand network measurements. In this work, we propose a flexible on-demand network measurement mechanism (FDSR-INT) based on a dual bitmap by combining the programmability of segment routing based on IPv6 (SRv6) and the telemetry efficiency of the INT to achieve customizable network measurements. By designing the dual bitmap, the telemetry information of personalized probe nodes is supported, and the telemetry efficiency is improved. SRv6 is employed to direct measurement probe packets, ensuring coverage of a specified set of network targets. Its inherent programmability enables INT to conduct customized per-hop network measurements. The designed flexible INT field structure, which appends traceability information along with telemetry information, reduces the information traceability overhead in the control plane and improves the network compatibility of the mechanism. We solve the optimal probing path by solving a traveler problem in an auxiliary graph and design a greedy pathcutting algorithm to maximize the number of nodes for single packet probing while satisfying the packet length constraints to improve the success rate of the probing task. Finally, we implemented FDSR-INT using P4 and verified its performance experimentally in the constructed *** integrated simulation dynamic environment. FDSR-INT saves 30% of the data plane bandwidth and 54% of the data plane bandwidth on *** interfaces compared with SONM-SR-INT, etc. Furthermore, it has low control plane processing overhead and probe path transmission overhead. © 2014 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in cognitive wireless powered communication networks with wirelessly powered secondary users and primary users

引用

Science China(Information Sciences) 2019年第2期62卷 224-229页

作者： Ding XU Qun LI Wireless Communication Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications

Dear editor,Wireless powered communication networks(WPCNs) are popular especially for wireless sensor networks where sensors can be wirelessly powered. For coordinating wireless power and information transfer, Ju and Zhang in their pioneer work [1] proposed a "harvest-then-transmit" protocol for WPCN, where the time for wireless power transfer (WPT) and wireless information transfer(WIT) is divided into two phases:the WPT phase and WIT phase. Meanwhile, cognitive radio (CR)

关键词： WIT Resource allocation in cognitive wireless powered communication networks with wirelessly powered secondary users and primary users

来源：评论

学校读者我要写书评

暂无评论

Learning Comprehensive Representation via Selective Activation and Dual-Level Orthogonality for Pedestrian Attribute Recognition

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Wu, Junyi Huang, Yan Gao, Min Niu, Yuzhen Chen, Yuzhong Wu, Qiang Zhao, Jianqiang Ministry of Education Engineering Research Center of Big Data Intelligence China Ai Research Center Sdic Intelligence Xiamen Information Co. Ltd Xiamen China Xiamen Meiya Pico Information Security Research Institute Co. Ltd Xiamen China Institute of Automation Beijing China Fuzhou University Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou China University of Technology Sydney School of Electrical and Data Engineering Ultimo Australia

Multi-label Pedestrian Attribute Recognition (PAR) involves identifying a series of semantic attributes in person images. Existing PAR solutions typically rely on CNN as the backbone network to extract pedestrian features. Unfortunately, CNNs process only one adjacent region at a time, resulting in the disappearance of long-range relations between different attribute-specific regions. To address this limitation, we adopt the Vision Transformer (ViT) instead of CNN as the backbone for PAR, aiming to build long-range relations and extract more robust features. However, PAR suffers from an inherent attribute imbalance issue, causing ViT to naturally focus more on attributes that appear frequently in the training set and ignore some pedestrian attributes that appear less. The native features extracted by ViT are not able to tolerate the imbalance attribute distribution issue. To tackle this issue, we propose a novel component and a dual-level loss: the Selective Feature Activation Method (SFAM), the Orthogonal Feature Activation Loss (OFALoss), and Orthogonal Weight Regularization Loss (OWRLoss). SFAM smartly suppresses the more informative attribute-specific features, thus compelling the PAR model to pay greater attention to attribute-specific regions that are often overlooked. The proposed OFALoss enforces an orthogonal constraint on the original feature extracted by ViT and the suppressed features from SFAM, promoting the comprehensiveness of feature representation in each attribute-specific region. Furthermore, OWRLoss is employed for decreasing correlations among entries of the last shared classification layer, which can alleviate the highly correlated of weight vectors caused by non-uniform distribution. This can prevent excessive mutual interference among different attributes during attribute recognition. Our model-agnostic approach is plug-and-play, requiring no additional training parameters in the training process. We conduct experiments on several benchmark P

关键词： Dual-Level Orthogonal Regularization Pedestrian Attribute Recognition Selective Feature Activation

来源：评论

学校读者我要写书评

暂无评论

FIMI： A Constant Frugal Incentive Mechanism for Time WindowCoverage in Mobile Crowdsensing

引用

Journal of Computer Science & Technology 2017年第5期32卷 919-935页

作者： Jia Xu Jian-Ren Fu De-Jun Yang Li-Jie Xu Lei Wang Tao Li School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Department of Computer Science Colorado School of Mines Golden 80401 U.S.A.

Mobile crowdsensing has become an efficient paradigm for performing large-scale sensing tasks. An incentive mechanism is important for a mobile crowdsensing system to stimulate participants and to achieve good service quality. In this paper, we explore truthful incentive mechanisms that focus on minimizing the total payment for a novel scenario, where the platform needs the complete sensing data in a requested time window (RTW). We model this scenario as a reverse auction and design FIMI, a constant frugal incentive mechanism for time window coverage. FIMI consists of two phases, the candidate selection phase and the winner selection phase. In the candidate selection phase, it selects two most competitive disjoint feasible user sets. Afterwards, in the winner selection phase, it finds all the interchangeable user sets through a graph-theoretic approach. For every pair of such user sets, FIMI chooses one of them by the weighted cost. Further, we extend FIMI to the scenario where the RTW needs to be covered more than once. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the proposed mechanisms achieve the properties of RTW feasibility (or RTW multi-coverage), computation efficiency, individual rationality, truthfulness, and constant frugality.

关键词： crowdsensing incentive mechanism constant frugality

来源：评论

学校读者我要写书评

暂无评论

Server load prediction algorithm based on CM-MC for cloud systems

引用

Journal of Systems Engineering and Electronics 2018年第5期29卷 1069-1078页

作者： XU Xiaolong ZHANG Qitong MOU Yiqi LU Xinyuan Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications State Key Laboratory of Information Security Chinese Academy of Sciences Shanghai Stock Exchange Technology Co. LtdShanghai Stock Exchange Institute of Big Data Research at Yancheng Nanjing University of Posts and Telecommunications

Accurate prediction of server load is important to cloud systems for improving the resource utilization, reducing the energy consumption and guaranteeing the quality of service(QoS).This paper analyzes the features of cloud server load and the advantages and disadvantages of typical server load prediction algorithms, integrates the cloud model(CM) and the Markov chain(MC) together to realize a new CM-MC algorithm, and then proposes a new server load prediction algorithm based on CM-MC for cloud systems. The algorithm utilizes the historical data sample training method of the cloud model, and utilizes the Markov prediction theory to obtain the membership degree vector, based on which the weighted sum of the predicted values is used for the cloud model. The experiments show that the proposed prediction algorithm has higher prediction accuracy than other typical server load prediction algorithms, especially if the data has significant volatility. The proposed server load prediction algorithm based on CM-MC is suitable for cloud systems, and can help to reduce the energy consumption of cloud data centers.

关键词： cloud computing load prediction cloud model Markov chain energy saving

来源：评论

学校读者我要写书评

暂无评论

Multi-task regression learning for survival analysis via prior information guided transductive matrix completion

引用

Frontiers of Computer Science 2020年第5期14卷 99-112页

作者： Lei Chen Kai Shao Xianzhong Long Lingsheng Wang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing210023China MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and AstronauticsNanjing211106China

Survival analysis aims to predict the occurrence time of a particular event of interest,which is crucial for the prognosis analysis of ***,due to the limited study period and potential losing tracks,the observed data inevitably involve some censored instances,and thus brings a unique challenge that distinguishes from the general regression *** addition,survival analysis also suffers from other inherent challenges such as the high-dimension and small-sample-size *** address these challenges,we propose a novel multi-task regression learning model,i.e.,prior information guided transductive matrix completion(PigTMC)model,to predict the survival status of the new ***,we use the multi-label transductive matrix completion framework to leverage the censored instances together with the uncensored instances as the training samples,and simultaneously employ the multi-task transductive feature selection scheme to alleviate the overfitting issue caused by high-dimension and small-sample-size *** addition,we employ the prior temporal stability of the survival statuses at adjacent time intervals to guide survival ***,we design an optimization algorithm with guaranteed convergence to solve the proposed PigTMC ***,the extensive experiments performed on the real microarray gene expression datasets demonstrate that our proposed model outperforms the previously widely used competing methods.

关键词： survival analysis matrix completion multi-task regression transductive learning multi-task feature selection

来源：评论

学校读者我要写书评

暂无评论

Relation Classification based on Selective Entity-Aware Attention 25

Relation Classification based on Selective Entity-Aware Atte...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Ding, Haijie Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Jiangsu Nanjing China

ISBN: (纸本)9781665405270

Relation classification aims to classify the entity pairs into a certain relation, which is an important task of natural language processing. The latest end-to-end models based on attention mechanism still have shortcomings, i.e., the attention will be gradually weakened when processing long sequences, and they cannot make use of the hidden type information of the entities. To solve these problems, we propose a relation classification model based on the selective entity-aware attention mechanism, which consists of context encoder and entity-aware attention network. In the context encoder, contextual word semantics are learned through self-attention. Entity selection is applied to adapt the fact that different words can determine each other's importance. Latent types of entities are taken as auxiliary information to make full use of the entities' hidden features. Experiments on the SemEval-2010 Task 8 dataset and TACRED show that our model outperforms the baselines without implementing any external resources or NLP tools, and the entity-aware attention indeed improve the model's performance. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

CETO-Sim: A Simulation Platform for Cloud-Edge Task Offloading 25

CETO-Sim: A Simulation Platform for Cloud-Edge Task Offloadi...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Yao, Rui Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Jiangsu Nanjing China

ISBN: (纸本)9781665405270

In order to verify the effectiveness of task offloading algorithms in large-scale cloud and edge computing systems, scholars usually use simulation platforms to conduct extensive experiments. However, existing simulation platforms have unclear application scenarios and relatively homogeneous functions, which cannot fully exploit the respective advantages of cloud and edge computing. To address the above issues, this paper designs a new simulation platform, CETO-Sim (Cloud-Edge Task Offloading Simulation), for the cloud-edge aggregation computing scenario, which is convenient for users to verify the effectiveness of the task offloading algorithm. The platform adopts a modular design strategy, allowing users to invoke the various interfaces provided by the platform to simulate and build different physical entities, and to freely combine them to simulate different computing environments. The platform contains six components: task management component, network topology component, end-user component, scheduling policy component, server component and operation component. The platform simulates the task offloading process through the interaction between these components, while recording the changes of various parameters of tasks and simulated entities in real time, and finally printing out the experimental results in the form of logs. This paper presents an example of task offloading using the particle swarm algorithm in a cloud-side aggregated computing environment, demonstrating that the CETO-Sim platform has the advantages of clear architecture, simple operation, easy deployment, accurate experimental results and high simulation efficiency, and also verifying the feasibility of deploying the platform in other scenarios. © 2022 IEEE.

关键词： Simulation platform

来源：评论

学校读者我要写书评

暂无评论

VECSim: A Simulation Platform for Multi-bitrate Video Caching Collaboratively in Edge Computing Network 25

VECSim: A Simulation Platform for Multi-bitrate Video Cachin...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Chen, Peipei Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Jiangsu Nanjing China

ISBN: (纸本)9781665405270

The development of the mobile Internet has led to a shape increase in video traffic data. New Mobile Edge Computing (MEC) technology can reduce network operation and service delivery delays, so as to improving the QoE (Quality of Experience) of user. In MEC environment, this article builds a simulation platform for multi-bitrate video caching and scheduling scenarios VECSim (Video Edge CloudSim). VECSim provides a simulation environment specific to verify multi-bitrate video caching collaboratively and scheduling strategy in the Mobile Edge Computing scenarios. Unlike simple numerical simulations and complex real-world deployments, VECSim provides a simple interface that can be called by the user, besides, it can be used to provide larger-scale, more flexible request scenarios which are closer to the actual environment. Based on the edge computing simulation platform EdgeCloudSim, this platform adds and modifies quite a few functions so that it can be effectively used in multi-bitrate video caching and scheduling scenarios, which now includes seven main modules: Server Management Modules, Network Module, User Mobility Module, Task Loader Generator Module, Video Storage Module, Edge Client Management Module, and Edge Orchestrator Module. With this platform, researchers can easily and quickly verify their video caching and scheduling strategies. © 2022 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：