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

DimSum: Disentangling Representation with Automatically Generated Multi-Category Summary Templates for Fine-grained Opinion Summarization

引用

Expert Systems with Applications 2025年

作者： Zhenglin Wang Deyu Zhou School of Computer Science and Engineering Ministry of Education Key Laboratory of Computer Network and Information Integration Southeast University No. 2 Southeast University Road Jiangning District Nanjing Jiangsu Province 210000 China

Supervised opinion summarization often employs a select-then-generate framework, while noticeable templated phenomena are observed in the generated summaries, indicating the inability to produce a fine-grained summary with the corresponding aspect information. Therefore, we propose DimSum , an end-to-end supervised summarization method based on disentangling summary representation with multi-category summary templates. Considering the product category the input describes, different summary templates are used to disentangle the summary representations into content and pattern parts. Only the content part is utilized to generate the final summary. Moreover, summary templates are automatically generated for each product category by training a template generator with contrastive learning and then clustering the outputs. Automatic and human evaluation results on the summarization dataset AmaSum show that the proposed approach outperforms several strong baselines, indicating its effectiveness in opinion summarization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Grouping Strategy-Based Progressive Fusion network for Hyperspectral Image Super-Resolution

A Grouping Strategy-Based Progressive Fusion Network for Hyp...

引用

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

作者： Guohua Lv Baodong Zhang Yongbiao Gao Guixin Zhao Guotao Wang Juncan Wang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Shandong Key Laboratory of Ubiquitous Intelligent Computing Jinan China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application (Southeast University) Ministry of Education China Beihang University Beijing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Hyperspectral super-resolution involves combining low-resolution hyperspectral images with high-resolution multispectral images to produce a high-resolution hyperspectral image. Recently, although many methods for hyperspectral image super-resolution have been proposed, they often fail to fully utilize the high similarity among adjacent bands to enhance fusion performance. Therefore, we propose a grouping strategy-based progressive fusion network (GPFNet) for hyperspectral super-resolution. The core of GPFNet is the grouping strategy fusion block (GPF block), in which grouping-based spatial-spectral information fusion and spatial information refinement are performed. We design the spatial-spectral information fusion module (SSIFM) based on grouped convolutions to capture the feature differences from adjacent bands. To refine spatial details, we develop the spatial information enhancement module (SpaEM), which leverages the hierarchical features extracted by the multi-scale feature extraction module (MIEM). Additionally, a progressive fusion strategy, which involves using multiple upsampled hyperspectral images and downsampled multispectral images, further preserves spectral integrity and spatial details. Extensive experiments show that GPFNet outperforms state-of-the-art methods both qualitatively and quantitatively.

关键词： Convolution Superresolution Feature extraction Acoustics Data mining Speech processing Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis and improvement of quantum broadcast communication and authentication protocol with a quantum one-time pad

引用

Chinese Physics B 2016年第8期25卷 59-64页

作者：刘志昊陈汉武 School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Center for Quantum Computation and Intelligent Systems Faculty of Engineering and Information TechnologyUniversity of Technology Sydney

The security of quantum broadcast communication（QBC） and authentication protocol based on Greenberger–Horne–Zeilinger（GHZ） state and quantum one-time pad is analyzed. It is shown that there are some security issues in this ***, an external eavesdropper can take the intercept–measure–resend attack strategy to eavesdrop on 0.369 bit of every bit of the identity string of each receiver without being detected. Meanwhile, 0.524 bit of every bit of the secret message can be eavesdropped on without being detected. Secondly, an inner receiver can take the intercept–measure–resend attack strategy to eavesdrop on half of the identity string of the other＇s definitely without being checked. In addition, an alternative attack called the CNOT-operation attack is discussed. As for the multi-party QBC protocol, the attack efficiency increases with the increase of the number of users. Finally, the QBC protocol is improved to a secure one.

关键词： cryptanalysis quantum broadcast communication information leakage intercept-measure-resendattack CNOT-operation attack

来源：评论

学校读者我要写书评

暂无评论

FLSSM: A Federated Learning Storage Security Model with Homomorphic Encryption

arXiv

引用

arXiv 2025年

作者： Li, Yang Xia, Chunhe Li, Chang Li, Xiaojian Wang, Tianbo School of Computer Science and Engineering Beihang University Beijing100191 China Key Laboratory of Beijing Network Technology Beihang University Beijing100191 China Guangxi Collaborative Innovation Center Multi-Source Information Integration and Intelligent Processing Guangxi Normal University Guilin541004 China School of Computer Science and Technology Zhengzhou University of Light Industry Zhengzhou450000 China College of Computer Science and Information Technology Guangxi Normal University Guilin541004 China School of Cyber Science and Technology Beihang University Beijing100191 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China

Federated learning based on homomorphic encryption has received widespread attention due to its high security and enhanced protection of user data privacy. However, the characteristics of encrypted computation lead to three challenging problems: "computation-efficiency", "attack-tracing" and "contribution-assessment". The first refers to the efficiency of encrypted computation during model aggregation, the second refers to tracing malicious attacks in an encrypted state, and the third refers to the fairness of contribution assessment for local models after encryption. This paper proposes a federated learning storage security model with homomorphic encryption (FLSSM) to protect federated learning model privacy and address the three issues mentioned above. First, we utilize different nodes to aggregate local models in parallel, thereby improving encrypted models’ aggregation efficiency. Second, we introduce trusted supervise nodes to examine local models when the global model is attacked, enabling the tracing of malicious attacks under homomorphic encryption. Finally, we fairly reward local training nodes with encrypted local models based on trusted training time. Experiments on multiple real-world datasets show that our model significantly outperforms baseline models in terms of both efficiency and security metrics. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Direction-Based Data Forwarding Algorithm for Opportunistic networks

引用

Journal of Electronic Science and Technology 2016年第2期14卷 152-159页

作者： Jie Yu Yue Ling Si-Ying Li Hui-Qi Fang Lin-Feng Liu School of Computer Science and Technology Nangjing University of Posts and Telecommunications Laboratory of Computer Network and Information Integration Southeast University

In this paper, the forwarding objective and mobility law of nodes in opportunistic networks are first investigated to establish a mathematical model for further analysis, then a gradually accelerated data forwarding algorithm is proposed. In this algorithm, according to the distance between data carriers （nodes） and the destination, some intermediate nodes are selected to relay the data. Especially, the forwarded copies can be increased when the delay reaches a threshold, to guarantee the required delivery ratio. The simulation results show that the proposed algorithm can effectively reduce the storage occupancies of nodes and forwarding delay, and guarantee the delivery ratio simultaneously.

关键词： Accelerated delivery ratio,forwarding opportunistic networks storageoccupancies.

来源：评论

学校读者我要写书评

暂无评论

Computing Power in the Sky: Digital Twin-assisted Collaborative Computing with Multi-UAV networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Chao Han, Yu Zhang, Long Jia, Ziye Zhang, Hongliang Hong, Choong Seon Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Jiangsu Nanjing211111 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Kyung Hee University Department of Computer Science and Engineering Gyeonggi-do Yongin-si17104 Korea Republic of University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The collaboration of computing powers (CPs) among unmanned aerial vehicles (UAVs)-mounted edge servers is essential to handle data-intensive tasks of user equipments (UEs). This paper presents a multi-UAV computing power network (CPN) that orchestrates the CP resources of edge servers to cooperatively process tasks through collaborative computing. Due to the frequent interactions among edge servers and the increased complexities for large-scale task executions, we propose a digital twin (DT)-driven multi-UAV CPN framework, where the aerial DT network is created as a digital replica of the multi-UAV network to assist collaborative computing. A joint optimization problem of the service association, offloading power control, task partitions, CP allocation, and UAV trajectory design is formulated to minimize the long-term average delay of UEs. We use the Lyapunov technique to tackle the long-term energy constraint, forming a tractable optimization problem, which is modeled as a Markov decision process to balance the UAV's deficit queue stability and the UE's task completion delay. A hybrid soft actor-critic based deep reinforcement learning algorithm is developed to optimize the joint design by sampling the hybrid action from the Gumbel and Gaussian distributions. Simulation results verify that the multi-UAV CPN contributes to significant performance gains when supported by DTs. © 2025 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Enhancing Interest Forwarding for Fast Recovery from Unanticipated Data Access Failure in NDN

引用

China Communications 2019年第7期16卷 120-130页

作者： Xiaoyan Hu Xuhui Liu Lixia Zhao Jian Gong Guang Cheng School of Cyber Science & Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing China Key Laboratory of Computer Network Technology of Jiangsu Province Nanjing China

We show that an aggregated Interest in Named Data networking (NDN) may fail to retrieve desired data since the Interest previously sent upstream for the same content is judged as a duplicate one and then dropped by an upstream node due to its multipath forwarding. Furthermore, we propose NDRUDAF, a NACK based mechanism that enhances the Interest forwarding and enables Detection and fast Recovery from such Unanticipated Data Access Failure. In the NDN enhanced with NDRUDAF, the router that aggregates the Interest detects such unanticipated data access failure based on a negative acknowledgement from the upstream node that judges the Interest as a duplicate one. Then the router retransmits the Interest as soon as possible on behalf of the requester whose Interest is aggregated to fast recover from the data access failure. We qualitatively and quantitatively analyze the performance of the NDN enhanced with our proposed NDRUDAF and compare it with that of the present NDN. Our experimental results validate that NDRUDAF improves the system performance in case of such unanticipated data access failure in terms of data access delay and network resource utilization efficiency at routers.

关键词： named data networking interest aggregation multipath forwarding data access failure negative acknowledgement

来源：评论

学校读者我要写书评

暂无评论

Joint Beamforming Design for Integrated Sensing and Communication Systems with Hybrid-Colluding Eavesdroppers

引用

IEEE Transactions on Communications 2025年

作者： Liu, Meiding Zhou, Zhengchun Shi, Qiao Li, Guyue Liu, Zilong Fan, Pingzhi Lee, Inkyu Southwest Jiaotong University School of Information Science and Technology Chengdu611756 China Key Laboratory of Analytical Mathematics and Applications China Southeast University School of Cyber Science and Engineering Nanjing210096 China Purple Mountain Laboratories for Network and Communication Security Nanjing210096 China University of Essex School of Computer Science and Electronics Engineering ColchesterCO4 3SQ United Kingdom Southwest Jiaotong University Key Laboratory of Information Coding and Transmission Chengdu611756 China Korea University School of Electrical Engineering Seoul02841 Korea Republic of

In this paper, we consider the physical layer security (PLS) problem for integrated sensing and communication (ISAC) systems in the presence of hybrid-colluding eavesdroppers, where an active eavesdropper (AE) and a passive eavesdropper (PE) collude to intercept the confidential information. To ensure the accuracy of sensing while preventing the eavesdropping, a base station transmits a signal consisting of information symbols and sensing waveform, in which the sensing waveform can be also used as artificial noise to interfere with eavesdroppers. Under this setup, we propose an alternating optimization-based two stage scheme (AO-TSS) for improving the sensing and communication performance. In the first stage, based on the assumptions that the perfect channel state information (CSI) of the AE and statistical CSI of the PE are known, the communication and sensing beamforming problem is formulated with the objective of minimizing the weighted sum of the beampattern matching mean squared error (MSE) and cross-correlation, subject to the secure transmission constraint. To tackle the non-convexity, we propose a semi-definite relaxation (SDR) algorithm and a reduced-complexity zero-forcing (ZF) algorithm. Then, the scenarios are further extended to more general cases with imperfect AE CSI and unknown PE CSI. To further improve the communication performance, the second-stage problem is developed to optimize the secrecy rate threshold under the radar performance constraint. Finally, numerical results demonstrate the superiority of the proposed scheme in terms of sensing and secure communication. © 1972-2012 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional classification via stacked dependency exploitation

引用

Science China(information Sciences) 2020年第12期63卷 104-117页

作者： Bin-Bin JIA Min-Ling ZHANG School of Computer Science and Engineering Southeast University College of Electrical and Information Engineering Lanzhou University of Technology Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of EducationChina Collaborative Innovation Center of Wireless Communications Technology

Multi-dimensional classification(MDC) aims to build classification models for multiple heterogenous class spaces simultaneously, where each class space characterizes the semantics of an object w.r.t. one specific dimension. Modeling dependencies among class spaces plays a key role in solving MDC tasks, where most approaches work by assuming directed acyclic graph(DAG) structure or random chaining structure over class spaces. Different from existing probabilistic strategies, a deterministic strategy named Seem for dependency modeling is proposed in this paper via stacked dependency exploitation. In the first-level, pairwise dependencies are considered which can be modeled more reliably than modeling full dependencies among all class spaces by DAG or chaining structure. In the second-level, the class label of unseen instance *** class space is determined by adaptively stacking predictive outputs from first-level pairwise *** results show that stacked dependency exploitation leads to superior performance against stateof-the-art MDC approaches.

关键词： machine learning multi-dimensional classification class dependencies deterministic strategy stacked dependency exploitation

来源：评论

学校读者我要写书评

暂无评论

A Construction of Quantum Error-Locating Codes

引用

Communications in Theoretical Physics 2017年第1期67卷 37-40页

作者：樊继豪陈汉武 School of Computer Science and Engineering Southeast UniversityNanjing 211189China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 211189China

We present the construction of quantum error-locating(QEL) codes based on classical error-locating(EL)codes. Similar to classical EL codes, QEL codes lie midway between quantum error-correcting codes and quantum errordetecting codes. Then QEL codes can locate qubit errors within one sub-block of the received qubit symbols but do not need to determine the exact locations of the erroneous qubits. We show that, an e-error-locating code derived from an arbitrary binary cyclic code with generator polynomial g(x), can lead to a QEL code with e error-locating abilities, only if g(x) does not contain the(1 + x)-factor.

关键词： quantum error-correcting code error-locating code cyclic code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：