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

Adaptive cyclic gradient methods with interpolation

Computational Optimization and Applications 2025年 1-25页

作者： Xie, Yixin Sun, Cong Yuan, Ya-Xiang Beijing100876 China Ministry of Education Beijing100876 China State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing100190 China

Gradient method is an important method for solving large scale problems. In this paper, a new gradient method framework for unconstrained optimization problem is proposed, where the stepsize is updated in a cyclic way. The Cauchy step is approximated by the quadratic interpolation. And the cycle for stepsize update is adjusted adaptively. Combining with the adaptive nonmonotone line search technique, we prove the global convergence of the proposed method. Furthermore, its sublinear convergence rate for convex problems and R-linear convergence rate for problems with quadratic functional growth property are analyzed. Numerical results show that our proposed algorithm enjoys good performances in terms of both computational cost and obtained function values. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

When Embodied AI Meets Industry 5.0:Human-Centered Smart Manufacturing

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 485-501页

作者： Jing Xu Qiyu Sun Qing-Long Han Yang Tang IEEE the Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology the School of Science Computing and Engineering Technologies Swinburne University of Technology

As embodied intelligence(EI), large language models(LLMs), and cloud computing continue to advance, Industry5.0 facilitates the development of industrial artificial intelligence(Ind AI) through cyber-physical-social systems(CPSSs) with a human-centric focus. These technologies are organized by the system-wide approach of Industry 5.0, in order to empower the manufacturing industry to achieve broader societal goals of job creation, economic growth, and green production. This survey first provides a general framework of smart manufacturing in the context of Industry 5.0. Wherein, the embodied agents, like robots, sensors, and actuators, are the carriers for Ind AI, facilitating the development of the self-learning intelligence in individual entities, the collaborative intelligence in production lines and factories(smart systems), and the swarm intelligence within industrial clusters(systems of smart systems). Through the framework of CPSSs, the key technologies and their possible applications for supporting the single-agent, multi-agent and swarm-agent embodied Ind AI have been reviewed, such as the embodied perception, interaction, scheduling, multi-mode large language models, and collaborative training. Finally, to stimulate future research in this area, the open challenges and opportunities of applying Industry 5.0 to smart manufacturing are identified and discussed. The perspective of Industry 5.0-driven manufacturing industry aims to enhance operational productivity and efficiency by seamlessly integrating the virtual and physical worlds in a human-centered manner, thereby fostering an intelligent, sustainable, and resilient industrial landscape.

关键词： Embodied AI human-centered manufacturing Industry 5.0 internet of things large multi-mode language models

来源：评论

学校读者我要写书评

暂无评论

Byzantine-robust distributed support vector machine

引用

Science China Mathematics 2025年第3期68卷 707-728页

作者： Xiaozhou Wang Weidong Liu Xiaojun Mao School of Statistics East China Normal UniversityShanghai 200062China Key Laboratory of Advanced Theory and Application in Statistics and Data Science(Ministry of Education) East China Normal UniversityShanghai 200062China School of Mathematical Sciences Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Artificial Intelligence(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Scientific and Engineering Computing(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China

The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines may behave abnormally and send arbitrary information to the central machine(known as Byzantine failures), which can invalidate the distributed algorithms based on the assumption of faultless systems. This paper studies Byzantine-robust distributed algorithms for support vector machines(SVMs) in the context of binary classification. Despite a vast literature on Byzantine problems, much less is known about the theoretical properties of Byzantine-robust SVMs due to their unique challenges. In this paper, we propose two distributed gradient descent algorithms for SVMs. The median and trimmed mean operations in aggregation can effectively defend against Byzantine failures. Theoretically, we show the convergence of the proposed estimators and provide the statistical error rates. After a certain number of iterations, our estimators achieve near-optimal rates. Simulation studies and real data analysis are conducted to demonstrate the performance of the proposed Byzantine-robust distributed algorithms.

关键词： Byzantine robustness convergence distributed learning support vector machine

来源：评论

学校读者我要写书评

暂无评论

Three-in-One: Robust Enhanced Universal Transferable Anti-Facial Retrieval in Online Social Networks

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4408-4421页

作者： Lv, Yunna Tang, Long Ye, Dengpan Xie, Caiyun Deng, Jiacheng He, Yiheng Shen, Sipeng Wuhan University School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan430072 China

Deep hash-based retrieval techniques are widely used in facial retrieval systems to improve the efficiency of facial matching. However, it also carries the danger of exposing private information. Deep hash models are easily influenced by adversarial examples, which can be leveraged to protect private images from malicious retrieval. The existing adversarial example methods against deep hash models focus on universality and transferability, lacking the research on its robustness in online social networks (OSNs), which leads to their failure in anti-retrieval after post-processing. Therefore, we provide the first in-depth discussion on robustness in universal transferable anti-facial retrieval and propose Three-in-One Adversarial Perturbation (TOAP). Specifically, we construct a local and global Compression Generator (CG) to simulate complex post-processing scenarios, which can be used to mitigate perturbation. Then, we propose robust optimization objectives based on the discovery of the variation patterns of model’s distribution after post-processing, and generate adversarial examples using these objectives and meta-learning. Finally, we iteratively optimize perturbation by alternately generating adversarial examples and fine-tuning the CG, balancing the performance of perturbation while enhancing CG’s ability to mitigate them. Numerous experiments demonstrate that, in addition to its advantages in universality and transferability, TOAP significantly outperforms current state-of-the-art methods in multiple robustness metrics. It further improves universality and transferability by 5% to 28%, and achieves up to about 33% significant improvement in several simulated post-processing scenarios as well as mainstream OSNs, demonstrating that TOAP can effectively protect private images from malicious retrieval in real-world scenarios. © 2005-2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Forward Secure Similarity Search Over Encrypted Data for Hamming Distance

引用

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

作者： Wang, Beining He, Kun Huang, Yingying Chen, Jing Zhao, Chenbin Du, Ruiying Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China

Similarity search on encrypted data can identify similar data and handle misspelled keywords in a privacy-preserving manner and thus has received a lot of attention. However, existing schemes suffer from imprecise or predefined distance thresholds, which means that they do not always return the expected search results. Moreover, these schemes either do not consider document addition or lack forward security in this dynamic setting. In this article, we present a Similar keyword Matching (SKM) framework that accurately calculates the Hamming distance between keywords through a new keyword representation called uni-pos-gram. Based on our framework, we propose a basic scheme for similarity search over encrypted data called SimSE that offers adjustable Hamming distance thresholds and an enhanced scheme called SimSE-F that provides forward security. Security analysis demonstrates that our schemes effectively safeguard the privacy of documents, indexes, and searches. Empirical experiments using real-world datasets demonstrate the efficiency and practical applicability of our schemes. © 2004-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RECONSTRUCTION-BASED A POSTERIORI ERROR ESTIMATES FOR THE L1 METHOD FOR TIME FRACTIONAL PARABOLIC PROBLEMS

引用

Journal of Computational Mathematics 2025年第2期43卷 345-368页

作者： Jiliang Cao Aiguo Xiao Wansheng Wang Department of Mathematics Shanghai Normal UniversityShanghai 200234China Hunan Key Laboratory for Computation and Simulation in Science and Engineering&Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan UniversityXiangtan 411105China

In this paper,we study a posteriori error estimates of the L1 scheme for time discretizations of time fractional parabolic differential equations,whose solutions have generally the initial *** derive optimal order a posteriori error estimates,the quadratic reconstruction for the L1 method and the necessary fractional integral reconstruction for the first-step integration are *** using these continuous,piecewise time reconstructions,the upper and lower error bounds depending only on the discretization parameters and the data of the problems are *** numerical experiments for the one-dimensional linear fractional parabolic equations with smooth or nonsmooth exact solution are used to verify and complement our theoretical results,with the convergence ofαorder for the nonsmooth case on a uniform *** recover the optimal convergence order 2-αon a nonuniform mesh,we further develop a time adaptive algorithm by means of barrier function recently *** numerical implementations are performed on nonsmooth case again and verify that the true error and a posteriori error can achieve the optimal convergence order in adaptive mesh.

关键词： Time fractional parabolic differential equations A posteriori error estimates Ll method Fractional integral reconstruction Quadratic reconstruction

来源：评论

学校读者我要写书评

暂无评论

MSMAE-Net: multi-semantic and multi-attention enhanced network for image forgery localization

引用

Signal, Image and Video Processing 2025年第7期19卷 1-11页

作者： Liao, Jianjun Su, Lichao Lu, Menghan Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

The popularization of modern digital image technology has brought convenience to us, but it also poses many risks. The advancement of image editing software allows anyone to modify image content effortlessly. If these modified images are abused, they can severely impact societal safety and stability. To address these risks, we propose an end-to-end multi-scale collaborative enhancement image forgery localization network, termed MSMAE-Net. The method first employs a multi-branch feature extractor to initially capture both global and local information, with each branch optimized for different contextual information and features of the image. Next, to enhance the model’s ability to capture forged traces at various levels while maintaining the correlation between different spatial hierarchies, a boundary information aggregation module is designed. By constructing multiple branches with different receptive fields and collaborative learning with each other, a nested collaborative enhancement branch is designed to make the backbone network pay more attention to key features, so as to obtain better feature representation capability. Furthermore, to further fuse different semantic information, a novel strongly compatible semantic attention fusion module is proposed in this paper. Finally, an attention enhancement module is introduced in the localization of forgery regions to adaptively concentrate on key forged areas in the image and effectively capture the relationships between different pixels. In the experiments, we demonstrate that MSMAE-Net exhibits significant advantages in both localization accuracy and robustness in complex forgery scenarios when compared to other SOTA image forgery detection methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

Study of the Inhibition of Schumann Resonance-inspired Electromagnetic Field on Cancer Cell Proliferation

引用

Journal of Bionic engineering 2025年第1期22卷 341-353页

作者： Xianqiang Yan Xuelei Liu Shujun Zhang Zhenning Liu Luquan Ren Key Laboratory of Bionic Engineering(Ministry of Education) College of Biological and Agricultural EngineeringJilin UniversityChangchun130022China School of Computing and Engineering University of GloucestershireThe ParkCheltenhamGL502RHUK School of Mechanical Engineering Shandong University of TechnologyZibo255000China

Organisms on Earth evolve and coexist with natural Electromagnetic Fields(EMFs).Although many reports have suggested the potential anti-neoplastic effects of EMFs with specific parameters,the studies on the influence of natural EMFs on cancers are still ***,an EMF emitter has been developed to investigate the effects of the extremely-low frequency SR-mimicking EMF(SREMF)on cancer and normal cell *** numerical simulation has revealed that the emitter with specific parameters is able to enhance EMF intensity and uniformity on the designated plane above the *** importantly,honeycomb-like emitter array can generate a stronger EMF intensity on the 20 mm plane above the *** colony formation assays have demonstrated that SREMF generated by the honeycomb-like emitter array can significantly inhibit Hela cell proliferation in a cell-density-dependent *** morphological changes of SREMF-exposed Hela cells suggest that the anti-proliferative effect of SREMF may be caused by apoptosis *** contrast,no detrimental effect is observed for SREMF-treated normal cells,which probably can be explained by the evolutionary ***,this work can not only contribute to understanding the impact of natural EMF on creatures,but also afford a novel strategy to personalized cancer prevention and treatment.

关键词： Electromagnetic fields(EMFs) Schumann resonance EMF emitter Cancer Cell proliferation

来源：评论

学校读者我要写书评

暂无评论

Weak Multi-Label Data Stream Classification Under Distribution Changes in Labels

引用

IEEE Transactions on Big Data 2025年第3期11卷 1369-1380页

作者： Zou, Yizhang Hu, Xuegang Li, Peipei Hu, Jun Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei230002 China National University of Singapore School of Computing 119077 Singapore

Multi-label stream classification aims to address the challenge of dynamically assigning multiple labels to sequentially arrived instances. In real situations, only partial labels of instances can be observed due to the expensive human annotations, and the problem of label distribution changes arises from multiple labels in a streaming mode, but few existing works jointly consider such challenges. Motivated by this, we propose the problem of weak multi-label stream classification (WMSC) and an online classification algorithm robust to weak labels. Specifically, we incrementally update the margin-based model using information from both the past model and the current incoming instance with partially observed labels. To increase the robustness to weak labels, we first adjust the classification margin of negative labels using the label causality matrix, which is constructed by the conditional probability of label pairs. Second, we introduce the label prototype matrix to regulate the margin by controlling the weighting parameter of the slack term. Additionally, to handle the potential distribution changes in labels, we utilize the instance-specific threshold via online thresholding to perform binary classification, which is formulated as a regression problem. Finally, theoretical analysis and empirical experimental results are presented to demonstrate the effectiveness of WMSC in classifying unobserved streaming instances. © 2015 IEEE.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：