Mass spectrometer parameter optimization method, device, equipment and storage medium

Through the improved differential evolution algorithm, the parameters of the mass spectrometer are optimized, which solves the complex and time-consuming problem of the mass spectrometer tuning process, and achieves faster and more accurate parameter optimization, which improves the debugging efficiency of the mass spectrometer.

CN119849541BActive Publication Date: 2025-08-08SUZHOU INST OF BIOMEDICAL ENG & TECH CHINESE ACADEMY OF SCI
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202510331303.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-03-20
Publication Date
2025-08-08
Estimated Expiration
2045-03-20

AI Technical Summary

Technical Problem

The tuning process of mass spectrometers is complicated, time-consuming and labor-intensive, and the problem of multi-objective optimization is difficult to solve efficiently.

Method used

The improved differential evolution algorithm is used to iteratively update the mass spectrometer parameters. By obtaining the initial target population and multi-dimensional vectors, the optimal parameters are determined using the mass spectrometry peak intensity value, and the combination of variation operations and cross-operation optimization parameters is combined.

Benefits of technology

It improves the speed and accuracy of mass spectrometer parameters, saves time and personnel costs, and improves debugging and optimization efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119849541B_ABST
    Figure CN119849541B_ABST
Patent Text Reader

Abstract

The present invention relates to the technical field of analytical instruments, and discloses a mass spectrometer parameter optimization method, device, equipment and storage medium, the method comprising: obtaining an initialized target population, wherein the individuals in the target population are multidimensional vectors, and the multidimensional vector is a vector composed of a combination of multiple mass spectrometer parameters; using an improved differential evolution algorithm, iteratively updating the individuals in the target population until one of the following termination conditions is met: the number of iterations reaches a first set value, and the number of times the optimal fitness value has not been continuously updated reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to each individual in the latest target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual; and the mass spectrometer parameters in the optimal individual corresponding to the optimal fitness value are determined as the optimal mass spectrometer parameters. The present invention can improve the speed and accuracy of mass spectrometer parameter optimization, saving time and personnel costs.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of analytical instruments, and in particular to a mass spectrometer parameter optimization method, device, equipment and storage medium. Background Art

[0002] A mass spectrometer is an instrument that separates and detects the composition of substances based on the mass-to-charge ratio of ions. It has the characteristics of high sensitivity and strong specificity and can be widely used in organic chemistry, biology, geochemistry, nuclear industry, materials science, environmental science, medicine and health, food chemistry, petrochemical industry, as well as special analysis such as space technology and public security work.

[0003] Mass spectrometers are complex, large instruments. During their production and use, they often require adjustment of numerous electrical and gas flow parameters to achieve optimal performance. This process is known as mass spectrometer tuning. During mass spectrometer tuning, the various parameters that require adjustment are interdependent and influence each other. This problem can be summarized as a multi-objective (i.e., multi-parameter combination) optimization problem. Multi-objective optimization problems are often complex, time-consuming, and labor-intensive. Summary of the Invention

[0004] In view of this, the present invention provides a mass spectrometer parameter optimization method, device, equipment and storage medium to solve the problem that the mass spectrometer tuning process is complicated, time-consuming and labor-intensive.

[0005] In a first aspect, the present invention provides a method for optimizing mass spectrometer parameters, the method comprising:

[0006] Acquire an initialized target population, where individuals in the target population are multidimensional vectors, and the multidimensional vector is a vector composed of a combination of multiple mass spectrometer parameters;

[0007] Using an improved differential evolution algorithm, iteratively updating the individuals in the target population until one of the following iterative update termination conditions is met: the number of iterations reaches a first set value, and the number of consecutive times the optimal fitness value has not been updated reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to the individuals in the latest target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual;

[0008] The mass spectrometer parameters in the optimal individual corresponding to the optimal fitness value are determined as the optimal mass spectrometer parameters.

[0009] In an optional embodiment, the mass spectrum peak intensity value corresponding to the individual is calculated by the following method:

[0010] Get the initial value of the mass axis and the initial value of the mass resolution;

[0011] adjusting a first voltage value corresponding to the mass axis based on the target value and the initial value of the mass axis; obtaining a corresponding current value of the mass axis based on the adjusted first voltage value; and if a deviation between the current value of the mass axis and the target value of the mass axis does not satisfy a first termination condition, continuing to adjust the first voltage value based on the target value of the mass axis and the current value of the mass axis until a deviation between the latest current value of the mass axis and the target value of the mass axis satisfies the first termination condition;

[0012] adjusting a second voltage value corresponding to the mass resolution based on the target value and the initial value of the mass resolution; obtaining a corresponding current mass resolution value based on the adjusted second voltage value; and if a deviation between the current mass resolution value and the target mass resolution value does not satisfy a second termination condition, continuing to adjust the second voltage value based on the target mass resolution value and the current mass resolution value until a deviation between the latest current mass resolution value and the target mass resolution value satisfies the second termination condition;

[0013] When the deviation between the current value of the mass axis and the target value of the mass axis satisfies the first termination condition, and the deviation between the current value of the mass resolution and the target value of the mass resolution satisfies the second termination condition, the corresponding mass spectrum peak intensity value is obtained based on the current value of the mass axis and the current value of the mass resolution.

[0014] In an optional embodiment, the mass spectrum peak intensity value is the intensity value of a single typical mass spectrum peak; or,

[0015] The mass spectrum peak intensity values include intensity values of typical mass spectrum peaks in multiple different mass number ranges.

[0016] In an optional embodiment, the iterative updating of individuals in the target population using an improved differential evolution algorithm includes:

[0017] In the current iterative update process, the individuals in the target population are divided into subpopulations according to the fitness values corresponding to the individuals to obtain multiple subpopulations;

[0018] A mutation operation is performed on a target individual to obtain a corresponding mutant individual; the mutation operation used is different depending on the subpopulation to which the target individual belongs;

[0019] Performing a crossover operation on the variant individual and the target individual corresponding to the variant individual to obtain a corresponding test individual;

[0020] If the fitness value corresponding to the test individual is better than that of the corresponding target individual, the test individual is used to replace the target individual.

[0021] In an optional embodiment, during the current iterative update process, the individuals in the target population are divided into subpopulations according to the fitness values corresponding to the individuals to obtain multiple subpopulations, including:

[0022] Determining the number of individuals corresponding to each of the subpopulations based on the iterative stage to which the current iterative update belongs; the iterative stage is a stage divided according to the number of iterations;

[0023] According to the number of individuals corresponding to each subpopulation and the fitness value corresponding to the individual, the individuals in the target population are divided into the corresponding subpopulations.

[0024] In an optional embodiment, as the iterative stage progresses, the number of the individuals of the first subpopulation in the subpopulation gradually increases, and the fitness values of the individuals of the first subpopulation are better than the fitness values of the individuals of other subpopulations.

[0025] In an optional embodiment, in subpopulations other than the first subpopulation, the number of individuals in the final iterative stage is less than that in the initial iterative stage.

[0026] In an optional embodiment, the multiple subpopulations include a first subpopulation, a second subpopulation, and a third subpopulation, and the fitness value of the individuals in the first subpopulation is better than the fitness value of the individuals in the second subpopulation, and the fitness value of the individuals in the second subpopulation is better than the fitness value of the individuals in the third subpopulation;

[0027] The step of applying a mutation operation to a target individual to obtain a corresponding mutant individual includes:

[0028] If the target individual belongs to the first subpopulation, a first mutation operation is adopted, wherein the first mutation operation is: a random search is performed near the current optimal individual, and as the iteration process proceeds, the range of the random search near the current optimal individual is gradually reduced;

[0029] If the target individual belongs to the second subpopulation, a second mutation operation is adopted, wherein the second mutation operation is: moving toward the current optimal individual while taking into account random direction search;

[0030] If the target individual belongs to the third sub-population, a third mutation operation is adopted, and the third mutation operation is: randomly regenerating a new individual in the global range.

[0031] In an optional implementation, the formula corresponding to the first mutation operation is:

[0032]

[0033] in, For the The first iteration The mutant individuals corresponding to the target individuals, is the current optimal individual, For the The first iteration 、 individual; , , is a constant coefficient, For is a decreasing function of the independent variable.

[0034] In an optional embodiment, ,in, is the first set value.

[0035] In an optional implementation, the formula corresponding to the second mutation operation is:

[0036]

[0037] in, For the The first iteration The target individual The corresponding variant individuals, is the current optimal individual, For the The first iteration 、 Individuals, is a constant coefficient, For is a function of the independent variable.

[0038] In a second aspect, the present invention provides a mass spectrometer parameter optimization device, comprising:

[0039] An initialization population acquisition module is used to acquire an initialized target population, where the individuals in the target population are multidimensional vectors, and the multidimensional vector is a vector composed of a combination of multiple mass spectrometer parameters;

[0040] An individual updating module is configured to iteratively update individuals in the target population using an improved differential evolution algorithm until one of the following iterative update termination conditions is met: the number of iterations reaches a first set value, and the number of consecutive times the optimal fitness value has not been updated reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to the latest individuals in the target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual;

[0041] The determination module is used to determine the mass spectrometer parameters in the optimal individual corresponding to the optimal fitness value as the optimal mass spectrometer parameters.

[0042] In a third aspect, the present invention provides a computer device comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory storing computer instructions, and the processor executing the mass spectrometer parameter optimization method of the first aspect or any corresponding embodiment thereof by executing the computer instructions.

[0043] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the mass spectrometer parameter optimization method of the first aspect or any corresponding embodiment thereof.

[0044] In a fifth aspect, the present invention provides a computer program product comprising computer instructions for causing a computer to execute the mass spectrometer parameter optimization method of the first aspect or any corresponding embodiment thereof.

[0045] The mass spectrometer parameter optimization method, apparatus, device, and storage medium provided by the embodiments of the present invention utilize an intelligent optimization algorithm, specifically an improved differential evolution algorithm, to achieve multi-parameter combination optimization. This improves the speed and accuracy of parameter optimization, saving time and labor costs. The embodiments of the present invention can be used in the debugging and optimization process of mass spectrometer test equipment, as well as in functional modules such as automatic tuning in mass spectrometer product software, improving debugging and optimization efficiency and results, thus possessing high practical value and industrialization potential. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in related technologies, the following briefly introduces the drawings required for use in the specific embodiments or related technical descriptions. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0047] Figure 1 is a flow chart of a method for optimizing mass spectrometer parameters according to an embodiment of the present invention;

[0048] Figure 2 is a trend graph showing how the maximum value of mass spectrum peak intensity values of individuals in a target population changes with the number of iterations according to an embodiment of the present invention;

[0049] Figure 3 is a process schematic diagram of another mass spectrometer parameter optimization method according to an embodiment of the present invention;

[0050] Figure 4 is a structural block diagram of a mass spectrometer parameter optimization device according to an embodiment of the present invention;

[0051] Figure 5 Schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0052] To make the purpose, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts shall fall within the scope of protection of the present invention.

[0053] According to an embodiment of the present invention, an embodiment of a mass spectrometer parameter optimization method is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of executable computer instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0054] In this embodiment, a mass spectrometer parameter optimization method is provided, which can be used in various computer devices. Figure 1 : is a flow chart of a mass spectrometer parameter optimization method according to an embodiment of the present invention. Figure 1 As shown, the process includes the following steps:

[0055] Step S101 : obtaining an initialized target population, where individuals in the target population are multidimensional vectors, and the multidimensional vector is a vector composed of a combination of multiple mass spectrometer parameters, that is, a parameter vector.

[0056] Specifically, the number of individuals in the target population can be N , an individual can be a D dimensional vector, that is, the individual is composed of D The parameter vector composed of a combination of mass spectrometer parameters ( , is the number of iterations currently completed). The initialized target population can be randomly generated, that is, randomly selected from the given boundary constraints, and can be expressed as:

[0057]

[0058] in, For the The first The initial value of the dimension parameter, For the The upper and lower limits of the dimension parameter, rand[0,1] represents a uniform random number generated before [0,1].

[0059] In an optional embodiment, the multiple mass spectrometer parameters may be multiple ion lens (ie, ion transmission system) parameters, such as the declustering voltage V DP , Interface guided DC voltage V Q , interface guide output voltage V EXIT , ion guide lens voltage V EP In other embodiments, the mass spectrometer parameters are not limited to ion lens parameters, and may also be parameters of a quadrupole ion guide structure, for example.

[0060] Step S102, using an improved differential evolution algorithm, iteratively updates the individuals in the target population until one of the following iterative update termination conditions is met: the number of iterations reaches a first set value, and the number of times the optimal fitness value has not been updated continuously reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to each individual in the latest target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual. The first set value is the maximum number of iterations G. Figure 2 The trend diagram of the maximum value of the mass spectrum peak intensity value changing with the number of iterations is shown. During the iterative optimization process of the target population, the overall trend of the maximum value of the mass spectrum peak intensity value is that it becomes larger with the increase of the number of iterations.

[0061] For each individual, each update requires calculation of the corresponding fitness value to determine the optimal fitness value after each iterative update. In some specific implementations, the calculation of the individual fitness value is also an iterative cycle process, as follows:

[0062] Step S102a: Acquire the initial value of the mass axis and the initial value of the mass resolution. Specifically, the initial values of the mass axis and the mass resolution may be the corresponding mass axis value and mass resolution value when the mass axis and the resolution of the backend mass analyzer have been debugged.

[0063] Step S102b: adjust the first voltage value corresponding to the mass axis based on the target value and initial value of the mass axis; obtain the corresponding current value of the mass axis based on the adjusted first voltage value; if the deviation between the current value of the mass axis and the target value of the mass axis does not meet the first termination condition, continue to adjust the first voltage value based on the target value of the mass axis and the current value of the mass axis until the deviation between the latest current value of the mass axis and the target value of the mass axis meets the first termination condition.

[0064] Based on the target value of the mass axis and the current value of the mass axis, the process of adjusting the first voltage value is expressed by the following formula:

[0065]

[0066] in, is the first voltage value after current adjustment, i.e. A first voltage value obtained by iterative adjustment; is the current first voltage value, that is, the A first voltage value obtained by iterative adjustment; is the coefficient; is the target value of the mass axis; For the The mass axis value after iteration adjustment.

[0067] In addition, the first termination condition may be, for example: or etc., among which, is the current value of the mass axis obtained based on the adjusted first voltage, i.e. The mass axis value after iteration adjustment.

[0068] The target value of the mass axis and the first termination condition may be determined based on factory requirements of the mass spectrometer.

[0069] Step S102c: adjusting the second voltage value corresponding to the mass resolution based on the target value and the initial value of the mass resolution; obtaining the corresponding current value of the mass resolution based on the adjusted second voltage value; if the deviation between the current value of the mass resolution and the target value of the mass resolution does not satisfy the second termination condition, continuing to adjust the second voltage value based on the target value of the mass resolution and the current value of the mass resolution until the deviation between the latest current value of the mass resolution and the target value of the mass resolution satisfies the second termination condition.

[0070] Based on the target value of the mass resolution and the current value of the mass resolution, the process of adjusting the second voltage value is expressed by the following formula:

[0071]

[0072] in, is the second voltage value after current adjustment, i.e. A second voltage value obtained by iterative adjustment; is the current second voltage value, that is, A second voltage value obtained by iterative adjustment; is the coefficient; is the target value of mass resolution; For the The mass resolution value after the iteration adjustment.

[0073] In addition, the second termination condition may be, for example: or, etc., among which, is the current value of the mass resolution obtained based on the adjusted second voltage, i.e. The mass resolution value after the adjustment of the iteration. The target value of mass resolution For example, it can be 0.7 or 0.75.

[0074] The target value of the mass resolution and the second termination condition may be determined based on the factory requirements of the mass spectrometer.

[0075] The execution order of the iterative adjustment step of the mass axis and the iterative adjustment step of the mass resolution is not limited, and they can be executed one after another or simultaneously.

[0076] Step S102d, when the deviation between the current value of the mass axis and the target value of the mass axis meets the first termination condition, and the deviation between the current value of the mass resolution and the target value of the mass resolution meets the second termination condition, the corresponding mass spectrum peak intensity value is obtained based on the current value of the mass axis and the current value of the mass resolution.

[0077] Step S102e: determining the corresponding fitness value based on the mass spectrum peak intensity value.

[0078] The calculation method of the individual fitness value provided in the embodiment of the present invention is applicable to the automatic optimization process of the mass spectrometer ion lens parameters. Before starting the automatic optimization process of the mass spectrometer ion lens parameters, the mass axis and resolution of the back-end mass analyzer have been debugged.

[0079] In addition, the fitness value acquisition process provided by the embodiment of the present invention requires synchronous fine-tuning of the mass axis and mass resolution of the typical peak of the mass spectrometer. In some embodiments, the above method can be used only when obtaining the fitness value for the test individual. When obtaining the fitness value for the initialized individual, the mass axis and mass resolution can be fine-tuned asynchronously. Instead, the corresponding mass spectrum peak intensity value is obtained directly based on the initial value of the mass axis and the initial value of the mass resolution when the mass analyzer is debugged. In other embodiments, the mass axis and mass resolution can also be fine-tuned asynchronously during the process of calculating the fitness value of the individual.

[0080] In some optional embodiments, the mass spectrum peak intensity value is the intensity value of a single typical mass spectrum peak. In this case, the fitness value corresponding to the individual It can be calculated according to the following formula:

[0081] ;

[0082] or,

[0083] ;

[0084] in, is the individual (a vector consisting of a combination of multiple mass spectrometer parameters), is the intensity value of a single typical mass spectrum peak.

[0085] In the embodiment of the present invention, a single-objective evaluation method is used to evaluate the fitness of an individual.

[0086] In some other optional embodiments, the mass spectrum peak intensity value includes the intensity values of typical mass spectrum peaks of multiple different mass number segments. In this case, the fitness value corresponding to the individual It can be calculated according to the following formula:

[0087]

[0088] in, I 1. I 2. I 3 are the intensity values of typical mass spectrum peaks in low, medium and high mass ranges respectively, λ 1. λ 1. λ 1 are the weight coefficients of typical mass spectrum peaks in low, medium and high mass ranges, respectively.

[0089] In the embodiment of the present invention, a multi-objective evaluation method is used to evaluate the fitness of an individual. Multi-objective evaluation refers to finding the best combination of multiple mass spectrometry peaks to achieve the best data interpretation and analysis results.

[0090] The optimization of mass spectrometer parameters is a process of maximizing the intensity value of the mass spectrometry peak. That is to say, the larger the intensity value of the mass spectrometry peak, the better. However, the optimization process of the differential evolution algorithm is a process of minimizing the fitness value. Therefore, in the above embodiments, the intensity value of the mass spectrometry peak is converted into the corresponding fitness value through an inverse proportional function or a linear function with a negative slope. Of course, other decreasing functions can also be used, such as exponential functions (where the base 0 < a < 1), power functions (negative exponents), etc., to convert the intensity value of the mass spectrometry peak into the corresponding fitness value.

[0091] In some optional specific implementation manners, such as Figure 3 shown, step S102, that is, using the improved differential evolution algorithm to iteratively update the individuals in the target population, specifically includes:

[0092] Step S1021, in the current iterative update process, divide the individuals in the target population into sub-populations according to the fitness values corresponding to the individuals, and obtain multiple sub-populations. In the embodiments of the present invention, in each round of iteration of the target population, it is necessary to re-divide the sub-populations based on the fitness values of the individuals.

[0093] Specifically, the individuals in the target population can be sorted in ascending order according to the fitness values. Then, perform sub-population division on the sorted individuals.

[0094] In some specific implementation manners, step S1021, that is, in the current iterative update process, divide the individuals in the target population into sub-populations according to the fitness values corresponding to the individuals, and obtain multiple sub-populations, includes:

[0095] Step S10211, based on the iteration stage to which the current iterative update belongs, determine the number of individuals corresponding to each sub-population; the iteration stage is a stage divided according to the number of iterations, such as including the initial stage, the intermediate stage, and the final stage.

[0096] In the embodiments of the present invention, if the iteration stage to which the current iterative update belongs is different, the number of individuals in each sub-population may also be different. For example, there are a total of three sub-populations: the better sub-population, the intermediate sub-population, and the worse sub-population. In the initial stage of the iteration process (for example, g ≤ G / 3, where g is the current iteration number and G is the maximum iteration number), the ratio of the number of individuals in the better sub-population, the intermediate sub-population, and the worse sub-population is 1:1:1; in the intermediate stage of the iteration process (for example, G / 3 < g ≤ 2G / 3), the ratio of the number of individuals in the better sub-population, the intermediate sub-population, and the worse sub-population is 3:2:1; in the final stage of the iteration process (for example, g > 2G / 3), the ratio of the number of individuals in the better sub-population, the intermediate sub-population, and the worse sub-population is 4:1:1.

[0097] In some embodiments, as the iterative stages progress, the number of individuals in the first subpopulation within the subpopulations gradually increases, and the fitness values of the individuals in the first subpopulation are superior to the fitness values of the individuals in the other subpopulations. In subpopulations other than the first subpopulation, the number of individuals in the final iterative stage is smaller than in the initial iterative stage. Specifically, in subpopulations other than the first subpopulation, the number of individuals decreases overall as the iterative stages progress. That is, in embodiments of the present invention, the sizes of the subpopulations are gradually adjusted during the iterative process.

[0098] Step S10212: Divide the individuals in the target population into corresponding subpopulations according to the number of individuals corresponding to each subpopulation and the fitness value corresponding to the individual.

[0099] Step S1022: applying a mutation operation to the target individual to obtain a corresponding mutant individual; the mutation operation applied is different depending on the subpopulation to which the target individual belongs.

[0100] In the embodiment of the present invention, in each round of iteration of the target population, each individual needs to be taken as a target individual and subjected to a mutation operation.

[0101] In the embodiment of the present invention, individuals are divided into subpopulations according to their fitness values, so that different mutation operations can be taken for different performances of individuals. The following examples illustrate how different mutation operations are taken for target individuals in different subpopulations.

[0102] In some embodiments, the multiple subpopulations include a first subpopulation, a second subpopulation, and a third subpopulation, and the fitness values of the individuals in the first subpopulation are better than the fitness values of the individuals in the second subpopulation, and the fitness values of the individuals in the second subpopulation are better than the fitness values of the individuals in the third subpopulation. That is, the first subpopulation, the second subpopulation, and the third subpopulation are respectively a superior subpopulation, an intermediate subpopulation, and a inferior subpopulation.

[0103] like Figure 3 As shown, step S1022, i.e., performing a mutation operation on the target individual to obtain a corresponding mutant individual, includes:

[0104] If the target individual belongs to the first subpopulation (i.e., the preferred subpopulation), the first mutation operation is performed. This involves a random search near the current optimal individual (i.e., the current global optimal solution). As the iteration proceeds, the range of the random search near the current optimal individual gradually decreases. The current optimal individual is the individual in the target population with the highest fitness value after the previous iteration.

[0105] Specifically, the formula corresponding to the first mutation operation may be, for example:

[0106]

[0107] in, For the The first iteration The mutant individuals corresponding to the target individuals, is the current optimal individual, i.e. The best individual after iterations, For the The first iteration 、 individual; , is [1, N ] Randomly select an integer from the range, is the mutation operator, , is a constant coefficient, for example, it can be 0.5, For is a decreasing function of the independent variable.

[0108] In the embodiment of the present invention, the proportional coefficient ( ) to control the gradual narrowing of the random search range near the current optimal individual. For is a decreasing function of the independent variable, so in the later stages of the iteration Gradually decrease, so as to retain more optimal individuals information, increasing the probability of converging to the optimal solution.

[0109] in, ,in, is the first set value.

[0110] If the target individual belongs to the second subpopulation (ie, the intermediate subpopulation), a second mutation operation is adopted, where the second mutation operation is: moving toward the current optimal individual while taking into account random direction search.

[0111] Specifically, the formula corresponding to the second mutation operation is:

[0112]

[0113] in, For the The first iteration The target individual The corresponding variant individuals, is the current optimal individual, For the The first iteration 、 Individuals, is a constant coefficient, for example , For is a function of the independent variable. For example, .

[0114] In the embodiment of the present invention, It can be is a decreasing function of the independent variable, so as to maintain a larger mutation operator in the early stage of iteration to maintain individual diversity and avoid falling into a local optimal solution.

[0115] If the target individual belongs to the third subpopulation (i.e., the inferior subpopulation), the third mutation operation is used. The third mutation operation is to randomly generate new individuals as mutation individuals in the global scope. This process is consistent with the individual initialization process and can be expressed as follows:

[0116]

[0117] in, For the The first iteration The first of the variant individuals The variation value of the dimension parameter, For the The upper and lower limits of the dimension parameter.

[0118] In the embodiment of the present invention, during the parameter optimization process, individuals in the third subpopulation are mutated by randomly taking values, so that the parameters are less likely to fall into a local optimal solution.

[0119] Step S1023: performing a crossover operation on the variant individual and the target individual corresponding to the variant individual to obtain a corresponding test individual.

[0120] In the embodiment of the present invention, in order to increase the diversity of the interference parameter vector, a crossover operation is introduced to adjust the parameter vector (ie, individual):

[0121]

[0122] Among them, randb( j ) represents the first random number sequence generated between [0,1]. j values; CR represents the crossover operator, and its value range is [0,1]; rnbr( i ) means from [1, D ] to generate a random number sequence between From the mutation parameter vector (ie mutation individual) At least one parameter value is obtained from , so that the parameter vector is updated instead of remaining unchanged.

[0123] In addition, after obtaining the test individual, it is necessary to compare the parameters in the test individual with the boundary conditions, and replace the parameters in the test individual that exceed the boundary with the adjacent boundary values, that is, boundary absorption processing, which can be expressed as follows:

[0124] like ,but ;

[0125] like ,but .

[0126] In the embodiment of the present invention, the boundary absorption process can make the newly generated test individuals located in the feasible domain space without exceeding the boundary.

[0127] In other embodiments, after the variant individual is obtained, the boundary absorption process may be performed on the variant individual, so that the subsequent test individuals obtained based on the variant individual will not exceed the boundary.

[0128] Step S1024: If the fitness value corresponding to the test individual is better than the corresponding target individual, the test individual is used to replace the target individual, that is, a selection operation.

[0129] In the embodiment of the present invention, in order to verify the test individual Is it compared to The better solution is stored in In the experiment, the individual The fitness value of Calculate. Please refer to the above for the calculation process of the fitness value of the test individual and the fitness value of the target individual. Then, the fitness value of the test individual is compared with the fitness value of the previous generation individual. If the test individual The corresponding fitness value is better, then To update, the formula is as follows:

[0130] .

[0131] In addition, there are two conditions for judging whether the iterative update is completed: 1. The number of iterations reaches the first set value, and 2. The number of times the optimal fitness value has not been updated continuously reaches the second set value. The specific judgment process is:

[0132] First, determine whether the number of iterations has ended, that is, whether it has reached the first set value. If not, compare the current result with the previous result. If the optimal fitness value is still continuously optimized, that is:

[0133] , is the smaller value set;

[0134] Then the newly generated Carry out a new round of iteration.

[0135] If the optimal fitness value has not been updated for several consecutive times (such as no update for 2 consecutive times), , it is considered to have reached the optimal value and the iteration ends early.

[0136] The present invention uses an improved differential evolution algorithm to automatically optimize mass spectrometer parameters. Based on the traditional differential evolution algorithm, the algorithm divides individuals into groups according to their performance and adopts different optimization directions for different groups of individuals.

[0137] In addition, the mutation operator in the basic differential evolution algorithm is generally a real constant. In the iterative optimization process, the value of the mutation operator has a great influence. If the mutation operator is too large, the algorithm search tends to be more of a random iterative process, resulting in low search efficiency; if the mutation operator is too small, the population diversity is low and it is easy to fall into a local optimal solution. The embodiment of the present invention introduces a certain idea of the adaptive differential evolution algorithm, which adjusts the value of some mutation operators ( 、 ) Perform adaptive adjustments based on iterative progress.

[0138] Step S103: determining the mass spectrometer parameters of the optimal individual corresponding to the optimal fitness value as the optimal mass spectrometer parameters.

[0139] The mass spectrometer parameter optimization method provided in this embodiment utilizes an intelligent optimization algorithm, specifically an improved differential evolution algorithm, to achieve multi-parameter combination optimization. This improves the speed and accuracy of parameter optimization, saving time and labor costs. This embodiment of the invention can be used in the debugging and optimization process of mass spectrometer test equipment, as well as in functional modules such as automatic tuning in mass spectrometer product software, improving debugging and optimization efficiency and results. It has high practical value and industrialization potential.

[0140] In this embodiment, a mass spectrometer parameter optimization device is also provided, which is used to implement the above-mentioned embodiments and preferred embodiments, and will not be repeated hereafter. As used below, the term "module" can be a combination of software and / or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and contemplated.

[0141] This embodiment provides a mass spectrometer parameter optimization device, such as Figure 4 Shown, including:

[0142] An initialization population acquisition module 401 is used to acquire an initialized target population, where individuals in the target population are multidimensional vectors, and the multidimensional vectors are vectors composed of a combination of multiple mass spectrometer parameters;

[0143] Individual updating module 402 is configured to iteratively update individuals in the target population using an improved differential evolution algorithm until one of the following iterative update termination conditions is met: the number of iterations reaches a first set value, or the number of consecutive times the optimal fitness value has not been updated reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to the latest individuals in the target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual;

[0144] The determination module 403 is configured to determine the mass spectrometer parameters of the optimal individual corresponding to the optimal fitness value as the optimal mass spectrometer parameters.

[0145] In some optional implementations, the individual update module 402 includes:

[0146] An initial value acquisition unit, used for acquiring an initial value of the mass axis and an initial value of the mass resolution;

[0147] a mass axis adjustment unit, configured to adjust a first voltage value corresponding to the mass axis based on a target value and an initial value of the mass axis; obtain a corresponding current value of the mass axis based on the adjusted first voltage value; and, if a deviation between the current value of the mass axis and the target value of the mass axis does not satisfy a first termination condition, continue to adjust the first voltage value based on the target value of the mass axis and the current value of the mass axis until the deviation between the latest current value of the mass axis and the target value of the mass axis satisfies the first termination condition;

[0148] a mass resolution adjustment unit, configured to adjust a second voltage value corresponding to the mass resolution based on the target value and the initial value of the mass resolution; obtain a corresponding current mass resolution value based on the adjusted second voltage value; and, if a deviation between the current mass resolution value and the target mass resolution value does not satisfy a second termination condition, continue to adjust the second voltage value based on the target mass resolution value and the current mass resolution value until the deviation between the latest current mass resolution value and the target mass resolution value satisfies the second termination condition;

[0149] A mass spectrum peak intensity value acquisition unit is used to acquire the corresponding mass spectrum peak intensity value based on the mass axis current value and the mass resolution current value when the deviation between the mass axis current value and the mass resolution target value meets the first termination condition and the deviation between the mass resolution current value and the mass resolution target value meets the second termination condition.

[0150] In some optional embodiments, the mass spectrum peak intensity value is the intensity value of a single typical mass spectrum peak; or,

[0151] The mass spectrum peak intensity values include intensity values of typical mass spectrum peaks in multiple different mass number ranges.

[0152] In some optional implementations, the individual update module 402 includes:

[0153] a subpopulation division unit, configured to divide the individuals in the target population into subpopulations according to the fitness values corresponding to the individuals during the current iterative update process, to obtain a plurality of subpopulations;

[0154] a mutation operation unit, configured to perform a mutation operation on a target individual to obtain a corresponding mutant individual; the mutation operation used is different depending on the subpopulation to which the target individual belongs;

[0155] a crossover operation unit, configured to perform a crossover operation on the variant individual and a target individual corresponding to the variant individual to obtain a corresponding test individual;

[0156] A selection unit is configured to replace the target individual with the test individual if the fitness value corresponding to the test individual is better than that of the corresponding target individual.

[0157] In some optional embodiments, the subpopulation division unit is specifically used to determine the number of individuals corresponding to each subpopulation based on the iterative stage to which the current iterative update belongs; the iterative stage is a stage divided according to the number of iterations; according to the number of individuals corresponding to each subpopulation and the fitness value corresponding to the individual, the individuals in the target population are divided into the corresponding subpopulations.

[0158] In some optional embodiments, as the iterative stage progresses, the number of the individuals of the first subpopulation in the subpopulation gradually increases, and the fitness values of the individuals of the first subpopulation are better than the fitness values of the individuals of other subpopulations.

[0159] In some optional embodiments, in subpopulations other than the first subpopulation, the number of individuals in the final iterative stage is less than that in the initial iterative stage.

[0160] In some optional embodiments, the multiple subpopulations include a first subpopulation, a second subpopulation, and a third subpopulation, and the fitness value of the individuals in the first subpopulation is better than the fitness value of the individuals in the second subpopulation, and the fitness value of the individuals in the second subpopulation is better than the fitness value of the individuals in the third subpopulation;

[0161] The mutation operation unit is specifically used for:

[0162] If the target individual belongs to the first subpopulation, a first mutation operation is adopted, wherein the first mutation operation is: a random search is performed near the current optimal individual, and as the iteration process proceeds, the range of the random search near the current optimal individual is gradually reduced;

[0163] If the target individual belongs to the second subpopulation, a second mutation operation is adopted, wherein the second mutation operation is: moving toward the current optimal individual while taking into account random direction search;

[0164] If the target individual belongs to the third sub-population, a third mutation operation is adopted, and the third mutation operation is: randomly regenerating a new individual in the global range.

[0165] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0166] The mass spectrometer parameter optimization device in this embodiment is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0167] The embodiment of the present invention also provides a computer device having the above Figure 4 The mass spectrometer parameter optimization device is shown.

[0168] See also Figure 5 , Figure 5 is a structural diagram of a computer device provided by an optional embodiment of the present invention, such as Figure 5As shown, the computer device includes: one or more processors 10, memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components utilize different buses to communicate with each other and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in the memory or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Equally, multiple computer devices can be connected, and each device provides part of the necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 5 A processor 10 is taken as an example.

[0169] The processor 10 may be a central processing unit, a network processor, or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit, a programmable logic device, or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic, or any combination thereof.

[0170] The memory 20 stores instructions that can be executed by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0171] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created based on the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely located relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0172] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0173] The computer device further includes an input device 30 and an output device 40. The processor 10, the memory 20, the input device 30 and the output device 40 may be connected via a bus or other means. Figure 5 The bus connection is taken as an example.

[0174] The input device 30 can receive input digital or character information and generate key signal input related to user settings and function control of the computer device. Examples include a touch screen, keypad, mouse, trackpad, touchpad, pointing stick, one or more mouse buttons, trackball, joystick, etc. The output device 40 may include a display device, auxiliary lighting devices (e.g., LEDs), and tactile feedback devices (e.g., vibration motors). Such display devices include, but are not limited to, liquid crystal displays, light emitting diodes, monitors, and plasma displays. In some optional embodiments, the display device may be a touch screen.

[0175] The computer device further includes a communication interface for the computer device to communicate with other devices or a communication network.

[0176] The embodiment of the present invention also provides a computer-readable storage medium. The above-mentioned method according to the embodiment of the present invention can be implemented in hardware, firmware, or implemented as a computer code that can be recorded in a storage medium, or implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and downloaded through a network and will be stored in a local storage medium, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state drive, etc.; further, the storage medium can also include a combination of the above-mentioned types of memory. It can be understood that a computer, a processor, a microprocessor controller or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor or hardware, the method shown in the above embodiment is implemented.

[0177] A portion of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the form in which the computer program instruction exists in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc. Accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium that can be accessed by the computer.

[0178] Although the embodiments of the present invention have been described with reference to the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention. Such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A mass spectrometer parameter optimization method, characterized in that: The method comprises: Acquire an initialized target population, where individuals in the target population are multidimensional vectors, and the multidimensional vector is a vector composed of a combination of multiple mass spectrometer parameters; Using an improved differential evolution algorithm, iteratively updating the individuals in the target population until one of the following iterative update termination conditions is met: the number of iterations reaches a first set value, and the number of consecutive times the optimal fitness value has not been updated reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to the individuals in the latest target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual; Determining the mass spectrometer parameters of the optimal individual corresponding to the optimal fitness value as the optimal mass spectrometer parameters; The iterative updating of individuals in the target population using the improved differential evolution algorithm includes: In the current iterative update process, the individuals in the target population are divided into subpopulations according to the fitness values corresponding to the individuals to obtain multiple subpopulations; A mutation operation is performed on a target individual to obtain a corresponding mutant individual; the mutation operation used is different depending on the subpopulation to which the target individual belongs; Performing a crossover operation on the variant individual and the target individual corresponding to the variant individual to obtain a corresponding test individual; If the fitness value corresponding to the test individual is better than the corresponding target individual, the test individual is used to replace the target individual; The multiple subpopulations include a first subpopulation, a second subpopulation, and a third subpopulation, and the fitness value of the individuals in the first subpopulation is better than the fitness value of the individuals in the second subpopulation, and the fitness value of the individuals in the second subpopulation is better than the fitness value of the individuals in the third subpopulation; The step of applying a mutation operation to a target individual to obtain a corresponding mutant individual includes: If the target individual belongs to the first subpopulation, a first mutation operation is adopted, wherein the first mutation operation is: a random search is performed near the current optimal individual, and as the iteration process proceeds, the range of the random search near the current optimal individual is gradually reduced; If the target individual belongs to the second subpopulation, a second mutation operation is adopted, wherein the second mutation operation is: moving toward the current optimal individual while taking into account random direction search; If the target individual belongs to the third subpopulation, a third mutation operation is adopted, wherein the third mutation operation is: randomly generating a new individual in the global scope; The mass spectrum peak intensity value corresponding to the individual is calculated by the following method: Get the initial value of the mass axis and the initial value of the mass resolution; adjusting a first voltage value corresponding to the mass axis based on the target value and the initial value of the mass axis; obtaining a corresponding current value of the mass axis based on the adjusted first voltage value; and if a deviation between the current value of the mass axis and the target value of the mass axis does not satisfy a first termination condition, continuing to adjust the first voltage value based on the target value of the mass axis and the current value of the mass axis until a deviation between the latest current value of the mass axis and the target value of the mass axis satisfies the first termination condition; adjusting a second voltage value corresponding to the mass resolution based on the target value and the initial value of the mass resolution; obtaining a corresponding current mass resolution value based on the adjusted second voltage value; and if a deviation between the current mass resolution value and the target mass resolution value does not satisfy a second termination condition, continuing to adjust the second voltage value based on the target mass resolution value and the current mass resolution value until a deviation between the latest current mass resolution value and the target mass resolution value satisfies the second termination condition; When the deviation between the current value of the mass axis and the target value of the mass axis satisfies the first termination condition, and the deviation between the current value of the mass resolution and the target value of the mass resolution satisfies the second termination condition, the corresponding mass spectrum peak intensity value is obtained based on the current value of the mass axis and the current value of the mass resolution.

2. The method according to claim 1, characterized in that The mass spectrum peak intensity value is the intensity value of a single typical mass spectrum peak; or, The mass spectrum peak intensity values include intensity values of typical mass spectrum peaks in multiple different mass number ranges.

3. The method according to claim 1, characterized in that In the current iterative update process, the individuals in the target population are divided into subpopulations according to the fitness values corresponding to the individuals to obtain multiple subpopulations, including: Determining the number of individuals corresponding to each of the subpopulations based on the iterative stage to which the current iterative update belongs; the iterative stage is a stage divided according to the number of iterations; According to the number of individuals corresponding to each subpopulation and the fitness value corresponding to the individual, the individuals in the target population are divided into the corresponding subpopulations.

4. The method according to claim 3, characterized in that As the iterative phase progresses, the number of the individuals of the first subpopulation in the subpopulation gradually increases, and the fitness values of the individuals of the first subpopulation are better than the fitness values of the individuals of other subpopulations.

5. The method according to claim 4, characterized in that In subpopulations other than the first subpopulation, the number of individuals in the final iterative stage is less than that in the initial iterative stage.

6. The method according to claim 1, characterized in that The formula corresponding to the first mutation operation is: in, For the The first iteration The mutant individuals corresponding to the target individuals, is the current optimal individual, For the The first iteration 、 individual; , , is a constant coefficient, For is a decreasing function of the independent variable.

7. The method according to claim 6, characterized in that ,in, is the first set value.

8. The method according to claim 1, characterized in that The formula corresponding to the second mutation operation is: in, For the The first iteration The target individual The corresponding variant individuals, is the current optimal individual, For the The first iteration 、 Individuals, is a constant coefficient, For is a function of the independent variable.

9. A mass spectrometer parameter optimization device, characterized in that: The device comprises: An initialization population acquisition module is used to acquire an initialized target population, where the individuals in the target population are multidimensional vectors, and the multidimensional vector is a vector composed of a combination of multiple mass spectrometer parameters; An individual updating module is configured to iteratively update individuals in the target population using an improved differential evolution algorithm until one of the following iterative update termination conditions is met: the number of iterations reaches a first set value, and the number of consecutive times the optimal fitness value has not been updated reaches a second set value; wherein the optimal fitness value is the optimal value among the fitness values corresponding to the latest individuals in the target population, and the fitness value corresponding to the individual is determined based on the mass spectrum peak intensity value corresponding to the individual; a determination module, configured to determine the mass spectrometer parameters in the optimal individual corresponding to the optimal fitness value as the optimal mass spectrometer parameters; Wherein, the individual update module includes: a subpopulation division unit, configured to divide the individuals in the target population into subpopulations according to the fitness values corresponding to the individuals during the current iterative update process, to obtain a plurality of subpopulations; a mutation operation unit, configured to perform a mutation operation on a target individual to obtain a corresponding mutant individual; the mutation operation used is different depending on the subpopulation to which the target individual belongs; a crossover operation unit, configured to perform a crossover operation on the variant individual and a target individual corresponding to the variant individual to obtain a corresponding test individual; A selection unit, configured to replace the target individual with the test individual if the fitness value corresponding to the test individual is better than that of the corresponding target individual; The multiple subpopulations include a first subpopulation, a second subpopulation, and a third subpopulation, and the fitness value of the individuals in the first subpopulation is better than the fitness value of the individuals in the second subpopulation, and the fitness value of the individuals in the second subpopulation is better than the fitness value of the individuals in the third subpopulation; The mutation operation unit is specifically used for: If the target individual belongs to the first subpopulation, a first mutation operation is adopted, wherein the first mutation operation is: a random search is performed near the current optimal individual, and as the iteration process proceeds, the range of the random search near the current optimal individual is gradually reduced; If the target individual belongs to the second subpopulation, a second mutation operation is adopted, wherein the second mutation operation is: moving toward the current optimal individual while taking into account random direction search; If the target individual belongs to the third subpopulation, a third mutation operation is adopted, wherein the third mutation operation is: randomly generating a new individual in the global scope; The individual update module includes: An initial value acquisition unit, used for acquiring an initial value of the mass axis and an initial value of the mass resolution; a mass axis adjustment unit, configured to adjust a first voltage value corresponding to the mass axis based on a target value and an initial value of the mass axis; obtain a corresponding current value of the mass axis based on the adjusted first voltage value; and, if a deviation between the current value of the mass axis and the target value of the mass axis does not satisfy a first termination condition, continue to adjust the first voltage value based on the target value of the mass axis and the current value of the mass axis until the deviation between the latest current value of the mass axis and the target value of the mass axis satisfies the first termination condition; a mass resolution adjustment unit, configured to adjust a second voltage value corresponding to the mass resolution based on the target value and the initial value of the mass resolution; obtain a corresponding current mass resolution value based on the adjusted second voltage value; and, if a deviation between the current mass resolution value and the target mass resolution value does not satisfy a second termination condition, continue to adjust the second voltage value based on the target mass resolution value and the current mass resolution value until the deviation between the latest current mass resolution value and the target mass resolution value satisfies the second termination condition; A mass spectrum peak intensity value acquisition unit is used to acquire the corresponding mass spectrum peak intensity value based on the mass axis current value and the mass resolution current value when the deviation between the mass axis current value and the mass resolution target value meets the first termination condition and the deviation between the mass resolution current value and the mass resolution target value meets the second termination condition.

10. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the mass spectrometer parameter optimization method according to any one of claims 1 to 8 by executing the computer instructions.

11. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the mass spectrometer parameter optimization method according to any one of claims 1 to 8.

12. A computer program product, characterized in that The method comprises computer instructions for causing a computer to execute the mass spectrometer parameter optimization method according to any one of claims 1 to 8.

Citation Information

Patent Citations

  • Triple quadrupole mass spectrum automatic tuning method and device based on improved PSO (Particle Swarm Optimization) and medium

    CN115879382A

  • Method for improving parameter efficiency of multi-electrode mass analyzer based on genetic algorithm

    CN117807745A

  • Pilot frequency power control method and system based on multi-strategy differential evolution

    CN119051697A