JP2015075876A - Design support device, design support method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To present connection candidates even for a module that has no connection history with other modules.SOLUTION: In a support device of graphic programming for performing programming by connecting a plurality of modules each indicating processing and by creating a data flow, a module information extraction part extracts attribute information of a selected module and on the basis of the extracted attribute information and connection history information between modules stored in a database, a combination candidate generation part extracts a combination of the selected module and the other module within the data flow meeting a predetermined condition. Thus, even for a module that has no connection history with the other modules, connection candidates for such a module can be presented.

Description

  The present invention relates to a design support apparatus, a design support method, and a program related to graphic programming.

  In recent years, graphic programming tools for programming in a visual environment have become widespread. Graphic programming (also called visual programming or visual programming) has a feature that it is visually easy to understand. However, when programming by connecting multiple processing modules with input terminals and output terminals, the designer usually examines the input / output terminals of each module and changes the input / output terminals of one module to the input / output of another module. It is necessary to associate such as connecting to a terminal. When the number of input / output terminals in the program increased, it took a great deal of time to connect them.

  Therefore, a method of automatically presenting combinations has been proposed in order to support associations related to modules. For example, in Patent Document 1, a processing order is specified, and a generation probability of a combination between modules is calculated and output based on a connection history between an arbitrary selected module and another module. Technology has been proposed.

Japanese Patent No. 4908073

  The device described in Patent Document 1 calculates a generation probability of a combination between modules based on a connection history between an arbitrary selected module and another module. Therefore, if the selected module does not have a connection history with other modules, connection candidates for the selected module cannot be presented, and the connection between modules is inefficient. There was a problem that there was. The present invention has been made in view of such circumstances, and an object of the present invention is to be able to present connection candidates for a module even if the module has no connection history with another module. .

  A design support apparatus according to the present invention is a design support apparatus related to graphic programming which is connected to a database storing connection history information between modules indicating processing, creates a data flow by connecting the modules, and performs programming. Based on the information extraction means for extracting the attribute information of the selected module, the attribute information extracted by the information extraction means, and the connection history information between the modules stored in the database, A combination candidate generation unit that extracts a combination of the selected module and another module in the data flow that satisfies a predetermined condition is provided.

  According to the present invention, combinations between modules that satisfy a predetermined condition are extracted based on module attribute information and inter-module connection history information. Thereby, even for a module that has no connection history with other modules, connection candidates for the module can be presented, and connections between modules can be efficiently performed.

It is a figure which shows the structural example of the programming system containing the design assistance apparatus in embodiment of this invention. It is a figure which shows the processing flow in the visual programming assistance apparatus in 1st Embodiment. It is a figure which shows the example of the data flow in 1st Embodiment. It is a figure which shows the example of the connection history information in 1st Embodiment, and a combination production | generation probability. It is a figure which shows the example of the data flow in 2nd Embodiment. It is a figure which shows the example of the connection log information in 2nd Embodiment. It is a figure which shows the example of the connection history information in 2nd Embodiment, and a combination production | generation probability. It is a figure which shows the example of the data flow in 3rd Embodiment. It is a figure which shows the example of the connection history information in 3rd Embodiment, and a combination production | generation probability. It is a figure which shows the example of the data flow in 4th Embodiment. It is a figure which shows the example of the connection history information in 4th Embodiment, and a combination production | generation probability. It is a figure which shows the example of the data flow in 6th Embodiment. It is a figure which shows the processing flow of the related module search step in 6th Embodiment. It is a figure which shows the computer function which can implement | achieve the visual programming assistance apparatus in this embodiment.

Hereinafter, embodiments of the present invention will be described with reference to the drawings.
Embodiments of the present invention relate to graphic programming in which a plurality of processing modules having input terminals and output terminals are connected to create a data flow diagram and perform programming. In this embodiment, when a new module (new module) is installed on the data flow diagram in graphic programming, a combination candidate between connectable modules is output. The data flow handled in this embodiment includes a module (processing module) representing processing, an input / output terminal representing input / output of processing, and a link connecting these terminals. The module is displayed as a rectangle, with input terminals on the left and output terminals on the right. Each module has attribute information, and a search for related modules (related modules) is performed based on the attribute information.

(First embodiment)
A first embodiment of the present invention will be described.
In the first embodiment, a category indicating the concept of module processing is employed as module attribute information related to the related module search. Examples of categories include “filter processing” in the image processing field. Further, as a condition for connection between modules, it is assumed that connection cannot be made to an input / output terminal that is already connected to another input / output terminal. Also, input terminals and output terminals cannot be connected to each other, and input / output terminals that form a loop in the data flow are not connected.

  In the first embodiment, a criterion for determining whether or not a category is the same is used as a relationship determination condition when determining a candidate for a related module. If the category is the same, a candidate for a related module is used. The new module has not been connected to any module in the past and has no connection history information with other modules, but the category is given when the new module is created. In the example of the first embodiment, it is assumed that the category “AAA” is given to the new module.

  In the first embodiment, for the sake of simplicity, one input terminal and one output terminal are provided for each module, and the input / output data types, that is, the input / output terminal types are all the same. All combinations of input and output terminals that meet the conditions are valid. Further, in the first embodiment, the connection history information between modules indicates the number of times of connection with the input / output terminals of each module. Then, when outputting the combination candidates between connectable modules, all are listed without providing a threshold or the like in descending order of the combination generation probability. The order in which the generation probabilities are equal is arbitrary.

  FIG. 1 is a diagram illustrating a configuration example of a programming system including a design support apparatus according to the present embodiment. The data flow storage module 101 provides an area for storing a data flow created by the user. The database 102 stores attribute information of individual modules excluding new modules and connection history information of the modules. The input device 103 accepts instructions from the user. The display device 104 displays information necessary for creating a data flow. The display device 104 displays, for example, a data flow diagram operated by the user or a combination candidate between connectable modules. The data flow update device 105 updates the data flow of the data flow storage module 101 when a module is added to the data flow or when modules are connected in response to a user instruction.

  A visual programming support apparatus 111 as a design support apparatus in the present embodiment includes an instruction selection unit 106, a module information extraction unit 107, a combination candidate generation unit 108, and an output unit 109. The instruction selection unit 106 selects an input / output terminal of an arbitrary module in the data flow or selects a combination candidate between connectable modules in accordance with a user instruction from the input device 103. The module information extraction unit 107 extracts attribute information of the selected module. The combination candidate generation unit 108 searches for a module related to the selected module, and extracts a combination candidate between modules that satisfies a predetermined probability that a combination between the selected modules is generated. The output unit 109 outputs a combination candidate between modules.

  The host processor 110 provides auxiliary functions necessary for the operation of each device included in the programming system shown in FIG. For example, the host processor 110 adds a module to the data flow in accordance with an instruction from the input device 103 or generates data to be displayed on the display device 104. The configuration shown in FIG. 1 is an example, and the present invention is not limited to this. For example, the module information extraction unit 107 may include the instruction selection unit 106.

FIG. 2 is a diagram illustrating a processing flow in the programming system according to the first embodiment.
In input step S <b> 201, the instruction selection unit 106 selects an input / output terminal of a module for which a connection candidate is to be searched from the created data flow in accordance with a user instruction input using the input device 103. In this example, it is assumed that the output terminal 301-O of the new module 301 is selected in the data flow including the modules 301, 302, 303, and 304 as shown in FIG.

  Next, in module information extraction step S202, the module information extraction unit 107 extracts the attribute information of the module selected in input step S201. In this example, “AAA” is extracted as the category of the new module 301.

  In the related module search step S <b> 203, the combination candidate generation unit 108 searches the database 102 for related modules of the selected module based on the module attribute information extracted by the module information extraction unit 107. In the first embodiment, the criterion of whether or not the categories are the same is used as the relation determination condition related to the search for the related module. As a result of the search, as shown in FIG. 4A, among the modules registered in the database 102, modules whose category belongs to “AAA” are listed together with the connection history information. Then, the listed connection history information is aggregated to obtain connection history information of related modules. Here, as a totaling method, the total is taken for each item in the listed connection history information. The tabulated connection history information in this example is shown in FIG.

  In the combination generation step S204, the combination candidate generation unit 108 searches for an input / output terminal of a module that can be connected to the input / output terminal of the selected module, and sets it as a combination candidate between modules. This search is performed for the modules used in the data flow stored in the data flow storage module 101. In this example, the input terminals of the module a302, the module b303, and the module c304 are set as combination candidates with the output terminal 301-O of the new module 301.

  In the validity confirmation step S205, the combination candidate generation unit 108 applies the combination candidate between modules obtained in the combination generation step S204 to the connection condition between modules, and individually checks whether the connection is valid. As a result, if the combination is connectable, the process proceeds to a combination generation probability calculation step S206. If the combination is not connectable, the process returns to the combination generation step S204 to process the next combination candidate.

  In the combination generation probability calculation step S206, the combination candidate generation unit 108 calculates a combination generation probability using the connection history information of the related modules and the combination candidates between modules. The connection history information of the related modules used here is obtained in the related module search step S203, and the combination candidates between the modules are those obtained in the combination generation step S204. In this example, for example, nk is the number of connections of a combination between modules of interest, and Σni is the total number of connections of the combinations obtained in the related module search step S203, so that a combination that focuses on (nk ÷ Σni) is generated. The probability is Nk. FIG. 4C shows the combination generation probability between modules calculated according to this example. For example, since the generation probability Nk of the combination of the new module 301 and the module a302 is nk = 40 and Σni = 400, Nk = 0.1.

  In the end condition step S207, the combination candidate generation unit 108 determines whether or not the search has been completed for all combinations of connectable modules. As a result, when a search for a combination between connectable modules is completed, the process proceeds to a combination candidate generation step S208. When there are still other combinations between connectable modules, a combination generation step S204 is performed. Return to.

  In the combination candidate generation step S208, the combination candidate generation unit 108 extracts combinations between modules in which the combination generation probability calculated in the combination generation probability calculation step S206 satisfies a predetermined condition. In this example, the combinations between modules that have a generation probability of 0 or more, that is, all combinations are extracted, and all combinations that are sorted in descending order of the combination generation probability are listed as candidate combinations between modules. Output from the output unit 109. That is, according to FIG. 4C, the module b303, the module a302, and the module c304 are listed in this order, and are output as candidate combinations between modules.

  In the screen display step S209, the host processor 110 displays the information on the combination candidates between modules output in the combination candidate generation step S208 on the display device 104. In this example, for example, as shown in FIG. 3B, based on the combination candidates between modules output in the combination candidate generation step S208, the connection candidates are displayed with the connection line thickness and color changed. Here, the combination located at the top of the list is thick and the color brightness is low.

  In the confirmation step S <b> 210, the instruction selection unit 106 selects one of the combination candidates between modules displayed on the display device 104 in accordance with a user instruction input using the input device 103. Then, the data flow update device 105 connects the selected modules, and the data flow is updated as shown in FIG.

  According to the first embodiment, a category is used as module attribute information, and connection history information of a related module belonging to the same category as the selected module is used to present a connection candidate for the selected module. it can. Thereby, even if a module has no connection history with other modules, connection candidates for the module can be presented to the user and the like, and connections between modules can be efficiently performed in graphic programming. .

(Second Embodiment)
Next, a second embodiment of the present invention will be described.
In the second embodiment, an interface indicating input / output of a module is employed instead of a category as module attribute information related to a related module search. Hereinafter, description of the same parts as those of the first embodiment will be omitted, and differences from the first embodiment will be described.

  First, in the second embodiment, the number of input / output terminals included in each module is arbitrary, and the type of input / output terminals is also arbitrary. The type of the input / output terminal is shown inside the square indicating the module at a position next to the corresponding input / output terminal. In addition, as a connection condition between the modules, in the second embodiment, in addition to the conditions set in the first embodiment, a combination in which the types of input / output terminals to be connected match is effective. For example, when an output terminal of a certain module is an integer type, connection to an integer type input terminal of another module is possible.

  In the second embodiment, a criterion for determining whether or not an interface is the same is adopted as a relation determination condition when determining a candidate for a related module. If the interface is the same, the candidate is a related module. Here, an interface is defined as a combination of input / output terminals of a module.

  In the second embodiment, the connection history information between modules indicates the number of times the input / output terminals of each module are connected to each other and the information of the user used at that time. As an example, the user's assigned process is user information. It is assumed that user information of a user who operates the data flow (operation user) is given in advance, and “algorithm development” is given as user information in this example. Then, when outputting the combination candidates between connectable modules, the ones listed in descending order of the combination generation probability are output. In the second embodiment, the list of combinations when the user information registered in the module connection history information matches the user information of the operating user and the combination when the user information does not match Output what is listed in it.

The overall processing flow in the programming system in the second embodiment is the same as that in the first embodiment, and is performed according to the processing flow shown in FIG.
However, in the second embodiment, in the module information extraction step S202, the module information extraction unit 107 extracts module interface information as the attribute information of the module selected in the input step S201. In this example, in the input step S201, when the output terminal 501-O of the new module 501 is selected in the data flow including the modules 501, 502, 503, 504, and 505, as shown in FIG. To do. Therefore, as the interface of the new module 501, the input terminal 501-I1 image type (8-bit RGB type), the input terminal 501-I2 int type (32-bit integer type), and the output terminal 501-O int type (32-bit). (Integer type) information is extracted.

  In the related module search step S <b> 203, the combination candidate generation unit 108 searches the database 102 for related modules of the selected module using the criterion of whether or not the interfaces of the modules are the same as the related determination condition. As a result of the search, as shown in FIG. 6, among the modules registered in the database 102, a module having an image type input terminal, an int type input terminal, and an int type output terminal is displayed together with connection history information. Listed. Then, the listed connection history information is aggregated to obtain connection history information of related modules. The aggregation method here is the same as in the first embodiment. In this example, in order to use the number of times the input / output terminals of each module are connected to each other and the user information at the time of connection, the number of connections is totaled for each user information. The tabulated connection history information in this example is shown in FIG.

  In the combination generation step S204, in this example, the input terminals of the module a502, the module b503, the module c504, and the module h505 are set as combination candidates with the output terminal 501-O of the new module 501.

  In the validity confirmation step S205, the combination candidate generation unit 108 excludes from the list those terminals whose terminal types do not match in addition to the conditions in the first embodiment. In this example, since the type of the selected output terminal 501 -O is the int type, the type of the input terminal to be paired is excluded from the list. That is, in this example, the input terminal 502-I2 of the module a502, the input terminal 503-I2 of the module b503, and the input terminal 504-I2 of the module c504 are set as possible combination candidates.

  In the combination generation probability calculation step S206, in this example, the combination candidate generation unit 108 calculates a combination generation probability between modules for each user information. FIG. 7B shows the combination generation probability between the modules in this example, calculated according to the same formula as in the first embodiment.

  In the combination candidate generation step S208, in this example, the combination candidate generation unit 108 generates a combination candidate between modules as described below under the above-described conditions, and outputs it from the output unit 109. When the output destination modules are duplicated, the generation probabilities that are not 0 and the user information matches are preferentially left in the list, and then only those with the highest generation probabilities are left in the list.

  More specifically, with reference to FIG. 7B, the modules a502 and b503 are listed in the order of generation probabilities when the user information is “algorithm development”. Next, the module c504 is listed with the generation probability when the user information is “product implementation” because the generation probability of the user information “algorithm development” is 0. That is, as shown in FIG. 7C, the list is in the order of module b503 (user information: “algorithm development”), module a502 (user information: “algorithm development”), module c504 (user information: “product development”). Turn into. And it outputs as a combination candidate between modules.

  In the screen display step S209, in this example, as shown in FIG. 5B, for example, the connection candidates are changed in connection line thickness and color based on the combination candidates between modules output in the combination candidate generation step S208. indicate. Here, the higher the connection order, the thicker the color and the lower the lightness of the color. Also, the line type is changed depending on whether the user information matches or does not match.

  According to the second embodiment, an interface indicating input / output is used as module attribute information, and connection candidates for a selected module are presented using connection history information of related modules having the same interface. it can. Thereby, even if a module has no connection history with other modules, connection candidates for the module can be presented to the user and the like, and connections between modules can be efficiently performed in graphic programming. . In addition, by using an interface determined by input / output of processing, the user can search for related modules without giving additional information in advance, so that the user's labor can be further reduced.

  In the second embodiment described above, only the connection between the input / output terminals of the same type is permitted. However, if the combination allows the type conversion, a type converter is inserted between the connections to establish the connection. It may be allowed. For example, when the type of the output terminal is an integer type and the type of the input terminal is a real number type, the converter may be connected by inserting a converter for converting from the integer type to the real number type. In this way, leakage of connection candidates to be presented can be reduced. Further, the user's responsible process is defined as the user information, but the process is not limited to this, and any information related to the user may be used, for example, a department name to which the user belongs. Also, a plurality of information may be used as information about the user, and connection candidates can be further narrowed down.

(Third embodiment)
Next, a third embodiment of the present invention will be described.
In the third embodiment, the attribute information of the module connected to the input / output terminal of the module is employed as the attribute information of the module related to the related module search. Hereinafter, description of the same parts as those in the first and second embodiments will be omitted, and differences from the first and second embodiments will be described.

  In the third embodiment, it is assumed that one or more connections have already been made between a new module and another module, and a combination candidate between modules when an unconnected input / output terminal is connected is output. The number of input / output terminals included in each module is arbitrary, and the type of input / output terminals is also arbitrary. In addition, as a connection condition between modules, in the third embodiment, in addition to the condition set in the first embodiment, a combination in which the types of input / output terminals to be connected match is valid.

  In the third embodiment, a criterion that a module having the same combination of modules already connected to a new module is selected as a related determination condition when determining a related module candidate. In addition, the connection history information between modules indicates the number of times the input / output terminals of each module are connected to each other and information on the product category when used. The product category is a keyword for classifying products by function. For example, categories such as “digital single-lens reflex camera” and “compact camera” can be considered as product categories. Product category information for which a connection candidate is desired to be output is given in advance. In this example, “P1” is given as product category information. And when outputting the combination candidate between connectable modules, the thing which rearranged in order from the thing with a high combination production | generation probability is output. In the third embodiment, the list of combinations when the product category information matches the product category information registered in the connection history information between modules, and the combination when the product category information does not match Output the list in.

The overall processing flow in the programming system in the third embodiment is the same as that in the first embodiment, and is performed according to the processing flow shown in FIG.
However, in the third embodiment, in the module information extraction step S202, the module information extraction unit 107 extracts information as to which other module the new module is connected as module attribute information. In this example, as shown in FIG. 8, it is assumed that the output terminal 801-O of the new module 801 is selected in the data flow including the modules 801, 802, 803, 804, 805, 806. Therefore, there is information that the output terminal 805-O of the module i805 and the input terminal 801-I1 of the new module 801 are connected, and the output terminal 806-O of the module j806 and the input terminal 801-I2 of the new module 801 are connected. Extracted.

  In the related module search step S203, the combination candidate generation unit 108 lists modules having a history of connection of the modules i805 and j806 as inputs together with the connection history information. Then, the listed connection history information is aggregated to obtain connection history information of related modules. The aggregation method here is the same as in the first embodiment. In this example, in order to use the number of times the input / output terminals of each module are connected to each other and the product category information at that time, the number of connections is totaled for each product category information. FIG. 9A shows part of the connection history information of the related modules in this example, and FIG. 9B shows the connection history information after aggregation.

  In the combination generation step S204, in this example, the input terminals of the module a802, the module b803, the module c804, the module i805, and the module j806 are set as combination candidates with the output terminal 801-O of the new module 801.

  In the validity confirmation step S205, the combination candidate generation unit 108 excludes those that do not meet the conditions from the list according to the same conditions as in the second embodiment. In this example, when the output terminal 801-O of the new module 801 is connected to the input terminals of the module i805 and the module j806, a loop is formed, so the module i805 and the module j806 are excluded from the list. Therefore, the input terminals of the module a802, the module b803, and the module c804 are set as possible combination candidates.

  In the combination candidate generation step S208, the combination candidate generation unit 108 generates a combination candidate between modules under the above-described conditions and outputs it from the output unit 109 in the same procedure as in the second embodiment. Specifically, using FIG. 9C, the modules a802 and b803 are listed in the order of generation probabilities when the product category information is “P1”. Next, the module c804 is listed with the generation probability when the product category information is “P2” because the generation probability of the product category information “P1” is 0. That is, as shown in FIG. 9D, the module b803 (product category information: “P1”), the module a802 (product category: “P1”), and the module c804 (product category information: “P2”) are listed in this order. To do. And it outputs as a combination candidate between modules.

  According to the third embodiment, it is possible to search for a more appropriate related module by using information on which module the module of interest is connected to. By using the connection history information of the related modules, connection candidates for the selected module can be presented, and connections between modules can be efficiently performed in graphic programming.

(Fourth embodiment)
Next, a fourth embodiment of the present invention will be described.
In the fourth embodiment, a category is adopted as attribute information of a module related to a related module search, and connection relations of other modules in the data flow are taken into consideration. Hereinafter, description of the same parts as those in the first and second embodiments will be omitted, and differences from the first and second embodiments will be described.

  In the fourth embodiment, the number of input / output terminals included in each module is arbitrary, and the type of input / output terminals is also arbitrary. In addition, the conditions for generating a combination of connections between modules are the same as those in the second embodiment. In this example, it is assumed that modules 1002, 1003, 1004, 1005, and 1006 other than the new module 1001 are connected as shown in FIG. At this time, it is assumed that a module a1002, a module b1003, and a module c1004 are obtained as combination candidates of the new module 1001.

  In the fourth embodiment, a criterion for determining whether or not a category is the same is adopted as a related determination condition when determining a candidate for a related module, as in the first embodiment. In the example of the fourth embodiment, it is assumed that “AAA” is given as the category of the new module 1001. The connection history information between modules indicates the probability that the input / output terminals of each module are connected to each other. In addition, the information indicates which module's input / output terminal is connected to the connection destination module. And when outputting the combination candidate between connectable modules, the combination generation probability when the connection relation of the module including the connection destination module is the same is output for each connection destination module, and the generation probability is high. Output a list in order. In the fourth embodiment, the combination generation probability is set to 0 when the module connection relationship is not the same.

The overall processing flow in the programming system in the fourth embodiment is the same as that in the first embodiment, and is performed according to the processing flow shown in FIG.
Hereinafter, a description will be given with reference to FIG. Focusing on the connection between the module d1007 belonging to the category “AAA” and the module a1002 as the connection history, the output terminal of the module p1005 is connected to the input terminal of the module a1002. The output terminal of the module a1002 is connected to the input terminal of the module b1003. When there is such a processing flow (this processing flow is called a module connection order and is written as p → a → b), the probability that the module d1007 and the module a1002 are connected is 0.1. Suppose that That is, it is assumed that the conditional connection probability of the combination of the module d1007 and the module a1002 is 0.1 when the module connection order p → a → b is given. On the other hand, focusing on the connection between the module d1007 and the module b1003, it is assumed that the conditional connection probability of the combination of the module d1007 and the module b1003 is 0.2 when the module connection order a → b → c is given. . Similarly, focusing on the connection between the module d1007 and the module c1004, it is assumed that the conditional connection probability of the combination of the module d1007 and the module c1004 is 0 when the module connection order b → c → q is given. .

  In this way, the connection probability is recorded as the connection history information including the information indicating which module is connected to the module d1007, that is, the module connection order. FIG. 11A shows an example of connection probabilities of combinations of modules according to the processing flow of the modules d, e, and f belonging to the category “AAA”.

  Here, the connection probability of the related module of the new module 1001 and the module a1002, the module b1003, and the module c1004 is considered. In this example, the sum Σpi (f) of conditional probabilities when an existing module belonging to a related module is connected to a module to be noticed when the flow f is a predetermined process is noted at the time of the predetermined process flow f. It is assumed that the connection probability p (f) with the module. For example, according to the example shown in FIG. 11A, p (p → a → b) = 0.1 + 0.1 + 0.1 = 0.3. Further, p (a → b → c) = 0.2 + 0.3 + 0.1 = 0.6, and p (b → c → q) = 0 + 0.1 + 0.1 = 0.2. Further, in accordance with the above-described conditions, p (f) in the connection order of modules other than this is set to 0.

  Then, (pk (f) ÷ Σpi (fi)) is set as the generation probability Nk ′ of the combination of related modules when there is a predetermined processing flow. Here, Σpi (fi) is the total sum of the connection probabilities pi (fi) of the combination i between the modules when there is a predetermined processing flow fi. FIG. 11B shows the generation probability Nk ′ of the combination k between the modules calculated according to this example. For example, Σpi (fi) = p (p → a → b) + p (a → b → c) + p (b → c → q) = 1.1.

  In the combination candidate generation step S208, in this example, the combination candidate generation unit 108 lists modules b1003, modules a1002, and modules c904 in this order under the conditions described above, and outputs them as combinations candidates between modules. FIG. 11C shows combination candidates between the output modules.

  According to the fourth embodiment, by considering the connection relationship of modules other than the module of interest in the data flow, it is possible to search for a more appropriate related module in accordance with the processing content. . By using the connection history information of the related modules, connection candidates for the selected module can be presented, and connections between modules can be efficiently performed in graphic programming.

  In the above-described fourth embodiment, the module to which the connection destination module is further connected is considered. However, the connection destination beyond that may be considered. That is, the number of connection destinations to be considered may be sufficiently increased, and combination candidates may be presented in consideration of the entire data flow. In this way, connection candidates can be presented more appropriately.

(Fifth embodiment)
Next, a fifth embodiment of the present invention will be described.
The fifth embodiment is a case where the categories in the first embodiment described above are hierarchized. Hereinafter, description of the same parts as those of the first embodiment will be omitted, and differences from the first embodiment will be described.

  For example, when the Gaussian filter processing used in image processing is categorized into three layers, “stratification of categories” is “image processing” as the first layer, “filter processing” as the second layer, and “third layer”. Can be “Gaussian filter processing”. The first hierarchy, the second hierarchy, and the third hierarchy are defined in order from the upper hierarchy. Similarly, when the Sobel filter processing is categorized into three layers, the first layer is “image processing”, the second layer is “filter processing”, and the third layer is “Sobel filter processing”. be able to. At this time, when the Gaussian filter processing and the Sobel filter processing are compared, different categories are assigned in the third hierarchy, but the same categories are assigned in the higher hierarchy than the second hierarchy.

  In this example, the category hierarchy is three, the first hierarchy of the category of the selected module is “A”, the second hierarchy is “a”, and the third hierarchy is “1”. 1 ”. Further, it is assumed that the module “A-a-2” is registered in the database 102 of the programming system, but the module “A-a-1” is not registered.

  In the fifth embodiment, the above-described hierarchical category is adopted as the attribute information of the module related to the related module search. In addition, a criterion for determining whether or not this category is the same is adopted as a related determination condition when determining a candidate for a related module. Further, if there is no category that is the same, a criterion of whether or not a category higher by a predetermined hierarchy, for example, the upper n hierarchy of the category is the same is adopted.

The overall processing flow in the programming system in the fifth embodiment is the same as that in the first embodiment, and is performed according to the processing flow shown in FIG.
In the fifth embodiment, in the module information extraction step S202, the module information extraction unit 107 extracts the attribute information of the module selected in the input step S201. In this example, “A-a-1” is extracted as the category of the selected module. The extracted information is sent to the related module search step S203.

  In the related module search step S <b> 203, the combination candidate generation unit 108 searches the database 102 for related modules of the selected module using the relationship determination condition based on the module category extracted by the module information extraction unit 107. . In this example, since the module of category “A-a-1” is not registered in the database 102, the module of category “A-a” is searched according to the related determination condition. Since the module of category “A-a-2” registered in the database 102 is also the category “A-a”, the module of category “A-a-2” is listed together with the connection history information. Thereafter, processing is performed in the same manner as in the first embodiment, and a combination candidate between modules is output.

  According to the fifth embodiment, the information used when searching for related modules is hierarchized, so that even if the information of the layer of interest is insufficient, the information of the higher layer is referred to. Related modules can be searched, and leakage of connection candidates to be presented can be reduced. By using the connection history information of the related modules, connection candidates for the selected module can be presented, and connections between modules can be efficiently performed in graphic programming.

  In the above description, an example in which the information layer has three layers is shown, but the number of layers is not limited to this. Moreover, although the category of the module is given as an example of hierarchization, other indicators may be hierarchized. For example, the input / output terminal types may be hierarchized such as numerical type → integer type → 32-bit integer type. If the lowest type is different, a converter may be used. By doing so, leakage of connection candidates to be presented can be reduced.

(Sixth embodiment)
Next, a sixth embodiment of the present invention will be described.
In the sixth embodiment, the new module is composed of one or more existing modules. Hereinafter, description of the same parts as those of the first embodiment will be omitted, and differences from the first embodiment will be described.

  FIG. 12 is a diagram illustrating an example of a new module including a plurality of existing modules. The input terminals 1201-I1 and 1201-I2 of the new module 1201 are both connected to the input terminal of the internal module n1203 and the input terminal of the internal module o1204. Similarly, the output terminal 1201-O of the new module 1201 is connected to the output terminal 1202-O of the internal module m1202. Here, it is assumed that the category of the new module 1201 is “AAA”, and the module of the category “AAA” is not registered in the database 102. Further, it is assumed that the category of the internal module m1202 connected to the output terminal 1201-O of the new module 1201 is “BBB” and is registered in the database 102.

The overall processing flow in the programming system in the sixth embodiment is the same as that in the first embodiment, and is performed according to the processing flow shown in FIG.
In the input step S201, it is assumed that the instruction selection unit 106 selects the output terminal 1201-O of the new module 1201 shown in FIG. In module information extraction step S202, the module information extraction unit 107 extracts information of the category “AAA” of the new module 1201 as attribute information of the selected module. The extracted information is sent to the related module search step S203.

  In the related module search step S <b> 203, the combination candidate generation unit 108 searches the database 102 for related modules of the selected module using the relationship determination condition based on the module category extracted by the module information extraction unit 107. . More specifically, the internal module constituting the selected module is searched. FIG. 13 shows the flow of processing of the related module search step S203 in the sixth embodiment.

  In the condition determination step S1301, if the extracted category module is not registered in the database 102 and the internal module search is not completed, the process proceeds to the internal module search step S1302. In other cases, the process proceeds to module list-up step S1304. In this example, since the module of the category “AAA” is not registered in the database 102, the process first proceeds to the internal module search step S1302.

  In the internal module search step S1302, the internal module connected to the selected output terminal 1201-O is searched. As a result, in this example, an internal module m1202 is obtained.

  In the internal module category extraction step S1303, the module information extraction unit 107 extracts the category of the internal module m1202. As a result, information of the category “BBB” is obtained. Since the module of the category “BBB” is registered in the database 102, the process proceeds to the module list-up step S1304 through the condition determination step S1301, and the related module is listed together with the connection history information.

Finally, in the totaling step S1305, the listed connection history information is totaled in the same manner as in the first embodiment, and is output as connection history information of related modules.
Thereafter, processing is performed in the same manner as in the first embodiment, and a combination candidate between modules is output.

  According to the sixth embodiment, when a module is composed of a plurality of internal modules, the attribute information of the internal modules is used to allow the user even in modules having no connection history with other modules. On the other hand, connection candidates can be presented. Thereby, leakage of connection candidates to be presented can be reduced, and connections between modules can be efficiently performed in graphic programming.

  In the sixth embodiment, the internal module connected to the input / output terminal of interest is referred to. However, when the internal module further includes an internal module, the information may be used. It is also possible to limit the number of times that modules can be traced back in this way. By doing so, it is possible to reduce processing for searching for candidates.

  In each of the embodiments described above, it is assumed that the selected module has not been connected to any module in the past, and there is no connection history information with other modules. However, if the selected module has been connected to another module in the past and there is connection history information between modules, connection candidates may be presented based on the connection history information between the modules. That is, when connection history information between modules for the selected module exists in the database 102, combination candidates between modules may be generated based on the connection history information. On the other hand, if the connection history information between the modules for the selected module does not exist in the database 102, as shown in each of the embodiments described above, the combination candidates between modules are based on the connection history information of the related modules. Should be generated.

  Further, the module attribute information used for searching for related modules in each of the above-described embodiments may be used in combination. For example, the interfaces may be further classified by category. By using a combination of module attribute information, connection candidates can be further narrowed down. In addition, when connection history information is not found with certain attribute information, other attribute information may be used. In this way, leakage of connection candidates to be presented can be reduced.

  Further, the connection history information between modules used in the above-described embodiments may be any information. For example, a time stamp at the time of connection may be used, and it becomes possible to further narrow down connection candidates by giving priority to combinations among recently used modules. Moreover, the method for calculating the combination generation probability described above is an example, and may be arbitrarily changed.

  In addition, the conditions for outputting the combination candidates between connectable modules in each embodiment described above may be any. For example, a threshold value may be set for the combination generation probability, and a list that exceeds the threshold value may be displayed. By doing in this way, the process for searching for a connection candidate can be reduced.

  In addition, the relevance determination condition in each embodiment described above may be any. For example, in the second embodiment, the criterion of whether or not the interfaces are the same is adopted, but the criterion that a predetermined number of input / output terminals constituting the interface are the same may be adopted. . Further, for example, in the fourth embodiment, the generation probability is set to 0 if the connection relation of the modules including the connection destination module is not the same, but the connection destination module is considered hierarchically as in the fifth embodiment. The standard that the predetermined number of the same is the same may be adopted. Further, the relationship may be defined as a parameter indicating how much the modules are related, and a combination candidate may be generated based on the relationship. By doing so, leakage of connection candidates to be presented can be reduced.

(Other embodiments of the present invention)
The present invention can also be realized by executing the following processing. That is, software (program) that realizes the functions of the above-described embodiments is supplied to a system or apparatus via a network or various storage media, and a computer (or CPU, MPU, etc.) of the system or apparatus reads the program. It is a process to be executed.

  For example, the visual programming support apparatus shown in the above-described embodiment has a computer function 1400 as shown in FIG. 14, and the CPU 1401 performs the operations in the above-described embodiments. As shown in FIG. 14, the computer function 1400 includes a CPU 1401, a ROM 1402, and a RAM 1403. Further, a controller (CONSC) 1405 of the operation unit (CONS) 1409 and a display controller (DISPC) 1406 of the display (DISP) 1410 are provided. Furthermore, a hard disk (HD) 1411, a controller (DCONT) 1407 of a storage device (STD) 1412 such as a flexible disk, and a network interface card (NIC) 1408 are provided. These functional units 1401, 1402, 1403, 1405, 1406, 1407, and 1408 are configured to be communicably connected to each other via a system bus 1404.

  The CPU 1401 comprehensively controls each component connected to the system bus 1404 by executing software stored in the ROM 1402 or the HD 1411 or software supplied from the STD 1412. In other words, the CPU 1401 reads out and executes a processing program for performing the above-described operation from the ROM 1402, the HD 1411, or the STD 1412, thereby performing control for realizing the operation in each of the above-described embodiments. The RAM 1403 functions as a main memory or work area for the CPU 1401. The CONSC 1405 controls instruction input from the CONS 1409. The DISPC 1406 controls display of the DISP 1410. The DCONT 1407 controls access to the HD 1411 and the STD 1412 that store a boot program, various applications, user files, a network management program, and the processing program in each of the above-described embodiments. The NIC 1408 exchanges data with other devices on the network 1413 in both directions.

  The above-described embodiments are merely examples of implementation in carrying out the present invention, and the technical scope of the present invention should not be construed as being limited thereto. That is, the present invention can be implemented in various forms without departing from the technical idea or the main features thereof.

101: Data flow storage module 102: Database 103: Input device 104: Display device 105: Data flow update device 106: Instruction selection unit 107: Module information extraction unit 108: Combination candidate generation unit 109: Output unit 110: Host processor 111: Visual programming support device (design support device)

Claims (10)

A design support apparatus related to graphic programming that is connected to a database storing connection history information between modules indicating processing, creates a data flow by connecting the modules, and performs programming,
Information extracting means for extracting attribute information of the selected module;
Based on the attribute information extracted by the information extraction means and the connection history information between the modules stored in the database, the selected module and the data flow satisfying a predetermined condition A design support apparatus comprising: combination candidate generation means for extracting a combination with another module.   The combination candidate generating unit searches for a module related to the selected module from the database based on the attribute information extracted by the information extracting unit and a predetermined determination condition, and stores the module in the database of the searched module. The design support according to claim 1, wherein a combination of the selected module and the other module that satisfies a predetermined condition is extracted based on the stored connection history information between the modules. apparatus. The attribute information extracted by the information extraction means includes information on a category given to the module,
The said combination candidate production | generation means uses the information of the said category extracted by the said information extraction means for extraction of the combination of the said selected module and the said other module, The Claim 1 or 2 characterized by the above-mentioned. Design support device. The attribute information extracted by the information extraction means includes information on input / output terminals of the module,
The combination candidate generation unit uses the information of the input / output terminals extracted by the information extraction unit for extracting a combination of the selected module and the other module. The design support apparatus according to any one of the above. The attribute information extracted by the information extraction means includes attribute information of a module connected to an input / output terminal of the module,
The combination candidate generation unit uses attribute information of a module connected to the input / output terminal extracted by the information extraction unit to extract a combination of the selected module and the other module. The design support apparatus according to any one of claims 1 to 4.   The combination candidate generation unit extracts a combination of the selected module and the other module according to a connection relation of the module in the data flow different from the selected module. The design support apparatus according to any one of claims 1 to 5. The attribute information extracted by the information extraction means is hierarchized,
The combination candidate generation unit uses the attribute information that goes back to a predetermined upper layer when extracting a combination of the selected module and the other module. The design support apparatus according to claim 1.   The attribute information of the internal module is used as the attribute information extracted by the information extraction unit when the selected module has a plurality of internal modules. The design support apparatus according to Item 1. A design support method related to graphic programming that uses a design support apparatus connected to a database storing connection history information between modules indicating processing, creates a data flow by connecting the modules, and performs programming.
An information extraction step of extracting attribute information of the selected module;
Based on the attribute information extracted in the information extraction step and the connection history information between the modules stored in the database, the selected module and the data flow satisfying a predetermined condition And a combination candidate generation step of extracting a combination with the other module. A program for executing processing related to graphic programming for creating a data flow by connecting the module to a computer connected to a database storing connection history information between modules indicating processing,
An information extraction step of extracting attribute information of the selected module;
Based on the attribute information extracted in the information extraction step and the connection history information between the modules stored in the database, the selected module and the data flow satisfying a predetermined condition A program for causing a computer to execute a combination candidate generation step of extracting a combination with another module.

Images