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

Topic-aware Incentive Mechanism for Task Diffusion in Mobile Crowdsourcing through Social Network

ACM Transactions on Internet Technology 2021年第1期22卷 1-23页

作者： Xu, Jia Zhou, Yuanhang Chen, Gongyu Ding, Yuqing Yang, Dejun Liu, Linfeng Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications 9 Wenyuan Rd Jiangsu Nanjing210023 China Colorado School of Mines 1500 Illinois St. GoldenCO80401 United States

Crowdsourcing has become an efficient paradigm to utilize human intelligence to perform tasks that are challenging for machines. Many incentive mechanisms for crowdsourcing systems have been proposed. However, most of existing incentive mechanisms assume that there are sufficient participants to perform crowdsourcing tasks. In large-scale crowdsourcing scenarios, this assumption may be not applicable. To address this issue, we diffuse the crowdsourcing tasks in social network to increase the number of participants. To make the task diffusion more applicable to crowdsourcing system, we enhance the classic Independent Cascade model so the influence is strongly connected with both the types and topics of tasks. Based on the tailored task diffusion model, we formulate the Budget Feasible Task Diffusion (BFTD) problem for maximizing the value function of platform with constrained budget. We design a parameter estimation algorithm based on Expectation Maximization algorithm to estimate the parameters in proposed task diffusion model. Benefitting from the submodular property of the objective function, we apply the budget-feasible incentive mechanism, which satisfies desirable properties of computational efficiency, individual rationality, budget-feasible, truthfulness, and guaranteed approximation, to stimulate the task diffusers. The simulation results based on two real-world datasets show that our incentive mechanism can improve the number of active users and the task completion rate by 9.8% and 11%, on average. © 2021 Association for Computing Machinery.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes

arXiv

引用

arXiv 2025年

作者： Wang, Xiaoqiang Li, Liuyi Wu, Yansheng Zheng, Dabin Lu, Shuxian Hubei Key Laboratory of Applied Mathematics Key Laboratory of Intelligent Sensing System and Security Ministry of Education Faculty of Mathematics and Statistics Hubei University Wuhan430062 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China National Mobile Communications Research Laboratory Southeast University Nanjing211111 China

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite family of Euclidean self-dual binary and nonbinary cyclic codes, whose minimum distances have a square-root lower bound and have a lower bound better than square-root lower bounds are constructed in [6] for the lengths of these codes being unbounded. Let q be a power of a prime number and Q = q2. In this paper, we first improve the lower bounds on the minimum distances of Euclidean and Hermitian duals of BCH codes with length (formula presented) over (formula presented) and (formula presented) over FQ in [11], [13], [31] for the designed distances in some ranges, respectively, where (formula presented). Then based on matrix-product construction and some lower bounds on the minimum distances of BCH codes and their duals, we obtain several classes of Euclidean and Hermitian self-dual codes, whose minimum distances have square-root lower bounds or a square-root-like lower bounds. Our lower bounds on the minimum distances of Euclidean and Hermitian self-dual cyclic codes improved many results in [6]. In addition, our lower bounds on the minimum distances of the duals of BCH codes are almost qs − 1 or q times that of the existing lower bounds. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Location and Lightpath Selection in Multi-Domain Optical data Center Networks

Location and Lightpath Selection in Multi-Domain Optical Dat...

引用

Mobile Internet, Cloud Computing and Information security (MICCIS), International Conference on

作者： Changle Xu Xu Zhang Chuan Feng Xiaoxue Gong School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9798350389906

ISBN: (纸本)9798350389913

In the era of booming fifth-generation fixed networks (F5G), the service demands for high bandwidth continue to grow. Meanwhile, in multi-domain network scenarios, service requests are vulnerable to physical layer attacks initiated by malicious clients. In this paper, a risk-aware heuristic algorithm is proposed to address the problem of lightpath provisioning in multi-domain elastic optical data center networks (EODCNs). Simulation results show that the blocking probability of the proposed algorithm is lower than the comparison algorithm, 8.2% and 8.8% lower in NSFNET topology and US-Backbone topology, respectively.

关键词： Integrated optics Multiplexing data centers Network topology Optical design Simulation Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Segment Routing based In-Band Network Telemetry in IPv6 over Optical Networks

Segment Routing based In-Band Network Telemetry in IPv6 over...

引用

Mobile Internet, Cloud Computing and Information security (MICCIS), International Conference on

作者： Wei Liu Xu Zhang Chuan Feng Xiaoxue Gong School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9798350389906

ISBN: (纸本)9798350389913

With the rise of automated network operations, network telemetry has become increasingly important. Optical networks play a key role in modern communication systems because of their high bandwidth, low latency, and low loss. To better manage and monitor Internet Protocol version 6 (IPv6) over optical networks, programmable data planes (PDP) are used to achieve flexible data collection. Meanwhile, to solve the scalability problem of the control plane in the software-defined network (SDN), segment routing over IPv6 (SRv6) is introduced. By programming the source node on the path, SRv6 wisely instructs packets to collect the appropriate telemetry data at the segment nodes to balance the trade-off between bandwidth usage and monitoring coverage. To efficiently achieve the observability of IPv6 over optical networks, we model the system and propose an SRv6-based in-band network telemetry (INT) algorithm. Simulation results verify the performance of our algorithm.

关键词： Protocols Simulation Bandwidth Optical fiber networks Routing Universal Serial Bus Topology

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Prompt Learning for Face Anti-Spoofing 24

Fine-Grained Prompt Learning for Face Anti-Spoofing

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Hu, Xueli Liu, Huan Yuan, Haocheng Fu, Zhiyang Luo, Yizhi Zhang, Ning Zou, Hang Gan, Jianwen Zhang, Yuan Key Laboratory of Cyberspace Security Ministry of Education Zhengzhou China Beijing Jiaotong University Beijing China Macau University of Science and Technology China Sichuan Intelligent Transportation System Management Co. Ltd. Chengdu China Institute of Forensic Science Beijing China China Telecom Research Institute Beijing China Wuzhou University Wuzhou China China Telecom Research Institute Shanghai China

ISBN: (纸本)9798400706868

There has been an increasing focus on domain-generalized (DG) face anti-spoofing (FAS). However, existing methods aim to project a shared visual space through adversarial training, making exploring the space without losing semantic information challenging. We investigate the DG inadequacies resulting from classifier overfitting to a significantly different domain distribution. To address this issue, we propose a novel Fine-Grained Prompt Learning (FGPL) based on Vision-Language Models (VLMs), such as CLIP, which can adaptively adjust weights for classifiers with text features to mitigate overfitting. Specifically, FGPL first motivates the prompts to learn content and domain semantic information by capturing Domain-Agnostic and Domain-Specific features. Furthermore, our prompts are designed to be category-generalized by diversifying the Domain-Specific prompts. Additionally, we design an Adaptive Convolutional Adapter (AC-adapter), which is implemented through an adaptive combination of Vanilla Convolution and Central Difference Convolution, to be inserted into the image encoder for quickly bridging the gap between general image recognition and FAS task. Extensive experiments demonstrate that the proposed FGPL is effective and outperforms state-of-the-art methods on several cross-domain datasets. © 2024 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

MCU-Net: A Multi-prior Collaborative Deep Unfolding Network with Gates-controlled Spatial Attention for Accelerated MR Image Reconstruction

arXiv

引用

arXiv 2024年

作者： Qiao, Xiaoyu Li, Weisheng Wang, Guofen Huang, Yuping Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China College of Computer and Information Science Chongqing Normal University Chongqing China

Deep unfolding networks (DUNs) have demonstrated significant potential in accelerating magnetic resonance imaging (MRI). However, they often encounter high computational costs and slow convergence rates. Besides, they struggle to fully exploit the complementarity when incorporating multiple priors. In this study, we propose a multi-prior collaborative DUN, termed MCU-Net, to address these limitations. Our method features a parallel structure consisting of different optimization-inspired subnetworks based on low-rank and sparsity, respectively. We design a gates-controlled spatial attention module (GSAM), evaluating the relative confidence (RC) and overall confidence (OC) maps for intermediate reconstructions produced by different subnetworks. RC allocates greater weights to the image regions where each subnetwork excels, enabling precise element-wise collaboration. We design correction modules to enhance the effectiveness in regions where both subnetworks exhibit limited performance, as indicated by low OC values, thereby obviating the need for additional branches. The gate units within GSAMs are designed to preserve necessary information across multiple iterations, improving the accuracy of the learned confidence maps and enhancing robustness against accumulated errors. Experimental results on multiple datasets show significant improvements on PSNR and SSIM results with relatively low FLOPs compared to cutting-edge methods. Additionally, the proposed strategy can be conveniently applied to various DUN structures to enhance their performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

SFma-Unet: A Mamba-Based Spatial-Frequency Fusion Network for Medical Image Segmentation

SFma-Unet: A Mamba-Based Spatial-Frequency Fusion Network fo...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhanpeng Liu Yuqiang Zhang Bin Wang Yang Yang Lin Cai Institute of Artificial Intelligence Xiamen University Xiamen China Key Laboratory of Intelligent Sensing System and Security (Ministry of Education) School of Artificial Intelligence Hubei University Wuhan China School of Life Sciences Hubei University Wuhan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Recently, Mamba-based methods have gained popularity in medical image segmentation due to their ability to model long-range dependencies with linear computational complexity. However, current segmentation methods often face challenges such as low contrast, blurred boundaries, and unclear backgrounds in medical images. Considering that perceived objects and features exhibit greater discriminative power in the frequency domain, we propose a novel mamba-based spatial and frequency domain feature fusion network, SFMa-Unet, to address these challenges. Specifically, we designed the Spatial-Frequency Interaction (SFI) module, which leverages the powerful modeling capabilities of Mamba to fuse spatial and frequency domain features, enhancing feature representation. Additionally, we developed a Mamba-based multi-scale feature channel fusion (MFCF) bridge to capture local and global dependencies across different feature scales, further improving the model’s representational capacity. We conduct comprehensive experiments on the ISIC17 and ISIC18 public datasets. Experimental results demonstrate the effectiveness and robustness of SFMa-Unet. Codes are available at https://***/RainCh-zyq/SFma-Unet.

关键词： Bridges Image segmentation Solid modeling Three-dimensional displays Frequency-domain analysis Semisupervised learning Signal processing Robustness Speech processing Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Image Semantic Communication system Based on GAN and Relative Position-Encoding

引用

IEEE Communications Letters 2025年

作者： Zhang, Ziqi Tan, Weijie Li, Chunguo Guizhou University College of Big Data and Information Engineering Guiyang550025 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Ministry of Industry and Information Technology Laboratory of Cryptography Application Technology Innovation and Testing Verification Beijing100015 China Southeast University School of Information Science and Engineering Nanjing210096 China

In image semantic communication, the complex wireless channel environment leads to the loss of image details and performance degradation during transmission. To address this issue, we propose an image semantic communication system based on Generative Adversarial Networks (GAN) and Relative Position-Encoding (RPE), named GAN-RpeSC. Specifically, in the system design, we introduce the GAN network at the output of the semantic communication framework to enhance the image restoration. We integrate the RPE module into the Visual Transformer (ViT) module, adding the RPE module to its Multihead Self Attention (MHSA), so that the model can better capture the spatial location information of the image. Experimental results show that the proposed GAN-RpeSC has significant advantages in improving image transmission quality, with a 0.3 dB improvement in peak signal-to-noise ratio (PSNR) compared to the ViT module alone. © 1997-2012 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Learning Counterfactual Explanation of Graph Neural Networks Via Generative Flow Network

SSRN

引用

SSRN 2023年

作者： He, Kangjia Liu, Li Zhang, Youmin Wang, Ye Liu, Qun Wang, Guoyin School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China

Counterfactual subgraphs explain Graph Neural Networks (GNNs) by answering the question: "How would the prediction change if a certain subgraph were absent in the input instance?" The differentiable proxy adjacency matrix is prevalent in current counterfactual subgraph discovery studies due to its ability to avoid exhaustive edge searching. However, a prediction gap exists when feeding the proxy matrix with continuous values and the thresholded discrete adjacency matrix to GNNs, compromising the optimization of the subgraph generator. Furthermore, the end-to-end learning schema adopted in the subgraph generator limits the diversity of counterfactual subgraphs. To this end, we propose CF-GFNExplainer, a flow-based approach for learning counterfactual subgraphs. CF-GFNExplainer employs a policy network with a discrete edge removal schema to construct counterfactual subgraph generation trajectories. Additionally, we introduce a reward and loss function designed to guide CF-GFNExplainer's optimization. The discrete adjacency matrix generated in each trajectory eliminates the prediction gap, enhancing the validity of the learned subgraphs. Furthermore, the multi-trajectories sampling strategy adopted in CF-GFNExplainer results in diverse counterfactual subgraphs. Extensive experiments conducted on synthetic and real-world datasets demonstrate the effectiveness of the proposed method in terms of validity and diversity. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：