期刊文献+
共找到59,846篇文章
< 1 2 250 >
每页显示 20 50 100
Study on the aided PC-ASCL decoding algorithm based on optimized parity check codes 认领 引用
1
作者 Jianguo YUAN Deyi YANG +1 位作者 Ziliang ZHU Jinneng XIANG 《Optoelectronics Letters》 EI 2026年第2期87-91,共5页
Aiming at the poor performance of the parity check(PC) aided adaptive successive cancellation list(PC-ASCL) decoding algorithm because the PC code in the polar code can only verify odd errors, an optimized parity chec... Aiming at the poor performance of the parity check(PC) aided adaptive successive cancellation list(PC-ASCL) decoding algorithm because the PC code in the polar code can only verify odd errors, an optimized parity check(OPC) code which can verify all odd errors as well as the half even errors is proposed. The OPC code is used to improve the PC-ASCL decoding algorithm, thus an OPC aided ASCL(OPC-ASCL) decoding algorithm is proposed. In the coding stage, the algorithm divides the information sequence into multiple segments, and places an OPC code at the end of each segment to verify the current information sequence, and places a cyclic redundancy check code at the end of the entire information sequence to verify the entire information sequence. In the decoding stage, the algorithm uses the OPC-ASCL decoder to decode. Simulation results show that compared to the PC-ASCL decoding algorithm, the OPC-ASCL decoding algorithm can reduce the complexity and obtain the certain performance gain. 展开更多
关键词 pc ascl decoding pc code adaptive successive cancellation list pc ascl divides information sequence multip parity check polar code optimized parity check coding stage
暂未订购 下载PDF
Quantum toric code decoding method based on syndrome-preliminary error fusion module and ResNet architecture 认领 引用
2
作者 Nai-Hua Ji Ping-Li Song +2 位作者 Wei Wang Hui-Qian Sun Hong-Yang Ma 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第6期649-659,共11页
Quantum error correction technology is based on the principle of redundant encoding,encoding logical quantum information into multiple physical qubits to provide important support for the stable operation of quantum c... Quantum error correction technology is based on the principle of redundant encoding,encoding logical quantum information into multiple physical qubits to provide important support for the stable operation of quantum computers.To address the issues of low decoding accuracy and limited feature extraction in quantum error correction,this paper proposes a toric code decoder based on a syndrome-preliminary error fusion module(SPEFM)and a ResNet architecture.This decoder takes full advantage of the correlations between X and Z errors.In the SPEFM,the syndrome and preliminary error predictions are deeply fused,while a unidirectional Swin transformer architecture is incorporated to extract global error features from the syndrome data,signiffiificantly improving both decoding accuracy and computational efffiificiency.In addition,this paper further extracts local error features from the fused features using the deep residual structure of ResNet,enhancing the decoder's ability to capture quantum error patterns.Experimental results show that the decoder is applicable to different code distances(d=4,6,8,10)under the depolarizing noise model.Its bit error rate is lower than that of the minimum weight perfect matching(MWPM)algorithm,and its logical error rate is lower than both the MWPM algorithm and the ResNet18 decoder.Furthermore,the decoding threshold is increased to 0.163,representing a 3.82%improvement over the MWPM algorithm threshold of 0.157. 展开更多
关键词 quantum error correction toric code ResNet Swin transformer
暂未订购 下载PDF
Two Bit-Serial Architectures for Check Node Update in Min-Sum Decoding of LDPC Codes 认领 引用
3
作者 Hu Qing He Xuan +2 位作者 Luo Lisha Cai Kui Tang Xiaohu 《China Communications》 SCIE EI CSCD 2026年第3期142-150,共9页
Implementing check node(CN)update based on the minimum value(MV)and second MV of incoming message magnitudes is crucial for Min-Sum Algorithms(MSAs).In the category of bit-serial implementations,existing schemes suffe... Implementing check node(CN)update based on the minimum value(MV)and second MV of incoming message magnitudes is crucial for Min-Sum Algorithms(MSAs).In the category of bit-serial implementations,existing schemes suffer from decoding performance degradation,large hardware areas,and/or long latency.In this paper,we propose two efficient CN update functions based on the MV and an approximate second MV,and design bit-serial architectures to implement them.Simulation results show that our functions exhibit the minimum decoding performance degradation compared to the existing functions using approximate second MVs.Moreover,the applicationspecific integrated circuits(ASIC)implementation results demonstrate the advantages of our architectures in terms of area,latency,etc. 展开更多
关键词 bit-serial check node update hardware implementation LDPC code min-sum algorithm
暂未订购 下载PDF
Multi-Attempt List Decoding of Polar Codes 认领 引用
4
作者 Yuan Peihong Chen Zhe +1 位作者 Wu Yongpeng Gao Yue 《China Communications》 SCIE EI CSCD 2026年第4期27-36,共10页
In this work,we propose a multi-attempt successive cancellation list(MA-SCL)decoder for polar codes that achieves identical error-correction performance to standard SCL decoding while reducing average complexity.Unlik... In this work,we propose a multi-attempt successive cancellation list(MA-SCL)decoder for polar codes that achieves identical error-correction performance to standard SCL decoding while reducing average complexity.Unlike CRC-aided SCL,the proposed MA-SCL progressively restarts decoding with increasing list sizes and reuses information from previous attempts.This design eliminates the need for outer CRC codes.The decoder features dynamic searchspace pruning and an early stopping criterion based on path metrics.Simulations show MA-SCL matches SCL performance with lower average complexity,particularly for short polar-like codes with reed-muller(RM)rate profiles and dynamic frozen constraints.Compared to existing adaptive decoders,MA-SCL offers implementation advantages by eliminating the need for stack-/heap management while providing relatively stable latency bounds(1×to|Λ|×SCL latency). 展开更多
关键词 complexity-adaptive decoding list decoding polar coding
暂未订购 下载PDF
Adaptive Coding and Modulation Using Enhanced Turbo Codes for Meteor Burst Communication 认领 引用
5
作者 Ding Mengchuan Li Zhiyong +1 位作者 Wang Wei Li Xuekun 《China Communications》 SCIE EI CSCD 2026年第5期1-14,共14页
Meteor burst channels(MBC)exhibit significant randomness and non-stationarity,limiting the effectiveness of traditional fixed-rate transmission strategies.This paper proposes an adaptive coding and modulation(ACM)sche... Meteor burst channels(MBC)exhibit significant randomness and non-stationarity,limiting the effectiveness of traditional fixed-rate transmission strategies.This paper proposes an adaptive coding and modulation(ACM)scheme based on real-time channel state perception using enhanced Turbo codes.By leveraging the interleaving structure of Turbo codes to mitigate channel fading and incorporating multi-rate adaptation,the scheme dynamically adjusts symbol rate,modulation,and coding methods to improve spectral efficiency.Meanwhile,a joint evaluation mechanism integrating physical-layer signal to noise ratio(SNR)estimation and media access control(MAC)-layer frame error rate(FER)statistics is introduced to achieve dynamic optimization of switching thresholds in multipath channels.Simulation and experimental results demonstrate that the proposed scheme significantly enhances system adaptability to MBC,and increases data transmission success rates,offering a more efficient and reliable solution for MBC systems. 展开更多
关键词 ACM enhanced turbo codes MAC-layer meteor burst channels
暂未订购 下载PDF
Computation-Efficient Decoding of LDPC Codes for High-Speed Space Laser Communications 认领 引用
6
作者 Hu Zhuojun Chen Zhao +1 位作者 Kuang Linling Yin Liuguo 《China Communications》 SCIE EI CSCD 2025年第12期108-123,共16页
Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementa... Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementation of low-density paritycheck(LDPC)decoding under resource-restricted space platforms.Particularly,due to the supply restriction and cost issues of high-speed on-board devices such as analog-to-digital converters(ADCs),the input of LDPC decoding will be usually constrained by hard-decision channel output.To tackle this challenge,density-evolution-based theoretical analysis is firstly performed to identify the cause of performance degradation in the conventional binaryinitialized iterative decoding(BIID)algorithm.Then,a computation-efficient decoding algorithm named multiary-initialized iterative decoding with early termination(MIID-ET)is proposed,which improves the error-correcting performance and computation efficiency by using a reliability-based initialization method and a threshold-based decoding termination rule.Finally,numerical simulations are conducted on example codes of rates 7/8 and 1/2 to evaluate the performance of different LDPC decoding algorithms,where the proposed MIID-ET outperforms the BIID with a coding gain of 0.38 dB and variable node calculation saving of 37%.With this advantage,the proposed MIID-ET can notably reduce LDPC decoder’s hardware implementation complexity under the same bit error rate performance,which successfully doubles the total throughput to 10 Gbps on a single-chip FPGA. 展开更多
关键词 computation-efficient decoding highspeed decoders LDPC codes LLR initialization space laser communications
暂未订购 下载PDF
Low Complexity Successive Cancellation List Decoding of U-UV Codes 认领 引用
7
作者 Chen Wenhao Chen Li +1 位作者 Lin Jingyu Zhang Huazi 《China Communications》 SCIE EI CSCD 2025年第1期41-60,共20页
Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-med... Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length regime.However,this list decoding complexity becomes formidable as the decoding output list size increases.This is primarily incurred by the OSD.Addressing this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding paths.For the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword candidate.It is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code decoding.Moreover,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV codes.In particular,its integration with the improved OSD and BMA is discussed.Simulation results show that significant complexity reduction can be achieved.Consequently,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity. 展开更多
关键词 ordered statistics decoding successive cancellation list decoding U-UV codes
暂未订购 下载PDF
Neural network-based decoding for bias-tailored quantum codes over quantum channels with asymmetric noise 认领 引用
8
作者 Jihao Fan Qianhui Zhang +1 位作者 Zhihua Zhang Jun Li 《Communications in Theoretical Physics》 SCIE CAS CSCD 2025年第12期32-42,共11页
To improve the decoding performance of quantum error-correcting codes in asymmetric noise channels,a neural network-based decoding algorithm for bias-tailored quantum codes is proposed.The algorithm consists of a bias... To improve the decoding performance of quantum error-correcting codes in asymmetric noise channels,a neural network-based decoding algorithm for bias-tailored quantum codes is proposed.The algorithm consists of a biased noise model,a neural belief propagation decoder,a convolutional optimization layer,and a multi-objective loss function.The biased noise model simulates asymmetric error generation,providing a training dataset for decoding.The neural network,leveraging dynamic weight learning and a multi-objective loss function,mitigates error degeneracy.Additionally,the convolutional optimization layer enhances early-stage convergence efficiency.Numerical results show that for bias-tailored quantum codes,our decoder performs much better than the belief propagation(BP)with ordered statistics decoding(BP+OSD).Our decoder achieves an order of magnitude improvement in the error suppression compared to higher-order BP+OSD.Furthermore,the decoding threshold of our decoder for surface codes reaches a high threshold of 20%. 展开更多
关键词 quantum error correction quantum channels asymmetric noise neural networkbased decoding bias-tailored quantum codes
暂未订购 下载PDF
Partial-measurement-enhanced high-dimensional superdense coding in amplitude damping channel with memory 认领 引用
9
作者 Xing Xiao Zhipeng Yang +2 位作者 Yan-Ling Li Fangqing Tang Tian-Xiang Lu 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第4期109-120,共12页
We study the performance of high-dimensional superdense coding(HD-SDC)over an amplitude damping(AD)channel with memory and propose a protocol that leverages partial measurement and its reversal to enhance the channel ... We study the performance of high-dimensional superdense coding(HD-SDC)over an amplitude damping(AD)channel with memory and propose a protocol that leverages partial measurement and its reversal to enhance the channel capacity.By considering a two-qutrit system,we model the memory AD noise using a convex mixture of memoryless and perfectly memory AD channels.We demonstrate that the memory effect alone can mitigate the decay of the SDC capacity under noise.More significantly,we show that the application of partial measurement before the channel and its reversal after the channel can not only recover the capacity degraded by noise but,for certain non-maximally entangled initial states,even amplify it beyond the initial capacity.This amplification effect is governed by three key factors:the ground-state probability in the initial entangled state,the memory strength,and the partial measurement strength.Our results provide a practical strategy for enhancing quantum communication protocols in realistic noisy environments and highlight the synergistic benefits of memory noise and measurement-based control. 展开更多
关键词 high-dimensional systems superdense coding memory noise partial measurement
暂未订购 下载PDF
The gap between principle and practice of lossy image coding 认领 引用
10
作者 Haotian Zhang Dong Liu 《Journal of University of Science and Technology of China》 CAS CSCD 北大核心 2026年第1期1-12,I0001,共12页
Lossy image coding is the art of computing that is principally bounded by the image’s rate-distortion function.This bound,though never accurately characterized,has been approached practically via deep learning techno... Lossy image coding is the art of computing that is principally bounded by the image’s rate-distortion function.This bound,though never accurately characterized,has been approached practically via deep learning technologies in recent years.Indeed,learned image coding schemes allow direct optimization of the joint rate-distortion cost,thereby outperforming the handcrafted image coding schemes by a large margin.Still,it is observed that there is room for further improvement in the rate-distortion performance of learned image coding.In this article,we identify the gap between the ideal rate-distortion function forecasted by Shannon’s information theory and the empirical rate-distortion function achieved by the state-of-the-art learned image coding schemes,revealing that the gap is incurred by five different effects:modeling effect,approximation effect,amortization effect,digitization effect,and asymptotic effect.We design simulations and experiments to quantitatively evaluate the last three effects,which demonstrates the high potential of future lossy image coding technologies. 展开更多
关键词 information theory learned image coding lossy image coding rate-distortion function
暂未订购 下载PDF
Improving MCUCN code to simulate ultracold neutron storage and transportation in superfluid4He 认领 引用
11
作者 Xue-Fen Han Fei Shen +6 位作者 Bin Zhou Xiao-Xiao Cai Tian-Cheng Yi Zhi-Liang Hu Song-Lin Wang Tian-Jiao Liang Robert Golub 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2026年第3期235-246,共12页
The ultracold neutron(UCN)transport code,MCUCN,designed initially for simulating UCN transportation from a solid deuterium(SD_2)source and neutron electric dipole moment experiments,could not simulate UCN storage and ... The ultracold neutron(UCN)transport code,MCUCN,designed initially for simulating UCN transportation from a solid deuterium(SD_2)source and neutron electric dipole moment experiments,could not simulate UCN storage and transportation in a superfluid4He(SFHe,He-Ⅱ)source accurately.This limitation arose from the absence of an4He upscattering mechanism and the absorption of3He.And the provided source energy distribution in MCUCN is different from that in SFHe source.This study introduced enhancements to MCUCN to address these constraints,explicitly incorporating the4He upscattering effect,the absorption of3He,the loss caused by impurities on converter wall,UCN source energy distribution in SFHe,and the transmission through negative optical potential.Additionally,a Python-based visualization code for intermediate states and results was developed.To validate these enhancements,we systematically compared the simulation results of the Lujan Center Mark3 UCN system by MCUCN and the improved MCUCN code(iMCUCN)with UCNtransport simulations.Additionally,we compared the results of the SUN1 system simulated by MCUCN and iMCUCN with measurement results.The study demonstrates that iMCUCN effectively simulates the storage and transportation of ultracold neutrons in He-Ⅱ. 展开更多
关键词 Ultracold neutron Storage Transportation Improved MCUCN code Upscattering effect Absorption by3He
暂未订购 下载PDF
Reliability-Based Code Calibration of Pultruded Glass Fibre-Reinforced Polymer I-Section Beams Under End-Two-Flange and Interior-Two-Flange Web-Crippling Loading Cases 认领 引用
12
作者 Andre Dias Martins Ângelo Palos Teixeira +1 位作者 Nuno Silvestre João Ramôa Correia 《Engineering》 SCIE EI CSCD 2026年第6期211-230,共20页
This paper presents a reliability-based code calibration procedure aimed at determining optimal partial safety factors to be employed in design rules for pultruded glass fibre-reinforced polymer(pGFRP)I-section beams,... This paper presents a reliability-based code calibration procedure aimed at determining optimal partial safety factors to be employed in design rules for pultruded glass fibre-reinforced polymer(pGFRP)I-section beams,susceptible to web-crippling,namely under end-two-flange(ETF)and interior-two-flange(ITF)loading cases with unfastened flanges.Following a comprehensive state-of-the-art literature overview regarding web-crippling of pGFRP beams,the description of a direct strength method(DSM)-based resistance model for the two web-crippling loading cases is presented.Next,attention is turned to the detailed description of the(structural)reliability-based code calibration procedure for both loading cases.This includes detailing all the necessary steps and pertinent data,encompassing the adopted probabilistic models for material prop-erties,loads,geometrical dimensions,and resistance model uncertainty.Then,the results obtained through the application of the code calibration procedure are presented,validated,and discussed.Lastly,the paper closes by presenting relevant concluding remarks,which include recommendations for the partial safety fac-tors to be applied in the resistance model for pGFRP I-beams under ETF and ITF loading cases. 展开更多
关键词 Pultruded glass fibre-reinforced polymers Web-crippling End-two-flange Interior-two-flange Structural safety Reliability-based code calibration Partial safety factors
暂未订购 下载PDF
Cognitive Erasure-Coded Data Update and Repair for Mitigating I/O Overhead 认领 引用
13
作者 Bing Wei Ming Zhong +2 位作者 Qian Chen Yi Wu Yubin Li 《Computers, Materials & Continua》 SCIE EI 2026年第2期1706-1725,共20页
In erasure-coded storage systems,updating data requires parity maintenance,which often leads to significant I/O amplification due to“write-after-read”operations.Furthermore,scattered parity placement increases disk ... In erasure-coded storage systems,updating data requires parity maintenance,which often leads to significant I/O amplification due to“write-after-read”operations.Furthermore,scattered parity placement increases disk seek overhead during repair,resulting in degraded system performance.To address these challenges,this paper proposes a Cognitive Update and Repair Method(CURM)that leverages machine learning to classify files into writeonly,read-only,and read-write categories,enabling tailored update and repair strategies.For write-only and read-write files,CURM employs a data-differencemechanism combined with fine-grained I/O scheduling to minimize redundant read operations and mitigate I/O amplification.For read-write files,CURM further reserves adjacent disk space near parity blocks,supporting parallel reads and reducing disk seek overhead during repair.We implement CURM in a prototype system,Cognitive Update and Repair File System(CURFS),and conduct extensive experiments using realworld Network File System(NFS)and Microsoft Research(MSR)workloads on a 25-node cluster.Experimental results demonstrate that CURMimproves data update throughput by up to 82.52%,reduces recovery time by up to 47.47%,and decreases long-term storage overhead by more than 15% compared to state-of-the-art methods including Full Logging(FL),ParityLogging(PL),ParityLoggingwithReservedspace(PLR),andPARIX.These results validate the effectiveness of CURM in enhancing both update and repair performance,providing a scalable and efficient solution for large-scale erasure-coded storage systems. 展开更多
关键词 Erasure coding machine learning cognitive update and repair I/O amplification mitigation seekefficient recovery
暂未订购 下载PDF
Erratum:“Data-driven Simulations of Magnetic Field Evolution in Active Region 11429:Magneto-frictional Method Using PENCIL CODE”(2024,RAA,24,025007) 认领 引用
14
作者 P.Vemareddy Jön Warnecke Ph.A.Bourdin 《Research in Astronomy and Astrophysics》 SCIE CAS CSCD 2026年第3期293-293,共1页
On page 6,Figure 3 is a duplicate of Figure 4.We publish below the correct figure,sincerely apologizing to the authors.
关键词 magnetic field evolution magneto frictional method pencil code erratum figure duplication apology active region
暂未订购 下载PDF
Shortened PAC Codes and List Decoding 认领 引用 被引量:1
15
作者 LIU Aolin FENG Bowen +2 位作者 LIANG Chulong XU Jin ZHANG Qinyu 《ZTE Communications》 2025年第4期86-96,共11页
Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also req... Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also require rate-matching.To this end,we first analyze the limitations of existing shortening patterns for PAC codes and explore their feasibility.Subsequently,we propose a novel shortening scheme for PAC codes based on list decoding,where the receiver is allowed to treat the values of the deleted bits as undetermined.This ap⁃proach uses a specialized PAC codeword and activates multiple decoding paths during the initialization of list decoding,enabling it to achieve the desired reliability. 展开更多
关键词 polarization-adjusted convolutional codes rate-matching shortened codes list decoding
暂未订购 下载PDF
Genomic insights into the survival code of karst plants 认领 引用
16
作者 Xiongfang Liu Yongpeng Ma 《Plant Diversity》 SCIE CAS CSCD 2026年第2期227-230,共4页
Karst landscapes are developed on soluble rocks(primarily limestone),covering about 10-15%of Earth’s ice-free land surface(Ford and Williams,2007).Their unique geological properties have given rise to complex,heterog... Karst landscapes are developed on soluble rocks(primarily limestone),covering about 10-15%of Earth’s ice-free land surface(Ford and Williams,2007).Their unique geological properties have given rise to complex,heterogeneous,and“island-like”habitats that,combined with periodic drought,high calcium,and lownutrient stresses,foster high species diversity and endemism(Clements et al.,2006;Hao et al.,2015;Oliver et al.,2017;Monro et al.,2018).These conditions make karst ecosystems ideal“natural laboratories”for studying speciation and adaptive evolution(Clements et al.,2006;Oliver et al.,2017). 展开更多
关键词 soluble rocks soluble rocks primarily karst ecosystems genomic insights survival code karst plants limestone ice free land surface
暂未订购 下载PDF
基于Vibe Coding的计算机程序设计课程改革 认领 引用
17
作者 许玉龙 朱红磊 宋婷 《数字通信世界》 2026年第5期241-243,共3页
人工智能融入软件开发,传统计算机程序设计课程难以适配新时代人才培养需求。Vibe Coding以氛围、心流体验为基础,强调人机协同、思维与实践融合。本文阐释其内涵价值,提出改革策略与保障措施,以提升学生多种能力,培育适配时代的应用型... 人工智能融入软件开发,传统计算机程序设计课程难以适配新时代人才培养需求。Vibe Coding以氛围、心流体验为基础,强调人机协同、思维与实践融合。本文阐释其内涵价值,提出改革策略与保障措施,以提升学生多种能力,培育适配时代的应用型人才。 展开更多
关键词 Vibe Coding 心流开发 计算机程序设计 课程改革 计算思维
暂未订购 下载PDF
An empirical study on cross-phase code modification behaviors in incremental programming projects 认领 引用
18
作者 Jing Jiang Chenhong Ji +1 位作者 Li Zhang Haiyan Yang 《计算机教育》 2026年第6期280-291,共12页
This paper conducts an empirical study on students'code modification behaviors in incremental programming projects by analyzing 40771 code submissions from 371 students through abstract syntax tree(AST)difference ... This paper conducts an empirical study on students'code modification behaviors in incremental programming projects by analyzing 40771 code submissions from 371 students through abstract syntax tree(AST)difference analysis and manual annotation.The study investigates the distribution of code modification types to prior-phase code during iterative development,identifies cross-phase error types,and analyzes refactoring strategies.The findings reveal that error correction and code refactoring constitute the primary types of cross-phase code modifications.Among cross-phase latent errors,special case neglect represents the dominant error type,indicating insufficient coverage of special scenarios in existing test suites.Variable renaming emerges as the most prevalent refactoring behavior,reflecting students'emphasis on code readability.These research findings provide empirical evidence for optimizing incremental curriculum design,improving test cases,and cultivating students'code maintenance capabilities in programming education. 展开更多
关键词 Incremental projects Code modification Error correction Code refactoring Computer science education
暂未订购 下载PDF
Methods,Algorithms,Codes,and Software for Theoretical and Computational Chemistry 认领 引用
19
作者 Bin Jiang 《Chinese Journal of Chemical Physics》 SCIE EI CAS CSCD 2026年第3期301-302,共2页
Theoretical and computational chemistry has profoundly impacted a wide range of disciplines,from chemistry and physics to biology and materials science.In recent years,remarkable advances in electronic structure theor... Theoretical and computational chemistry has profoundly impacted a wide range of disciplines,from chemistry and physics to biology and materials science.In recent years,remarkable advances in electronic structure theory,molecular dynamics,and machine learning methods——coupled with increasingly powerful algorithms and software—have equipped chemists with an unprecedented arsenal of tools to tackle complex chemical problems. 展开更多
关键词 theoretical computational chemistry electronic structure theorymolecular dynamicsand algorithms codes software methods materials sciencein theoretical chemistry
暂未订购 下载PDF
CoDefense:面向对抗性攻击的多粒度代码归一化防御方法 认领 引用
20
作者 田朝 邝仕琦 +2 位作者 闫明 王海弛 陈俊洁 《软件学报》 EI CSCD 北大核心 2026年第3期1170-1196,共27页
近年来,以代码为输入的预训练模型在许多基于代码的关键任务中取得了显著的性能优势,但这类模型可能容易受到通过保留语义的代码转换实现的对抗性攻击,这种攻击会显著降低模型鲁棒性并可能进一步引发严重的安全问题.尽管已有对抗性训练... 近年来,以代码为输入的预训练模型在许多基于代码的关键任务中取得了显著的性能优势,但这类模型可能容易受到通过保留语义的代码转换实现的对抗性攻击,这种攻击会显著降低模型鲁棒性并可能进一步引发严重的安全问题.尽管已有对抗性训练方法通过生成对抗性样本作为增强数据来提升模型鲁棒性,但其有效性和效率在面对不同粒度和策略的未知对抗性攻击时仍显不足.为了克服这一局限性,提出一种基于代码归一化的预训练代码模型对抗性防御方法CoDefense.该方法的核心思想是作为代码模型的一个前置数据处理模块,通过多粒度代码归一化技术,对训练阶段的原始训练集和推理阶段的代码输入进行归一化预处理,以避免潜在对抗性样本对代码模型的影响.这种策略能够高效地防御不同粒度和策略的对抗性攻击.为验证CoDefense的有效性和效率,针对3种先进的对抗性攻击方法、3种流行的预训练代码模型以及3个基于代码的分类和生成任务,共设计了27个实验场景进行全面的实证研究.实验结果表明,CoDefense相较于最先进的对抗性训练方法,在防御对抗性攻击方面显著提升了有效性和效率.具体而言,CoDefense平均成功防御了95.33%的对抗性攻击.同时,在时间效率上,CoDefense相对于对抗性训练方法平均提升了85.86%. 展开更多
关键词 对抗性防御 预训练代码模型 深度学习
暂未订购 下载PDF
上一页 1 2 250 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈