WO2017198198A1 - Dispositif et procédé de compilation de logiciel - Google Patents

Dispositif et procédé de compilation de logiciel Download PDF

Info

Publication number
WO2017198198A1
WO2017198198A1 PCT/CN2017/084942 CN2017084942W WO2017198198A1 WO 2017198198 A1 WO2017198198 A1 WO 2017198198A1 CN 2017084942 W CN2017084942 W CN 2017084942W WO 2017198198 A1 WO2017198198 A1 WO 2017198198A1
Authority
WO
WIPO (PCT)
Prior art keywords
item set
order
frequent
item
target
Prior art date
Application number
PCT/CN2017/084942
Other languages
English (en)
Chinese (zh)
Inventor
徐磊
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2017198198A1 publication Critical patent/WO2017198198A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformation of program code
    • G06F8/41—Compilation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor

Definitions

  • the present disclosure relates to the field of software technologies, for example, to a software compilation method and apparatus.
  • Software version compilation is an indispensable link in continuous integration. For large software systems, such as communication systems, there are often many modules, and the degree of association between modules is high. It is easy to take the whole system, often because of a module. Small modifications caused the entire system to fail to compile. Because there are many modules involved, the involved personnel are extensive, the compilation troubleshooting cycle is long, and the severe blocking continues to integrate, resulting in a high risk of software version update.
  • the present disclosure provides a software compiling method and apparatus, which can solve the problem that the manual solving of the compiling problem is difficult, and the problem of inter-module interdependence is not considered when compiling the fault.
  • a method for compiling a version software may include: determining, according to a pre-established failure information construction knowledge base, a target frequent item set in the knowledge base, wherein the failure construction information knowledge base The item set that was previously failed to be saved is saved; the effective strong association rule is determined according to the dependency relationship between the target frequent item set calculation modules; and the modules of the effective strong association are bound together to compile or simultaneously warn.
  • the method may further include: acquiring, when each compilation fails, acquiring the item set of the failed build and Add to the knowledge base.
  • determining the target frequent item set in the knowledge base according to the pre-established failure building information knowledge base may include: sequentially calculating a frequent item set of each order according to the item set in the knowledge base Calculating the support degree of each 1st order item set in the knowledge base, pruning the 1st order item set whose support degree is lower than the first threshold, and obtaining the 1st order frequent item set; according to the m-1 order frequent item set, Using lexicographic order and combination method, multiple m-1 order frequent cameras are generated to generate multiple m-th order items, and the support degree of each m-th order item set is calculated respectively, and the support degree is lower than the preset corresponding to the preset m-th order item set.
  • the m-th order item set with the support threshold is set for pruning, and the m-th order frequent item set is obtained, and when the number of m-th order frequent cameras is one, the m-th order frequent item set is determined as the target frequent item set, wherein m is A positive integer and m is greater than 1.
  • Support(X) represents the probability of the item set ⁇ X ⁇ appearing in the total item set
  • Support(X->Y) indicates that the item set ⁇ X, Y ⁇ is in the total item.
  • the probability of occurrence in the set P represents the probability
  • P(X)/P(I) represents the probability of the item set (X) appearing in the total item set
  • the support degree of the item set means that the item set appears in the total item set The probability.
  • determining the valid strong association rule according to the dependency relationship between the target frequent item set calculation modules may include: calculating a confidence level of each non-empty item set in the target frequent item set, which is lower than The non-empty item set corresponding to the confidence level of the pre-set confidence threshold is pruned to obtain a plurality of target non-empty item sets; and the plurality of target non-empty item sets are calculated according to the confidence of the plurality of target non-empty item sets The degree of lift; and the rule between multiple target non-empty item sets that determine a degree of lift greater than one is a valid strong association rule.
  • the calculating the confidence of each non-empty item set in the target frequent item set adopts the following formula:
  • the confidence Confidence (X->Y) indicates that in the case of having the item set X, the probability of having the item set Y is derived by the association rule "X->Y".
  • the lift Lift(X->Y) represents the ratio of the probability of containing the item set Y under the condition that the item set X is included, and the probability of containing the item set Y under the condition that the item set X is not included;
  • the embodiment further provides a version software compiling device, which may include: a target frequent item set determining unit, configured to determine a target frequent item set in the knowledge base according to a pre-established failure building information knowledge base, wherein The failed build information knowledge base stores the item set that is previously failed to be built; the effective strong association rule analysis unit is configured to determine the effective strong association rule according to the dependency relationship between the target frequent item set calculation modules; and the associated compilation
  • the Build Unit is set to bind the modules that are effectively strongly associated together and compile at the same time.
  • the target frequent item set determining unit may include: a first determining subunit, configured to sequentially calculate a frequent item set of each order according to the item set of the knowledge base; and second determining the subunit, configured as a calculation center Determining the support degree of each 1st order item set in the knowledge base, pruning the 1st order item set whose support degree is lower than the first threshold, and obtaining the 1st order frequent item set; and the third determining subunit, which is set according to m-
  • the first-order frequent itemsets are lexicographically ordered and combined, and multiple m-1 order frequent itemsets are generated to generate multiple m-th order items, and the support degrees of multiple m-th order items are calculated respectively.
  • the support degree is lower than m order.
  • the m-th order item set of the preset support degree threshold corresponding to the item set is pruned, and the m-th order frequent item set is obtained.
  • the m-th order frequent item set is determined as the target frequent item set. Stop calculating the m+1th order item set, where m is a positive integer and m is greater than 1.
  • the effective strong association rule analysis unit may include: a first analysis subunit, configured to calculate a confidence level of each non-empty item set in the target frequent item set, and a non-empty item lower than a preset reliability threshold The set performs pruning to obtain a plurality of target non-empty item sets; and the second analysis sub-unit is configured to calculate a degree of elevation between the plurality of target non-empty item sets according to the confidence of the plurality of target non-empty item sets; The third analysis subunit is set to determine that the rule between the plurality of target non-empty item sets having a degree of lift greater than 1 is effective Association rules.
  • the embodiment further provides a computer readable storage medium storing computer executable instructions for executing any of the above version software compilation methods.
  • the embodiment also provides a server including one or more processors, a memory, and one or more programs, the one or more programs being stored in the memory, when executed by one or more processors, Execute any of the above versions of the software compilation method.
  • the embodiment further provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer And causing the computer to execute any of the above versions of the software compilation method.
  • the version software compiling method and apparatus provided by the present disclosure automatically calculates the degree of association between modules according to a pre-established failure to construct an information knowledge base, and determines effective strong association rules; and binds the modules of effective strong association according to the effective strong association rules. Compile at the same time or at the same time. It is the most likely to achieve self-repair of the compiled project, ensuring continuous integration and reducing the risk of release. It can also save the wrong human resources when the compilation fails.
  • FIG. 1 is a flowchart of a method for compiling a version software according to an embodiment of the present invention.
  • FIG. 2 is a flowchart of a method for determining a target frequent item set according to an embodiment of the present disclosure.
  • FIG. 3 is a flowchart of an effective strong association rule analysis method according to an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a version software compiling apparatus according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a target frequent item set determining unit according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of an effective strong association rule analysis unit according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of a general hardware of a server according to an embodiment of the present disclosure.
  • the execution body of the version software compiling method is a version software compiling device, and the software compiling device may be located in a server or a terminal.
  • the version software compiling method in this embodiment may include S10-S30.
  • a target frequent item set in the knowledge base is determined according to a pre-established failure building information knowledge base.
  • the failed build information knowledge base saves the item set that was previously failed to be built, and each compiled failure module corresponds to one item set.
  • the set I of items is called an item set, the number of elements is called the length of the item set, and the item set of length k is called the k-order item set.
  • the set of tasks that are failed to build each time is a subset of the total item set I.
  • determining a target frequent item set in the knowledge base includes S101-S103 according to the pre-established failure building information knowledge base.
  • a preset support degree threshold is preset for each order item, and the preset support degree threshold may represent a minimum importance of the association rule.
  • a frequent item set may refer to a set of items whose support degree is not less than a preset support degree threshold corresponding to the order item set.
  • a frequent item set of length k can be referred to as a k-th order frequent item set.
  • the item set of each order corresponds to a preset support degree threshold of the order, and the item set pruning whose support degree is lower than the preset support threshold of the order is supported, and the support degree is greater than or equal to the preset support of the order.
  • the set of items of the degree threshold constitutes a frequent item set of the order.
  • calculating the first-order frequent item set includes: calculating a support degree of each first-order item set in the knowledge base, and performing pruning on the first-order item set whose support degree is lower than the first threshold, and supporting the degree A set of 1st order items greater than or equal to a preset support degree threshold of the 1st order item set constitutes a 1st order frequent item set.
  • Pruning means that the set of items that are less than the preset support threshold of the first-order item set is ignored.
  • the following formula may be used to calculate the support degree of the n-th order frequent itemsets:
  • Support(X) represents the probability of the item set ⁇ X ⁇ appearing in the total item set
  • Support(X->Y) indicates that the item set ⁇ X, Y ⁇ is in the total item. The probability of occurrence in the set.
  • a single module item set that is, a 1st order item set is calculated, and the first degree item set lower than the preset support degree threshold corresponding to the 1st order item set is pruned in the total item set support degree.
  • the preset support degree threshold (which may be referred to as a first threshold) corresponding to the first-order item set is 50%.
  • the knowledge base item set includes four first-order item sets, and each first-order item is calculated.
  • the corresponding support degree is set, and the first-order item set whose support degree is lower than the preset support degree threshold is pruned (as shown in FIG. 2, the first-order item set ⁇ D ⁇ is pruned), and the support degree is greater than or
  • a first-order item set equal to a preset support degree threshold corresponding to the first-order item set constitutes a first-order frequent item set ⁇ A ⁇ , ⁇ B ⁇ , ⁇ C ⁇ , and ⁇ E ⁇ .
  • the m-th order item set is generated by using the dictionary order and the combination manner, and the support degree of each m-th order item set is calculated respectively, and the preset with the support degree lower than the m-th order item set is preset.
  • the m-th order item set of the support threshold is pruned to obtain an m-th order frequent item set until the last remaining high-order frequent item set.
  • n is a positive integer and m is greater than 1.
  • dictionary order also known as Lexicographical Order
  • Lexicographical Order is a sorting method for forming sequences of random variables. Multiple random variables are compared one by one from left to right, and are arranged in order from small to large to form an ordered queue.
  • the first-order frequent itemsets ⁇ A ⁇ , ⁇ B ⁇ , ⁇ C ⁇ , and ⁇ E ⁇ are lexicographically ordered, and the process of generating a second-order item set may be: combining four first-order frequent itemsets into two.
  • the set of order terms is ⁇ A, B ⁇ , ⁇ B, C ⁇ , ⁇ C, E ⁇ , ⁇ A, C ⁇ , ⁇ B, E ⁇ and ⁇ A, E ⁇ .
  • a plurality of second-order item sets are randomly arranged, and the plurality of second-order item sets are sorted in a lexicographic order, and first, the first item sets in the plurality of second-order item sets are respectively compared by two, and The plurality of second-order item sets are reordered in order from small to large, and the second item set in the plurality of second-order item sets after reordering is compared two by two, and again in order from small to large Multiple 2nd order items are sorted.
  • the lexicographically ordered 2nd order item set is: ⁇ A, B ⁇ , ⁇ A, C ⁇ , ⁇ A, E ⁇ , ⁇ B, C ⁇ , ⁇ B, E ⁇ , ⁇ C, E ⁇ .
  • the obtained first-order frequent itemsets are ⁇ A ⁇ , ⁇ B ⁇ , ⁇ C ⁇ , and ⁇ E ⁇ .
  • the first-order frequent itemsets are generated in a lexicographic order and a combination of two and two to generate a second-order item set ⁇ A, B ⁇ , ⁇ A, C ⁇ , ⁇ A, E ⁇ , ⁇ B, C ⁇ , ⁇ B, E ⁇ , ⁇ C, E ⁇ .
  • the second-order item set whose support degree is lower than the preset support degree threshold (preset threshold value, for example, 25%) corresponding to the second-order item set is pruned, and the support degree is greater than or equal to the second-order item of the small support degree threshold.
  • the set constitutes a second-order frequent item set ⁇ A, C ⁇ B, C ⁇ , ⁇ B, E ⁇ C, E ⁇ , as shown in Table 3 below.
  • the second-order frequent itemsets ⁇ A, C ⁇ , ⁇ B, C ⁇ , ⁇ B, E ⁇ and ⁇ C, E ⁇ obtained above are generated in a combined manner and in a lexicographic order to generate a third-order item set ⁇ A , B, C ⁇ , ⁇ A, C, E ⁇ , ⁇ A, B, E ⁇ and ⁇ B, C, E ⁇ .
  • the third-order item set (for example, 25%) whose support degree is lower than the preset support degree threshold corresponding to the third-order item set is pruned, and the support degree is greater than or equal to the preset support degree threshold corresponding to the third-order item set.
  • the set of order items constitutes the 3rd order frequent itemsets ⁇ B, C, E ⁇ , as shown in Table 4 below.
  • the first-order frequent item set is the target frequent item set, and if the first-order frequent item set is more than one, according to the obtained first order Frequent itemsets, using a lexicographical order and a two-two combination method, generating a 2nd-order item set, respectively calculating the support degree of each 2nd-order item set, and pruning the 2nd-order item set whose support degree is lower than the second threshold, A 2nd order item set whose support degree is greater than or equal to the second threshold value constitutes a 2nd order frequent item set.
  • the third-order item set is continuously calculated, and the third-order frequent item set is calculated until the last remaining high-order frequent item set.
  • the second-order frequent item set is more than one, continue to calculate the third-order item set, and the calculated multiple 3
  • the support degree of the order item set is compared with the preset support degree threshold corresponding to the 3rd order item set. If the support degree of all the 3rd order item sets is less than the preset support degree threshold corresponding to the 3rd order item set, it is determined that the requirement is not met.
  • the frequent item set, the version software compilation process in this embodiment ends.
  • the effective strong association rule is determined according to the dependency relationship between the target frequent item set calculation modules.
  • determining a valid strong association rule may include S201-S203 according to a dependency relationship between the target frequent item set calculation modules.
  • a confidence level of each non-empty item set in the target frequent item set is calculated, and a non-empty item set that does not satisfy the pre-set reliability threshold is pruned.
  • the reliability threshold when the confidence level of the non-empty item set is lower than the preset reliability threshold, determining that the confidence of the non-empty item set does not satisfy the pre-set confidence threshold; when the confidence of the non-empty item set is greater than or equal to When the reliability threshold is preset, it is determined that the execution degree of the non-empty item set satisfies the preset reliability threshold.
  • the degree of lifting between the non-empty item sets is calculated according to the confidence of the non-empty item set left after the pruning.
  • the calculating the confidence of each non-empty item set in the target frequent item set may adopt the following formula:
  • the confidence Confidence (X->Y) indicates that in the case of having the item set X, the probability of having the item set Y is derived by the association rule "X->Y".
  • the calculating the degree of lifting between the non-empty item sets according to the confidence of the non-empty item set left after the pruning may be performed by using the following formula:
  • the lift degree Lift(X->Y) represents the ratio of the probability of containing the item set Y under the condition that the item set X is included, and the probability of containing the item set Y under the condition that the item set X is not included.
  • a rule that satisfies a preset support threshold and a preset reliability threshold is called a strong association rule.
  • a strong association rule a valid strong association rule and an invalid strong association rule can be divided.
  • the target frequent item set is ⁇ B, C, E ⁇
  • the confidence between the individual non-empty item sets in the target frequent item set is calculated respectively, assuming that the pre-set confidence threshold is 75%, when a single non-empty item Rules with confidence that the set is less than the pre-set confidence threshold will be pruned, as shown in Table 5 below:
  • the modules that are effectively strongly associated are combined and compiled at the same time to maximize self-healing, and the modules with effective and strong associations are combined and early warning can reduce the human resources of manual troubleshooting and improve efficiency.
  • step S20 valid strong association rules B->E and E->B are obtained.
  • B can be constructed at the same time, or module B can be notified at the same time; when the E construction fails, it can be simultaneously B linkage construction, can also notify module E at the same time, so that B and E are associated, considering the relationship between different modules, version compilation according to the effective strong association rules, can be the most self-healing, to ensure continuous integration
  • the effect is to reduce the risk of version release. Can warn when it is not self-healing Improve the efficiency of manual troubleshooting.
  • the knowledge base can be continuously updated, and the updated knowledge base can re-correct the effective strong association rules.
  • the version software compiling method provided in this embodiment automatically calculates the association degree between the modules by constructing the information knowledge base according to the pre-established failure, and determines the effective strong association rule; and binds the effective strong association modules together according to the effective strong association rule. Compile or alert at the same time. It can not only self-repair the compiled project, but also ensure continuous integration and reduce the risk of version release. It can also save the wrong human resources when the compilation fails.
  • the version apparatus may include a target frequent item set determining unit 10, an effective strong association rule analyzing unit 20, and an associated compiling building unit 30.
  • the target frequent item set determining unit 10 is configured to determine a target frequent item set in the knowledge base according to the pre-established failure building information knowledge base, wherein the failed build information knowledge base stores the item set that was previously failed to be built. .
  • the target frequent item set determining unit 10 may include: a first determining subunit 101, configured to sequentially calculate a frequent item set of each order according to the item set of the knowledge base; and second determining the subunit 102, setting To calculate the support degree of each 1st order item set in the knowledge base, pruning the 1st order item set whose support degree is lower than the first threshold to obtain a 1st order frequent item set; and the third determining subunit 103, setting According to the m-1 order frequent itemsets, the m-order itemsets are generated in lexicographic order, and the support degree of each m-th order item set is calculated separately, and the m-th order item set whose support degree is lower than the preset threshold is pruned to obtain m. The order frequent itemsets until the last remaining high-order frequent itemsets, where m is a positive integer and m is greater than 1.
  • the third determining subunit 103 may be configured to calculate an nth order frequent item set support degree by using the following formula:
  • Support(X) represents the probability of the item set ⁇ X ⁇ appearing in the total item set
  • Support(X->Y) indicates that the item set ⁇ X, Y ⁇ is in the total item. The probability of occurrence in the set.
  • the effective strong association rule analysis unit 20 is configured to determine a valid strong association rule according to the dependency relationship between the target frequent item set calculation modules.
  • the effective strong association rule analysis unit 20 may include: a first analysis subunit 201 configured to calculate a confidence level of each non-empty item set in the target frequent item set, and a non-pre-set confidence threshold The empty item set is pruned; the second analysis sub-unit 202 is configured to calculate a degree of lifting between the non-empty item sets according to the confidence of the non-empty item set left after the pruning; the third analysis sub-unit 203, The rule set to determine that a non-empty item set that satisfies a degree of lift greater than 1 is a valid strong association rule.
  • the first analysis sub-unit 201 may be further configured to: when calculating the confidence of each non-empty item set in the target frequent item set, adopt the following formula:
  • the confidence Confidence (X->Y) indicates that in the case of having the item set X, the probability of having the item set Y is derived by the association rule "X->Y".
  • the second analysis sub-unit 202 may be further configured to calculate a degree of lifting between the non-empty item sets according to the confidence of the non-empty item set left after the pruning, using the following formula:
  • the lift degree Lift(X->Y) represents the ratio of the probability of containing the item set Y under the condition that the item set X is included, and the probability of containing the item set Y under the condition that the item set X is not included.
  • the association compilation building unit 30 is arranged to bind the modules that are effectively strongly associated together to compile or simultaneously warn.
  • the modules with effective strong associations are combined and compiled at the same time to maximize self-healing, and the modules with effective strong associations are combined and early warning can reduce the human resources of manual troubleshooting errors and improve effectiveness.
  • the apparatus may further include a correction unit configured to acquire the item set of the failed build and add to the knowledge base each time the compilation fails.
  • the version software compiling apparatus provided in this embodiment automatically calculates the association degree between the modules by constructing the information knowledge base according to the pre-established failure, and determines the effective strong association rule; and binds the effective strong association modules together according to the effective strong association rule. Compile or alert at the same time. It can not only self-repair the compiled project, but also ensure continuous integration and reduce the risk of version release. It can also save the wrong human resources when the compilation fails.
  • the software may be stored in a storage medium, which may be a non-transitory storage medium, including: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (Random Access Memory, A medium that can store program codes, such as a RAM, a disk, or an optical disk, or a transitory storage medium.
  • the software may include a plurality of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform any of the methods described in the above embodiments.
  • FIG. 7 a general hardware structure diagram of a server provided in this embodiment is shown in FIG. 7.
  • the server includes: a processor 310 and a memory 320; and may also include a communication interface (Communications). Interface) 330 and bus 340.
  • Communication interface Communication interface
  • the processor 310, the memory 320, and the communication interface 330 can complete communication with each other through the bus 340. Communication interface 330 can be used for information transmission.
  • the processor 310 can call the logic instructions in the memory 320 to perform the version software compilation method of the above embodiment.
  • logic instructions in the memory 320 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the program when executed, may include a flow of an embodiment of the method described above, wherein the computer readable storage medium may be a magnetic disk, an optical disk, a read only memory (ROM), or a random access memory. (RAM), etc.
  • the computer readable storage medium may be a magnetic disk, an optical disk, a read only memory (ROM), or a random access memory. (RAM), etc.
  • the present disclosure provides a version software compiling method and device, which can implement self-repair of a compiled project, ensure continuous integration effect, and reduce the risk of version release. It is also possible to save the wrong human resources when the compilation fails.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Stored Programmes (AREA)

Abstract

La présente invention concerne un appareil et un procédé de compilation de version de logiciel. Le procédé consiste : conformément à un référentiel des informations de création défaillante pré-établi, à déterminer un ensemble d'élément fréquent cible dans le référentiel (S10), un ensemble d'élément pour chaque création défaillante précédente étant stocké dans le référentiel des informations de création défaillante ; à calculer une relation de dépendance entre des modules conformément à un ensemble d'élément fréquent cible, et à déterminer une règle de corrélation forte efficace (S20) ; et à lier ensemble les modules qui sont dans une corrélation forte efficace, afin de compiler simultanément ou de donner simultanément un avertissement rapide (S30).
PCT/CN2017/084942 2016-05-19 2017-05-18 Dispositif et procédé de compilation de logiciel WO2017198198A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610338595.0A CN107402797A (zh) 2016-05-19 2016-05-19 一种软件编译方法及装置
CN201610338595.0 2016-05-19

Publications (1)

Publication Number Publication Date
WO2017198198A1 true WO2017198198A1 (fr) 2017-11-23

Family

ID=60325739

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/084942 WO2017198198A1 (fr) 2016-05-19 2017-05-18 Dispositif et procédé de compilation de logiciel

Country Status (2)

Country Link
CN (1) CN107402797A (fr)
WO (1) WO2017198198A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111126608A (zh) * 2019-12-11 2020-05-08 北京明略软件系统有限公司 知识表示方法、装置、电子设备和计算机可读存储介质
CN111221650A (zh) * 2019-12-31 2020-06-02 青岛海尔科技有限公司 基于进程类型关联的系统资源回收方法及装置
CN111368871A (zh) * 2019-12-18 2020-07-03 中国人民解放军战略支援部队信息工程大学 多特征信息融合方法、装置及系统
CN115617698A (zh) * 2022-12-15 2023-01-17 北京航空航天大学 一种基于关联规则网络的软件缺陷度量元选择方法

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109977021A (zh) * 2019-04-02 2019-07-05 济南浪潮高新科技投资发展有限公司 一种基于关联规则分析的软件质量管理方法及系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060277526A1 (en) * 2005-06-02 2006-12-07 The Mathworks, Inc. Calling of late bound functions from an external program environment
CN103268274A (zh) * 2013-06-09 2013-08-28 浙江中控研究院有限公司 一种基于现场总线实验平台的测试方法及装置
CN104715073A (zh) * 2015-04-03 2015-06-17 江苏物联网研究发展中心 基于改进Apriori算法的关联规则挖掘系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102098175B (zh) * 2011-01-26 2015-07-01 浪潮通信信息系统有限公司 一种移动互联网告警关联规则获取方法
US9507567B2 (en) * 2014-09-09 2016-11-29 Oracle Financial Services Software Limited Facilitating use of techniques implemented by external library functions in process definitions of analytical applications

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060277526A1 (en) * 2005-06-02 2006-12-07 The Mathworks, Inc. Calling of late bound functions from an external program environment
CN103268274A (zh) * 2013-06-09 2013-08-28 浙江中控研究院有限公司 一种基于现场总线实验平台的测试方法及装置
CN104715073A (zh) * 2015-04-03 2015-06-17 江苏物联网研究发展中心 基于改进Apriori算法的关联规则挖掘系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ANONYMOUS: "Detailed solution of C++ Static Binding and Dynamic Binding", JB51.NET, 21 July 2014 (2014-07-21), XP055598207, Retrieved from the Internet <URL:http://www.jb51.net/article/52482.htm> *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111126608A (zh) * 2019-12-11 2020-05-08 北京明略软件系统有限公司 知识表示方法、装置、电子设备和计算机可读存储介质
CN111368871A (zh) * 2019-12-18 2020-07-03 中国人民解放军战略支援部队信息工程大学 多特征信息融合方法、装置及系统
CN111368871B (zh) * 2019-12-18 2023-04-07 中国人民解放军战略支援部队信息工程大学 多特征信息融合方法、装置及系统
CN111221650A (zh) * 2019-12-31 2020-06-02 青岛海尔科技有限公司 基于进程类型关联的系统资源回收方法及装置
CN115617698A (zh) * 2022-12-15 2023-01-17 北京航空航天大学 一种基于关联规则网络的软件缺陷度量元选择方法

Also Published As

Publication number Publication date
CN107402797A (zh) 2017-11-28

Similar Documents

Publication Publication Date Title
WO2017198198A1 (fr) Dispositif et procédé de compilation de logiciel
US20210304071A1 (en) Systems and methods for generating machine learning applications
US10754709B2 (en) Scalable task scheduling systems and methods for cyclic interdependent tasks using semantic analysis
EP3072070B1 (fr) Détecteur de chemins d&#39;appel
CN106294533B (zh) 使用数据库复制的分布式工作流
US9471470B2 (en) Automatically recommending test suite from historical data based on randomized evolutionary techniques
CN109857532B (zh) 基于蒙特卡洛树搜索的dag任务调度方法
Roche et al. Evaluating vaccination strategies to control foot-and-mouth disease: a model comparison study
US9262501B2 (en) Method, apparatus, and computer-readable medium for optimized data subsetting
JP2016514299A5 (fr)
JP2018511106A (ja) データ系統図のフィルタリング
US9146709B2 (en) System and method for automatic detection of decomposition errors
CN108513658B (zh) 一种事务处理方法及装置
US9747345B2 (en) System and method for identifying relationships in a data graph
WO2017165693A4 (fr) Utilisation de paramètres cliniques pour la prédiction de syndrome de réponse inflammatoire systémique
CN107784400B (zh) 一种业务模型的执行方法和装置
US20130282908A1 (en) Method and System for Deploying and Modifying a Service-Oriented Architecture Deployment Environment
US20200183740A1 (en) Data stream processing method and data stream processing system
JP6294145B2 (ja) 監視方法、監視装置および監視制御プログラム
CN110909024A (zh) 数据处理方法、装置、计算设备及流计算系统
CN106844377B (zh) 多维数据库的处理方法及装置
US10140318B1 (en) Microbatch loading
JP6954347B2 (ja) 実験計画最適化装置、実験計画最適化方法および実験計画最適化プログラム
US9274872B1 (en) Set-based bugs discovery system via SQL query
CN109344047B (zh) 系统回归测试方法、计算机可读存储介质和终端设备

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17798761

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17798761

Country of ref document: EP

Kind code of ref document: A1