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.展开更多
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.展开更多
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-Ⅱ.展开更多
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.展开更多
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.展开更多
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).展开更多
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.展开更多
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.展开更多
As artificial Intelligence(AI)continues to expand exponentially,particularly with the emergence of generative pre-trained transformers(GPT)based on a transformer’s architecture,which has revolutionized data processin...As artificial Intelligence(AI)continues to expand exponentially,particularly with the emergence of generative pre-trained transformers(GPT)based on a transformer’s architecture,which has revolutionized data processing and enabled significant improvements in various applications.This document seeks to investigate the security vulnerabilities detection in the source code using a range of large language models(LLM).Our primary objective is to evaluate the effectiveness of Static Application Security Testing(SAST)by applying various techniques such as prompt persona,structure outputs and zero-shot.To the selection of the LLMs(CodeLlama 7B,DeepSeek coder 7B,Gemini 1.5 Flash,Gemini 2.0 Flash,Mistral 7b Instruct,Phi 38b Mini 128K instruct,Qwen 2.5 coder,StartCoder 27B)with comparison and combination with Find Security Bugs.The evaluation method will involve using a selected dataset containing vulnerabilities,and the results to provide insights for different scenarios according to the software criticality(Business critical,non-critical,minimum effort,best effort)In detail,the main objectives of this study are to investigate if large language models outperform or exceed the capabilities of traditional static analysis tools,if the combining LLMs with Static Application Security Testing(SAST)tools lead to an improvement and the possibility that local machine learning models on a normal computer produce reliable results.Summarizing the most important conclusions of the research,it can be said that while it is true that the results have improved depending on the size of the LLM for business-critical software,the best results have been obtained by SAST analysis.This differs in“NonCritical,”“Best Effort,”and“Minimum Effort”scenarios,where the combination of LLM(Gemini)+SAST has obtained better results.展开更多
Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a prom...Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a promising solution due to their outstanding error-correction performance and low complexity.Unequal error protection(UEP)involves nonuniform error safeguarding for distinct data segments,achieving a fine balance between error resilience and resource allocation,which ultimately enhancing system performance and efficiency.In this paper,we propose a novel class of UEP rateless polar codes.The codes are designed based on matrix extension of polar codes,and elegant mapping and duplication operations are designed to achieve UEP property while preserving the overall performance of conventional polar codes.Superior UEP performance is attained without significant modifications to conventional polar codes,making it straightforward for compatibility with existing polar codes.A theoretical analysis is conducted on the block error rate and throughput efficiency performance.To the best of our knowledge,this work provides the first theoretical performance analysis of UEP rateless polar codes.Simulation results show that the proposed codes significantly outperform existing polar coding schemes in both block error rate and throughput efficiency.展开更多
Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successiv...Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successive cancellation(SC)decoding scheme based on the weighted levenshtein distance(WLD)of polar codes for correcting insertions/deletions in DPPM systems.In this method,the WLD is used to calculate the transfer probabilities recursively to obtain likelihood ratios,and the low-complexity SC decoding method is built according to the error characteristics to match the DPPM system.Additionally,the proposed SC decoding scheme is extended to list decoding,which can further improve error correction performance.Simulation results show that the proposed scheme can effectively correct insertions/deletions in the DPPM system,which enhances its reliability and performance.展开更多
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.展开更多
We study the algebraic structures of a generalized class of quasi-cyclic codes of index two,and prove that any quasicyclic code of index two can be transformed into our proposed quasi-cyclic codes.We determine the gen...We study the algebraic structures of a generalized class of quasi-cyclic codes of index two,and prove that any quasicyclic code of index two can be transformed into our proposed quasi-cyclic codes.We determine the generator forms of the proposed quasi-cyclic codes and their Hermitian dual codes.We establish the necessary and sufficient conditions for Hermitian self-orthogonality and dual-containing property to construct quantum stabilizer codes via the Hermitian construction method.As an application,10 record-breaking quantum stabilizer codes are constructed.展开更多
Key parameters of microwave signals,including frequency,phase noise,period,and pulse width,exert a profound influence on the detection performance of radar systems.Optoelectronic oscillators(OEOs)offer the distinct ad...Key parameters of microwave signals,including frequency,phase noise,period,and pulse width,exert a profound influence on the detection performance of radar systems.Optoelectronic oscillators(OEOs)offer the distinct advantage of enabling direct generation of microwave signals with frequency-independent ultra-low phase noise.By integrating external modulation mechanisms,OEOs can further produce signals with more complex waveforms,thereby effectively addressing the demanding requirements of modern radar systems.We propose and demonstrate a method for generating programmable phase-coded microwave signals with tunable duty cycles in an OEO.The approach utilizes simple bias voltage modulation,where a voltage-level-coded signal is injected into the direct-current bias port of the push-pull Mach–Zehnder modulator(MZM)within the OEO loop.Binary phase coding is achieved by exploiting the reverse-phase characteristic of the minimum transmission point of the MZM.The duty cycle of the generated phase-coded microwave signal is adjusted by varying that of the injected signal.Simulations and experiments confirm the generation of microwave signals with excellent phase-coding performance and high spectral coherence.展开更多
DAYU3D is a modern three-dimensional(3D)computer code for thermal-hydraulic design and accident analysis in hightemperature gas-cooled reactors(HTGRs),developed by the Institute of Nuclear and New Energy Technology(IN...DAYU3D is a modern three-dimensional(3D)computer code for thermal-hydraulic design and accident analysis in hightemperature gas-cooled reactors(HTGRs),developed by the Institute of Nuclear and New Energy Technology(INET)at Tsinghua University.Compared to the traditional codes like TINTE,the DAYU3D code has advantages due to its refined framework,improved models,and more efficient algorithms.It is able to simulate the continuous movement of control rods and is more rigorous in treating radiation heat transfer and the break mass flow.Advanced computational methods significantly improve the computational efficiency of DAYU3D,achieving a time reduction of over 60%compared to TINTE.Extensive verification and validation with more than 100 cases demonstrate that DAYU3D is promising for HTGR 3D thermal-hydraulic design and accident analyses.展开更多
Differential Code Bias(DCB)is the time delays between two different GNSS signals,which is crucial for GNSS positioning.Previous studies have shown that it can be significantly affected by the flex power operations in ...Differential Code Bias(DCB)is the time delays between two different GNSS signals,which is crucial for GNSS positioning.Previous studies have shown that it can be significantly affected by the flex power operations in satellites.This study proposes a 15-min short-term DCB estimation method to analyze flex power's impact on DCB variations.The method jointly estimates satellite DCB,receiver DCB,and ionospheric parameters using over 300 MGEX stations.We examined three representative flex power events in 2024,achieving average internal RMS values of 0.042 ns and 0.0068 ns for inter-frequency and intra-frequency scenarios respectively.Results show that intra-frequency DCB exhibits clear shift biases synchronized with flex power state transitions while maintaining stability within 0.20 ns during nontransition periods.No definitive impact on inter-frequency DCB was observed at current estimation precision levels.展开更多
As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated eff...As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated effectiveness in capturing sparse features and complex workflows in large-scale source code,their capacity to extract global semantic information and intricate long-range dependencies remains limited.Recent large language model(LLM)-based approaches have shown promising accuracy by leveraging rich contextual information,but their high computational cost often limits practical efficiency.To address these challenges,we propose VulSCP,a new framework that integrates sequential convolution with a parallel attention mechanism.Specifically,VulSCP first constructs a semantically weighted graph from the source code,then employs sequential convolution to extract local vulnerability-related features,and finally enhances the global feature representation through parallel attention.Experimental results on large-scale C/C++function-level datasets show that VulSCP achieves an accuracy of 85.14%and a false positive rate of 17.25%,outperforming the best baseline in accuracy by 1.73 percentage points and reducing the false positive rate by 3.38 percentage points.Moreover,while maintaining high detection accuracy,VulSCP achieves a low average inference time of 1.89 s per sample,showing favorable efficiency compared with the evaluated LLM-based methods.These results suggest that VulSCP is a promising approach for vulnerability detection in large and complex software systems,offering a favorable balance between accuracy and efficiency.The source code of VulSCP is publicly available at http://gffzz188fe103f8f1460asbqnk96fwo55v6x5c.ffgz.tsg.suse.edu.cn/Hwzx-ZeL/VulSCP.展开更多
LargeLanguageModels(LLMs)are increasingly appliedinthe fieldof code translation.However,existing evaluation methodologies suffer from two major limitations:(1)the high overlap between test data and pretraining corpora...LargeLanguageModels(LLMs)are increasingly appliedinthe fieldof code translation.However,existing evaluation methodologies suffer from two major limitations:(1)the high overlap between test data and pretraining corpora,which introduces significant bias in performance evaluation;and(2)mainstream metrics focus primarily on surface-level accuracy,failing to uncover the underlying factors that constrain model capabilities.To address these issues,this paper presents TCode(Translation-Oriented Code Evaluation benchmark)—a complexity-controllable,contamination-free benchmark dataset for code translation—alongside a dedicated static feature sensitivity evaluation framework.The dataset is carefully designed to control complexity along multiple dimensions—including syntactic nesting and expression intricacy—enabling both broad coverage and fine-grained differentiation of sample difficulty.This design supports precise evaluation of model capabilities across a wide spectrum of translation challenges.The proposed evaluation framework introduces a correlation-driven analysis mechanism based on static program features,enabling predictive modeling of translation success from two perspectives:Code Form Complexity(e.g.,code length and character density)and Semantic Modeling Complexity(e.g.,syntactic depth,control-flow nesting,and type system complexity).Empirical evaluations across representative LLMs—including Qwen2.5-72B and Llama3.3-70B—demonstrate that even state-of-the-art models achieve over 80% compilation success on simple samples,but their accuracy drops sharply below 40% on complex cases.Further correlation analysis indicates that Semantic Modeling Complexity alone is correlated with up to 60% of the variance in translation success,with static program features exhibiting nonlinear threshold effects that highlight clear capability boundaries.This study departs fromthe traditional accuracy-centric evaluation paradigm and,for the first time,systematically characterizes the capabilities of large languagemodels in translation tasks through the lens of programstatic features.The findings provide actionable insights for model refinement and training strategy development.展开更多
基金supported by the National Natural Science Foundation of China(Nos.U21A20447 and 61971079)。
摘要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.
基金supported by the Joint Fund of the Natural Science Foundation of Shandong Province,China(Grant Nos.ZR2022LLZ012 and ZR2021LLZ001)the Key Research and Development Program of Shandong Province,China(Grant No.2023CXGC010901)。
摘要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.
基金the National Key R&D Program of China(No.2024YFE0110001)the National Natural Science Foundation of China(U1932219)the Mobility Programme endorsed by the Joint Committee of the Sino-German Center(M0728)。
摘要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-Ⅱ.
基金the Portuguese Founda-tion for Science and Technology(Fundação para a Ciência e Tec-nologia,FCT)(PTDC/ECI-EGC/3916/2021)for the financial supportsupported by the FCT through projects Laboratory of Energy,Transports and Aerospace(LAETA)Base Funding and LAETA Programatic Funding,Civil Engineering Research and Innovation for Sustainability(CERIS,UIDB/04625/2020)the Centre for Marine Technology and Ocean Engineering(CENTEC,UIDB/UIDP/00134/2020).
摘要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.
基金supported by the National Natural Science Foundation of China(Grant No.62362019)the Natural Science Foundation of Hainan Province(Grant No.624RC482)the Hainan Provincial Higher Education Teaching Reform Research Project(Grant Hnjg2024-27).
摘要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.
基金equally funded by the Joint Funds of the National Natural Science Foundation of China(U2571210)the Strategic Priority Research Program of Kunming Institute of Botany,Chinese Academy of Sciences(KIBXD202401)+2 种基金National Natural Science Foundation of China(32471734)the Yuelushan Laboratory Breeding Projectthe Caiyun Postdoctoral Program of Yunnan Province。
摘要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).
摘要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.
基金supported by the National Natural Science Foundation of China(Nos.62577007 and 92582204)。
摘要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.
摘要As artificial Intelligence(AI)continues to expand exponentially,particularly with the emergence of generative pre-trained transformers(GPT)based on a transformer’s architecture,which has revolutionized data processing and enabled significant improvements in various applications.This document seeks to investigate the security vulnerabilities detection in the source code using a range of large language models(LLM).Our primary objective is to evaluate the effectiveness of Static Application Security Testing(SAST)by applying various techniques such as prompt persona,structure outputs and zero-shot.To the selection of the LLMs(CodeLlama 7B,DeepSeek coder 7B,Gemini 1.5 Flash,Gemini 2.0 Flash,Mistral 7b Instruct,Phi 38b Mini 128K instruct,Qwen 2.5 coder,StartCoder 27B)with comparison and combination with Find Security Bugs.The evaluation method will involve using a selected dataset containing vulnerabilities,and the results to provide insights for different scenarios according to the software criticality(Business critical,non-critical,minimum effort,best effort)In detail,the main objectives of this study are to investigate if large language models outperform or exceed the capabilities of traditional static analysis tools,if the combining LLMs with Static Application Security Testing(SAST)tools lead to an improvement and the possibility that local machine learning models on a normal computer produce reliable results.Summarizing the most important conclusions of the research,it can be said that while it is true that the results have improved depending on the size of the LLM for business-critical software,the best results have been obtained by SAST analysis.This differs in“NonCritical,”“Best Effort,”and“Minimum Effort”scenarios,where the combination of LLM(Gemini)+SAST has obtained better results.
基金supported by National Natural Science Foundation of China(No.62301008)China Postdoctoral Science Foundation(No.2022M720272)New Cornerstone Science Foundation through the XPLORER PRIZE。
摘要Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a promising solution due to their outstanding error-correction performance and low complexity.Unequal error protection(UEP)involves nonuniform error safeguarding for distinct data segments,achieving a fine balance between error resilience and resource allocation,which ultimately enhancing system performance and efficiency.In this paper,we propose a novel class of UEP rateless polar codes.The codes are designed based on matrix extension of polar codes,and elegant mapping and duplication operations are designed to achieve UEP property while preserving the overall performance of conventional polar codes.Superior UEP performance is attained without significant modifications to conventional polar codes,making it straightforward for compatibility with existing polar codes.A theoretical analysis is conducted on the block error rate and throughput efficiency performance.To the best of our knowledge,this work provides the first theoretical performance analysis of UEP rateless polar codes.Simulation results show that the proposed codes significantly outperform existing polar coding schemes in both block error rate and throughput efficiency.
基金supported by National Natural Science Foundation of China(No.61801327).
摘要Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successive cancellation(SC)decoding scheme based on the weighted levenshtein distance(WLD)of polar codes for correcting insertions/deletions in DPPM systems.In this method,the WLD is used to calculate the transfer probabilities recursively to obtain likelihood ratios,and the low-complexity SC decoding method is built according to the error characteristics to match the DPPM system.Additionally,the proposed SC decoding scheme is extended to list decoding,which can further improve error correction performance.Simulation results show that the proposed scheme can effectively correct insertions/deletions in the DPPM system,which enhances its reliability and performance.
基金supported by National Natural Science Foundation of China(NSFC)under Grant 62571455,Grant 62371401,and Grant 62331002supported by the SingaporeMinistry of Education Academic Research Fund Tier 2 T2EP50221-0036.
摘要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.
基金funded by the National Natural Science Foundation of China(Grant No.61372072)the Overseas Expertise Introduction Project for Discipline Innovation(111Project)(Grant No.B08038)the Fundamental Research Funds for the Central Universities。
摘要We study the algebraic structures of a generalized class of quasi-cyclic codes of index two,and prove that any quasicyclic code of index two can be transformed into our proposed quasi-cyclic codes.We determine the generator forms of the proposed quasi-cyclic codes and their Hermitian dual codes.We establish the necessary and sufficient conditions for Hermitian self-orthogonality and dual-containing property to construct quantum stabilizer codes via the Hermitian construction method.As an application,10 record-breaking quantum stabilizer codes are constructed.
基金supported by the National Natural Science Foundation of China(Grant Nos.62175038 and 62105381)the Guangdong Introducing Innovative and Entrepreneurial Teams of“The Pearl River Talent Recruitment Program”(Grant No.2019ZT08X340)。
摘要Key parameters of microwave signals,including frequency,phase noise,period,and pulse width,exert a profound influence on the detection performance of radar systems.Optoelectronic oscillators(OEOs)offer the distinct advantage of enabling direct generation of microwave signals with frequency-independent ultra-low phase noise.By integrating external modulation mechanisms,OEOs can further produce signals with more complex waveforms,thereby effectively addressing the demanding requirements of modern radar systems.We propose and demonstrate a method for generating programmable phase-coded microwave signals with tunable duty cycles in an OEO.The approach utilizes simple bias voltage modulation,where a voltage-level-coded signal is injected into the direct-current bias port of the push-pull Mach–Zehnder modulator(MZM)within the OEO loop.Binary phase coding is achieved by exploiting the reverse-phase characteristic of the minimum transmission point of the MZM.The duty cycle of the generated phase-coded microwave signal is adjusted by varying that of the injected signal.Simulations and experiments confirm the generation of microwave signals with excellent phase-coding performance and high spectral coherence.
摘要DAYU3D is a modern three-dimensional(3D)computer code for thermal-hydraulic design and accident analysis in hightemperature gas-cooled reactors(HTGRs),developed by the Institute of Nuclear and New Energy Technology(INET)at Tsinghua University.Compared to the traditional codes like TINTE,the DAYU3D code has advantages due to its refined framework,improved models,and more efficient algorithms.It is able to simulate the continuous movement of control rods and is more rigorous in treating radiation heat transfer and the break mass flow.Advanced computational methods significantly improve the computational efficiency of DAYU3D,achieving a time reduction of over 60%compared to TINTE.Extensive verification and validation with more than 100 cases demonstrate that DAYU3D is promising for HTGR 3D thermal-hydraulic design and accident analyses.
基金the funds from the Key Laboratory of Smart Earth(KF2023YB01-07)Shanghai Collaborative Innovation Fund(XTCX-KJ-2024-17)the National Natural Science Foundation of China(42388102,62303311,and 62231010)。
摘要Differential Code Bias(DCB)is the time delays between two different GNSS signals,which is crucial for GNSS positioning.Previous studies have shown that it can be significantly affected by the flex power operations in satellites.This study proposes a 15-min short-term DCB estimation method to analyze flex power's impact on DCB variations.The method jointly estimates satellite DCB,receiver DCB,and ionospheric parameters using over 300 MGEX stations.We examined three representative flex power events in 2024,achieving average internal RMS values of 0.042 ns and 0.0068 ns for inter-frequency and intra-frequency scenarios respectively.Results show that intra-frequency DCB exhibits clear shift biases synchronized with flex power state transitions while maintaining stability within 0.20 ns during nontransition periods.No definitive impact on inter-frequency DCB was observed at current estimation precision levels.
基金funded by the Ministry of Public Security of the People’s Republic of China,grant number 2024ZB02(X.Z.).
摘要As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated effectiveness in capturing sparse features and complex workflows in large-scale source code,their capacity to extract global semantic information and intricate long-range dependencies remains limited.Recent large language model(LLM)-based approaches have shown promising accuracy by leveraging rich contextual information,but their high computational cost often limits practical efficiency.To address these challenges,we propose VulSCP,a new framework that integrates sequential convolution with a parallel attention mechanism.Specifically,VulSCP first constructs a semantically weighted graph from the source code,then employs sequential convolution to extract local vulnerability-related features,and finally enhances the global feature representation through parallel attention.Experimental results on large-scale C/C++function-level datasets show that VulSCP achieves an accuracy of 85.14%and a false positive rate of 17.25%,outperforming the best baseline in accuracy by 1.73 percentage points and reducing the false positive rate by 3.38 percentage points.Moreover,while maintaining high detection accuracy,VulSCP achieves a low average inference time of 1.89 s per sample,showing favorable efficiency compared with the evaluated LLM-based methods.These results suggest that VulSCP is a promising approach for vulnerability detection in large and complex software systems,offering a favorable balance between accuracy and efficiency.The source code of VulSCP is publicly available at http://gffzz188fe103f8f1460asbqnk96fwo55v6x5c.ffgz.tsg.suse.edu.cn/Hwzx-ZeL/VulSCP.
摘要LargeLanguageModels(LLMs)are increasingly appliedinthe fieldof code translation.However,existing evaluation methodologies suffer from two major limitations:(1)the high overlap between test data and pretraining corpora,which introduces significant bias in performance evaluation;and(2)mainstream metrics focus primarily on surface-level accuracy,failing to uncover the underlying factors that constrain model capabilities.To address these issues,this paper presents TCode(Translation-Oriented Code Evaluation benchmark)—a complexity-controllable,contamination-free benchmark dataset for code translation—alongside a dedicated static feature sensitivity evaluation framework.The dataset is carefully designed to control complexity along multiple dimensions—including syntactic nesting and expression intricacy—enabling both broad coverage and fine-grained differentiation of sample difficulty.This design supports precise evaluation of model capabilities across a wide spectrum of translation challenges.The proposed evaluation framework introduces a correlation-driven analysis mechanism based on static program features,enabling predictive modeling of translation success from two perspectives:Code Form Complexity(e.g.,code length and character density)and Semantic Modeling Complexity(e.g.,syntactic depth,control-flow nesting,and type system complexity).Empirical evaluations across representative LLMs—including Qwen2.5-72B and Llama3.3-70B—demonstrate that even state-of-the-art models achieve over 80% compilation success on simple samples,but their accuracy drops sharply below 40% on complex cases.Further correlation analysis indicates that Semantic Modeling Complexity alone is correlated with up to 60% of the variance in translation success,with static program features exhibiting nonlinear threshold effects that highlight clear capability boundaries.This study departs fromthe traditional accuracy-centric evaluation paradigm and,for the first time,systematically characterizes the capabilities of large languagemodels in translation tasks through the lens of programstatic features.The findings provide actionable insights for model refinement and training strategy development.