Data calculation method and system suitable for biopharmaceutical production process

By establishing a configuration component library and formula library, generating electronic record templates and analyzing dependencies, the problems of complex formula configuration and low computing efficiency in the biopharmaceutical production process are solved, and efficient and accurate data calculations are achieved.

CN120012750AActive Publication Date: 2025-05-16BAIMOSI (CHENGDU) DIGITAL TECH CO LTD

Patent Information

Application Number
CN202510481519.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-04-17
Publication Date
2025-05-16
Estimated Expiration
2045-04-17

AI Technical Summary

Technical Problem

The data calculation design in the existing biopharmaceutical production process has problems such as complex formula configuration, low execution efficiency and inconvenient result management. Especially in multiple production control lines and complex formula configurations, it is easy to cause circular references to fail to calculate effective results.

Method used

By establishing a configuration component library and formula library, generating electronic record templates, and analyzing the dependencies between target formulas through the calculation formula configurator, generating a calculation link path diagram, and performing integrity and feasibility verification to ensure the legitimacy and efficiency of the calculation process.

Benefits of technology

It improves the efficiency and accuracy of data calculation in biopharmaceutical production process, simplifies the calculation path, avoids circular citation problems, and ensures the accuracy and reliability of calculation results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120012750A_ABST
    Figure CN120012750A_ABST
Patent Text Reader

Abstract

The invention provides a data calculation method and system suitable for a biopharmaceutical production process, and relates to the field of data processing.The method comprises the steps that a configuration component library is established based on biopharmaceutical production process data, and the configuration component library is used for storing calculation unit components; establishing a formula library based on biopharmaceutical production process data; generating an electronic record template based on the configuration component library and the formula library; obtaining a user operation instruction through the electronic record template; obtaining a target formula from a formula library based on the user operation instruction, and binding a calculation unit component for a variable in the target formula; the dependency relationship between the target formulas is analyzed through a calculation formula configurator, a calculation chain path diagram is generated, and integrity and execution feasibility verification is conducted on the calculation chain path diagram; after the integrity and execution feasibility verification is passed, calculation is completed based on the calculation chain path diagram, and a calculation result is output, and the method has the advantage that the efficiency and accuracy of data calculation in the biopharmaceutical production process are improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data processing, and in particular to a data calculation method and system suitable for a biopharmaceutical production process. Background Art

[0002] There are many types of calculations in the pharmaceutical production process. For example, the culture medium formula calculation needs to accurately adjust the concentration of each component according to different cell lines and culture conditions to ensure cell growth and product synthesis. For another example, when calculating material balance, it is often necessary to first count the total output and total consumption, and then calculate the overall material balance. These calculations have various forms and are interrelated, which improves reliable data calculations for production process control and quality inspection data reporting, and have the significant characteristics of time correlation, logical complexity, and repeated references. Providing various types of calculations for the production process is a very important core function of the Manufacturing Execution System (MES). Its precise and efficient operation is a necessary guarantee for achieving precise control of the entire production process and ensuring production quality.

[0003] Most of the existing MES software calculation designs use a relatively fixed and rigid design, that is, introducing / configuring the corresponding formulas and implementing the algorithms in the required calculation links or data that need to be reported. This has at least the following three problems: 1. The workload of calculation and design is large, and the same formula and algorithm are repeatedly cited; 2. The verification workload of algorithm calculation is large, and debugging and modification are troublesome; 3. Since a biopharmaceutical company has multiple complex production control lines, there will be more than 1,000 reference formulas in a complex formula configuration calculation, and there may be circular references, which will make it impossible to calculate valid results or even errors. For example, configure formula (1): A=B+C, and then configure another formula (2): B=A+D; when applying formula (1) to calculate A, substituting formula (2) into formula (1) will generate a circular reference to A and the result cannot be calculated.

[0004] Therefore, it is necessary to provide a data calculation method and system suitable for the biopharmaceutical production process to improve the efficiency and accuracy of data calculation in the biopharmaceutical production process. Summary of the invention

[0005] The present invention provides a data calculation method suitable for a biopharmaceutical production process, aiming to solve the problems of complex formula configuration, low execution efficiency and inconvenient result management in the existing calculation process, comprising: establishing a configuration component library based on biopharmaceutical production process data, wherein the configuration component library is used to store calculation unit components; establishing a formula library based on the biopharmaceutical production process data, wherein the formula library is used to store multiple formulas; generating an electronic record template based on the configuration component library and the formula library; obtaining user operation instructions through the electronic record template; obtaining a target formula from the formula library based on the user operation instructions, and binding the calculation unit components to the variables in the target formula; parsing the dependency relationship between the target formulas through a calculation formula configurator, generating a calculation chain path diagram, and performing integrity and execution feasibility checks on the calculation chain path diagram; after the integrity and execution feasibility checks are passed, completing the calculation based on the calculation chain path diagram, and outputting the calculation result.

[0006] Furthermore, the computing unit component has a unique identifier, a parameter type, a data source, and a computing logic.

[0007] Furthermore, the dependency relationship between the target formulas is parsed by the calculation formula configurator to generate a calculation chain path diagram, including: S11, constructing a topological sequence diagram for storing the identifier of the calculation unit component or formula and the index in the dependency diagram; S12, constructing a dependency diagram for recording the dependent calculation unit components of the calculation unit component or formula; S13, constructing a reverse reference mapping table for recording the reverse reference relationship corresponding to each calculation unit component; S14, inputting the current target formula or target calculation unit component; S15, based on the current target formula or target calculation unit component, updating the topological sequence diagram and the dependency diagram; S16, detecting whether the dependency chain of the current target formula or target calculation unit component forms a loop, if so, generating an abnormal prompt message and terminating the execution, if not, updating the reverse reference mapping table and executing S17; S17, judging whether all target formulas or target calculation unit components have completed the input, if so, generating a calculation chain path diagram and terminating the execution, if not, executing S18; S18, obtaining the next target formula or target calculation unit component as the current target formula or target calculation unit component and executing S14.

[0008] Furthermore, based on the current target formula or target computing unit component, the topology sequence diagram and the dependency diagram are updated, including: updating the topology sequence diagram using the unique identifier of the current target formula or target computing unit component as the key and the index in the dependency diagram as the value; updating the dependency diagram based on the unique identifier list of dependent computing unit components of the current target formula or target computing unit component.

[0009] Furthermore, the reverse reference mapping table is updated, including: constructing a bidirectional mapping tool based on the topological sequence diagram; traversing each node and its dependent nodes in the dependency graph to generate a reverse reference relationship of the node, wherein a node represents a computing unit component or formula, and based on the bidirectional mapping tool, constructing a reference mapping corresponding to each dependent node of the node and recording it in the reverse reference mapping table.

[0010] Further, detecting whether the dependency chain of the current target formula or target computing unit component forms a loop includes: detecting whether the dependency chain of the current target formula or target computing unit component forms a loop through a depth-first search algorithm.

[0011] Furthermore, a depth-first search algorithm is used to detect whether the dependency chain of the current target formula or target computing unit component forms a loop, including: establishing an access status array and a path status array, wherein the access status array is used to mark whether the node has been fully visited, and the path status array is used to mark the nodes in the current recursive path; starting with the node of the current target formula or target computing unit component, the path status array is updated, and for each adjacent node, if the adjacent node is not in the current recursive path, a depth-first search is recursively called, and if the adjacent node is in the current recursive path, it is determined that the dependency chain of the current target formula or target computing unit component forms a loop.

[0012] Further, generating a computation chain path graph includes: generating the computation chain path graph based on topological sorting.

[0013] Furthermore, based on the topological sorting, a computation chain path graph is generated, including: S21, for each node, calculating the in-degree of the node, wherein the in-degree is used to characterize the number of parameters of the target formula or target computing unit component; S22, adding all nodes with an in-degree of 0 to a queue as the starting point of the calculation; S23, taking a node from the queue, and according to the reverse reference mapping table, reducing the in-degree of the node that references the node with an in-degree of 0 by 1, if the in-degree of the node with an in-degree of 0 is 0 after reducing the in-degree of the node with an in-degree of 0 by 1, adding the node that references the node with an in-degree of 0 to the queue; S24, determining whether the queue is empty, if so, generating a computation chain path graph, if not, executing S23.

[0014] The present invention provides a data calculation system applicable to a biopharmaceutical production process, aiming to solve the problems of complex formula configuration, low execution efficiency and inconvenient result management in the existing calculation process, and applies the above-mentioned data calculation method applicable to the biopharmaceutical production process, including: a configuration component library for storing calculation unit components, wherein each of the calculation unit components has a unique identifier, a parameter type, a data source and a calculation logic, and the calculation unit components are generated based on the biopharmaceutical production process data; a formula library for storing a plurality of formulas, and the plurality of formulas are generated based on the biopharmaceutical production process data; an instruction acquirer for generating an electronic record template based on the configuration component library and the formula library, and acquiring user operation instructions through the electronic record template; a calculation formula configurator for acquiring a target formula from the formula library based on the user operation instruction, binding the calculation unit components to the variables in the target formula, parsing the dependency relationship between the target formulas, generating a calculation chain path diagram, and performing integrity and execution feasibility verification on the calculation chain path diagram; an automatic calculator for completing the calculation based on the calculation chain path diagram after the integrity and execution feasibility verification of the calculation chain path diagram are passed, and outputting the calculation result.

[0015] Compared with the prior art, the data calculation method and system applicable to the biopharmaceutical production process provided by the present invention have at least the following beneficial effects: 1. All calculations are composed of calculation unit components, so that complex calculation processes can be completed through simple combinations; this combination is achieved by using a chain calculation path generation method, which is conducive to the simplification and optimization of the calculation path when there are multiple calculation paths, thereby improving calculation efficiency; it can quickly perform checks to troubleshoot repeated references to formulas.

[0016] 2. Supports checking loops at any time during the dynamic construction of the computing chain path diagram, which is suitable for incremental configuration and modification of computing unit components. When a loop is detected, the operation is terminated immediately and clear error information is provided to reduce the difficulty of subsequent troubleshooting. Ensure that the dependency chain of each computing unit component is legal to avoid the dead loop problem of the computing link caused by loops.

[0017] 3. It can dynamically add computing unit components and check loops when adding them to ensure the correctness of the dependency chain. Dependency parsing and link generation: By building a reverse reference mapping table and calculating the in-degree, the dependency relationship between components can be clearly parsed to generate a computing chain path diagram. The links are parsed in sequence using topological sorting, and computing tasks are completed in order, supporting dynamic updates and real-time execution. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] This specification will be further described in the form of exemplary embodiments, which will be described in detail by the accompanying drawings. These embodiments are not restrictive, and in these embodiments, the same number represents the same structure, wherein: Figure 1 is a schematic flow chart of a data calculation method applicable to a biopharmaceutical production process according to some embodiments of this specification; Figure 2 is a schematic diagram of a newly added formula shown in some embodiments of this specification; Figure 3 is a schematic diagram of an electronic record template according to some embodiments of the present specification; Figure 4 is a schematic diagram of a module of a data computing system applicable to a biopharmaceutical production process according to some embodiments of this specification; Figure 5 It is a schematic diagram of a computing chain path diagram according to some embodiments of the present specification. DETAILED DESCRIPTION

[0019] In order to more clearly illustrate the technical solutions of the embodiments of this specification, the following is a brief introduction to the drawings required for the description of the embodiments. Obviously, the drawings described below are only some examples or embodiments of this specification. For ordinary technicians in this field, this specification can also be applied to other similar scenarios based on these drawings without creative work. Unless it is obvious from the language environment or otherwise explained, the same reference numerals in the figures represent the same structure or operation.

[0020] The data calculation method and system for biopharmaceutical production process described in this specification are not limited to data calculation in biopharmaceutical production process, but can also be applied to other scenarios where data calculation is required, such as chemical industry, food processing, etc.

[0021] Figure 1 is a flow chart of a data calculation method applicable to a biopharmaceutical production process according to some embodiments of this specification, such as Figure 1 As shown, the data calculation method applicable to the biopharmaceutical production process may include the following steps.

[0022] Step 110, establishing a configuration component library based on biopharmaceutical production process data.

[0023] The configuration component library is used to store calculation unit components. A calculation unit component has a unique identifier, parameter type (e.g., numeric value, text, etc.), data source (e.g., manual entry, automatic collection, etc.), and calculation logic. A calculation unit component can reference other calculation unit components to form a recursive relationship. For example, the value of a calculation unit component can be calculated by the summation formula of multiple calculation unit components.

[0024] Users can dynamically create new computing unit components based on biopharmaceutical production process data and incorporate them into component library management.

[0025] The configuration component library supports the real-time input, modification and historical record query of calculation unit components. As a basic module, the configuration component library provides parameter support for the generation of formula libraries, electronic record templates and calculation links.

[0026] Step 120, establishing a formula library based on biopharmaceutical production process data.

[0027] The formula library is used to store multiple formulas. Multiple formulas can be a set of verified formulas required for the calculation of biopharmaceutical production process data, containing information such as formula name, formula parameters, and formula calculation results. For example, the geometric mean formula: describes the concentration of drugs at different time points, which can more accurately reflect the overall trend of these concentrations and avoid the influence of extreme values. Another example is the material balance formula: a key indicator to measure whether the production process complies with the predetermined input and output rules.

[0028] Each formula describes a specific calculation logic, supports user-defined formulas and verifies their correctness, and is referenced by electronic record template configuration components.

[0029] Figure 2 is a schematic diagram of a newly added formula shown in some embodiments of this specification, such as Figure 2 As shown, the formula library supports user-defined formula structures and associates specific calculation unit components as parameters. For example, in formula C=A / B, the unique identifier of the associated calculation unit component A is 93, and the unique identifier of the associated calculation unit component B is 94.

[0030] The formula library has the ability to verify the mathematical logic and variable dependencies of the formula to ensure correctness. The defined formula can be stored in the formula library for direct call by other templates or components. The formula library supports advanced calculation logic (such as conditional branching, iterative calculation, etc.) and parameterized formula design.

[0031] Step 130, generating an electronic record template based on the configuration component library and the formula library.

[0032] The electronic record template is a framework for carrying calculation unit components and formulas, supporting flexible configuration and customization. Each electronic record template can be regarded as a virtual worksheet, containing specific calculation unit components and their associated formula logic.

[0033] Step 140, obtaining user operation instructions through the electronic record template.

[0034] Step 150, obtaining a target formula from a formula library based on a user operation instruction, and binding a calculation unit component to a variable in the target formula.

[0035] The target formula may be a formula selected by the user.

[0036] Users can freely layout calculation unit components on the electronic record template and associate related formulas. It supports adding, deleting or modifying calculation unit components in the template and updating the calculation relationship in real time.

[0037] The electronic record template provides a graphical interface where users can drag and drop calculation unit components and set their positions, associations, and calculation logic.

[0038] Different electronic record templates can be deployed and presented according to the user's actual usage scenarios. For example, Figure 3 is a schematic diagram of an electronic record template according to some embodiments of this specification, such as Figure 3 As shown, in the material balance calculation template, the user can design an electronic record template containing actual values, theoretical values ​​and their difference values, and embed calculation unit components (such as numbers 93, 92, etc.).

[0039] Step 160, the dependency relationship between target formulas is parsed by the calculation formula configurator, a calculation chain path graph is generated, and the integrity and execution feasibility of the calculation chain path graph are verified.

[0040] In some embodiments, the dependency relationship between target formulas is parsed by a calculation formula configurator to generate a calculation chain path diagram, including: S11, constructing a topology sequence graph for storing identifiers of computing unit components or formulas and indexes in the dependency graph; S12, constructing a dependency graph to record dependent computational unit components of computational unit components or formulas; S13, constructing a reverse reference mapping table to record the reverse reference relationship corresponding to each computing unit component; S14, inputting the current target formula or target calculation unit component, wherein the target calculation unit component may be a calculation unit component associated with the target formula; S15. Based on the current target formula or target computing unit component, update the topology sequence diagram and the dependency diagram; S16, detecting whether the dependency chain of the current target formula or target calculation unit component forms a loop, if so, generating an exception prompt message and terminating the execution, if not, updating the reverse reference mapping table and executing S17; S17, determine whether all target formulas or target calculation unit components have been input, if so, generate a calculation chain path diagram and end the execution, if not, execute S18; S18. Obtain the next target formula or target calculation unit component as the current target formula or target calculation unit component, and execute S14.

[0041] Specifically, building a computing chain path diagram is to express and display the dependencies between computing unit components and provide reliable storage and analysis for reference computing.

[0042] The topology sequence graph (map) is used to store the identifier of a calculation unit component or formula and its index in the dependency graph. The Key represents the unique identifier of the calculation unit component or formula, and the Value is the index of the calculation unit component or formula in the dependency graph. Through the topology sequence graph (map), you can quickly locate a node (calculation unit component or formula) and its related information.

[0043] The reverse reference mapping table (valueMap) records the reverse reference relationship corresponding to each computing unit component, so as to calculate the in-degree and generate the dependency chain later. Key represents a computing unit component, and Value is a list of components that reference the computing unit component (reverse reference).

[0044] As an example, two formulas are added one after another: A = B + C B = D + E The existence of data {A=0, B=1} in the topology sequence map means that in the dependency graph, the data referenced by A is the 0th element of the array, and the data referenced by B is the 1st element of the array.

[0045] In the dependency graph, there is data [[B,C], [D, E]].

[0046] The data {B=[A], C=[A], D=[B], E=[B]} in the reverse reference mapping table (valueMap) indicates that B is referenced by A, C is referenced by A, D is referenced by B, and E is referenced by B.

[0047] In some embodiments, based on the current target formula or target computing unit component, updating the topology sequence diagram and the dependency diagram includes: Update the topology sequence graph using the unique identifier of the current target formula or target calculation unit component as a key and the index in the dependency graph as a value; Based on the current target formula or the unique identifier list of the dependent computational unit components of the target computational unit component, the dependency graph is updated.

[0048] In some embodiments, updating the reverse reference mapping table includes: According to the topological sequence diagram, a bidirectional mapping tool is constructed; Traverse each node and its dependent nodes in the dependency graph to generate the reverse reference relationship of the nodes, where a node represents a calculation unit component or formula. Based on the bidirectional mapping tool, construct the reference mapping corresponding to each dependent node of the node and record it in the reverse reference mapping table.

[0049] In some embodiments, detecting whether a dependency chain of a current target formula or target computing unit component forms a loop includes: Through the depth-first search algorithm, we can detect whether the dependency chain of the current target formula or target computing unit component forms a loop, which can efficiently detect the loop in the computing chain path graph and ensure the legitimacy of the dependency relationship. Through loop verification, we can check whether there is a circular dependency during the construction of the computing chain path graph to avoid operation errors caused by illegal computing links.

[0050] In some embodiments, the depth-first search algorithm is used to detect whether the dependency chain of the current target formula or target computing unit component forms a loop, including: Establish a visit status array and a path status array, wherein the visit status array is used to mark whether the node has been fully visited, and the path status array is used to mark the nodes in the current recursive path; Starting from the node of the current target formula or target calculation unit component, update the path state array. For each adjacent node, if the adjacent node is not in the current recursive path, recursively call the depth-first search. Each recursion checks whether there is a cycle and marks the detection result in time. If the adjacent node is in the current recursive path, it is determined that the dependency chain of the current target formula or target calculation unit component forms a cycle, set the global flag hasCycle = true and terminate the recursion.

[0051] Specifically, the visited[] state array marks whether a node has been fully visited. visited[node] = true: indicates that the node and all its adjacent nodes have been fully visited.

[0052] The path status array onPath[] marks the nodes in the current recursive path. onPath[node]= true: indicates that the node is in the current recursive path and has not yet exited. The key to detecting a loop is to check whether the current node already exists in the path status array. During the depth-first search process, the existence of a loop is determined by checking whether the state of the onPath[] array is repeated. After the current node is traversed, it is removed from the path status array (onPath[node]=false) and the current node is marked as visited (visited[node]= true).

[0053] In some embodiments, generating a computation chain path graph includes: Based on topological sorting, a computation chain path graph is generated.

[0054] In some embodiments, generating a computation chain path graph based on topological sorting includes: S21. For each node, calculate the in-degree of the node, where the in-degree is used to characterize the number of parameters of the target formula or target computing unit component. For example, for the formula A=B+C, it can be known that the in-degree of the A node is 2. S22, add all nodes with in-degree 0 to the queue as the starting point of calculation, wherein an in-degree of 0 indicates that the node has no dependency or its dependency has been processed; S23, according to the reverse reference mapping table, take a node from the queue, reduce the in-degree of the node that references the node with in-degree 0 by 1, if the in-degree of the node with in-degree 0 is 0 after the in-degree is reduced by 1, it means that all its parameters have been determined, and the new node with in-degree 0 is added to the queue; S24, update queue; S25. Determine whether the queue is empty. If so, when the queue is empty, all nodes have completed the calculation, the calculation chain path graph is parsed, and the calculation chain path graph is generated. If not, execute S23.

[0055] For example, Figure 5 is a schematic diagram of a computing chain path diagram according to some embodiments of this specification, Figure 5 It can represent the calculation path diagram of the formulas a = b + c, c = d + e, and d = e + b.

[0056] Step 170, after the integrity and execution feasibility checks are passed, the calculation is completed based on the calculation chain path diagram and the calculation result is output.

[0057] For example, Figure 5 Taking the calculation path diagram of the formulas a = b + c, c = d + e, d = e + b as an example, the calculation is completed based on the calculation chain path diagram and the calculation results are output, including: S31, e, b computing unit component in-degree is 0, join the queue; S32, take out a computing unit component such as e from the queue, process computing unit components c and d that reference e, reduce the in-degree of computing unit component c by 1 to 1, and reduce the in-degree of computing unit component d by 1 to 1; S33, the remaining computing unit component b in the queue is taken out, and the unit components d and a of the computing unit component b are processed. The in-degree of a is reduced by 1 to 1, and the in-degree of d is reduced by 1 to 0. It is found that the in-degree of d is 0, and d is calculated to obtain the value of d and added to the queue; S34, take out d, process the computing unit component c that references d, reduce the in-degree of computing unit component c by 1 to 0, perform calculation, and after obtaining the value of c, add c to the queue; S35, take out c, process the computing unit component a that references c, reduce the in-degree by 1 to 0, calculate a, get the value of a, and add a to the queue S36. Take out a. There is no reference to be processed. The queue is empty and the calculation ends.

[0058] The user enters the initial parameters required for calculation (such as component values ​​or external data) through the interface. The completeness and legality of the input parameters are automatically checked.

[0059] After the integrity and legality of the input parameters are checked, the intermediate results and final results are calculated step by step according to the dependencies in the calculation chain path diagram, starting from the most basic calculation unit components.

[0060] For independent link branches, multi-threaded parallel computing is supported to improve execution efficiency.

[0061] When input parameters or intermediate results change, recalculation of related link nodes is triggered.

[0062] After the calculation is completed, the values ​​of all result components are displayed and a visual output is provided in the form of a chart or table.

[0063] Save all inputs, links, and output results of the calculation process to support traceability and analysis.

[0064] Figure 4 is a schematic diagram of a module of a data computing system applicable to a biopharmaceutical production process according to some embodiments of this specification, such as Figure 4 As shown, a data computing system suitable for a biopharmaceutical production process may include a configuration component library, a formula library, an instruction acquirer, a calculation formula configurator, and an automatic calculator.

[0065] A component library is configured to store computing unit components, wherein each computing unit component has a unique identifier, a parameter type, a data source, and a computing logic, and the computing unit component is generated based on biopharmaceutical production process data; A formula library for storing multiple formulas, wherein the multiple formulas are generated based on biopharmaceutical production process data; An instruction acquirer, used to generate an electronic record template based on the configuration component library and the formula library, and acquire user operation instructions through the electronic record template; The calculation formula configurator is used to obtain the target formula from the formula library based on the user's operation instructions, bind the calculation unit components to the variables in the target formula, parse the dependencies between the target formulas, generate the calculation chain path diagram, and perform integrity and execution feasibility verification on the calculation chain path diagram; The automatic calculator is used to complete the calculation based on the calculation chain path diagram and output the calculation result after the integrity and execution feasibility of the calculation chain path diagram are checked and passed.

[0066] The data computing system applicable to the biopharmaceutical production process can be used to execute the data computing method applicable to the biopharmaceutical production process, which will not be described in detail here.

[0067] Finally, it should be understood that the embodiments described in this specification are only used to illustrate the principles of the embodiments of this specification. Other variations may also fall within the scope of this specification. Therefore, as an example and not a limitation, alternative configurations of the embodiments of this specification may be considered consistent with the teachings of this specification. Accordingly, the embodiments of this specification are not limited to the embodiments explicitly introduced and described in this specification.

Claims

1. A data calculation method suitable for a biopharmaceutical production process, characterized in that: include: Based on the biopharmaceutical production process data, a configuration component library is established, wherein the configuration component library is used to store computing unit components; Based on the biopharmaceutical production process data, a formula library is established, wherein the formula library is used to store a plurality of formulas; Generate electronic record templates based on configuration component library and formula library; Obtain user operation instructions through electronic record templates; Acquire a target formula from the formula library based on a user operation instruction, and bind a calculation unit component to a variable in the target formula; The calculation formula configurator analyzes the dependencies between target formulas, generates a calculation chain path diagram, and verifies the integrity and feasibility of the calculation chain path diagram; After the integrity and execution feasibility checks are passed, the calculation is completed based on the calculation chain path diagram and the calculation results are output.

2. The data calculation method applicable to the biopharmaceutical production process according to claim 1, characterized in that: The computing unit component has a unique identifier, parameter type, data source, and computing logic.

3. The data calculation method applicable to the biopharmaceutical production process according to claim 2, characterized in that: The calculation formula configurator analyzes the dependencies between target formulas and generates a calculation chain path diagram, including: S11, constructing a topology sequence graph for storing identifiers of computing unit components or formulas and indexes in the dependency graph; S12, constructing a dependency graph to record dependent computational unit components of computational unit components or formulas; S13, constructing a reverse reference mapping table to record the reverse reference relationship corresponding to each computing unit component; S14, input the current target formula or target calculation unit component; S15. Based on the current target formula or target computing unit component, update the topology sequence diagram and the dependency diagram; S16, detecting whether the dependency chain of the current target formula or target calculation unit component forms a loop, if so, generating an exception prompt message and terminating the execution, if not, updating the reverse reference mapping table and executing S17; S17, determine whether all target formulas or target calculation unit components have been input, if so, generate a calculation chain path diagram and end the execution, if not, execute S18; S18. Obtain the next target formula or target calculation unit component as the current target formula or target calculation unit component, and execute S14.

4. The data calculation method applicable to the biopharmaceutical production process according to claim 3, characterized in that: Based on the current target formula or target calculation unit component, update the topology sequence diagram and dependency diagram, including: Update the topology sequence graph using the unique identifier of the current target formula or target calculation unit component as a key and the index in the dependency graph as a value; Based on the current target formula or the unique identifier list of the dependent computational unit components of the target computational unit component, the dependency graph is updated.

5. The data calculation method applicable to the biopharmaceutical production process according to claim 4, characterized in that: Update the reverse reference map, including: According to the topological sequence diagram, a bidirectional mapping tool is constructed; Traverse each node and its dependent nodes in the dependency graph to generate the reverse reference relationship of the nodes, where a node represents a calculation unit component or formula. Based on the bidirectional mapping tool, construct the reference mapping corresponding to each dependent node of the node and record it in the reverse reference mapping table.

6. The data calculation method applicable to the biopharmaceutical production process according to claim 5, characterized in that: Check whether the dependency chain of the current target formula or target calculation unit component forms a loop, including: Through the depth-first search algorithm, detect whether the dependency chain of the current target formula or target calculation unit component forms a loop.

7. The data calculation method applicable to the biopharmaceutical production process according to claim 6, characterized in that: Through the depth-first search algorithm, detect whether the dependency chain of the current target formula or target calculation unit component forms a loop, including: Establishing an access status array and a path status array, wherein the access status array is used to mark whether a node has been fully visited, and the path status array is used to mark nodes in the current recursive path; Starting with the node of the current target formula or target calculation unit component, update the path state array. For each adjacent node, if the adjacent node is not in the current recursive path, recursively call the depth-first search. If the adjacent node is in the current recursive path, determine whether the dependency chain of the current target formula or target calculation unit component forms a loop.

8. The data calculation method applicable to the biopharmaceutical production process according to claim 7, characterized in that: Generate a calculation chain path diagram, including: Based on topological sorting, a computation chain path graph is generated.

9. The data calculation method applicable to the biopharmaceutical production process according to claim 8, characterized in that: Based on topological sorting, a computational chain path graph is generated, including: S21. For each node, calculate the in-degree of the node, where the in-degree is used to characterize the number of parameters of the target formula or the target computing unit component; S22, add all nodes with in-degree 0 to the queue as the starting point of calculation; S23, taking a node from the queue, and according to the reverse reference mapping table, reducing the in-degree of the node that references the node with in-degree 0 by 1, if the in-degree of the node with in-degree 0 is 0 after reducing the in-degree by 1, adding the node that references the node with in-degree 0 to the queue; S24, determine whether the queue is empty, if so, generate a calculation chain path diagram, if not, execute S23.

10. A data computing system suitable for a biopharmaceutical production process, characterized in that: The data calculation method applicable to the biopharmaceutical production process according to any one of claims 1 to 9 comprises: A configuration component library is used to store computing unit components, wherein each computing unit component has a unique identifier, a parameter type, a data source, and a computing logic, and the computing unit component is generated based on biopharmaceutical production process data; A formula library, used to store a plurality of formulas, wherein the plurality of formulas are generated based on biopharmaceutical production process data; An instruction acquirer, used to generate an electronic record template based on the configuration component library and the formula library, and acquire user operation instructions through the electronic record template; A calculation formula configurator is used to obtain a target formula from the formula library based on a user operation instruction, bind calculation unit components to variables in the target formula, parse dependencies between target formulas, generate a calculation chain path diagram, and perform integrity and execution feasibility verification on the calculation chain path diagram; The automatic calculator is used to complete the calculation based on the calculation chain path diagram and output the calculation result after the integrity and execution feasibility of the calculation chain path diagram are checked and passed.

Citation Information

Patent Citations

  • Method and device for determining target mapping of quantum program to be executed and quantum computer

    CN115907023A

  • Software system dependency defect tracking method and system based on graph database

    CN119440993A

  • Framework for dependency management and automatic file load in a network environment

    US20150100879A1

Cited By

  • Real-time monitoring system for electrical parameters of production and operation of wiring harness

    CN120761761A