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

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Auxiliary Tasks Benefit Skeleton-based Action Recognition

Auxiliary Tasks Benefit Skeleton-based Action Recognition

引用

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

作者： Yang, Yuheng Chen, Haipeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

ISBN: (纸本)9798350368741

Skeleton-based action recognition has long been a fundamental and intriguing problem in machine intelligence. This task is challenging due to pose occlusion and rapid motion, which typically results in incomplete or noisy skeleton data. State-of-the-art methods tend to learn human motion directly from these corrupted skeletons as if they were reliable. Unfortunately, this might lead to unsatisfactory results when key regions of the skeleton are occluded or disturbed. To tackle the problem, we propose a novel framework that integrates auxiliary tasks into a motion modeling network. These auxiliary tasks corrupt partial human skeletons with masking or noise and then force the network to recover the corrupted data, explicitly facilitating robust feature representation learning. We further propose supervising the auxiliary tasks with mutual information losses, mathematically ensuring feature consistency and spatial alignment between the recovered and original skeleton data. Empirically, our approach sets the new state-of-the-art performance on three benchmark datasets. © 2025 IEEE.

关键词： auxiliary task mutual information skeleton-based action recognition

来源：评论

学校读者我要写书评

暂无评论

Recognition of tea sprouts based on improved deeplabV3 + model

引用

Multimedia Tools and Applications 2025年 1-18页

作者： Liu, Ruixin Wang, Dengzhun Chen, Zhonghui Li, Zhilin Xiao, Hui Yan, Chunyu Yan, Jianwei Lu, Ping Xie, Benliang College of Big Data and Information Engineering Guizhou University Guiyang550025 China Power Semiconductor Device Reliability Engineering Center of the Ministry of Education Guiyang550025 China College of Mechanical Engineering Guizhou University Guiyang550025 China State Key Laboratory Breeding Base of Green Pesticide and Agricultural Bioengineering Key Laboratory of Green Pesticide and Agricultural Bioengineering Ministry of Education Guizhou University Guiyang550025 China

The recognition of tea sprouts is the premise of realize the intelligence of the premium tea picking. DeepLabV3 +, as the latest semantic segmentation algorithm of DeepLab family, can well recognize the tea sprouts in images. However, the model still has the problem of large number of parameters, and there is still room for improvements in segmentation accuracy and speed. To solve the multi-label recognition and segmentation of background, single bud, one leaf and two leaves in the tea sprout images, an improved deep convolutional neural network algorithm is proposed. This method realizes the recognition of different postures of high-quality tea sprouts on the premise of efficiency and accuracy. The DMResNet18 model is used as the feature extraction network to lightweight the network model and increase the segmentation speed. The feature joint attention network is added to optimize the spatial weights and channel weights of the model, which improves the accuracy of segmentation. Additionally, the low-level feature fusion method is applied to obtain rich initial global information of features and improves the overall performance of the model. The results show that the segmentation accuracy of improved DeepLabV3 + model reaches 92.58%, which is improved by 4.26% compared with the original DeepLabV3 + model. The model size and the speed of detection are improved by 80.67% and 52.24%, respectively. The proposed method offers a solution for the intelligent recognition of tea sprouts. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PBCounter:weighted model counting on pseudo-boolean formulas

引用

Frontiers of Computer Science 2025年第3期19卷 55-63页

作者： Yong LAI Zhenghang XU Minghao YIN College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China School of Computer Science and Information Technology Northeast Normal UniversityChangchun 130017China

In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its *** current WMC solvers work on Conjunctive Normal Form(CNF)***,CNF is not a natural representation for human-being in many *** by the stronger expressive power of Pseudo-Boolean(PB)formulas than CNF,we propose to perform WMC on PB *** on a recent dynamic programming algorithm framework called ADDMC for WMC,we implement a weighted PB counting tool *** compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD,ExactMC,D4,and ADDMC,where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF *** experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.

关键词： weighted model counting pseudo-boolean constraint algebraic decision diagrams preprocessing techniques

来源：评论

学校读者我要写书评

暂无评论

Two efficient beamforming methods for hybrid IRS-aided AF relay wireless networks

引用

Science China(Information Sciences) 2025年第4期68卷 363-379页

作者： Xuehui WANG Qingbo LI Wen ZHU Feng SHU Mengxing HUANG Fuhui ZHOU Riqing CHEN Cunhua PAN Yongpeng WU Jiangzhou WANG School of Mathematics and Statistics Hainan Normal University Key Laboratory of Data Science and Smart Education Ministry of Education Hainan Normal University School of Information and Communication Engineering Hainan University Collaborative Innovation Center of Information Technology Hainan University School of Electronic and Optical Engineering Nanjing University of Science and Technology College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Digital Fujian Institute of Big Data for Agriculture Fujian Agriculture and Forestry University National Mobile Communications Research Laboratory Southeast University Shanghai Key Laboratory of Navigation and Location Based Services Shanghai Jiao Tong University School of Engineering University of Kent

Owing to its ability to mitigate the double-fading effect by amplifying the reflected signal, the active intelligent reflecting surface(IRS) has garnered significant attention. In this paper, an amplify-and-forward(AF) relay network assisted by a hybrid IRS consisting of both passive and active units is developed. A signal-to-noise ratio(SNR) maximization problem is formulated, where the AF relay beamforming matrix and the hybrid IRS reflecting coefficient matrices for two-time slots need to be optimized. To address the SNR maximization problem, this paper proposes both a high-performance(HP) method and a low-complexity(LC) method. The HP method is based on the semidefinite relaxation and fractional programming(SDR-FP)algorithm, with rank-1 solutions obtained through Gaussian randomization. For the LC method, the amplification coefficient of each active IRS element is assumed to be equal. The SNR maximization problem is then addressed using the whitening filter,generalized power iteration, and generalized Rayleigh-Ritz(WF-GPI-GRR) approach. Simulation results show that compared with the benchmarks, such as the passive IRS-aided AF relay network, the proposed HP-SDR-FP and WF-GPI-GRR methods achieve significant rate improvements. In particular, the HP-SDR-FP and WF-GPI-GRR methods yield more than a 135.0%rate gain when the transmit power Ps of the source is 10 dBm. Furthermore, the proposed HP-SDR-FP method outperforms the WF-GPI-GRR method in terms of rate performance.

关键词： double-fading intelligent reflecting surface active elements passive elements hybrid IRS AF relay

来源：评论

学校读者我要写书评

暂无评论

HTOTP: Honey Time-Based One-Time Passwords

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4438-4453页

作者： Ding, Zixuan Wang, Ding Nankai University College of Cryptology and Cyber Science Key Laboratory of Data and Intelligent System Security Ministry of Education Tianjin300350 China Chinese Academy of Sciences Key Laboratory of Cyberspace Security Defense Institute of Information Engineering Beijing100085 China

One-Time Passwords (OTPs) play a crucial role in Two-Factor Authentication (2FA) and Multi-Factor Authentication (MFA) by adding an additional layer of security. OTPs effectively reduce the risk of static passwords being intercepted and reused. Nevertheless, both academic schemes and industrial solutions face security threats stemming from server/device compromises and OTP factor forgery. Chain-based asymmetric OTP schemes are a promising approach to addressing the problem of server compromise but still face threats from device compromise and pre-generated chain leakage. We emphasize that since devices directly store the OTP seed, OTP authentication is essentially equivalent to verifying device possession. This means that in existing OTP schemes, OTP forgery and device compromise remain prevalent and difficult to overcome. In this work, we propose a brand new scheme to address OTP factor forgery and server/device compromises. For the first time, our scheme constructs a tightly coupled architecture between the password factor and the OTP factor. The OTP seed is derived from a password and a device-stored salt, preventing OTP seed extraction and OTP forgery even in the event of a device compromise. Through the integration of "honeywords" with the tightly coupled OTP architecture, the server stores decoy OTP seeds generated by decoy passwords, providing resistance against server compromises and partial password guessing from devices. We conduct a comprehensive evaluation of our OTP schemes. The computational overhead is correlated with the number of honeywords, and with the recommended set size of 20, the total verification overhead is approximately 0.24~ms . Additionally, we propose formal security properties and application metrics, and rigorously prove our scheme’s resistance against server/device compromise attacks and guessing attacks. Our scheme is the first to achieve comprehensive OTP security with low overhead. © 2005-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Retrieval-Augmented Fine-Tuning for Improving Retrieve-and-Edit Based Assertion Generation

引用

IEEE Transactions on Software engineering 2025年第5期51卷 1591-1614页

作者： Li, Hongyan Sun, Weifeng Yan, Meng Xu, Ling Li, Qiang Zhang, Xiaohong Zhang, Hongyu Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing400044 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

Unit Testing is crucial in software development and maintenance, aiming to verify that the implemented functionality is consistent with the expected functionality. A unit test is composed of two parts: a test prefix, which drives the unit under test to a particular state, and a test assertion, which determines what the expected behavior is under that state. To reduce the effort of conducting unit tests manually, Yu et al. proposed an integrated approach (integration for short), combining information retrieval with a deep learning-based approach to generate assertions for test prefixes, and obtained promising results. In our previous work, we found that the overall performance of integration is mainly due to its success in retrieving assertions. Moreover, integration is limited to specific types of edit operations and struggles to understand the semantic differences between the retrieved focal-test (focal-test includes a test prefix and a unit under test) and the input focal-test. Based on these insights, we then proposed a retrieve-and-edit approach named EDITAS to learn the assertion edit patterns to improve the effectiveness of assertion generation in our prior study. Despite being promising, we find that the effectiveness of EDITAS can be further improved. Our analysis shows that: ① The editing ability of EDITAS still has ample room for improvement. Its performance degrades as the edit distance between the retrieval assertion and ground truth increases. Specifically, the average accuracy of EDITAS is 12.38% when the edit distance is greater than 5. ② EDITAS lacks a fine-grained semantic understanding of both the retrieved focal-test and the input focal-test themselves, which leads to many inaccurate token modifications. In particular, an average of 25.57% of the incorrectly generated assertions that need to be modified are not modified, and an average of 6.45% of the assertions that match the ground truth are still modified. Thanks to pre-trained models employing

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Orthogonal Projection-Based Fault Detection for Linear Discrete-Time Varying Systems

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 3478-3485页

作者： Li, Linlin Ding, Steven X. Zhong, Maiying Peng, Kaixiang University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering Beijing100083 China Duisburg47057 Germany Shandong University of Science and Technology College of Electrical Engineering and Automation Qingdao266590 China

This article is devoted to one-class fault detection in linear discrete-time varying (LDTV) systems with uncertainties. Specifically, following the Hilbert Projection theorem, the residual generation problem is solved by means of an orthogonal projection of process data onto system subspaces in Hilbert space. The resulted Pythagorean equation enables establishing an adaptive threshold driven by the residual signal and using gap metric as the similarity measure. In this projection-based fault detection framework, the design and implementation of the residual generators and threshold setting can be uniformly addressed, which provides a systematic solution to the detection issues in linear discrete-time varying systems. Moreover, a comparison with the observer- and differential-algebraic equations-based fault detection schemes is studied, which highlights the improved fault detection capability of the projection-based method. © 1963-2012 IEEE.

关键词： Linear time-invariant system

来源：评论

学校读者我要写书评

暂无评论

T³Planner: Multi-Phase Planning Across Structure-Constrained Optical, IP, and Routing Topologies

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1823-1839页

作者： Hao, Yijun Yang, Shusen Li, Fang Zhang, Yifan Zhao, Cong Ren, Xuebin Zhao, Peng Xu, Chenren Wang, Shibo Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Xi’an710049 China Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an710049 China Peking University School of Computer Science Beijing100871 China The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong National Engineering Laboratory for Big Data Analytics Xi'an Jiaotong University Xi'an710049 China

Network topology planning is an essential multi-phase process to build and jointly optimize the multi-layer network topologies in wide-area networks (WANs). Most existing practices target single-phase/layer planning, and are incapable of satisfying all rigorous topological structure constraints (e.g., dual-homing rings) defined by network standards and operators, especially in large-scale networks. These significantly limit their usability and performance in production networks. We consider a general topology planning problem with typical structure constraints over three essential phases (greenfield, reconfiguration, and site expansion) and topological layers (optical, IP, and routing topologies). We present, T3Planner, a novel practical solver to this problem in production. Specifically, we develop a structure-driven encoder based on graph neural network (GNN) for concise structure encoding, and design a new learning framework with optical-centric layer compression/reconstruction and rule-aided reinforcement learning (RL) for fast convergence and high performance. Extensive experiments on nine real topologies demonstrate that T3Planner scales to large optical networks with hundreds of sites, saves 46.6% cost, and supports 3.12x more demand when compared to related existing approaches. © 1983-2012 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：