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

Machine learning prediction of network dynamics with privacy protection

Physical Review Research 2022年第4期4卷 043076-043076页

作者： Xin Xia Yansen Su Linyuan Lü Xingyi Zhang Ying-Cheng Lai Hai-Feng Zhang The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei 230601 China

Predicting network dynamics based on data, a problem with broad applications, has been studied extensively in the past, but most existing approaches assume that the complete set of historical data from the whole network is available. This requirement presents a great challenge in applications, especially for large, distributed networks in the real world, where data collection is accomplished by many clients in a parallel fashion. Often, each client only has the time series data from a partial set of nodes, and the client has access to only partial time stamps of the whole set of time series data and the partial structure of the network. Due to privacy concerns or license-related issues, the data collected by different clients cannot be shared. Accurately predicting the network dynamics while protecting the privacy of different parties is a critical problem in modern times. Here, we propose a solution based on federated graph neural networks (FGNNs) that enables the training of a global dynamic model for all parties without data sharing. We validate the working of our FGNN framework through two types of simulations to predict a variety of network dynamics (four discrete and three continuous dynamics). As a significant real-world application, we demonstrate successful prediction of state-wise influenza spreading in the USA. Our FGNN scheme represents a general framework to predict diverse network dynamics through collaborative fusing of the data from different parties without disclosing their privacy.

关键词： Collective behavior in networks

来源：评论

学校读者我要写书评

暂无评论

Temporal Feature Aggregation for Efficient 2D Video Grounding

Temporal Feature Aggregation for Efficient 2D Video Groundin...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Mohan Chen Yiren Zhang Jueqi Wei Yuejie Zhang Rui Feng Tao Zhang Shang Gao School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Shanghai Collaborative Innovation Center of Intelligent Visual Computing Fudan University School of Information Management and Engineering Shanghai Key Laboratory of Financial Information Technology Shanghai University of Finance and Economics School of Information Technology Deakin University

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Video grounding aims to locate the target video moment in an untrimmed video based on a text query. Most existing methods employ 3D CNNs as the video feature extractor, incurring substantial computational costs. Only a few methods use 2D backbones for video feature extraction, and they suffer from diminished accuracy due to the inherent lack of temporal information within 2D features. To address this problem, we propose a novel 2D video grounding method called TFA that improves accuracy while minimizing computational costs. Our approach involves a query-guided temporal feature aggregation module designed to explicitly capture temporal information. We disentangle time intervals of input video frames and prediction spans to reduce computational overhead. Additionally, we introduce deformable attention into the multi-modal encoder for further enhancement. Extensive experiments on two public datasets demonstrate that our method outperforms previous 2D video grounding methods and achieves competitive results with most 3D methods at significantly reduced costs.

关键词： Three-dimensional displays Accuracy Costs Grounding Streaming media Feature extraction Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Threshold Credential Management with Fine-Grained Authentication for VANETs

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5818-5831页

作者： Zhang, Jing Wang, Xin Cui, Jie Li, Ru Zhong, Hong Anhui University School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei 230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei 230039 China Anhui University School of Computer Science and Technology Hefei 230039 China

In Vehicular Ad-hoc Networks (VANETs), vehicles must authenticate their identities before accessing services. However, existing authentication schemes based on anonymous credentials still face single-point failure in multi-authority scenarios. In addition, in traditional anonymous credential schemes, the public key of credential authority is used directly to verify the credential, which may increase the risk of vehicle privacy being misused. To address these issues, we propose a decentralized threshold credential management system with fine-grained authentication for VANETs. The decentralized credential management architecture is proposed for VANETs with multiple credential authorities, each credential authority consists of multiple credential managers who issue credentials using the threshold mechanism, effectively solving the single-point failure. Based on this architecture, we design a fine grained, privacy-preserving authentication scheme that allows vehicles to autonomously perform selective attribute disclosure, credential aggregation, and randomization before requesting verification from the Cloud Service Provider, thereby achieving a balance between privacy preservation and authentication efficiency. The security proofs and analysis show that our scheme satisfies the target security properties. Performance evaluations indicate that our scheme enables efficient, flexible credential management and authentication in VANETs while ensuring privacy preservation. © 2005-2012 IEEE.

关键词： anonymous credentials authentication decentralization privacy preservation VANETs

来源：评论

学校读者我要写书评

暂无评论

Pctlfusion: A Progressive Fusion Network Via Contextual Texture Learning for Infrared and Visible Image

SSRN

引用

SSRN 2024年

作者： Lu, Yixiang Gong, Daiwei Zhao, Dawei Maksim, Davydau Gao, Qingwei The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electrical Engineering and Automation Anhui University Hefei230601 China Belarusian State University of Informatics and Radioelectronics Minsk Belarus

The objective of infrared and visible image fusion is to generate a fused image that contains rich texture details and salient targets. However, most of the existing fusion methods tend to focus on preserving texture details in visible image and salient targets in infrared image, ignoring the fact that infrared image have richer texture details and better visual effects than visible image under low-light conditions. In other words, differences in information sources under the condition of illumination imbalance is ignored in setting the task goal. In addition, existing network designs usually ignore multimodal information interactions during the coding phase, which may result in loss of information. In this work, we propose a progressive fusion network via contextual texture learning for infrared and visible image, termed as PCTLFusion. To enhance the limited texture information, we design a content and contextual texture learning module (CCTLM) to model the texture and content of both the source images, respectively. Then, an affine transform-based multimodal pre-fusion module (ATMPM) is designed to learn and pre-fuse the complementary and similar enhanced information, which achieves information interaction during encoding. To learn fully feature information using multilayers, we iterate CCTLM and ATMPM three times in the process of model forming. Finally, the fused image is reconstructed by decoding the output of the last ATMPM. Numerous experiments show that our proposed fusion algorithm is superior to the state-of-the-art existing methods in both subjective and objective evaluations. © 2024, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

BTC-Shadow: an analysis and visualization system for exposing implicit behaviors in Bitcoin transaction graphs

引用

Frontiers of Computer Science 2023年第6期17卷 167-169页

作者： Ding BAO Wei REN Yuexin XIANG Weimao LIU Tianqing ZHU Yi REN Kim-Kwang Raymond CHOO School of Computer Science China University of GeosciencesWuhan 430074China Hubei Key Laboratory of Intelligent Geo-Information Processing Wuhan 430074China NSFOCUS Technologies Group Co. Ltd.Beijing 100089China School of Computing Sciences University of East AngliaNorwich NR47TJUK Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX 78249-0631USA

1 Introduction A Bitcoin ledger comprises a sizable number of transaction records,which can be utilized to make it easier to track and analyze the traits and patterns of cryptocurrency-related *** facilitate the visual analysis of Bitcoin,numerous tools with various aims have been *** example,MiningVis[1]and SuPoolVisor[2]are the analytics systems for Bitcoin mining pools,as well as[3-5]focus on the Bitcoin transaction graphs ***,due to our previous research requirements for Bitcoin transaction graphs,none of the available tools can provide exploring the features of connection related to the address and observe significant visual ***,using these tools is challenging to navigate to abnormal node clusters effortlessly from large node groups and then analyze the local interlink characteristics between transaction nodes with interactive analytics.

关键词： analytic implicit utilized

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

arXiv

引用

arXiv 2025年

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. Copyright © 2025, The Authors. All rights reserved.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Sparse Andrew's Sine Norm Promoting Adaptive Algorithm under Non-Gaussian Noises 5

Sparse Andrew's Sine Norm Promoting Adaptive Algorithm under...

引用

5th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2022

作者： Hadi, Abdul Huang, Xinqi Ali, Burhan Li, Yingsong College of Information and Communications Engineering Harbin Engineering University Harbin150001 China College of Intelligent System and Control Science Engineering Harbin Engineering University Harbin150001 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

Two sparse adaptive filtering (AF) algorithms based on Andrew's sine estimator (ASE) are presented to achieve improved performance for identifying sparse systems, where the ASE is derived within the least-square framework. Furthermore, zero-attracting (ZA) scheme is used in ASE to construct ZA-ASE and its re-weighting form (RZA-ASE) to combat non-Gaussian noises and use the sparse characteristics of the system. Their performance is investigated via simulations and compared with the least-mean square (LMS) and the maximum correntropy criterion (MCC) algorithms to show their superior performance. © 2022 IEEE.

关键词： Adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

BGRA-Net: Boundary-Guided and Region-Aware Convolutional Neural Network for the Segmentation of Breast Ultrasound Images

BGRA-Net: Boundary-Guided and Region-Aware Convolutional Neu...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Zhang, Xiang Li, Xuanya Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Baidu Inc. Beijing100085 China Key Laboratory of Medical Imaging and Artifical Intelligence of Hunan Province Xiangnan University Chenzhou423000 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781665401265

In this paper, we propose a novel convolutional neural network based on boundary-guided and region-aware (BGRA-Net) for breast tumor segmentation in ultrasound images. In particular, in the encoding stage, we propose a boundary-guided module (BGM) to guide the learning of boundary features in the decoding stage by explicitly strengthening the extracted boundary information. Meanwhile, in the decoding stage, we propose a region-aware module (RAM) to integrate different levels of detailed and semantic features to improve the comprehensive representation of tumor regional features. Besides, a scale-adaptive module (SAM) is further proposed to capture the characteristics of tumors with different sizes between the encoding and decoding stages. To evaluate the effectiveness of our BGRA-Net, we conduct extensive experiments on the UDIAT dataset and compare it with eight state-of-the-art methods. The experimental results show that our BGRA-Net outperforms the state-of-the-art methods and can achieve accurate segmentation of breast tumors with ambiguous boundaries. © 2021 IEEE.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

A Cell Condition-Sensitive Frequency Segmentation Method Based on the Sub-Band Instantaneous Energy Spectrum of Aluminum Electrolysis Cell Voltage

引用

Engineering 2021年第9期7卷 1282-1292页

作者： Zhaohui Zeng Weihua Gui Xiaofang Chen Yongfang Xie Hongliang Zhang Yubo Sun School of Automation Central South UniversityChangsha 410083China Key Laboratory of Intelligent Computing&Information Processing Ministry of EducationXiangtan UniversityXiangtan 411105China School of Metallurgy and Environment Central South UniversityChangsha 410083China

Cell voltage is a widely used signal that can be measured online from an industrial aluminum electrolysis cell.A variety of parameters for the analysis and control of industrial cells are calculated using the cell *** this paper,the frequency segmentation of cell voltage is used as the basis for designing filters to obtain these *** on the qualitative analysis of the cell voltage,the sub-band instantaneous energy spectrum(SIEP)is first proposed,which is then used to quantitatively represent the characteristics of the designated frequency bands of the cell voltage under various cell ***,a cell condition-sensitive frequency segmentation method is *** proposed frequency segmentation method divides the effective frequency band into the[0,0.001]Hz band of lowfrequency signals and the[0.001,0.050]Hz band of low-frequency noise,and subdivides the lowfrequency noise into the[0.001,0.010]Hz band of metal pad abnormal rolling and the[0.01,0.05]Hz band of sub-low-frequency *** with the instantaneous energy spectrum based on empirical mode decomposition,the SIEP more finely represents the law of energy change with time in any designated frequency band within the effective frequency band of the cell *** proposed frequency segmentation method is more sensitive to cell condition changes and can obtain more elaborate details of online cell condition information,thus providing a more reliable and accurate online basis for cell condition monitoring and control decisions.

关键词： Sub-band instantaneous energy spectrum Cell condition-sensitive frequency band Frequency segmentation Metal pad abnormal rolling Aluminum electrolysis

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Logits Tree: Pursuing Granularity Reconcilement in Fine-Grained Classification 39

Bidirectional Logits Tree: Pursuing Granularity Reconcilemen...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Zhiguang Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

ISBN: (纸本)157735897X

This paper addresses the challenge of Granularity Competition in fine-grained classification tasks, which arises due to the semantic gap between multi-granularity labels. Existing approaches typically develop independent hierarchy-aware models based on shared features extracted from a common base encoder. However, because coarse-grained levels are inherently easier to learn than finer ones, the base encoder tends to prioritize coarse feature abstractions, which impedes the learning of fine-grained features. To overcome this challenge, we propose a novel framework called the Bidirectional Logits Tree (BiLT) for Granularity Reconcilement. The key idea is to develop classifiers sequentially from the finest to the coarsest granularities, rather than parallelly constructing a set of classifiers based on the same input features. In this setup, the outputs of finer-grained classifiers serve as inputs for coarser-grained ones, facilitating the flow of hierarchical semantic information across different granularities. On top of this, we further introduce an Adaptive Intra-Granularity Difference Learning (AIGDL) approach to uncover subtle semantic differences between classes within the same granularity. Extensive experiments demonstrate the effectiveness of our proposed method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：