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

k-TEVS: A k-Times E-Voting Scheme on Blockchain With Supervision

学校读者我要写书评

暂无评论

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 2326-2337页

作者： Liu, Yang He, Debiao Luo, Min Wang, Lianhai Peng, Cong Wuhan University School of Cyber Science and Engineering Wuhan430072 China Shenzhen Institute of Information Technology Institute of Information Technology Shenzhen518172 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Matrix Elements Technologies Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Shanghai200232 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

Thee-vote is regarded as a waytoexpress the opinion that the voters ask for. Actually, the e-vote could be applied wildly likequestionnaire,***,thecoexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storagecostsforthefieldconsistedofthevotegroupmanager(GM) with its vote assistants (VA). Particularly the k-times anonymous authentication (k-TAA) could also be a practical approach to pre serve voters’ privacy and reduce the computation costs during the ***,thee-voteschemewithpurek-TAAstrategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of k-TAA with the update process for the e-vote on blockchain for supervision (k-TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the k-TEVS framework. Finally, We implement k TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme. © 2004-2012 IEEE.

关键词： Efficiency

Kernel-learning parameter prediction and evaluation in algebraic multigrid method for several PDEs

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Juan Luo, Junyue Zhang, Fangfang Yue, Xiaoqiang Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

This paper explores the application of kernel learning methods for parameter prediction and evaluation in the Algebraic Multigrid Method (AMG), focusing on several Partial Differential Equation (PDE) problems. AMG is an efficient iterative solver for large-scale sparse linear systems, particularly those derived from elliptic and parabolic PDE discretizations. However, its performance heavily relies on numerous parameters, which are often set empirically and are highly sensitive to AMG’s effectiveness. Traditional parameter optimization methods are either computationally expensive or lack theoretical support. To address this, we propose a Gaussian Process Regression (GPR)-based strategy to optimize AMG parameters and introduce evaluation metrics to assess their effectiveness. Trained on small-scale datasets, GPR predicts nearly optimal parameters, bypassing the time-consuming parameter sweeping process. We also use kernel learning techniques to build a kernel function library and determine the optimal kernel function through linear combination, enhancing prediction accuracy. In numerical experiments, we tested typical PDEs such as the constant-coefficient Poisson equation, variable-coefficient Poisson equation, diffusion equation, and Helmholtz equation. Results show that GPR-predicted parameters match grid search results in iteration counts while significantly reducing computational time. A comprehensive analysis using metrics like mean squared error, prediction interval coverage, and Bayesian information criterion confirms GPR’s efficiency and reliability. These findings validate GPR’s effectiveness in AMG parameter optimization and provide theoretical support for AMG’s practical application. © 2025, CC BY.

关键词： Poisson equation

A Tetrahedral Spectral Element Method for Thermo-Mechanical Analysis of Electronic Devices

学校读者我要写书评

暂无评论

IEEE Transactions on Components, Packaging and Manufacturing Technology 2025年

作者： Feng, Naixing Zhang, Shuai Huang, Zhixiang Liu, Qi Qiang Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Electromagnetic Environmental Sensing of Anhui Higher Education Institutes Hefei China Hangzhou Dianzi University School of Electronics and Information Engineering Hangzhou310018 China

For the coupled thermo-mechanical simulation of complex electronic devices, we propose a Tetrahedral Spectral Element Method (TSEM), which truly combines the high accuracy of spectral methods with the strong geometric adaptability of Finite Element Methods (FEMs). The TSEM employs a collapse transformation method and successfully converts the orthogonal Gauss-Lobatto-Legendre (GLL) basis functions from a hexahedron to a tetrahedral reference element. This ensures numerical accuracy and stability for arbitrary high-order interpolation. We also generate non-equidistant GLL spectral interpolation nodes for tetrahedral elements through Warp&Blend transformation, enabling direct nodal numerical integration calculation through Vandermonde matrices. This approach replaces the classical Gaussian quadrature in the FEM, not only significantly enhancing the computational efficiency of element matrix but also avoiding potential numerical dissipation and dispersion associated with Gaussian integration, thus achieving rapid convergence. In the TSEM thermo-mechanical coupling, we further construct a separate solver based on the implicit Newmark-β method, which realizes unconditional stability for temporal integration for arbitrary time step increment. Moreover, it supports independent inversion of system matrices for temperature and stress fields, without increasing computational resource consumption due to the coupling of multi-physics equations. By quantitatively comparing with the COMSOL Multiphysics software, several typical case studies are used to demonstrate the significant advantages of the TSEM in numerical accuracy, efficiency, and stability. © 2025 IEEE. All rights reserved.

关键词： Orthogonal functions

A Nonconformal SETI-DP Method for Transient Thermal Simulation

学校读者我要写书评

暂无评论

IEEE Transactions on Components, Packaging and Manufacturing Technology 2025年

作者： Feng, Naixing Li, Hongyang Huang, Zhixiang Liu, Qi Qiang Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education The Information Materials and Intelligent Sensing Laboratory of Anhui Province The Key Laboratory of Electromagnetic Environmental Sensing of Anhui Higher Education Institutes Hefei China Hangzhou Dianzi University School of Electronics and Information Engineering Hangzhou310018 China

This paper proposes a novel nonconformal meshbased dual-primal spectral element tearing and interconnecting (SETI-DP) method designed for the efficient transient simulation of complex large-scale heat conduction problems utilizing a domain decomposition method (DDM). This method allows for the division of complex, large-scale problems into smaller subdomain problems. By applying Robin-type transmission conditions at the subdomain interfaces, rapid convergence of the global interface iterative solution is achieved for arbitrary non-conformal subdomain problems. This non-conformal DDM approach supports independent meshing of subdomains, eliminating the need to generate a globally continuous mesh for large-scale problems, thereby significantly enhancing meshing efficiency. In addition, this non-conformal meshing strategy enables high-contrast spatial discretization and mixed-order spectral interpolation between different subdomains. This significantly increases meshing flexibility, minimizes the number of degrees of freedom (DoF) in multi-scale problems, and reduces computational costs. In addition, by developing a subdomain-coupled time iteration scheme, the global corner problem of residual transfer is explicitly given, which greatly improves the versatility and flexibility of the algorithm. Finally, to demonstrate the accuracy, efficiency, and robustness of our algorithm, we conduct benchmark tests on several representative examples. © 2011-2012 IEEE.

关键词： Domain decomposition methods

MaintaAvatar: A Maintainable Avatar Based on Neural Radiance Fields by Continual Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Gu, Shengbo Qiu, Yu-Kun Tang, Yu-Ming Wu, Ancong Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Peng Cheng Laboratory Shenzhen China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

The generation of a virtual digital avatar is a crucial research topic in the field of computer vision. Many existing works utilize Neural Radiance Fields (NeRF) to address this issue and have achieved impressive results. However, previous works assume the images of the training person are available and fixed while the appearances and poses of a subject could constantly change and increase in real-world scenarios. How to update the human avatar but also maintain the ability to render the old appearance of the person is a practical challenge. One trivial solution is to combine the existing virtual avatar models based on NeRF with continual learning methods. However, there are some critical issues in this approach: learning new appearances and poses can cause the model to forget past information, which in turn leads to a degradation in the rendering quality of past appearances, especially color bleeding issues, and incorrect human body poses. In this work, we propose a maintainable avatar (MaintaAvatar) based on neural radiance fields by continual learning, which resolves the issues by utilizing a Global-Local Joint Storage Module and a Pose Distillation Module. Overall, our model requires only limited data collection to quickly fine-tune the model while avoiding catastrophic forgetting, thus achieving a maintainable virtual avatar. The experimental results validate the effectiveness of our MaintaAvatar model. © 2025, CC BY.

关键词： Federated learning

MBF-DTI: A Fused Multi-dimensional Biochemical Feature-Based Drug Target Prediction Method Based on Heterogeneous Graph Attention Networks 10th

学校读者我要写书评

暂无评论

MBF-DTI: A Fused Multi-dimensional Biochemical Feature-Based...

10th China Health Information Processing Conference, CHIP 2024

作者： Zhao, Haixue Yao, Kui Liu, Yunjiong Che, Chao Tang, Lin Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University Dalian116622 China School of Software Engineering Dalian University Dalian116622 China

ISBN: (纸本)9789819637515

Drug-target interaction prediction help reduce the cost and time of drug development. However, existing research often overlooks the complexity of biological interactions. To address this issue, this paper proposes a DTI prediction model that integrates multi-dimensional biochemical features. Specifically, the model utilizes a heterogeneous graph attention network to capture the topological relationships among biological entities from diverse data, providing a deep understanding of the interactions among drugs, proteins, diseases, and side effects. A molecular attention Transformer network and a CBiNet module are used to extract the key structural features of drugs and targets. By automatically optimizing the weight distribution between drugs and targets, the model enhances the information transfer during network training, significantly improving model performance. Experimental results on real-world datasets demonstrate that the proposed model outperforms the current state-of-the-art methods in the field. Among the top 50 novel COVID-19 therapeutic drugs predicted by our model, 30 have been supported by clinical trials or scientific literature, further demonstrating the effectiveness of our proposed method in drug repurposing. Experimental data and supplementary materials are available online at: https://***/Eadog/MBF-DTI. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： COVID-19

iManip: Skill-Incremental Learning for Robotic Manipulation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zheng, Zexin Cai, Jia-Feng Wu, Xiao-Ming Wei, Yi-Lin Tang, Yu-Ming Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Pengcheng Lab China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

The development of a generalist agent with adaptive multiple manipulation skills has been a long-standing goal in the robotics community. In this paper, we explore a crucial task, skill-incremental learning, in robotic manipulation, which is to endow the robots with the ability to learn new manipulation skills based on the previous learned knowledge without re-training. First, we build a skill-incremental environment based on the RLBench benchmark, and explore how traditional incremental methods perform in this setting. We find that they suffer from severe catastrophic forgetting due to the previous methods on classification overlooking the characteristics of temporality and action complexity in robotic manipulation tasks. Towards this end, we propose an incremental Manipulation framework, termed iManip, to mitigate the above issues. We firstly design a temporal replay strategy to maintain the integrity of old skills when learning new skill. Moreover, we propose the extendable PerceiverIO, consisting of an action prompt with extendable weight to adapt to new action primitives in new skill. Extensive experiments show that our framework performs well in Skill-Incremental Learning. Codes of the skill-incremental environment with our framework will be open-source. Copyright © 2025, The Authors. All rights reserved.

关键词： Robot learning

Learning hierarchical scene graph and contrastive learning for object goal navigation

学校读者我要写书评

暂无评论

Knowledge-Based Systems 2025年 319卷

作者： Luo, Jian Zhang, Jian Cai, Bo Yu, Yaoxiang Ke, Aihua School of Cyber Science and Engineering Wuhan University Wuhan430072 China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan430072 China Wuhan Digital Engineering Institute Wuhan430074 China

The task of object goal navigation (ObjNav) requires the agent to locate the given target object within a complex dynamic scene. To successfully accomplish the task, the agent needs to well understand the scenes, make executable decisions with less steps, avoid collisions, and successfully navigate to the target. As a result, efficient environmental perception and scene graph-inspired path planning is important to successfully accomplish the ObjNav task. In this paper, we present a hierarchical scene graph (HSG) contrastive learning, which consists of (1) a multimodal graph mixer that aligns the visual and textual information using open-vocabulary detector with GLIP. It can be regarded as an "eagle eye" to perceive target-related frontiers and suppress irrelevant information, and (2) a graph constructer that takes observed RGBD images to incrementally build a hierarchical scene graph. It acts as the "brain" that memorizes the common scene layout, (3) an action control contrastive learning that takes the graph contextual relationships as input to predict optimal actions to the target. It is treated as the "limbs" of the agent, coordinating and correcting incorrect movements. On the task of ObjNav, experiments on Gibson, HM3D, MP3D, and ProcTHOR demonstrate that navigation plans from the HSG framework achieve significantly higher success rates than existing map-based method, indicating the feasibility of executing navigation utilizing commonsense knowledge from language models leading efficient semantic exploration. Code is available at https://***/luosword/HSG4VN. © 2025 Elsevier B.V.

关键词： Flow visualization

Quantum simulation of a class of highly-oscillatory transport equations via Schrödingerisation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Gu, Anjiao Jin, Shi School of Mathematical Sciences Shanghai Jiao Tong University Shanghai200240 China Institute of Natural Sciences Shanghai Jiao Tong University Shanghai200240 China Ministry of Education Key Laboratory in Scientific and Engineering Computing Shanghai200240 China

In this paper, we present quantum algorithms for a class of highly-oscillatory transport equations, which arise in semiclassical computation of surface hopping problems and other related non-adiabatic quantum dynamics, based on the Born-Oppenheimer approximation. Our method relies on the classical nonlinear geometric optics method, and the recently developed Schrödingerisation approach for quantum simulation of partial differential equations. The Schrödingerisation technique can transform any linear ordinary and partial differential equations into Hamiltonian systems evolving under unitary dynamics, via a warped phase transformation that maps these equations to one higher dimension. We study possible paths for better recoveries of the solution to the original problem by shifting the bad eigenvalues in the Schrödingerized system. Our method ensures the uniform error estimates independent of the wave length, thus allowing numerical accuracy, in maximum norm, even without numerically resolving the physical oscillations. Various numerical experiments are performed to demonstrate the validity of this approach. Copyright © 2025, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions