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

PS-CoT-Adapter: adapting plan-and-solve chain-of-thought for scienceQA

science China(Information sciences) 2025年第1期68卷 392-393页

作者： Qun LI Haixin SUN Fu XIAO Yiming WANG Xinping GAO Bir BHANU School of Computer Science Nanjing University of Posts and Telecommunications Purple Mountain Laboratories Department of Electrical and Computer Engineering University of California at Riverside

Large language models (LLMs) have recently shown remarkable performance in a variety of natural language processing (NLP) *** further explore LLMs'reasoning abilities in solving complex problems,recent research [1-3]has investigated chain-of-thought (CoT) reasoning in complex multimodal scenarios,such as science question answering (scienceQA) tasks [4],by fine-tuning multimodal models through human-annotated CoT ***,collected CoT rationales often miss the necessary rea-soning steps and specific expertise.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Enhancing cyber threat detection with an improved artificial neural network model

引用

Data science and Management 2025年第1期8卷 107-115页

作者： Oyinloye, Toluwase Sunday Arowolo, Micheal Olaolu Prasad, Rajesh Department of Computer Science African University of Science and Technology Abuja900107 Nigeria Department of Electrical Engineering and Computer Science University of Missouri ColumbiaMO65201 United States

Identifying cyberattacks that attempt to compromise digital systems is a critical function of intrusion detection systems (IDS). Data labeling difficulties, incorrect conclusions, and vulnerability to malicious data injections are only a few drawbacks of using machine learning algorithms for cybersecurity. To overcome these obstacles, researchers have created several network IDS models, such as the Hidden Naive Bayes Multiclass Classifier and supervised/unsupervised machine learning techniques. This study provides an updated learning strategy for artificial neural network (ANN) to address data categorization problems caused by unbalanced data. Compared to traditional approaches, the augmented ANN's 92% accuracy is a significant improvement owing to the network's increased resilience to disturbances and computational complexity, brought about by the addition of a random weight and standard scaler. Considering the ever-evolving nature of cybersecurity threats, this study introduces a revolutionary intrusion detection method. © 2024 Xi'an Jiaotong University

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

A Novel Lightweight Joint Source-Channel Coding Design in Semantic Communications

引用

IEEE Internet of Things Journal 2025年第11期12卷 18447-18450页

作者： Yu, Xianhua Li, Dong Zhang, Ning Shen, Xuemin Macau University of Science and Technology School of Computer Science and Engineering 999078 China University of Windsor Department of Electrical and Computer Engineering Canada University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada

Semantic communication has emerged as a promising solution to meet the growing demand for efficient data transmission in the information age. Unlike traditional communication methods that focus on transmitting raw data, semantic communication prioritizes preserving the meaning of transmitted information, which significantly reduces the data volume. However, implementing semantic communication systems in resource-constrained environments, such as Internet of Things (IoT) devices, remains challenging due to limited computational resources. In this letter, we propose a novel lightweight deep learning (DL) model, termed the lightweight image compression and reconstruction network (LICRnet). LICRnet leverages depthwise separable convolution (DSC) and a local and non-local mixture (LNLM) block to significantly reduce computational costs. Additionally, the LNLM incorporates a variable window size-based multi-scale attention mechanism (VW-MSA), enabling it to effectively learn from both local detailed features and global high-level meaningful features. Extensive simulations demonstrate that LICRnet significantly reduces computational complexity while maintaining satisfactory image compression and reconstruction performance, making it highly suitable for deployment in resource-constrained environments. © 2014 IEEE.

关键词： Channel coding

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Path Planning Based on Conflict-Based Search (CBS) Variations for Heterogeneous Robots

引用

Journal of Intelligent and Robotic Systems: Theory and Applications 2025年第1期111卷 1-12页

作者： Bai, Yifan Kotpalliwar, Shruti Kanellakis, Christoforos Nikolakopoulos, George Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå797187 Sweden

This article introduces a novel Multi-agent path planning scheme based on Conflict Based Search (CBS) for heterogeneous holonomic and non-holonomic agents, designated as Heterogeneous CBS (HCBS). The proposed methodology employs a hybrid A∗ algorithm for non-holonomic car-like robots and a conventional A∗ algorithm for holonomic robots. Following this, a body conflict detection strategy is utilized to construct the conflict tree, bridging the initial path planning with the resolution of conflicts among agents. Moreover, we present two variants of HCBS: the Enhanced Conflict-Based Search (EHCBS) and the Depth-First Conflict-Based Search (DFHCBS). We evaluate the efficacy of our proposed algorithms—HCBS, EHCBS, and DFHCBS—against a standard prioritized planning algorithm, focusing on success rates and computational efficiency in environments with varying numbers of agents and obstacles. The empirical results demonstrate that EHCBS exhibits superior computational efficiency in small, dense environments, while DFHCBS performs well in larger-scale environments. This highlights the adaptability of our proposed approaches in various settings, proving the computational advantage of EHCBS and DFHCBS over traditional methods. © The Author(s) 2025.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Tightening QC Relaxations of AC Optimal Power Flow Through Improved Linear Convex Envelopes

引用

IEEE Transactions on Power Systems 2025年第2期40卷 1465-1480页

作者： Narimani, Mohammad Rasoul Molzahn, Daniel K. Davis, Katherine R. Crow, Mariesa L. Department of Electrical and Computer Engineering NorthridgeCA91330 United States Georgia Institute of Technology School of Electrical and Computer Engineering AtlantaGA30332 United States Texas A&M University Electrical and Computer Engineering Department College StationTX77840 United States Missouri University of Science and Technology Electrical and Computer Engineering Department RollaMO65409 United States

AC optimal power flow (AC OPF) is a fundamental problem in power system operations. Accurately modeling the network physics via the AC power flow equations makes AC OPF a challenging nonconvex problem. To search for global optima, recent research has developed various convex relaxations that bound the optimal objective values of AC OPF problems. The QC relaxation convexifies the AC OPF problem by enclosing the non-convex terms within convex envelopes. The QC relaxation's accuracy strongly depends on the tightness of these envelopes. This paper proposes two improvements for tightening QC relaxations of OPF problems. We first consider a particular nonlinear function whose projections are the nonlinear expressions appearing in the polar representation of the power flow equations. We construct a polytope-shaped convex envelope around this nonlinear function and derive convex expressions for the nonlinear terms using its projections. Second, we use sine and cosine expression properties, along with changes in their curvature, to tighten this convex envelope. We also propose a coordinate transformation to tighten the envelope by rotating power flow equations based on individual bus-specific angles. We compare these enhancements to a state-of-the-art QC relaxation method using PGLib-OPF test cases, revealing improved optimality gaps in 68% of the cases. © 1969-2012 IEEE.

关键词： Load flow optimization

来源：评论

学校读者我要写书评

暂无评论

Generalized Fractional Repetition Codes for Binary Coded Computations

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2170-2194页

作者： Charalambides, Neophytos Mahdavifar, Hessam Hero, Alfred O. University of California at San Diego Department of Computer Science and Engineering La Jolla CA92093 United States Northeastern University Department of Electrical and Computer Engineering BostonMA02115 United States University of Michigan Department of Electrical Engineering and Computer Science Ann ArborMI48104 United States

This paper addresses the gradient coding and coded matrix multiplication problems in distributed optimization and coded computing. We present a computationally efficient coding method which overcomes the drawbacks of the Fractional Repetition Coding gradient coding method proposed by Tandon et al., and can also be leveraged by coded computing networks whose servers are of heterogeneous nature. Specifically, we propose a construction for fractional repetition gradient coding;while ensuring that the generator matrix remains close to perfectly balanced for any set of coding parameters, as well as a low complexity decoding step. The proposed binary encoding avoids operations over the real and complex numbers which inherently introduce numerical and rounding errors, thereby enabling accurate distributed encodings of the partial gradients. We then make connections between gradient coding and coded matrix multiplication. Specifically, we show that any gradient coding scheme can be extended to coded matrix multiplication. Furthermore, we show how the proposed binary gradient coding scheme can be used to construct two different coded matrix multiplication schemes, each achieving different trade-offs. © 1963-2012 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Divergence Maximizing Linear Projection for Supervised Dimension Reduction

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2104-2115页

作者： Chen, Biao Kortje, Joshua Syracuse University Department of Electrical Engineering and Computer Science SyracuseNY13244 United States

This paper proposes two linear projection methods for supervised dimension reduction using only first- and second-order statistics. The methods, each catering to a different parameter regime, are derived under the general Gaussian model by maximizing the Kullback-Leibler divergence between the two classes in the projected sample for a binary classification problem. They subsume existing linear projection approaches developed under simplifying assumptions of Gaussian distributions, such as these distributions might share an equal mean or covariance matrix. As a by-product, we establish that the multi-class linear discriminant analysis, a celebrated method for classification and supervised dimension reduction, is provably optimal for maximizing pairwise Kullback-Leibler divergence when the Gaussian populations share an identical covariance matrix. For the case when the Gaussian distributions share an equal mean, we establish conditions under which the optimal subspace remains invariant regardless of how the Kullback-Leibler divergence is defined, despite the asymmetry of the divergence measure itself. Such conditions encompass the classical case of signal plus noise, where both signal and noise have zero mean and arbitrary covariance matrices. Experiments are conducted to validate the proposed solutions, demonstrate their superior performance over existing alternatives, and illustrate the procedure for selecting the appropriate linear projection solution. © 1963-2012 IEEE.

关键词： Discriminant analysis

来源：评论

学校读者我要写书评

暂无评论

On Shaping Gain of Multidimensional Constellation in Linear and Nonlinear Optical Fiber Channel

引用

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

作者： Chen, Bin Liang, Zhiwei Lei, Yi Deng, JingXin Li, Shen Liga, Gabriele Hefei University of Technology School of Computer Science and Information Engineering Hefei China Chalmers University of Technology Department of Electrical Engineering Gothenburg Sweden Department of Electrical and Computer Engineering Québec Canada Eindhoven University of Technology Department of Electrical Engineering Eindhoven Netherlands

Utilizing the multi-dimensional (MD) space for constellation shaping has been proven to be an effective approach for achieving shaping gains. Despite there exists a variety of MD modulation formats tailored for specific optical transmission scenarios, there remains a notable absence of a dependable comparison method for efficiently and promptly re-evaluating their performance in arbitrary transmission systems. In this paper, we introduce an analytical nonlinear interference (NLI) power model-based shaping gain estimation method to enable a fast performance evaluation of various MD modulation formats in coherent dual-polarization (DP) optical transmission system. In order to extend the applicability of this method to a broader set of modulation formats, we extend the established NLI model to take the 4D joint distribution into account and thus able to analyze the complex interactions of non-iid signaling in DP systems. With the help of the NLI model, we conduct a comprehensive analysis of the state-of-the-art modulation formats and investigate their actual shaping gains in two types of optical fiber communication scenarios (multi-span and single-span). The numerical simulation shows that for arbitrary modulation formats, the NLI power and relative shaping gains in terms of signal-to-noise ratio can be more accurately estimated by capturing the statistics of MD symbols. Furthermore, the proposed method further validates the effectiveness of the reported NLI-tolerant modulation format in the literature, which reveals that the linear shaping gains and modulation-dependent NLI should be jointly considered for nonlinearity mitigation. © 1983-2012 IEEE.

关键词： Optical fibers

来源：评论

学校读者我要写书评

暂无评论

Orbit-Orbit Interaction in Spatiotemporal Optical Vortex

引用

engineering 2025年第2期45卷 44-51页

作者： Jian Chen Jie Zhao Xi Shen Dewei Mo Cheng-Wei Qiu Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China Department of Electrical and Computer Engineering National University of SingaporeSingapore 117583Singapore

While spin-orbit interaction has been extensively studied,few investigations have reported on the interaction between orbital angular momenta(OAMs).In this work,we study a new type of orbit-orbit coupling between the longitudinal OAM and the transverse OAM carried by a three-dimensional(3D)spatiotemporal optical vortex(STOV)in the process of tight *** 3D STOV possesses orthogonal OAMs in the x-y,t-x,and y-t planes,and is preconditioned to overcome the spatiotemporal astigmatism effect.x,y,and t are the axes in the spatiotemporal *** corresponding focused wavepacket is calculated by employing the Debye diffraction theory,showing that a phase singularity ring is generated by the interactions among the transverse and longitudinal vortices in the highly confined *** Fourier-transform decomposition of the Debye integral is employed to analyze the mechanism of the orbit-orbit *** is the first revelation of coupling between the longitudinal OAM and the transverse OAM,paving the way for potential applications in optical trapping,laser machining,nonlinear light-matter interactions,and more.

关键词： Spatiotemporal optical vortex Orbital angular momentum Momentum interaction Highly confined wavepacket Diffraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：