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

2021 International Conference on Networking and Network Applications, NaNA 2021

作者： Wang, Xu An Su, Yunxuan Zhang, Jindan Engineering University of Chinese Armed Police Force Key Laboratory of Network and Information Security China College of Electronics and Information Xianyang Vocational Technical College China Guizhou Provincial Key Laboratory of Public Big Data Guizhou University China

ISBN: (纸本)9781665441582

Cloud-based storage systems are the norm in our interconnected society, although there remain a number of research and operational challenges relating to the security of such systems. One ongoing research challenge is the design of efficient and secure query authentication mechanism for cloud-based storage systems, in the sense that data users can verify the authenticity and integrity of the retrieved data from the cloud servers. In 2017, Chandrasekhar and Singhal proposed a query authentication protocol for cloud-based storage systems, designed with efficiency and scalability in mind [IEEE Transactions on Services Computing, 10(4):520-533]. In this comment, we demonstrate that their protocol is not secure as claimed, due to weaknesses in two core building blocks of the protocol, namely: the double-trapdoor variant and the multi-trapdoor variant of the trapdoor hash function. By revealing this weakness, we hope future protocol designers can avoid similar mistake in their work. © 2021 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Joint Node Selection and Resource Allocation Optimization for Cooperative Sensing with a Shared Wireless Backhaul

arXiv

引用

arXiv 2024年

作者： Chen, Mingxin Zhao, Ming-Min Liu, An Li, Min Shi, Qingjiang College of Information Science and Electronic Engineering Zhejiang University Zhejiang Provincial Key Laboratory of Information Processing Communication and Networking Hangzhou310027 China School of Software Engineering Tongji University Shanghai201804 China Shenzhen Research Institute of Big Data Shenzhen518172 China

In this paper, we consider a cooperative sensing framework in the context of future multi-functional network with both communication and sensing ability, where one base station (BS) serves as a sensing transmitter and several nearby BSs serve as sensing receivers. Each receiver receives the sensing signal reflected by the target and communicates with the fusion center (FC) through a wireless multiple access channel (MAC) for cooperative target localization. To improve the localization performance, we present a hybrid information-signal domain cooperative sensing (HISDCS) design, where each sensing receiver transmits both the estimated time delay/effective reflecting coefficient and the received sensing signal sampled around the estimated time delay to the FC. Then, we propose to minimize the number of channel uses by utilizing an efficient Karhunen-Loéve transformation (KLT) encoding scheme for signal quantization and proper node selection, under the Cramér-Rao lower bound (CRLB) constraint and the capacity limits of MAC. A novel matrix-inequality constrained successive convex approximation (MCSCA) algorithm is proposed to optimize the wireless backhaul resource allocation, together with a greedy strategy for node selection. Despite the high non-convexness of the considered problem, we prove that the proposed MCSCA algorithm is able to converge to the set of Karush-Kuhn-Tucker (KKT) solutions of a relaxed problem obtained by relaxing the discrete variables. Besides, a low-complexity quantization bit reallocation algorithm is designed, which does not perform explicit node selection, and is able to harvest most of the performance gain brought by HISDCS. Finally, numerical simulations are presented to show that the proposed HISDCS design is able to significantly outperform the baseline schemes. Copyright © 2024, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning Framework for Delivery Capacity Scheduling with Vehicle Constraints

Reinforcement Learning Framework for Delivery Capacity Sched...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Zhongneng Ma Zhuorui Qin Shuxia Shi Qingyao Wu South China University of Technology Guangzhou China School of Software Engineering South China University of Technology Key Laboratory of Big Data and Intelligent Robot Ministry of Education Guangzhou Henll Electronics Equipment Co. Ltd Guangzhou China Peng Cheng Laboratory

ISBN: (数字)9798350365856

ISBN: (纸本)9798350365863

Improving the risk prevention capability of grid operations is a crucial requirement for smart resilient grids, where efficient dispatch and scheduling of delivery capacity play a pivotal role in enhancing grid resilience. Therefore, it is necessary to develop targeted intelligent dispatch algorithms based on operational data. To address this issue, this paper proposes a framework with inherent constraints and utilizes reinforcement learning using recursive neural networks. A constraint module is designed to identify available vehicle combinations based on de-livery capacity, allocate goods considering vehicle number, load, and size constraints, and generate delivery routes sequentially. Additionally, a reinforcement learning model is introduced, using negative trip length as a reward signal, optimizing parameters of the recursive neural network through policy gradient methods to automatically improve strategies for selecting optimal deliv-ery routes with improved vehicle combinations. To validate the effectiveness of this algorithm, extensive experiments were conducted using both real-world application validation data and the TSPLIB public dataset. Within a limited computational budget, the proposed algorithm outperforms several mature methods in terms of effectiveness and real-time performance, achieving near-optimal results in Euclidean graphs with nearly 100 nodes. These results demonstrate that this approach effectively addresses the intelligent scheduling of delivery capacity in digital twin systems for power storage,

关键词： Processor scheduling Prevention and mitigation Neural networks Reinforcement learning Real-time systems Scheduling Digital twins Smart grids Resilience Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Auto Graph Filtering for Bundle Recommendation

Auto Graph Filtering for Bundle Recommendation

引用

IEEE International Conference on data Mining (ICDM)

作者： Xiang-Long Li Wu-Dong Xi Xing-Xing Xing Chang-Dong Wang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China UX Center NetEase Games Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China

Bundle recommendation focuses on recommending users with associated item sets at once. Recently, some works utilize Graph Neural Network (GNN), which has a solid power for mining information behind the topological structure, to enhance bundle recommendation performance. The previous GNN-based methods focus on designing the bundle-item association mechanism and fusing the extra information from the item view into the final prediction. However, the crucial component in GNN, namely the neighborhood aggregation mechanism, is yet to be explored under the bundle recommendation scenario. In this work, we propose a bundle-specific neighborhood aggregation mechanism named Auto Graph Filtering (AGF). The AGF refines the neighborhood aggregation mechanism from two aspects. (1) AGF utilizes the 2-hop meta paths in the bundle recommendation scenario instead of user interactions directly, which alleviates the extreme sparsity in the user-bundle graph. (2) AGF automatically reweights all the meta paths during the training. With training procedure completed, AGF optimizes the user-bundle graph to meet the bundle recommendation requirement. The experimental results show that our simplest AGF version, AGFN, consistently outperforms all the baselines. Moreover, the user-bundle graph learned by AGFN could also boost the existing GNN-based methods to achieve a better performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Out-of-Distribution Generalization on Graphs via Progressive Inference 39

Out-of-Distribution Generalization on Graphs via Progressive...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Xu, Yiming Shi, Bin Peng, Zhen Liu, Huixiang Dong, Bo Chen, Chen School of Computer Science and Technology Xi'an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University China School of Distance Education Xi'an Jiaotong University China University of Virginia CharlottesvilleVA United States

ISBN: (纸本)157735897X

The development and evaluation of graph neural networks (GNNs) generally follow the independent and identically distributed (i.i.d.) assumption. Yet this assumption is often untenable in practice due to the uncontrollable data generation mechanism. In particular, when the data distribution shows a significant shift, most GNNs would fail to produce reliable predictions and may even make decisions randomly. One of the most promising solutions to improve the model generalization is to pick out causal invariant parts in the input graph. Nonetheless, we observe a significant distribution gap between the causal parts learned by existing methods and the ground-truth, leading to undesirable performance. In response to the above issues, this paper presents GPro, a model that learns graph causal invariance with progressive inference. Specifically, the complicated graph causal invariant learning is decomposed into multiple intermediate inference steps from easy to hard, and the perception of GPro is continuously strengthened through a progressive inference process to extract causal features that are stable to distribution shifts. We also enlarge the training distribution by creating counterfactual samples to enhance the capability of the GPro in capturing the causal invariant parts. Extensive experiments demonstrate that our proposed GPro outperforms the state-of-the-art methods by 4.91% on average. For datasets with more severe distribution shifts, the performance improvement can be up to 6.86%. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Out-of-Distribution Generalization on Graphs via Progressive Inference

arXiv

引用

arXiv 2025年

作者： Xu, Yiming Shi, Bin Peng, Zhen Liu, Huixiang Dong, Bo Chen, Chen School of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China School of Distance Education Xi’an Jiaotong University China University of Virginia CharlottesvilleVA United States

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Neural Network Based Preselection for Expensive Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Li, Bingdong Yang, Yanting Hong, Wenjing Yang, Peng Zhou, Aimin Shanghai Institute of AI for Education the School of Computer Science and Technology and the Shanghai Frontiers Science Center of Molecule Intelligent Syntheses East China Normal University Shanghai China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science and Engineering Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

A series of surrogate-assisted evolutionary algorithms (SAEAs) have been proposed for expensive multi-objective optimization problems (EMOPs), building cheap surrogate models to replace the expensive real function evaluations. However, the search efficiency of these SAEAs is not yet satisfactory. More efforts are needed to further exploit useful information from the real function evaluations in order to better guide the search process. Facing this challenge, this paper proposes a Hyperbolic Neural Network (HNN) based preselection operator to accelerate the optimization process based on limited evaluated solutions. First, the preselection task is modeled as a multi-label classification problem where solutions are classified into different layers (ordinal categories) through -relaxed objective aggregation. Second, in order to resemble the hierarchical structure of candidate solutions, a hyperbolic neural network is applied to tackle the multi-label classification problem. The reason for using HNN is that hyperbolic spaces more closely resemble hierarchical structures than Euclidean spaces. Moreover, to alleviate the data deficiency issue, a data augmentation strategy is employed for training the HNN. In order to evaluate its performance, the proposed HNN-based preselection operator is embedded into two surrogate-assisted evolutionary algorithms. Experimental results on two benchmark test suites and three real-world problems with up to 11 objectives and 150 decision variables involving seven state-of-the-art algorithms demonstrate the effectiveness of the proposed method. IEEE

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

MCRec: Multi-channel Gated Gifts Recommendation

MCRec: Multi-channel Gated Gifts Recommendation

引用

IEEE International Conference on data Mining (ICDM)

作者： Ting-Ting Su Wu-Dong Xi Xing-Xing Xing Chang-Dong Wang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China UX Center NetEase Games Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China

In recent years, various recommendation methods are proposed to capture user preferences more accurately, with the assumption that different types of records reflects the positive intention of users to buy items in different degree. However, the records of different channels may denote positive or negative impacts on users’ willingness to buy items in multi-channel scenario, which is a salient features of games. Making recommendation only with the records of buy channel makes it difficult to capture cross-channel impact of items. To solve the issue, this paper proposes a multi-channel gated gifts recommendation method, named MCRec, which is able to mine the impact of acquisition in different channels on buy channel from multi-channel records and generate personalized gifts for users. The MCRec method extracts channel-aware correlation of items from channel-aware item-item graphs. The contribution of different items in various sessions is distinguished with item gate, and the impact of the context of different channels on buy channel is measured with channel gate. Finally, personalized gifts will be generated hierarchically with different purposes. Extensive experiments are conducted on two datasets that are constructed with the data collected from two massively multiplayer online (MMO) games. The results demonstrate the superiority of our MCRec over state-of-the-art recommendation methods in gifts recommendation. Further ablation studies validate the effectiveness of the design of MCRec in modeling cross-channel impact of items.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic Correspondence with Peripheral Position Coding

Semantic Correspondence with Peripheral Position Coding

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Jinjian Chen Zuoyong Li Taotao Lai Huosheng Xie College of Computer and Data Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou China

Establishing dense correspondences between semantically similar images is a challenging task. Cost aggregation is a crucial step in finding correct dense correspondences, with the goal of optimizing the initial correlation map thereby removing the ambiguity of the correspondences. Current approaches use transformer architectures for cost aggregation, which lack local priors to adequately capture the local information contained in the correlation map. We propose to incorporate peripheral position coding into the transformer to explore the local information to obtain the matching set and call it the Peripheral Transformer Matcher (PTM). This coding technique partitions the overall receptive field of the self-attention mechanism into diverse peripheral regions, each with its own set of weights. By doing this, the proposed PTM gets a specific local prior by adding an inductive bias to the transformer models and making the initial correlation map less confusing. In addition, a local self-attention module is used to enhance the image features and obtain an enhanced initial correlation map. Comparisons of the experimental results with baselines on public datasets demonstrate the effectiveness of the proposed PTM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MChIRC: A Multimodal Benchmark for Chinese Idiom Reading Comprehension 39

MChIRC: A Multimodal Benchmark for Chinese Idiom Reading Com...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Tongguan Wu, Mingmin Su, Guixin Su, Dongyu Hu, Yuxue Huang, Zhongqiang Sha, Ying Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China College of Informatics Huazhong Agricultural University Wuhan China

ISBN: (纸本)157735897X

The performance of various tasks of natural language processing has greatly improved with the emergence of large language models. However, there is still much room for improvement in understanding certain specific linguistic phenomena, such as Chinese idioms, which are usually composed of four characters. Chinese idioms are difficult to understand due to semantic gaps between their literal and actual meanings. Researchers have proposed the Chinese idiom reading comprehension task to examine the ability of large language models to represent and understand Chinese idioms. The task requires choosing the correct Chinese idiom from a list of candidates to complete the sentence. The current research mainly focuses on text-based idiom comprehension. Nevertheless, there are many idiom application scenarios that combine images and text, and we believe that the corresponding images are beneficial for the model’s understanding of the idioms. Therefore, to address the above problems, we first construct a large-scale Multimodal Chinese Idiom Reading Comprehension dataset (MChIRC), which contains a total of 44,433 image-text pairs covering 2,926 idioms. Then, we propose a Dual-Contrastive Idiom Graph Network (DCIGN), which employs a dual-contrastive learning module to align the text and image features corresponding to the same Chinese idiom at both coarse and fine levels, while utilizing a graph structure to capture the semantic relationships between idiom candidates. Finally, we use a cross-attention module to fuse multimodal features with graph features of candidate idioms to predict correct answers. The authoritativeness of MChIRC and the effectiveness of DCIGN are demonstrated through a variety of experiments, which provides a new benchmark for the multimodal Chinese idiom reading comprehension task. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：