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

34th ACM Web Conference, WWW 2025

作者： Zhang, Xin Cai, Fei Zheng, Jianming Pan, Zhiqiang Chen, Wanyu Chen, Honghui Chen, Chonghao National Key Laboratory of Information Systems Engineering National University of Defense Technology Changsha China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China College of Electronic Countermeasures National University of Defense Technology Hefei China

ISBN: (纸本)9798400712746

Dynamic graph link prediction is widely utilized in the complex web of the real world, such as social networks, citation networks, recommendation systems, etc. Recent Transformer-based link prediction methods on dynamic graphs not only fail to model the fine-grained structures such as triangles with the vanilla Transformers in the graph serialization process, but also amplify the imbalanced distribution of graphs because of their over-estimation of high-degree nodes. To tackle these issues, we propose a Topology-aware Transformer on Dynamic Graph (TopDyG) for link prediction, consisting of a topology injected Transformer (Ti-Transformer) and a mutual information learning (Mi-Learning). The Ti-Transformer explores the explicit structure of serialized graphs, capturing the topological features. The Mi-Learning mines the relationship between nodes by modeling the mutual information with a prior knowledge, alleviating the over-estimation of high-degree nodes when applying the Transformer-based models for the dynamic graph link prediction task. Extensive experiments on four public datasets containing both transductive and inductive settings present the superiority of our proposal. In particular, TopDyG presents an improvement of 43.27% and 28.75% against the state-of-the-art baselines in terms of NDCG and Jaccard, respectively. The advantages are especially obvious on the high-density graphs. © 2025 Copyright held by the owner/author(s).

关键词： Dynamic graphs Link prediction Topology Transformer

来源：评论

学校读者我要写书评

暂无评论

Population-Based Meta-Heuristic Optimization Algorithm Booster: An Evolutionary and Learning Competition Scheme

引用

Neurocomputing 2025年 643卷

作者： Wang, Jun Dong, Junyu Zhou, Huiyu Dong, Xinghui State Key Laboratory of Physical Oceanography and Faculty of Information Science and Engineering Ocean University of China China School of Computing and Mathematical Sciences University of Leicester United Kingdom

In a Population-Based Meta-Heuristic Optimization Algorithm (PMOA), individuals in the population will constantly generate new promising individuals, to form new populations. Although the population continuously changes, the variations in each individual are traceable in most algorithms. An individual in the population comes from the individual in the previous population. The direction of the evolution of populations can be identified on top of this historical inheritance relationship, which improves the efficiency of PMOAs and solves optimization problems more effectively. Since Recurrent Neural Networks (RNNs) are able to capture the temporal dependencies in sequences, we are motivated to propose a novel but simple Evolutionary and Learning Competition Scheme (ELCS), also referred to as the PMOA Booster, in which individuals keep changing for the better fitness based on the heuristic rules of the PMOA while an RNN is used to learn the process that each individual changes in order to guide the generation of promising individuals. The ELCS automatically selects the RNN or PMOA which generates more individuals with the better fitness. We test the proposed scheme using the benchmark of IEEE Congress on Evolutionary Computation 2022 competition (CEC 2022). The results show that this scheme is able to boost the performance of both the classical and state-of-the-art PMOAs and outperforms its counterparts. Also, the ELCS produces promising results in two real-world industrial scenarios. We believe that the effectiveness of the proposed ELCS is due to the adaptive competition between the RNN and the PMOA. © 2025 Elsevier B.V.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A Note on "Constructing Bent Functions Outside the Maiorana-McFarland Class Using a General Form of Rothaus"

arXiv

引用

arXiv 2025年

作者： Guo, Fei Wang, Zilong Gong, Guang State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou450001 China State Key Laboratory of Integrated Service Networks Xidian University Xi’an710071 China Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

In 2017, Zhang et al. proposed a question (not open problem) and two open problems in [IEEE TIT 63 (8): 5336–5349, 2017] about constructing bent functions by using Rothaus’ construction. In this note, we prove that the sufficient conditions of Rothaus’ construction are also necessary, which answers their question. Besides, we demonstrate that the second open problem, which considers the iterative method of constructing bent functions by using Rothaus’ construction, has only a trivial solution. It indicates that all bent functions obtained by using Rothaus’ construction iteratively can be generated from the direct sum of an initial bent function and a quadratic bent function. This directly means that Zhang et al.’s construction idea makes no contribution to the construction of bent functions. To compensate the weakness of their work, we propose an iterative construction of bent functions by using a secondary construction in [DCC 88: 2007–2035, 2020]. © 2025, CC BY-NC-ND.

关键词： Hadamard transforms

来源：评论

学校读者我要写书评

暂无评论

Admissibly Randomized Coordinate Descent Methods for computing Extreme Eigenpairs of Symmetric Matrices

引用

Numerical Linear Algebra with Applications 2025年第2期32卷

作者： Bai, Zhong-Zhi Chen, Yan-Qi State Key Laboratory of Mathematical Sciences State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China

For solving symmetric eigenvalue problems of extremely large matrices that cannot be stored in a whole in the computer memory, we propose a class of admissibly randomized coordinate descent methods by minimizing the corresponding Rayleigh quotients. These iteration methods only call of and operate on a column of the matrix at each of their iteration steps, so they require a small computer memory and have a small computational complexity. We analyze the convergence property of these admissibly randomized coordinate descent methods and confirm their implemental effectiveness by numerical experiments. © 2025 John Wiley & Sons Ltd.

关键词： convergence property coordinate descent method randomized iteration symmetric eigenvalue problem

来源：评论

学校读者我要写书评

暂无评论

ThicknesVAE: Learning a Latera Prior for Clothed Human Body Reconsuction

ThicknesVAE: Learning a Latera Prior for Clothed Human Body ...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Wu, Xiaotao Fan, Zhaoxin He, Huiguang Shen, Dinggang School of Biomedical Engineering State Key Laboratory of Advanced Medical Materials and Devices ShanghaiTech University Shanghai201210 China NeuBCI Group State Key Laboratory of Brain Cognition and Brain-inspired Intelligence Technology Institute of Automation Chinese Academy of Sciences Beijing China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Institute of Artificial Intelligence Beihang University Beijing100191 China Beijing Academy of Blockchain and Edge Computing China Shanghai United Imaging Intelligence Co. Ltd. Shanghai200232 China Shanghai Clnical Research and Trial Center Shanghai201210 China

ISBN: (纸本)9798350368741

Sandwich-like structures have shown remarkable efficacy in clothed human reconstruction. However, these approaches often generate unrealistic side geometries due to inadequate handling of lateral regions. This paper addresses this limitation by incorporating the side geometry of clothed humans as a prior. We propose ThicknessVAE, a novel two-stage method that makes two key contributions: (1) We learn a prototype from point clouds for the lateral regions of clothed humans to extract common and detailed geometric features. (2) We utilize this prototype as a prior to transform geometric features into a thickness map associated with clothed human images, enabling refined normal integration for sandwich-like reconstruction methods. By seamlessly integrating our model into the sandwich-like reconstruction pipeline, we achieve highly realistic side views. Both qualitative and quantitative experiments demonstrate that our approach is comparable to state-of-the-art methods in terms of side-view realism. © 2025 IEEE.

关键词： 3D Human Reconsruction Normal Integraton Prior Learning

来源：评论

学校读者我要写书评

暂无评论

Detection of Malicious PDF Files Using a Two-Stage Machine Learning Algorithm

引用

Chinese Journal of Electronics 2020年第6期29卷 1165-1177页

作者： HE Kang ZHU Yuefei HE Yubo LIU Long LU Bin LIN Wei State Key Laboratory of Mathematical Engineering and Advanced Computing

Portable document format(PDF) files are increasingly used to launch cyberattacks due to their popularity and increasing number of *** solutions have been developed to detect malicious files,but their accuracy decreases rapidly in face of new evasion *** explore how to improve the robustness of classifiers for detecting adversarial attacks in PDF *** replacement and the n-gram are implemented to extract robust features using proposed guiding *** the two-stage machine learning model,the objects are divided based on their types,and the anomaly detection model is first trained for each type *** former detection results are organized into tree-like information structure and treated as inputs to convolutional neural *** results show that the accuracy of our classifier is nearly 100% and the robustness against evasive samples is *** object features also enable the identification of different vulnerabilities exploited in malicious PDF files.

关键词： convolutional neural nets document handling feature extraction learning (artificial intelligence) pattern classification security of data trees (mathematics) robust feature extraction convolutional neural network tree-like information structure adversarial attack detection two-stage machine learning algorithm evasion techniques malicious files portable document format malicious PDF files classifier robustness anomaly detection model two-stage machine learning model Malicious PDF classification Robustness Guiding principles Two-stage classifier Convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

Non-binary entanglement-assisted quantum stabilizer codes

引用

Science China(Information Sciences) 2017年第4期60卷 210-223页

作者： Lan LUO Zhi MA Zhengchao WEI Riguang LENG State Key Laboratory of Mathematical Engineering and Advanced Computing

In this paper, we present the pm-ary entanglement-assisted(EA) stabilizer formalism, where p is a prime and m is a positive integer. Given an arbitrary non-abelian "stabilizer", the problem of code construction and encoding is settled perfectly in the case of m = 1. The optimal number of required maximally entangled pairs is discussed and an algorithm to determine the encoding and decoding circuits is proposed. We also generalize several bounds on p-ary EA stabilizer codes, such as the BCH bound, the G-V bound and the linear programming bound. However, the issue becomes tricky when it comes to m > 1, in which case, the former construction method applies only when the non-commuting "stabilizer" satisfies a sophisticated limitation.

关键词： entanglement non-commutativity non-binary stabilizer codes quantum error-correction quantum circuits bounds

来源：评论

学校读者我要写书评

暂无评论

LaTLS: A Lattice-Based TLS Proxy Protocol

引用

Chinese Journal of Electronics 2022年第2期31卷 313-321页

作者： ZHANG Xinglong CHENG Qingfeng LI Yuting State Key Laboratory of Mathematical Engineering and Advanced Computing

The function of the Internet proxy is to check and convert the data exchanged between client and server. In fact, the two-party secure communication protocol with good security is turned into an unsafe multiparty protocol. At present, there are relatively few proxy protocols that can be applied in practice. This paper analyzes the classic agent protocol mcTLS and pointed out the security issues. We focus on the security of TLS 1.3 and proposed a lattice-based multi-party proxy protocol:La TLS. LaTLS can be proved secure in the eCK model, it can resist key-sharing attacks, counterfeiting attacks, replay attacks, and achieve forward security. Compared with traditional DH and ECDH schemes, LaTLS is more effcient. Its security is based on the shortest vector problem, therefor it has anti-quantum attack properties.

关键词： security issues Internet lattice-based multiparty proxy protocol relatively few proxy protocols data exchanged LaTLS key sharing attacks unsafe multiparty protocol Internet proxy shortest vector problem protocols antiquantum attack properties forward security two-party secure communication protocol classic agent protocol mcTLS classic agent protocol computer network security

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Proximal Inexact Gradient Framework and Its Application to Per-Antenna Constrained Joint Beamforming and Compression Design

arXiv

引用

arXiv 2025年

作者： Fan, Xilai Jiang, Bo Liu, Ya-Feng State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Ministry of Education Key Laboratory of NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing210023 China

In this paper, we propose an adaptive proximal inexact gradient (APIG) framework for solving a class of nonsmooth composite optimization problems involving function and gradient errors. Unlike existing inexact proximal gradient methods, the proposed framework introduces a new line search condition that jointly adapts to function and gradient errors, enabling adaptive stepsize selection while maintaining theoretical guarantees. Specifically, we prove that the proposed framework achieves an ϵ-stationary point within O(ϵ−2) iterations for nonconvex objectives and an ϵ-optimal solution within O(ϵ−1) iterations for convex cases, matching the best-known complexity in this context. We then custom-apply the APIG framework to an important signal processing problem: the joint beamforming and compression problem (JBCP) with per-antenna power constraints (PAPCs) in cooperative cellular networks. This customized application requires careful exploitation of the problem’s special structure such as the tightness of the semidefinite relaxation (SDR) and the differentiability of the dual. Numerical experiments demonstrate the superior performance of our custom-application over state-of-the-art benchmarks for the JBCP. © 2025, CC BY.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic Optimization Methods and Techniques for Multiple Sclerosis Detection 4th

Metaheuristic Optimization Methods and Techniques for Multip...

引用

4th International Conference on IoT and Big Data Technologies for Health Care, IotCare 2023

作者： Wang, Jiaji Wu, Meng Chen, Shuwen Zhu, Huisheng School of Computing and Mathematical Sciences University of Leicester LeicesterLE1 7RH United Kingdom School of Physics and Information Engineering Jiangsu Second Normal University Jiangsu Nanjing210016 China State Key Laboratory of Millimeter Waves Southeast University Nanjing210096 China

ISBN: (纸本)9783031900839

This paper explores the application of metaheuristic optimization methods in the context of Multiple Sclerosis (MS) detection, addressing the challenges of early and accurate diagnosis. It introduces Genetic Algorithms, Simulated Annealing, and Particle Swarm Optimization as effective tools for feature selection and classification in MS detection. Additionally, the paper discusses emerging metaheuristic optimization methods and their potential contributions. Through critical evaluation, it emphasizes the need for method selection based on task-specific requirements. In conclusion, this research highlights the promise of metaheuristic optimization in revolutionizing MS detection, urging further development and validation on larger datasets. Future directions include hybrid algorithms and advanced machine learning integration for improved diagnostic precision. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2025.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：