After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algo...After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.展开更多
How to verify that a given fuzzy set A∈F(X *) is a fuzzy code? In this paper, an algorithm of test has been introduced and studied with the example of test. The measure notion for a fuzzy code and a precise form...How to verify that a given fuzzy set A∈F(X *) is a fuzzy code? In this paper, an algorithm of test has been introduced and studied with the example of test. The measure notion for a fuzzy code and a precise formulation of fuzzy codes and words have been discussed. sification:90K20,94D05.展开更多
To solve the problem of the large Doppler frequency offset in the LEO communication system, this paper studies a rapid PN code acquisition method based on the PMF-FFT architecture, which searches the phase and frequen...To solve the problem of the large Doppler frequency offset in the LEO communication system, this paper studies a rapid PN code acquisition method based on the PMF-FFT architecture, which searches the phase and frequency offset and at the same time reduces the acquisition time. It presents an improved method equivalent to windowing function and uses windowing process to overcome the attenuation of related peak envelope caused by partial matched filters.展开更多
Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh ma...Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.展开更多
A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computatio...A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.展开更多
Based on mirror-blocks, a totally coded algorithm （TCA） for switched-current （SI） network analysis in frequency domain is presented. The algorithm is simple, available, and suitable for any swltched-current networ...Based on mirror-blocks, a totally coded algorithm （TCA） for switched-current （SI） network analysis in frequency domain is presented. The algorithm is simple, available, and suitable for any swltched-current networks. A basis of analysis and design for switched-current networks via this algorithm is provided.展开更多
In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical...In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.展开更多
According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the r...According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to cont...Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to control action and a real coded genetic algorithm then proposed to produce a global optimum solution, and proves the feasibility and advantages of this algorithm with the example of a standard test function and a two collocated actuators/sensors cantilever, and comparing the results with those given in the literatures.展开更多
This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there e...This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obtain a linear time integer sorting algorithm. The Prufer code problem is reduced to integer sorting. In this paper we consider the Prufer code problem in a different angle and a more direct manner. We start from a naïve algorithm, then improved it gradually and finally we obtain a very practical linear time algorithm. The techniques we used in this paper are of interest in their own right.展开更多
With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, ne...With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, new antennas should be developed to provide larger bandwidth and at the same time small dimensions. Although the gain in bandwidth performances of an antenna are directly related to its dimensions in relation to the wavelength, the aim is to keep the overall size of the antenna constant and from there, find the geometry and structure that give the best performance. The design and bandwidth optimization of a Planar Inverted-F Antenna (PIFA) were introduced in order to achieve a larger bandwidth in the 2 GHz band, using two optimization techniques based upon genetic algorithms (GA), namely the Binary Coded GA (BCGA) and Real-Coded GA (RCGA). During the optimization process, the different PIFA models were evaluated using the finite-difference time domain (FDTD) method-a technique belonging to the general class of differential time domain numerical modeling methods.展开更多
In this work a new technique for global perceptual codes (GPCs) extraction using genetic algorithms (GA) is presented. GAs are employed to extract the GPCs in order to reduce the original number of features and to pro...In this work a new technique for global perceptual codes (GPCs) extraction using genetic algorithms (GA) is presented. GAs are employed to extract the GPCs in order to reduce the original number of features and to provide meaningful representations of the original data. In this technique the GPCs are build from a certain combination of elementary perceptual codes (EPCs) which are provided by the Beta-elliptic model for the generation of complex handwriting movements. Indeed, in this model each script is modelled by a set of elliptic arcs. We associate to each arc an EPC. In the proposed technique we defined four types of EPCs. The GPCs can be formed by many possible combinations of EPCs depending on their number and types. So that, the problem of choosing the right combination for each GPC can be regarded as a global optimization problem which is treated in this work using the GAs. Several simulation examples are presented to evaluate the interest and the efficiency of the proposed technique.展开更多
Presents the fuzzy neural network optimized by hybrid coded genetic algorithm of decimal encoding and binary encoding, the searching ability and stability of genetic algorithms enhanced by using binary encoding during...Presents the fuzzy neural network optimized by hybrid coded genetic algorithm of decimal encoding and binary encoding, the searching ability and stability of genetic algorithms enhanced by using binary encoding during the crossover operation and decimal encoding during the mutation operation, and the way of accepting new individuals by probability adopted, by which a new individual is accepted and its parent is discarded when its fitness is higher than that of its parent, and a new individual is accepted by probability when its fitness is lower than that of its parent. And concludes with calculations made with an example that these improvements enhance the speed of genetic algorithms to optimize the fuzzy neural network controller.展开更多
In this paper, the main objective is to identify the parameters of motors, which includes a brushless direct current (BLDC) motor and an induction motor. The motor systems are dynamically formulated by the mechanical ...In this paper, the main objective is to identify the parameters of motors, which includes a brushless direct current (BLDC) motor and an induction motor. The motor systems are dynamically formulated by the mechanical and electrical equations. The real-coded genetic algorithm (RGA) is adopted to identify all parameters of motors, and the standard genetic algorithm (SRGA) and various adaptive genetic algorithm (ARGAs) are compared in the rotational angular speeds and fitness values, which are the inverse of square differences of angular speeds. From numerical simulations and experimental results, it is found that the SRGA and ARGA are feasible, the ARGA can effectively solve the problems with slow convergent speed and premature phenomenon, and is more accurate in identifying system’s parameters than the SRGA. From the comparisons of the ARGAs in identifying parameters of motors, the best ARGA method is obtained and could be applied to any other mechatronic systems.展开更多
Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances for solving large optimization problems. This article proposes a new decoder based on Seri...Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances for solving large optimization problems. This article proposes a new decoder based on Serial Genetic Algorithm Decoder (SGAD) for decoding Low Density Parity Check (LDPC) codes. The results show that the proposed algorithm gives large gains over sum-product decoder, which proves its efficiency.展开更多
Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memor...Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.展开更多
目的:为了提升乳腺超声肿物的分类性能,基于大型语言模型对乳腺超声肿物分类算法进行优化。方法:首先,选取乳腺超声数据集(BrEaST,v1.0)中252例患者的乳腺超声文字描述(恶性98例,良性154例),基于乳腺成像报告和数据系统(Breast Imaging ...目的:为了提升乳腺超声肿物的分类性能,基于大型语言模型对乳腺超声肿物分类算法进行优化。方法:首先,选取乳腺超声数据集(BrEaST,v1.0)中252例患者的乳腺超声文字描述(恶性98例,良性154例),基于乳腺成像报告和数据系统(Breast Imaging Reporting and Data System,BI-RADS)指南选取乳腺组织成分、皮肤增厚、肿物形态、后方回声、边界、声晕、回声强度和钙化8项特征,并将252例样本按7∶3的比例划分为训练集与测试集。以大型语言模型(ChatGPT 5.1 Thinking)自动生成Python代码,系统部署3种算法:将预设超参数的随机森林作为算法1,并作为基线算法;将预设超参数的随机森林结合针对名义变量的合成少数类过采样技术(synthetic minority oversampling technique for nominal,SMOTEN)作为算法2;将利用随机搜索调优的随机森林作为算法3。以病理良恶性为金标准,采用Friedman检验比较3种算法的总体差异,采用Nemenyi检验比较3种算法间的两两差异。通过人工编程对3种算法进行复现,采用Bootstrap自助法对测试集进行1000次重采样,比较人工编程实现的算法和大型语言模型实现的算法的性能指标差异。结果:Friedman检验结果表明,算法3在准确度(0.848)、敏感度(0.912)、F1分数(0.823)、AUC(0.895)4项评价指标中均为最优,3种算法的准确度、敏感度、F1分数、AUC比较差异均有统计学意义(P<0.05),3种算法的特异度比较差异无统计学意义(P>0.05)。Nemenyi检验结果表明,算法3的准确度、敏感度、F1分数、AUC均优于算法1和算法2,差异有统计学意义(P<0.05),算法1和算法2各项指标比较差异均无统计学意义(P>0.05)。大型语言模型生成代码实现的算法与人工编程实现的算法在各项性能指标上均表现出高度一致性,各项性能指标比较差异均无统计学意义(P>0.05)。结论:大型语言模型可以提升乳腺超声肿物分类算法的性能,为临床医师的诊断和治疗提供了参考。展开更多
文摘After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.
基金Supported by National Natural Science Foundation of China(6980 30 0 7)
文摘How to verify that a given fuzzy set A∈F(X *) is a fuzzy code? In this paper, an algorithm of test has been introduced and studied with the example of test. The measure notion for a fuzzy code and a precise formulation of fuzzy codes and words have been discussed. sification:90K20,94D05.
文摘To solve the problem of the large Doppler frequency offset in the LEO communication system, this paper studies a rapid PN code acquisition method based on the PMF-FFT architecture, which searches the phase and frequency offset and at the same time reduces the acquisition time. It presents an improved method equivalent to windowing function and uses windowing process to overcome the attenuation of related peak envelope caused by partial matched filters.
基金supported by the National Natural Science Foundation of China(61371099)the Fundamental Research Funds for the Central Universities of China(HEUCF150812/150810)
文摘Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.
文摘A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.
文摘Based on mirror-blocks, a totally coded algorithm （TCA） for switched-current （SI） network analysis in frequency domain is presented. The algorithm is simple, available, and suitable for any swltched-current networks. A basis of analysis and design for switched-current networks via this algorithm is provided.
文摘In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.
基金supported by the National Natural Science Foundation of China(61102130)the Innovative Program of the Academy of Opto-Electtronics,Chinese Academy of Sciences(Y12414A01Y)
文摘According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
文摘Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to control action and a real coded genetic algorithm then proposed to produce a global optimum solution, and proves the feasibility and advantages of this algorithm with the example of a standard test function and a two collocated actuators/sensors cantilever, and comparing the results with those given in the literatures.
文摘This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obtain a linear time integer sorting algorithm. The Prufer code problem is reduced to integer sorting. In this paper we consider the Prufer code problem in a different angle and a more direct manner. We start from a naïve algorithm, then improved it gradually and finally we obtain a very practical linear time algorithm. The techniques we used in this paper are of interest in their own right.
文摘With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, new antennas should be developed to provide larger bandwidth and at the same time small dimensions. Although the gain in bandwidth performances of an antenna are directly related to its dimensions in relation to the wavelength, the aim is to keep the overall size of the antenna constant and from there, find the geometry and structure that give the best performance. The design and bandwidth optimization of a Planar Inverted-F Antenna (PIFA) were introduced in order to achieve a larger bandwidth in the 2 GHz band, using two optimization techniques based upon genetic algorithms (GA), namely the Binary Coded GA (BCGA) and Real-Coded GA (RCGA). During the optimization process, the different PIFA models were evaluated using the finite-difference time domain (FDTD) method-a technique belonging to the general class of differential time domain numerical modeling methods.
文摘In this work a new technique for global perceptual codes (GPCs) extraction using genetic algorithms (GA) is presented. GAs are employed to extract the GPCs in order to reduce the original number of features and to provide meaningful representations of the original data. In this technique the GPCs are build from a certain combination of elementary perceptual codes (EPCs) which are provided by the Beta-elliptic model for the generation of complex handwriting movements. Indeed, in this model each script is modelled by a set of elliptic arcs. We associate to each arc an EPC. In the proposed technique we defined four types of EPCs. The GPCs can be formed by many possible combinations of EPCs depending on their number and types. So that, the problem of choosing the right combination for each GPC can be regarded as a global optimization problem which is treated in this work using the GAs. Several simulation examples are presented to evaluate the interest and the efficiency of the proposed technique.
文摘Presents the fuzzy neural network optimized by hybrid coded genetic algorithm of decimal encoding and binary encoding, the searching ability and stability of genetic algorithms enhanced by using binary encoding during the crossover operation and decimal encoding during the mutation operation, and the way of accepting new individuals by probability adopted, by which a new individual is accepted and its parent is discarded when its fitness is higher than that of its parent, and a new individual is accepted by probability when its fitness is lower than that of its parent. And concludes with calculations made with an example that these improvements enhance the speed of genetic algorithms to optimize the fuzzy neural network controller.
文摘In this paper, the main objective is to identify the parameters of motors, which includes a brushless direct current (BLDC) motor and an induction motor. The motor systems are dynamically formulated by the mechanical and electrical equations. The real-coded genetic algorithm (RGA) is adopted to identify all parameters of motors, and the standard genetic algorithm (SRGA) and various adaptive genetic algorithm (ARGAs) are compared in the rotational angular speeds and fitness values, which are the inverse of square differences of angular speeds. From numerical simulations and experimental results, it is found that the SRGA and ARGA are feasible, the ARGA can effectively solve the problems with slow convergent speed and premature phenomenon, and is more accurate in identifying system’s parameters than the SRGA. From the comparisons of the ARGAs in identifying parameters of motors, the best ARGA method is obtained and could be applied to any other mechatronic systems.
文摘Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances for solving large optimization problems. This article proposes a new decoder based on Serial Genetic Algorithm Decoder (SGAD) for decoding Low Density Parity Check (LDPC) codes. The results show that the proposed algorithm gives large gains over sum-product decoder, which proves its efficiency.
文摘Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.
文摘目的:为了提升乳腺超声肿物的分类性能,基于大型语言模型对乳腺超声肿物分类算法进行优化。方法:首先,选取乳腺超声数据集(BrEaST,v1.0)中252例患者的乳腺超声文字描述(恶性98例,良性154例),基于乳腺成像报告和数据系统(Breast Imaging Reporting and Data System,BI-RADS)指南选取乳腺组织成分、皮肤增厚、肿物形态、后方回声、边界、声晕、回声强度和钙化8项特征,并将252例样本按7∶3的比例划分为训练集与测试集。以大型语言模型(ChatGPT 5.1 Thinking)自动生成Python代码,系统部署3种算法:将预设超参数的随机森林作为算法1,并作为基线算法;将预设超参数的随机森林结合针对名义变量的合成少数类过采样技术(synthetic minority oversampling technique for nominal,SMOTEN)作为算法2;将利用随机搜索调优的随机森林作为算法3。以病理良恶性为金标准,采用Friedman检验比较3种算法的总体差异,采用Nemenyi检验比较3种算法间的两两差异。通过人工编程对3种算法进行复现,采用Bootstrap自助法对测试集进行1000次重采样,比较人工编程实现的算法和大型语言模型实现的算法的性能指标差异。结果:Friedman检验结果表明,算法3在准确度(0.848)、敏感度(0.912)、F1分数(0.823)、AUC(0.895)4项评价指标中均为最优,3种算法的准确度、敏感度、F1分数、AUC比较差异均有统计学意义(P<0.05),3种算法的特异度比较差异无统计学意义(P>0.05)。Nemenyi检验结果表明,算法3的准确度、敏感度、F1分数、AUC均优于算法1和算法2,差异有统计学意义(P<0.05),算法1和算法2各项指标比较差异均无统计学意义(P>0.05)。大型语言模型生成代码实现的算法与人工编程实现的算法在各项性能指标上均表现出高度一致性,各项性能指标比较差异均无统计学意义(P>0.05)。结论:大型语言模型可以提升乳腺超声肿物分类算法的性能,为临床医师的诊断和治疗提供了参考。
