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

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3342-3355页

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China 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, rending its especially apt for large-scale 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. © 2025 IEEE Computer Society. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Angle measurement using the integrated amplitude of difference beam from an optical phased array

引用

Optics Express 2025年第6期33卷 13785-13795页

作者： Yuan, Jing Wu, Guihan Yang, Shichong Yu, Fuhao Xin, Yu Cao, Haijiang Luo, Quan Luo, Hongsheng Su, Jinshan Jiang, Wei College of Engineering and Applied Sciences Nanjing University Nanjing210023 China Key Laboratory of Intelligent Optical Sensing and Manipulation Ministry of Education Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Artificial Functional Materials Nanjing University Nanjing210023 China Yili Normal University Key Laboratory of Vibration Signal Capture and Intelligent Processing ILI835000 China

We propose an angle measurement method by comparing the integrated amplitude of the difference beam (AMCIAD) generated by an optical phase array (OPA), which can be used to improve the precision of angle measurements. The AMCIAD utilizes the beam-forming capability of an OPA to improve upon the traditional method of angle measurement by comparing amplitude (AMCA). In the experiment, an on-chip OPA is used to generate the difference beams and scan the object. An algorithm is developed to calculate the angular position of the object from the reflected light. The experimental results demonstrate that AMCIAD improves the accuracy of angle measurement by about four times compared to AMCA (0.13° of AMCIAD and 0.60° of AMCA). Angular accuracy equivalent to ∼4% of the beam width is demonstrated. © 2025 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement.

关键词： Angle measurement

来源：评论

学校读者我要写书评

暂无评论

Glare-SNet: Unsupervised Glare Suppression Balance Network 27th

Glare-SNet: Unsupervised Glare Suppression Balance Network

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Li, Pei Zuo, Chengyu Wei, Wangjuan Pan, Xiaoying Wang, Zhanhao School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an China Shaanxi Key Laboratory of Intelligent Media Computing and interaction Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an China

ISBN: (纸本)9783031781681

In light of the problems associated with glare and halo effects in low-light images, as well as the inadequacy of existing processing algorithms in handling details, a glare suppression balance network based on unsupervised learning has been designed and implemented in this study. A network that perceives brightness through light decomposition has been proposed, and an illumination learning network has been designed. The idea of integration has been employed to form an unsupervised glare suppression balance network, aiming to tackle the issues of glare and the accompanying halo effects. Through objective and subjective evaluations of real images, it has been proven that the method introduced in this paper surpasses other methods in suppressing glare and enhancing the overall quality of low-light images. Furthermore, it has been shown to exhibit good performance and effectiveness in target detection. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Identifying important nodes of hypergraph:An improved PageRank algorithm

引用

Chinese Physics B 2025年第4期34卷 162-171页

作者： Yu-Hao Piao Jun-Yi Wang Ke-Zan Li School of Mathematics and Computing Science Guilin University of Electronic TechnologyGuilin 541004China School of Information and Communication Guilin University of Electronic TechnologyGuilin 541004China Guangxi Wireless Broadband Communication and Signal Processing Key Laboratory Guilin University of Electronic TechnologyGuilin 541004China

Hypergraphs can accurately capture complex higher-order relationships,but it is challenging to identify their important *** this paper,an improved PageRank(ImPageRank)algorithm is designed to identify important nodes in a directed *** algorithm introduces the Jaccard similarity of directed *** comparing the numbers of common neighbors between nodes with the total number of their neighbors,the Jaccard similarity measure takes into account the similarity between nodes that are not directly connected,and can reflect the potential correlation between *** improved susceptible–infected(SI)model in directed hypergraph is proposed,which considers nonlinear propagation mode and more realistic propagation *** addition,some important node evaluation methods are transferred from undirected hypergraphs and applied to directed ***,the ImPageRank algorithm is used to evaluate the performance of the SI model,network robustness and *** of real networks demonstrate the excellent performance of the proposed algorithm and provide a powerful framework for identifying important nodes in directed hypergraphs.

关键词： hypergraph important node PageRank susceptible-infected(SI)model centrality index

来源：评论

学校读者我要写书评

暂无评论

AMHF-TP:Multifunctional therapeutic peptides prediction based on multi-granularity hierarchical features

引用

Quantitative Biology 2025年第1期13卷 127-141页

作者： Shouheng Tuo YanLing Zhu Jiangkun Lin Jiewei Jiang School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’anChina Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’anChina Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anChina School of Electronic Engineering Xi’an University of Posts and TelecommunicationsXi’anChina

Multifunctional therapeutic peptides(MFTP)hold immense potential in diverse therapeutic contexts,yet their prediction and identification remain challenging due to the limitations of traditional methodologies,such as extensive training durations,limited sample sizes,and inadequate generalization *** address these issues,we present AMHF-TP,an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance *** AMHF-TP is composed of four key components:a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences;a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures;a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences;and a hierarchical feature extraction module that integrates multimodal peptide sequence *** with leading methods,the proposed AMHF-TP demonstrates superior precision,accuracy,and coverage,underscoring its effectiveness and robustness in MFTP *** comparative analysis of separate hierarchical models and the combined model,as well as with five contemporary models,reveals AMHFTP’s exceptional performance and stability in recognition tasks.

关键词： deep learning hypergraph multifunctional therapeutic peptides multi-granularity hierarchical features

来源：评论

学校读者我要写书评

暂无评论

Determining the covering radius of all generalized Zetterberg codes in odd characteristic

引用

IEEE Transactions on Information Theory 2025年第5期71卷 3602-3613页

作者： Shi, Minjia Li, Shitao Helleseth, Tor Özbudak, Ferruh Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Hefei230601 China Anhui University School of Mathematical Sciences Anhui Hefei230601 China University of Bergen Department of Informatics Bergen Norway Sabanci University Faculty of Engineering and Natural Sciences Istanbul34956 Turkey

For an integer s ≥ 1, let Cs(q0) be the generalized Zetterberg code of length qs0 + 1 over the finite field Fq0 of odd characteristic. Recently, Shi, Helleseth, and Özbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of Cs(q0) for qs0 7 (mod 8), and left the remaining case as an open problem. In this paper, we develop a general technique involving arithmetic of finite fields and algebraic curves over finite fields to determine the covering radius of all generalized Zetterberg codes for qs0 ≡ 7 (mod 8), which therefore solves this open problem. We also introduce the concept of twisted half generalized Zetterberg codes of length qs0+1/2, and show the same results hold for them. As a result, we obtain some quasi-perfect codes. © 1963-2012 IEEE.

关键词： Turbo codes

来源：评论

学校读者我要写书评

暂无评论

Design of Dual-mode DPE Receiver Based on GPS L1/BDS B1C signals

Design of Dual-mode DPE Receiver Based on GPS L1/BDS B1C Sig...

引用

2025 International Technical Meeting of The Institute of Navigation, ITM 2025

作者： Jia, Qiongqiong Guo, Qiqi Tianjin Key Laboratory of Intelligent Signal and Image Processing Civil Aviation University of China Tianjin300000 China

ISBN: (纸本)9780936406404

With the expanding applications of the Global Navigation Satellite System (GNSS), its operating environment has become increasingly complex, with challenges such as multipath effects, non-line-of-sight (NLOS) propagation, and signal attenuation caused by tall urban buildings and trees. This complexity poses additional challenges for traditional GNSS receivers. Direct Position Estimation (DPE) addresses some of the limitations of traditional receivers by accumulating signals from all visible satellites directly in the navigation domain. However, when severe obstructions result in a reduced number of visible satellites, DPE may fail to function properly. The introduction of multiconstellation satellite signals can help mitigate the issue of insufficient visible satellites in complex environments. Based on this, this paper designs a dual-mode DPE receiver utilizing Global Positioning System (GPS) L1 signals and BeiDou Navigation Satellite System (BDS) B1C signals. © 2025 Proceedings of the International Technical Meeting of The Institute of Navigation, ITM. All rights reserved.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

Dual Averaging for Distributed Unbalanced Optimization with Delayed Information

引用

IEEE Transactions on signal and Information processing over Networks 2025年 11卷 366-377页

作者： Huang, Qing Fan, Yuan Cheng, Songsong Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electrical Engineering and Automation Anhui Hefei230601 China

In this paper, we study a category of distributed constrained optimization problems where each agent has access to local information, communicates with its neighbors, and cooperatively minimizes the aggregated cost functions over time-varying unbalanced graphs. To address the considered problems, we propose a distributed dual averaging algorithm based on a row-stochastic weighted matrix (DDAR), which improves the robustness of network topology compared to conventional push-sum algorithms. Moreover, we develop a modified version of DDAR with delayed information (DDARD), which considers the delays of both network communication and gradient calculation, enhancing the algorithm's flexibility in communication and iteration. Our analysis demonstrates that the DDAR and DDARD achieve the optimal value at rates of O(N/(1-λ)√T) and O(τ2N/(1-λ}})√T}), respectively. Finally, the theoretical results are confirmed by simulation on a logistic regression problem. © 2015 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Balanced Task Offloading in Vehicular Networks Based on Edge computing 27th

Multi-objective Balanced Task Offloading in Vehicular Networ...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Wang, Lingjiao Meng, Lingwei Guo, Hua Xiangtan University Hunan Xiangtan411105 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China

ISBN: (纸本)9783031783821

The increasing number of vehicular networking devices and application demands has made the limited computing and communication resources a significant challenge. The heuristic task offloading strategy mechanism was proposed to improve the efficiency of task offloading in vehicular networks. This strategy mechanism utilized the Nondominated Sorting Genetic Fireworks Algorithm (NSGFA) based on the characteristics of the problem, integrated consideration of the multi-target balance between system offloading costs and load balancing. Experimental data results demonstrate that this method performs well in reducing latency, energy consumption, and load balancing, effectively enhancing the quality of service for vehicular network users. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Security-Enhanced Data Sharing Via Efficient Sanitization for VANETs

引用

IEEE Transactions on Mobile computing 2025年第06期24卷 4925-4938页

作者： Zhong, Hong Zhou, Dan Cui, Jie Wang, Li Zhang, Jing Bolodurina, Irina He, Debiao Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Computer Science and Technology Hefei230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei230039 China Orenburg State University Faculty of Mathematics and Information Technologies Orenburg460018 Russia Wuhan University School of Cyber Science and Engineering Wuhan430072 China MatrixElements Technologies Shanghai Key Laboratory of Privacy Preserving Computation Shanghai201204 China

With the widespread deployment of vehicular ad-hoc networks (VANETs), data sharing has garnered considerable attention as a core feature of VANETs. Attribute-based proxy re-encryption (ABPRE) enables fine-grained access control and provides flexible ciphertext updates. The initially authorized vehicle generates the re-encryption key to enable ciphertext-to-ciphertext conversion in the cloud, allowing ciphertext to be shared with new recipients. However, initially authorized vehicles may not always be trustworthy and could share data with malicious receivers. In addition, the computation and communication overhead of ABPRE hinders its widespread application in VANETs. To address these issues, we propose a lightweight sanitizable scheme for edge-assisted VANETs based on ABPRE. In this scheme, the re-encryption key is verified by a sanitizer, to prevent the data from being shared with malicious data receivers. In addition, key-splitting techniques and edge computing are employed to reduce the communication and computation overhead of re-encryption. A comprehensive security analysis and performance evaluation demonstrate that the proposed scheme is efficient and practical. © 2002-2012 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：