WO2016072515A1 - 流れパターンの正規表現作成方法、正規表現作成装置、および、コンピュータが実行可能なプログラム - Google Patents
流れパターンの正規表現作成方法、正規表現作成装置、および、コンピュータが実行可能なプログラム Download PDFInfo
- Publication number
- WO2016072515A1 WO2016072515A1 PCT/JP2015/081402 JP2015081402W WO2016072515A1 WO 2016072515 A1 WO2016072515 A1 WO 2016072515A1 JP 2015081402 W JP2015081402 W JP 2015081402W WO 2016072515 A1 WO2016072515 A1 WO 2016072515A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- regular expression
- expression
- flow pattern
- word
- pattern
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Z—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR
- G16Z99/00—Subject matter not provided for in other main groups of this subclass
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/10—Numerical modelling
Definitions
- the present invention relates to a flow pattern regular expression creating method, a regular expression creating apparatus, and a computer-executable program.
- an optimization technique has been developed in which a fluid simulation is repeatedly performed on a structure while changing the design variable of the structure using an annealing method (simulated annealing method), a genetic algorithm method, or the like.
- the search range is inevitably limited due to these restrictions.
- the possibility that the optimal structure is locally optimal cannot be excluded. That is, there is a problem that the optimization range of the derived structure depends on where the search range is set, depending on the experience and intuition of the engineer as to where the search range is set.
- the applicant of the present application is obtained by numerical calculation or experiment in the “flow pattern word expression method, word expression device, and program (hereinafter also referred to as“ word expression theory ”)” of Patent Document 1.
- word expression theory assigns this character string to the flow and expresses the quantitative characteristics (eg, lift-drag ratio) of the flow that appears as a qualitative partial character string.
- the present invention has been made in view of the above, and a flow pattern regular expression creating method, regular expression creating device, and a new expression method capable of providing a one-to-one correspondence with a flow pattern, And it aims at providing a program.
- the present invention provides a regular expression creation method for creating a regular expression of a flow pattern in a multi-connected external region having topologically N (where N is an integer of 1 or more) holes.
- the graph representation is a tree T with a unique root, a label, and a direction with respect to the structurally stable Hamilton vector field H defined by the flow pattern.
- H (V, E) is assigned (where V is a set of points called vertices, E is a set of edges connecting the vertices), and is preferably visualized as a planar graph.
- the graph representation is such that the parent vertex is v, the child vertex is w, the label assigned to the parent vertex v is l (v), and the child vertex is w. If the assigned labels are l (w) and v's child vertex set ⁇ (v), then v's child vertex set ⁇ (v) is rearranged according to a predetermined ordering rule, and w ⁇ (v) , L (v) to l (w) are desirably drawn side by side from left to right.
- the flow pattern is (1) a suction spring out of two types of flow patterns that can be taken topologically in a single connected outer region having one hole.
- Pattern I with a pair and two ss-ad-saddle connections
- Pattern II with a pair of saddle points, a homoclinic saddle connection and two ss-saddle connections that connect it
- a pattern O that does not have a suction spring pair in a double connected external region with two holes It is desirable that the number is one or more.
- the graph creating step includes a counterclockwise ss-orbit that is closest to the suction and spring-out pair when the flow pattern has a suction and spring-out pair.
- the region is converted so that it becomes the outermost region, and the trajectory that appears in the (ss-) saddle connection diagram of the converted flow pattern is extracted from the entire region, and the trajectory that appears in the (ss-) saddle connection diagram from the entire region.
- a vertex is set for the connected component obtained by excluding all, the connected component on the outermost side is set as the root, the current component is set as the root, and the connected components that are in contact with the current component are children of the current component.
- the flow pattern defines five types of operations that can be taken topologically when one hole is added to the flow pattern, starting from one or more of the pattern words. It is desirable that the flow pattern diagram is created by repeating the operation of assigning any one of the operated words until the number of holes becomes N.
- the word expression conversion step it is possible to perform forward substitution on a regular expression of a basic type among regular expressions corresponding to a tree with a root, a label, and a direction. It is desirable to convert the allowable regular expression into the word expression.
- the word expression includes two types of flow patterns that have two holes in addition to two kinds of flow patterns that can be taken topologically in a single connected outer region having one hole.
- a pattern word that defines a total of three types of flow patterns, with the addition of a pattern that does not have a pair of suction and outflow in the externally connected region, it can be used topologically when adding one hole to the flow pattern. It is desirable that it is a symbol word formed by assigning any one of the operation words defining five types of operations to the number of added holes.
- an upper limit and a lower limit of the design parameter are set, and the upper limit and the lower limit of the design parameter are defined.
- a plurality of parameters are selected from the parameter region, and a flow experiment and / or numerical calculation is performed for each of the selected plurality of parameters, and the word expression and / or the numerical calculation is performed on the result of the experiment and / or numerical calculation.
- a design parameter selection step of assigning a regular expression and selecting a design parameter having the word expression and / or the regular expression indicating an optimum state among the assigned word expression and / or the regular expression as a candidate for the design parameter It is desirable to include.
- the design parameter selection step further includes a step of performing an optimization design using the selected design parameter.
- a transition is made from the regular expression of the current flow pattern to the regular expression of the target flow pattern. It is desirable to include a second design parameter selection step of changing the design parameter so as to select the design parameter that becomes the regular expression of the target flow pattern.
- the regular expression and word expression of the current flow pattern are changed to the regular expression and word expression of the target flow pattern. It is desirable to change the design parameters to select the design parameters that are the regular expressions and word expressions of the target flow pattern.
- the second design parameter selection step transitions from the regular expression and word expression of the current flow pattern to the regular expression and word expression of the target flow pattern.
- the present invention provides a regular expression for creating a regular expression of a flow pattern in a multi-connected outer region having topologically N (where N is an integer of 1 or more) holes.
- the present invention provides a regular expression for creating a regular expression of a flow pattern in a multi-connected outer region having topologically N (where N is an integer of 1 or more) holes.
- a program installed in a creation device a graph expression creation step for creating a graph expression corresponding to the flow pattern on a one-to-one basis, and a regular expression for creating a regular expression from the graph expression created in the graph expression creation step
- An expression creating step is executed by a computer.
- a flow pattern regular expression creation method, regular expression creation device, and program capable of providing a new expression method that can be associated with a flow pattern on a one-to-one basis are provided. There is an effect that becomes possible.
- FIG. 1 is an explanatory diagram for explaining the outline of the present invention.
- FIG. 2-A is a flowchart for explaining a flow pattern regular expression creation method according to the present embodiment.
- FIG. 2-B is a flowchart for explaining an example of the graph expression creation step of FIG. 2-A.
- FIG. 3 is a flowchart shown in the outline of the present embodiment.
- FIG. 4 is a diagram schematically showing a structure-stable flow pattern.
- FIG. 5 is a diagram describing all the characteristic trajectories (streamlines) that perform topological classification of structurally stable flow patterns in a region.
- FIG. 6 is a diagram schematically showing three types of flow patterns serving as an initial structure.
- FIG. 7 is a diagram schematically showing five types of operations for forming a structurally stable flow by adding one hole.
- FIG. 8 is a diagram showing all classifications of flow patterns when there are two structures and a uniform flow.
- FIG. 9 is a diagram showing all the flow patterns generated by the operations B 0 , B 2 , and C and the parent-child relationships excited correspondingly to the connected subset (vertex set).
- FIG. 10A is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 10-B is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 10C is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 10A is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 10-B is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 10D is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 10E is a flowchart for explaining a conversion process of a saddle connection diagram tree in the O series.
- FIG. 12 is a diagram showing the local structure of the ss-saddle connection diagram generated by the operations A 0 , A 2 , and C and the visualization of the graph expression obtained correspondingly.
- FIG. 13-A is a flowchart for explaining the conversion process to the ss-saddle connection diagram tree in the I and II series.
- FIG. 13-A is a flowchart for explaining the conversion process to the ss-saddle connection diagram tree in the I and II series.
- FIG. 13B is a flowchart for explaining the conversion process to the tree of the ss-saddle connection diagram in the I and II series.
- FIG. 13-C is a flowchart for explaining the conversion process to the tree of the ss-saddle connection diagram in the I and II series.
- FIG. 13-D is a flowchart for explaining the conversion process of the ss-saddle connection diagram tree to the I and II series.
- FIG. 14A is a diagram showing a graph expression of a structurally stable streamline pattern having the word expression IA 0 C and its regular expression.
- FIG. 14B is a flowchart for explaining a process of converting a tree into a regular expression.
- FIG. 15 is a diagram showing five fundamental types TN and regular expressions N corresponding to the five fundamental types TN .
- FIG. 16 is a diagram showing a list of 14 forward replacements.
- FIG. 17 is a diagram showing changes in forward replacement and streamline structure when operations A 0 , A 2 , and C are performed.
- FIG. 18 shows excitation along with the change in streamline structure obtained when operations B 0 , B 2 , and C are applied to the closed orbit included in the simple connected components ⁇ 0 and ⁇ 2 in the (ss-) saddle connection diagram. It is a figure for demonstrating forward replacement of the regular expression to do.
- FIG. 16 is a diagram showing a list of 14 forward replacements.
- FIG. 17 is a diagram showing changes in forward replacement and streamline structure when operations A 0 , A 2 , and C are performed.
- FIG. 18 shows excitation along with the change in streamline structure obtained when operations B 0 , B 2 , and C are applied to the closed orbit included in the simple connected components ⁇
- FIG. 19 is a diagram illustrating a list of backward replacement [B 2 ], [B 0 ], and [C] of regular expressions induced by the reverse operation of the operations B 0 , B 2 , and C.
- FIG. 20 is a diagram illustrating a backward replacement of a regular expression corresponding to a change in the local streamline structure in the (ss-) saddle connection diagram.
- Figure 21 is a regular expression o ⁇ (o 2 (o 2 (o 0 (- 0 (- 0, - 0))), + 2 (+ 2)) of the structural stability Hamiltonian vector field with ss-saddle It is a figure which shows connection diagram.
- FIG. 22-A is a flowchart for explaining a process of converting a regular expression into a word expression.
- FIG. 22-B is a flowchart for explaining a process of converting a regular expression into a word expression.
- FIG. 22-C is a flowchart for explaining a process of converting a regular expression into a word expression.
- FIG. 23 is a block diagram illustrating an example of a regular expression creation device to which the exemplary embodiment is applied.
- FIG. 24 is a flowchart for explaining a method of designing an object in a fluid using word expressions and regular expressions.
- FIG. 25 is a diagram for explaining an example of a specific example for explaining a method for designing an object in a fluid using word expressions and regular expressions.
- FIG. 26 is a diagram for explaining an example of a specific example for explaining a method for designing an object in a fluid using word expressions and regular expressions.
- FIG. 27 is an explanatory diagram for explaining a method for optimizing a flow around an object in a fluid using word expressions and regular expressions.
- FIG. 28 is an explanatory diagram for explaining a method for optimizing a flow around an object in a fluid using word expressions and regular expressions.
- FIG. 29 is a flowchart for explaining an example of a method for optimizing a flow around an object in a fluid using word expressions and regular expressions.
- FIG. 1 is an explanatory diagram for explaining the outline of the present invention.
- Patent Document 1 International Publication No. 2014/041917, Japanese Patent Application No. 2012-203601, PCT / JP2013 / 070939
- this character string is given to the flow pattern obtained by numerical calculation and experiment, and the word expression that expresses the quantitative characteristic (for example, lift-drag ratio) of the flow that appears there as a qualitative partial character string.
- a theory was proposed.
- Patent Document 1 has already filed a method for creating a word expression from a flow pattern (P1).
- a method for creating a fluid transition path from a word expression (P2) has been filed.
- a unique word expression can be given to the flow pattern, but a plurality of different flow patterns correspond to the character string given in the word expression. Therefore, in the flow pattern regular expression creating method of the present embodiment, a graph expression corresponding to the flow pattern is created one-to-one (T1), and a regular expression is created from the graph expression (T2).
- T3 regular expression is created from the regular expression (T3).
- the fluid transition path can be created directly from the word expression. Furthermore, in the flow pattern regular expression creation method of the present embodiment, the fluid transition path can also be created directly from the regular expression (T4).
- FIG. 2A is a flowchart for explaining the outline of the flow pattern regular expression creation method according to the present embodiment.
- the regular expression creation method of the flow pattern according to the present embodiment is based on topologically N (where N is an integer of 1 or more) holes in a multi-connected outer region.
- a regular expression of a flow pattern is created, and is roughly divided into a graph expression creation process (step S1) for creating a graph expression corresponding to a flow pattern on a one-to-one basis, and a graph expression creation process of step S1.
- a regular expression creating step (step S2) for creating a regular expression from the graph expression; and a word expression converting step (step S3) for converting the regular expression created in the regular expression creating step of step S2 into a word expression.
- V is called a vertex
- a set of points, E is a set of edges connecting vertices) and may be visualized as a planar graph.
- the graph representation is such that the parent vertex is v, the child vertex is w, the label assigned to the parent vertex v is l (v), and the label assigned to the child vertex w is l (w), v.
- the child vertex set ⁇ (v) is used, the child vertex set ⁇ (v) of v is rearranged according to a rule of a predetermined order relation, and from w ( ⁇ ) to l (w) for w ⁇ (v). You may include what was drawn with the arrow arranged from left to right.
- the flow patterns are (1) two ss- ⁇ -saddle connections, which have a suction-and-out pair of two types of flow patterns that can be taken topologically in a single connected outer region having one hole.
- One or more pattern words consisting of a pattern II having a homoclinic saddle connection and two ss-saddle connections, and (3) a pattern O having no suction spring-out pair in a double-connected external region having two holes. It may be.
- the word representation does not have a suction-out pair in a double connected outer region with two holes.
- the operation words that define the five types of operations that can be taken topologically when adding one hole to the flow pattern with respect to the pattern words that define a total of three types of flow patterns with added patterns It is good also as a symbol word formed by giving any one word by the number of the added holes.
- FIG. 2-B is a flowchart for explaining an example of the graph expression creation process of FIG. 2-A.
- the graph expression creation process first, when the flow pattern has a suction-and-out pair, the region including the counterclockwise ss-orbit closest to the suction-and-out pair is the first. Conversion is performed so as to be in the outer region (step S31).
- the flow pattern starts from one or more of the above-described pattern words, and is one of the operation words that define five types of operations that can be taken topologically when a hole is added to the flow pattern. It is good also as a flow pattern figure with the number of the holes created by repeating the operation which provides a word until the number of holes becomes N pieces.
- the route of the ss-saddle connection diagram (flow pattern diagram) of I-word and II-word is converted as shown in FIG.
- the trajectory that appears in the (ss-) saddle connection diagram of the converted flow pattern is extracted from the entire region (step S32).
- a vertex is set to the connected component obtained by excluding all trajectories appearing in the (ss-) saddle connection diagram from the entire region, and the outermost connected component is set as the root (step S33).
- the current component is set as the root (step S34).
- a connected component that touches the boundary with the current component is a child of the current component, labels are assigned according to the trajectory corresponding to the boundary, and they are arranged in accordance with a predetermined label order relationship (step S35).
- the child of the current component is set as the current component, and step S35 is repeatedly executed until there are no more children (step S36).
- the flow pattern regular expression creation method of the present embodiment may execute a design parameter selection step of selecting design parameter candidates for an object in a fluid.
- a design parameter selection step for example, when selecting a design parameter candidate for an object in a fluid, an upper limit and a lower limit of the design parameter are set, and a parameter region defined by the upper limit and the lower limit of the design parameter is set. A plurality of parameters are selected, and a flow experiment and / or numerical calculation is performed for each of the selected parameters, and the word expression and / or the regular expression is used for the result of the experiment and / or numerical calculation.
- a design parameter having the word expression and / or the regular expression indicating an optimal state may be selected as the design parameter candidate.
- the design parameter selection step may further include a step of performing optimization design using the selected design parameter.
- the flow pattern regular expression creation method of the present embodiment may execute a second design parameter selection step of selecting a design parameter for an object in a fluid.
- the second design parameter selection step for example, when the optimum design parameter is selected for an object in the fluid, the current flow pattern regular expression is changed to the target flow pattern regular expression.
- the design parameter may be changed to a design parameter that is a regular expression of the target flow pattern.
- the word expression is used in addition to the regular expression so that the current flow pattern regular expression and word expression are changed to the target flow pattern regular expression and word expression.
- the design parameter may be changed, and a design parameter that becomes a regular expression and a word expression of the target flow pattern may be selected.
- one or a plurality of paths for transitioning from the current flow pattern regular expression and word expression to the target flow pattern regular expression and word expression are acquired, and the acquired 1 Or, select a path that can be transitioned from the current flow pattern by changing the design parameter among multiple paths, and change the design parameter around the changed design parameter for the selected path. You may decide to select the design parameter used as the regular expression and word expression of a flow pattern.
- FIG. 3 is a flowchart showing an outline of the word expression algorithm.
- step SA-1 in order to form a word representation of the flow pattern in a connected external region having N holes topologically, topologically in a single connected external region having one hole.
- a pattern word that defines a total of three types of flow patterns for example, I, II, O is assigned (step SA-1).
- an operation word defining five types of operations that can be taken topologically when adding one hole to the flow pattern with respect to the word given in step SA-1 (for example, , A 0 , A 2 , B 0 , B 2 , C) (Step SA-2), and repeats the process of Step SA-2 until the number of holes becomes N
- step SA-3 a word expression corresponding to the connected external region having N holes is formed.
- the pattern word assignment (step SA-1) is performed first and the operation word assignment (step SA-2) is performed later.
- the present invention is not limited to this, and the operation word assignment is performed first.
- the pattern word may be given later.
- the “connected external region” is an expression including a single connected external region and a multiple connected external region
- the “single connected external region” is in two dimensions (plane).
- a region is a region with a single hole
- a “multiple connected external region” is a region in two dimensions (plane) with a plurality of holes.
- the expression “hole” here is a mathematical abstract expression, but various expression forms may be applied. For example, when focusing on a uniform flow that occurs relatively when a vehicle moves, if there is one or more structures on the cross-section of the vehicle along the uniform flow, the region is simply It can be treated as a connected external region or a multiple connected external region.
- one or more holes and a single connection or multiple connection Can be treated as a connected external region.
- a flow such as “one or more obstacles in the flow” is treated as a flow in the connected external region in this embodiment.
- an isolated vortex structure or a flow structure (such as an elliptical stopping point) having a periodic orbit around it can be regarded as a “hole”.
- Topological is a technical term in mathematics and refers to a field of geometry, also called topology (topology).
- topology topology
- triangles and quadrilaterals are considered to be different figures due to the difference in the number of their corners, but from the viewpoint of topological geometry, triangles and quadrilaterals can move to each other by deforming rubber bands, for example.
- topology topology
- the connected external region is expressed as D ⁇ (M) with respect to the number of holes M + 1. For example, when there is only one hole, it is a single connected external region D ⁇ (0), and when there are two holes, it is a double connected external region D ⁇ (1).
- topological structure a specific structure that characterizes the flow
- Those that cannot be deformed by continuous (ie, not cut or stuck) deformation of a particular structure are considered different flows.
- An uncompressed flow may be handled as the “flow” in the present embodiment.
- the incompressibility of a fluid refers to a property that hardly changes its volume even when force is applied. When we consider normal water and air flow on the scale of daily life, it is generally safe to consider this flow framework. Note that the present invention is not limited to this, and a compressible flow may be handled in calculation.
- the fluid in the present embodiment may be handled as a non-viscous fluid.
- An inviscid fluid can treat the boundary condition as a “slip condition”.
- the boundary condition is the “zero boundary condition”.
- the word conversion algorithm for non-viscous fluids may be described in particular, but this embodiment can also be applied to viscous fluids by appropriate boundary expansion.
- FIG. 4 is a diagram schematically showing a flow pattern.
- FIG. 4C schematically shows a boundary having four ⁇ 4-saddle points (the definition will be described later).
- the vortex is an element that creates a flow rotating around it.
- the uniform flow is a basic flow in terms of river flow, and is a flow that crosses the entire region.
- the uniform flow is a flow such as a relative air flow or a water flow as viewed from an observer riding on the vehicle. That is, in the coordinate system of the moving object, even if air or water is actually stationary, it is possible to imagine the relative flow that flows from the infinity point.
- the element that constitutes a uniform flow is called a 1-source-sink point, and the correctness of the rule can be proved mathematically.
- a plane may be projected onto a spherical surface by a projection method called stereographic projection (stereo projection / stereo projection) in mathematics.
- stereographic projection stereo projection / stereo projection
- the uniform flow has a flow structure such as a flow source and a suction pair in the spherical north pole, and it can be mathematically shown to correspond to the flow field as shown in FIG.
- the position of the north pole and the south pole can be appropriately shifted using the fact that the spherical surface has a highly symmetric shape, so the point at infinity is the south pole,
- a flow as shown in FIG. 4B can be obtained near the origin corresponding to the south pole.
- the flow field of the entire plane can be expressed as a bounded area having a shape as shown in FIG.
- D ⁇ (M) is moved to the unit circle outer region by selecting the pair of suction and spring at infinity point as the origin and one of M + 1 boundaries by this conversion method.
- a connected region inside a unit circle including M boundaries inside is sometimes written as D z (M). All subsequent descriptions are made using this D z (M). Therefore, the expression as shown in FIG. 4B is equivalent to a flow in which a uniform flow is contained in the entire plane through an appropriate projection method. In the description of the present embodiment, it is convenient to schematically show the flow, and therefore, it may be expressed in the drawing using such a projection method.
- FIG. 5 is a diagram describing all the characteristic trajectories (streamlines) that perform topological classification of the structure-stable flow in such a connection region D z (M).
- ss-orbit the trajectory returning from the pair of suction and outflow and returning to itself.
- Fig. 5 (b) the trajectory that exits the pair of suction and outflow and connects to the boundary is called ss- ⁇ -saddle connection, and the trajectory is connected as shown in Fig. 5 (c).
- the point on the border is called ss- ⁇ -saddle.
- FIG. 5 (e) the trajectory leading out from a point on a certain boundary and leading to a point on the same boundary, not from a pair of suction and outflow, is called ⁇ -saddle connection, and FIG. 5 (d) The points on the boundary connected by this are called ⁇ -saddle.
- a hyperbolic stop point not on the boundary as shown in FIG. 5 (h) is called a saddle point (saddle point).
- the trajectory leading to this saddle point is called ss-saddle connection.
- a closed curve orbit that creates a boundary or a vortex is called a closed orbit
- Fig. 5 (i) a trajectory that leaves the saddle point and returns to itself. It is called homoclinic saddle connection. It can be mathematically proved that the target structurally stable flow can only be expressed by a combination of these trajectories.
- step SA-2 in the above-described step SA-2, one hole and the flow structure associated therewith are added to the flow of the connected external region D z (M ⁇ 1) having M holes.
- the flow field of many multiple connected external regions D z (M) is constructed recursively. Therefore, the simplest hole is a single connected external region D z (0) or a double connected external region D z (1), which is the initial structure of these inductive structures given in step SA-1 ing.
- FIG. 6 is a diagram schematically showing three types of structure-stable flow patterns as an initial structure.
- FIGS. 6A and 6B there are two types of flows, a pattern I and a pattern II, in which a hole is in one single connected external region D z (0). Both of these patterns have a pair of suction and spring, and it can be proved mathematically that there are only these two types.
- the double-coupled outer region D z (1) is composed of these, but does not have a suction-and-out pair. Is not constructed from here, the initial flow necessary for constructing the flow is the pattern O schematically shown in FIG. 6 (c).
- step SA-2 the five types of operations that can be taken topologically are: 1) A 0 operation that replaces one ss-orbit with one saddle point, a homoclinic saddle connection that connects the ss-orbit and a hole inside, and two ss-saddle connections.
- FIG. 7 is a diagram schematically showing five types of operations for forming a structurally stable flow by adding one hole.
- operation A 0 and A 2 is performed for a single ss-orbit. Further, as shown in FIG. 7 (b), the operation B 0 and B 2 is performed for a single closed orbit. Further, as shown in FIG. 7C, the operation C is performed on the boundary already having ⁇ -saddle. It can be mathematically proved that there are only five types of operations that enable such a process while maintaining structural stability.
- a flow pattern diagram obtained by repeating this step is referred to as ss-saddle connection diagram when starting from patterns I and II, and as a saddle connection diagram when starting from pattern O.
- FIG. 8 is a diagram showing the entire classification of the structure-stable flow pattern when there are two structures and a uniform flow. As shown in FIG. 8, all the flow patterns in the double connected region D z (1) are given to the patterns I and II of the initial structure in the single connected external region D z (0) by assigning operation words. Can be described. However, all the flow patterns shown in FIG.
- the constraints will be described as follows. That is, as described above with reference to FIG. 7, since the operations A 0 and A 2 are performed on one ss-orbit, the presence of one ss-orbit is indispensable as a premise for performing this operation. It becomes. Further, since the operations B 0 and B 2 are performed on one closed orbit, the presence of one closed orbit is indispensable as a premise for performing this operation. Further, since the operation C is performed on a boundary having two or more ⁇ -saddles, the presence of a boundary having ⁇ -saddles is indispensable for performing this operation. Therefore, the rules for arranging the pattern words are different depending on where the pattern words are started from I, II, and O. The rules for arranging the character strings starting from the pattern words I, II, and O, which are derived based on the above constraint conditions, will be described below.
- Such a character string is called an O-series word (O-word), and the correctness of the rule can be mathematically proved.
- O-word O-series word
- I-1 Operations that can be performed are all of A 0 , A 2 , B 0 , B 2 , and C.
- I-2 the word expression starting from I lists these five types of operation words.
- I-2) In order to include the word B 0 or B 2 in the word expression of the operation sequence, C or A 0 must always exist before that.
- I-word Such a character string is called an I-series word (I-word), and the correctness of the rule can be mathematically proved.
- Such a character string is called a II-series word (II-word), and the correctness of the rule can be mathematically proved.
- the graph T (V, E) is a set given as a pair of a set of points (vertex set) called “vertex” V and a set E called “edge” connecting the vertices. It is.
- a graph can have various structures, but in the graph representation theory of the present embodiment, the following set of graphs having a specific structure in the entire set of graphs is considered.
- Tree and tree refer to a graph in which two arbitrary vertices are connected only by one edge.
- a routed graph refers to a graph in which a specific vertex (hereinafter referred to as a root) exists.
- a root a specific vertex
- “Directed” means that all edges have a parent-child order.
- the edge from the vertex v ⁇ V to w ⁇ V in the directed graph is expressed as v ⁇ w ⁇ E.
- v is called the parent of w and w is called the child of v.
- Write ⁇ (v) to represent the set of all children of vertex v ⁇ V. That is, ⁇ (v): ⁇ w ⁇ V
- the number of child vertices # ⁇ (v) included in the set is called v out-degree, and conversely, the number of edges entering v is called v in-degree.
- a graph is labeled as being labeled with a specific label assigned to all vertices.
- a tree with root, label, and orientation is considered. Further, the root is considered to be a vertex where in-degree is zero, that is, there is no incoming edge.
- the vertex label any one of ⁇ o ⁇ , o 0 , o 2 , + ⁇ , + 0 , + 2 , ⁇ , ⁇ 0 , ⁇ 2 ⁇ is assigned.
- the label is o ⁇ (o 0, o 2 , + ⁇ , + 0, + 2, - ⁇ , - 0, or - 2) a subset of the vertex set has become Vo ⁇ (Vo 0, Vo 2 , V + ⁇ , V + 0 , V + 2 , V ⁇ ⁇ , V ⁇ 0 , or V ⁇ 2 ).
- V the label assigned to the vertex.
- the following set is defined.
- Vo Vo ⁇ ⁇ Vo 0 ⁇ Vo 2
- V + V + ⁇ ⁇ V + 0 ⁇ V + 2
- V- V- ⁇ ⁇ V- 0 ⁇ V- 2
- V 0 Vo 0 ⁇ V + 0 ⁇ V- 2
- V 2 Vo 2 ⁇ V + 2 ⁇ V- 2
- ⁇ symbols represent a disjointed union.
- ⁇ (v) can be divided into a child vertex set of vertex v as follows.
- H a structurally stable Hamiltonian vector field expressed by O-word on the two-dimensional region D z (M), and let D be its saddle connection diagram.
- a set C H D z (M) ⁇ D consisting of several connected components (including infinite periodic orbits) is an open set. it can.
- Each connected component is set as a vertex set V. Apex of the root is a connected component in the outermost of these connected components, when periodic orbits included as the label is counterclockwise + phi, when a clockwise - assign phi.
- FIG. 9 shows all streamline patterns generated by the operations B 0 , B 2 , and C, and the parent-child relationships excited correspondingly to the connected subset (vertex set).
- (A) is B 0
- (b) is B 0
- (c) is B 0 B 0
- (d) is B 2 C k ⁇ 1 , k ⁇ 1
- (e) is B 2 C 1 , l ⁇ 1
- (F) is B 2 C k + l ⁇ 1 , k, l ⁇ 1
- (g) is B 0 B 2 C k , k ⁇ 1
- (h) is B 0 B 2 C l , l ⁇ 1.
- v represents a parent connected subset, and its child connected subset is expressed as w, y, z, and the like. Since the broken line represents a set of parent connected parts, only one periodic trajectory included therein is drawn with a direction.
- FIG. 9 (a) can be constructed character pattern outward 8 made by the operation B 0.
- the number of elements included in the set of child connected components is # ⁇ + 0 (v), # ⁇ -0 (v) ⁇ 2, and any non-negative integer can be selected for the child vertex sets # ⁇ + 2 (v) and # ⁇ - 2 (v).
- the order is cyclically arranged with respect to the connected portion written as j in FIG. That is, a specific connected portion is selected as y 1 from these, and thereafter the connected components are arranged counterclockwise.
- the child connected components written as j j can be simply arranged counterclockwise.
- N a set of non-negative integers
- N ⁇ a set of finite sequences of non-negative integers
- ⁇ ⁇
- G a tree
- s, s ′, t, u vertex ids
- T a subset of vertex ids.
- FIGS. 10A to 10E are flowcharts for explaining the conversion process of a saddle connection diagram to a tree in the O series.
- the conversion process to the tree of the saddle connection diagram in the O series shown in FIGS. 10-A to 10-E can be executed by a device such as a computer.
- step S101 input is set as saddle connection diagram D
- step S101 saddle connection diagram D is converted so that there is root in outermost
- step S106 it is determined whether or not root 0 has the shape (pattern) shown in FIG. If root 0 has the form shown in FIG. 9A (“Yes” in step 106), the vertex ids of w 1 and w 2 are set to 00, 01, and the tree G is set as shown in FIG. 9A.
- step S106 if root 0 does not have the shape of FIG. 9A ("No" in step 106), the process proceeds to step S108.
- step S108 it is determined whether or not root 0 has the left shape of FIG. If root 0 has the left shape of FIG. 9B (“Yes” in step 108), the vertex id of w is set to 00, the tree G is the label of the tree of FIG. 9B. Is replaced with a set of id and label (ie, G is ((0, ⁇ ⁇ ) ⁇ (00, ⁇ 0 ))), and ⁇ 00 ⁇ is added to the set T (step S109). That is, T ⁇ TU ⁇ 00 ⁇ . Thereafter, the process proceeds to step S114.
- step S108 if root 0 does not have the left shape of FIG. 9B ("No" in step S108), the process proceeds to step S110.
- step S110 it is determined whether or not root 0 has the shape shown in FIG. If root 0 has the shape of FIG. 9D (“Yes” in step S110), y 1 ,. . . , Y k with vertex ids 00,. . . , 0k ⁇ 1, and the tree G is defined as a tree in which the label of the tree in FIG. 9D is replaced with a set of id and label, and ⁇ 00,. . . , 0k-1 ⁇ is added (step S111). That is, T ⁇ TU ⁇ 00,. . . , 0k-1 ⁇ . Thereafter, the process proceeds to step S114.
- step S110 if root 0 does not have the shape of FIG. 9D (“No” in step S11), tree G is defined as ⁇ ⁇ (step S112), and this tree G is output. (Step S113), the process ends.
- step S114 it is determined whether or not an element t greater than s exists in T.
- s is the largest element in T (“No” in step S114)
- all the vertex ids of the tree G are removed, the remaining tree is set as G (step S115), and the tree G is output (step S113). ), The process is terminated.
- step S117 it is determined whether or not the outer boundary of the vertex s is composed of one homoclinic saddle connection and saddle, and the inner boundary of the vertex s has the shape shown in FIG.
- the outer boundary of the vertex s is composed of one homoclinic saddle connection and saddle, and the inner boundary of the vertex s has the shape of FIG. 9A (“Yes” in step 117)
- w 1 , w 2 Is defined as s0, s1
- the tree G is defined as a tree obtained by replacing the label of the tree in FIG. 9A with a set of id and label, and ⁇ s0, s1 ⁇ is added to T (step S118). . Thereafter, the process returns to step S114.
- step S117 when the outer boundary of the vertex s is not one homoclinic saddle connection and saddle in step S117, or the inner boundary of the vertex s does not have the shape of FIG. 9A (“No” in step S117). The process proceeds to step S119.
- step S119 it is determined whether or not the outer boundary of the vertex s is composed of one homoclinic saddle connection and saddle, and the inner boundary of the vertex s has the left shape of FIG. 9B. If the outer boundary of the vertex s consists of one homoclinic saddle connection and saddle, and the inner boundary of the vertex s has the left shape of FIG. 9B (“Yes” in step S119), the vertex id of w Is defined as s0, the tree G is defined as a tree in which the label of the left tree in FIG. 9B is replaced with a set of id and label, and ⁇ s0 ⁇ is added to T (step S120). Thereafter, the process returns to step S114.
- step S119 if the outer boundary of the vertex s is not one homoclinic saddle connection and saddle in step S119, or if the inner boundary of the vertex s does not have the left shape of FIG. 9B (“No” in step S119) '), The process proceeds to step S121.
- step S121 it is determined whether or not the outer boundary of the vertex s is composed of one homoclinic saddle connection and saddle, and the inner boundary of the vertex s has the shape shown in FIG. 9D.
- the outer boundary of the vertex s is composed of one homoclinic saddle connection and saddle, and the inner boundary of the vertex s has the shape of FIG. 9D (“Yes” in step 121)
- the tree G is defined as a tree in which the label of the tree in FIG. 9D is replaced with a set of id and label, and T is set to ⁇ s0,. . . , Sk-1 ⁇ is added (step S122). Thereafter, the process returns to step S114.
- step S121 if the outer boundary of the vertex s is not one homoclinic saddle connection and saddle in step S121, or the inner boundary of the vertex s does not have the shape shown in FIG. 9D (“No” in step S121). The process proceeds to step S123.
- step S123 it is determined whether or not the vertex s has the left shape of FIG.
- the process proceeds to step S124.
- step S124 the one sigma label sigma 0 vertex s is + (i.e., flow in the s is either a counter-clockwise) to determine.
- ⁇ of the label ⁇ 0 of the vertex s is + (that is, the flow in s is counterclockwise) (“Yes” in step S124)
- the vertex ids of w 1 , w 2 , and w 3 are set.
- s0, s1, s2 are defined, and the tree G is defined as a tree in which the label of the left tree in FIG. 9C is replaced with a set of id and label, and ⁇ s0, s1, s2 ⁇ is added to T (step S125). Thereafter, the process returns to step S114.
- step S124 when ⁇ of label ⁇ 0 of vertex s is not +, that is, when ⁇ of label ⁇ 0 of vertex s is ⁇ (that is, the flow in s is clockwise) (
- step S124, “No”) the vertices id of w 1 , w 2 , w 3 are defined as s1, s2, s0, and the tree G is set to the left tree label in FIG. The replaced tree is determined, and ⁇ s0, s1, s2 ⁇ is added to T (step S126). Thereafter, the process returns to step S114.
- step S123 when the vertex s does not have the left shape of FIG. 9C (“No” in step S123), the process proceeds to step S127.
- step S127 it is determined whether or not the vertex s has the right shape of FIG.
- the process proceeds to step S128.
- step S1208 it is determined whether or not ⁇ of label ⁇ 0 of vertex s is + (that is, the flow in s is counterclockwise).
- ⁇ of label ⁇ 0 of vertex s is + (ie, the flow in s is counterclockwise) (“Yes” in step S128)
- the vertex ids of w 1 and w 2 are set to s0 and s1.
- the tree G is defined as a tree in which the label of the right tree in FIG. 9C is replaced with a set of id and label, and ⁇ s0, s1 ⁇ is added to T (step S129). Thereafter, the process returns to step S114.
- step S128 when ⁇ of label ⁇ 0 of vertex s is not +, that is, when ⁇ of label ⁇ 0 of vertex s is ⁇ (that is, the flow in s is clockwise) ( “No” in step S128), the vertex ids of w 1 and w 2 are defined as s1 and s0, and the tree G is defined as a tree in which the label of the right tree in FIG. , T is added to ⁇ s0, s1 ⁇ (step S130). Thereafter, the process returns to step S114.
- step S127 when the vertex s does not have the right shape of FIG. 9C (“No” in step S127), the process proceeds to step S131.
- step S131 it is determined whether the vertex s has the shape shown in FIG.
- y 1 ,. . . , Y l , w are the vertex ids s1,. . . , Sl, s0
- the tree G is defined as a tree in which the label of the tree in FIG. 9H is replaced with a set of id and label, and ⁇ s0,. . . , Sl ⁇ are added (step S132). Thereafter, the process returns to step S114.
- step S131 when the vertex s does not have the shape of FIG. 9H (“No” in step S131), the process proceeds to step S133.
- step S133 it is determined whether or not the vertex s has the left shape of FIG.
- the tree G is defined as a tree in which the label of the left tree in FIG. 9G is replaced with a set of id and label, and ⁇ s0,. . . , Sk + 1 ⁇ are added (step S134). Thereafter, the process returns to step S114.
- step S133 when the vertex s does not have the left shape of FIG. 9G (“No” in step S133), the process proceeds to step S135.
- step S135 it is determined whether or not the vertex s has the right shape in FIG.
- w, z 1 ,. . . , Z k vertices id are s0, s1,. . . , Sk
- the tree G is defined as a tree in which the label of the right tree in FIG. 9G is replaced with a set of id and label, and ⁇ s0,. . . , Sk ⁇ is added (step S136). Thereafter, the process returns to step S114.
- step S135 when the vertex s does not have the right shape of FIG. 9G (“No” in step S135), the process proceeds to step S138 (in this case, as shown in step S137, the vertex s is in the form of FIG. 9 (f)).
- step S138 it is determined whether or not ⁇ of label ⁇ 0 of vertex s is + (that is, the flow in s is counterclockwise).
- ⁇ of label ⁇ 0 of vertex s is + (ie, the flow in s is counterclockwise) (“Yes” in step S138)
- the tree G is defined as a tree obtained by replacing the label of the tree in FIG. 9F with a set of id and label, and ⁇ s0,. . . , Sl + k ⁇ 1 ⁇ are added (step S139). Thereafter, the process returns to step S114.
- step S138 when ⁇ of label ⁇ 0 of vertex s is not +, that is, when ⁇ of label ⁇ 0 of vertex s is ⁇ (that is, the flow in s is clockwise) (step S138).
- “No”) y 1 ,. . . , Y k , z 1 ,. . . , Z l with the vertex ids sl,. . . , Sl + k-1, s0,. . . , Sl ⁇ 1, and the tree G is defined as a tree obtained by replacing the label of the tree in FIG. 9F with a set of id and label, and ⁇ s0,. . . , Sl + k ⁇ 1 ⁇ is added (step S140). Thereafter, the process returns to step S114.
- the above operation is the conversion process to the tree of the saddle connection diagram in the O series.
- D is an ss-saddle connection diagram that can be expressed in I-word or II-word.
- the broken line is one ss-orbit included in the connected component that is the root, along with its direction.
- (a) is a ss-saddle connection diagram expressed by the word expression IA 0 A 0 , and the flow direction of the ss- ⁇ -saddle connection is from right to left.
- (B) is a ss-saddle connection diagram having the word expression IA 0 A 0, and the direction of the ss- ⁇ -saddle connection is from left to right.
- (C) is a ss-saddle connection diagram having the word expression IIA 0 A 0, and the direction of the periodic orbit included in the outermost connected component is clockwise.
- the word expression IIA 0 A 0 is the same as (c), but the direction of the periodic orbit is opposite.
- each ss-saddle connection diagram an image of a ss-saddle connection diagram is shown which is formed by a conformal mapping that infinitely maps a point in the connected component that is the root.
- this mapped image all ss-orbits included in the route are counterclockwise.
- the connected component (the curve drawn with a broken line is directly above 1-source-sink point). Included area) becomes the root. If the same ss-saddle connection diagram has the same shape, but the direction of the flow is reversed as shown in FIG. 11B, the route becomes a connected component immediately below 1-source-sink point from the definition. .
- the ss-saddle connection diagram with the word representation IIA 0 A 0 in FIG. 11 (c) when the connected component directly above the 1-source-sink point reverses the direction (FIG. 11 (d)). The connected component directly below is the root.
- the connected component of the root in the image is the outermost component. Note that the ss-orbit is always counterclockwise (see the lower part of each figure in FIG. 11).
- the orientation edge between the vertices is defined as shown in FIG. 11 by using a conformal map obtained by mapping the root connected component to the outermost side.
- FIG. 12 shows the visualization of the local structure of the ss-saddle connection diagram generated by the operations A 0 , A 2 , and C and the corresponding graph representation.
- the parent connected component v is expressed as o ⁇ (o 0 or o 2 ).
- (a) is A 0
- (b) is A 0
- (c) is A 0 A 0
- (d) is A 2 C k (k ⁇ 0)
- (e) is A 2 C l ( l ⁇ 1)
- (f) are A 2 2 C k + 1 (k, l ⁇ 1)
- (g) is A 0 A 2 C k (k ⁇ 0)
- (h) is A 0 A 2 C l
- the local ss-saddle connection diagram constructed by l ⁇ 1) and the parent-child relationship of the connected components generated corresponding thereto, and the counterclockwise ss-orbit included in the parent connected component v are indicated by broken lines. .
- the label of the parent connected component is expressed as o * (where * is either ⁇ , 0, or 2). Since the route is determined so that the direction of the ss-orbit is always counterclockwise, the direction in which the trajectory included in the connected component as a child flows is automatically determined.
- the parent connected component v has two child connected components w ⁇ Vo 0 and y ⁇ V + 0 , so from o * to draw the two arrows to the o 0 and + 0.
- the depending on choosing to which connecting component the parent, o 0 or - can be an arrow pointing to 0.
- two types of patterns are created as shown in FIG. 12 (c), so the three arrows to o 0 , + 0 , and ⁇ 0 are changed accordingly. or o 0 and draw - two of the edge of the 0 can be drawn.
- the l pieces of arrow - can be drawn to 2.
- FIGS. 13-A to 13-D are flowcharts for explaining the conversion process of the ss-saddle connection diagram in the I and II series into a tree.
- the conversion process of the ss-saddle connection diagram in the I and II series shown in FIGS. 13-A to 13-D into a tree can be executed by a device such as a computer.
- step S143 if root 0 does not have the shape of FIG. 12A (“No” in step S143), the process proceeds to step S145.
- step S145 it is determined whether or not root 0 has the left shape of FIG. If root 0 has the left shape of FIG. 12B (“Yes” in step S145), the vertex id of w is set to 1, the tree G is the label of the tree of FIG. The tree replaced with the set of id and label (that is, G is defined as ((0, o ⁇ ) ⁇ (1, o 0 )), and ⁇ 1 ⁇ is added to T (step S146). The process proceeds to step S149.
- step S145 if root 0 does not have the left shape of FIG. 12B (“No” in step S145), the process proceeds to step S148 (in this case, as shown in step S147, root). 0 has the shape of FIG. 12 (d)).
- step S148 w, z 1 ,. . . , Z k vertices id are set to 1, 00,. . . , 0k ⁇ 1, and the tree G is defined as a tree in which the label of the tree in FIG. 12D is replaced with a set of id and label, and ⁇ 1,0,. . . , 0k ⁇ 1 ⁇ is added, and the process proceeds to step S149.
- step S149 it is determined whether or not an element t larger than u exists in T. If u is the largest element in T (“No” in step S149), all vertex ids of the tree G are removed, the remaining tree is set as G (step S150), and the tree G is output (step S150). S151), the process ends.
- step S153 it is determined whether u is a natural number (that is, corresponding to the ids of o ⁇ , o 0 , o 2 ). If u is not a natural number (“No” in step S153), the process proceeds to S114 in FIG. 10-B, which is an O-word process.
- step S153 if u is a natural number in step S153 (“Yes” in step S153), the process proceeds to step S155.
- step S155 the outer boundary of the vertex u is composed of an outward homoclinic ss-saddle connection and a circle S (see FIG. 6), and the inner boundary of u has the shape of FIG. 12 (a). Determine whether or not.
- the outer boundary of the vertex u is composed of one homoclinic ss-saddle connection and a circle S, and the inner boundary of u has the shape shown in FIG. 12A (“Yes” in step S155)
- w, y Vertices id is defined as u + 1, u0, and the tree G is replaced with a set of id and label in FIG.
- step S155 if the outer boundary of the vertex u does not consist of an outward homoclinic ss-saddle connection and a circle S, or if the inner boundary of u does not have the shape of FIG. (“No” in S155), the process proceeds to step S157.
- step S157 it is determined whether or not the outer boundary of the vertex u is composed of the outward homoclinic ss-saddle connection and the circle S, and the inner boundary of u has the left shape of FIG.
- the outer boundary of the vertex u is composed of one homoclinic ss-saddle connection and a circle S, and the inner boundary of u has the left shape of FIG. 12B (“Yes” in step S157)
- the tree G is determined as a tree in which the label of the left tree in FIG. 12B is replaced with a set of id and label, and ⁇ u + 1 ⁇ is added to T (step S158). Thereafter, the process returns to step S149.
- step S157 if the outer boundary of the vertex u is not composed of the outward homoclinic ss-saddle connection and the circle S, or the inner boundary of u does not have the left shape of FIG. (“No” in step S157), the process proceeds to step S159.
- step S159 it is determined whether or not the outer boundary of the vertex u is composed of an outward homoclinic ss-saddle connection and a circle S, and the inner boundary of u has the shape shown in FIG.
- the outer boundary of the vertex u is composed of one homoclinic ss-saddle connection and a circle S, and u has the shape of FIG. 12D (“Yes” in step S159)
- the tree G is defined as a tree in which the label of the tree in FIG. 12D is replaced with a set of id and label, and ⁇ u + 1, u0,. . . , Uk-1 ⁇ is added (step S160). Thereafter, the process returns to step S149.
- step S159 if the outer boundary of the vertex u does not consist of the outward homoclinic ss-saddle connection and the circle S in step S159, or if the inner boundary of u does not have the shape of FIG. ("No" in S159), the process proceeds to step S161.
- step S161 it is determined whether or not the vertex u has the left shape of FIG. If the vertex u has the left shape of FIG. 12C (“Yes” in step S161), the vertex ids of w, y 1 , y 2 are defined as u + 1, u0, u1, and the tree G is A tree in which the label of the left tree in FIG. 12C is replaced with a set of id and label is determined, and ⁇ u + 1, u0, u1 ⁇ is added to T (step S162). Thereafter, the process returns to step S149.
- step S161 when the vertex u does not have the left shape in FIG. 12C (“No” in step S161), the process proceeds to step S163.
- step S163 it is determined whether or not the vertex u has the right shape in FIG.
- the vertex ids of w 1 and w 2 are determined as u + 1, u0, and the tree G is changed to FIG. )
- the process proceeds to step S149.
- step S163 when the vertex u does not have the right shape of FIG. 12C (“No” in step S163), the process proceeds to step S165.
- step S165 it is determined whether or not the vertex u has the shape shown in FIG.
- the vertex u has the shape shown in FIG. 12G (“Yes” in step S165)
- the tree G is defined as a tree in which the label of the tree in FIG. 12G is replaced with a set of id and label, and ⁇ u + 1, u0,. . . , Uk ⁇ is added (step S166). Thereafter, the process returns to step S149.
- step S165 when the vertex u does not have the shape of FIG. 12G (“No” in step S165), the process proceeds to step S167.
- step S167 it is determined whether or not the vertex u has the left shape in FIG.
- the vertex id of y l u + 1, u0, u1 ,. . . , Ul, and the tree G is defined as a tree in which the label of the left tree in FIG. 12H is replaced with a set of id and label, and ⁇ u + 1, u0, u1,. . . , Ul ⁇ is added (step S168).
- the process returns to step S149.
- step S167 when the vertex u does not have the left shape of FIG. 12H (“No” in step S167), the process proceeds to step S169.
- step S169 it is determined whether or not the vertex u has the right shape in FIG.
- the vertex u has the right shape in FIG. 12H (“Yes” in step S169)
- the tree G is defined as a tree in which the label of the right tree in FIG. 12H is replaced with a set of id and label, and T is set to ⁇ u + 1, u0,. . . , Ul-1 ⁇ is added (step S170). Thereafter, the process returns to step S149.
- step S169 when the vertex u does not have the right shape in FIG. 12H (“No” in step S169), the process proceeds to step S171.
- step S171 it is determined whether or not the vertex u has the shape shown in FIG.
- the vertex u has the shape shown in FIG. 12F (“Yes” in step S171)
- the vertex ids are u + 1, u0,. . . , Uk-1, uk,. . . , Ul + k ⁇ 1
- the tree G is defined as a tree in which the label of the tree in FIG. 12F is replaced with a set of id and label, and T is set to ⁇ u + 1, u0,. . . , Ul + k-1 ⁇ is added (step S172). Thereafter, the process returns to step S149.
- step S171 when the vertex u does not have the shape of FIG. 12F (“No” in step S171), the process proceeds to step S173.
- step S173 it is determined whether or not the vertex u has the right shape of FIG.
- the vertex id of y is defined as u0
- the tree G is defined as the right tree in FIG. 12B.
- the tree is determined by replacing the label with a set of id and label, and ⁇ u0 ⁇ is added to T (step S174). Thereafter, the process returns to step S149.
- step S173 when the vertex u does not have the right shape of FIG. 12B (“No” in step S173), the process proceeds to step S175.
- step S175 it is determined whether or not the vertex u has the shape shown in FIG.
- the tree G is defined as a tree in which the label of the tree in FIG. 12E is replaced with a set of id and label, and ⁇ u0,. . . , Ul-1 ⁇ is added (step 176). Thereafter, the process returns to step S149.
- step S175 when the vertex u does not have the shape of FIG. 12E in step S175 (“No” in step S175), the process returns to step S149 (in this case, as shown in step S177, the vertex u is (It has the shape of FIG. 12 (a)).
- the above operation is the conversion process from ss-saddle connection diagram in I / II series to tree.
- Proposition 3.1 A streamlined phase structure of a stable Hamilton vector field with each 1-source-sink point corresponds to a tree expression with a root, a label, and an orientation.
- the route selection method is not unique. Because, for any connected component that includes a circular boundary that does not have ⁇ -saddle inside, there is a continuous mapping, so that the connected component can always be the outermost connected component. is there. Therefore, for the saddle connection diagram, there are different graph representations as many as the number of connected components. In order to remove such ambiguity, the graph representations that can be transferred by these continuous maps are different.
- V 1 and V 2 For the two structural stability Hamiltonian vector field V 1 and V 2, V a 1 ⁇ V 2 becomes equivalence relation, V 1 exist homeomorphism on certain homeomorphism D z (M) and V 2 Are defined by the fact that the outer boundaries of V 1 and V 2 correspond to each other without changing their orientation.
- ⁇ defines an equivalence relation, and a tree with a unique root, a label, and a direction can be given to this equivalence class.
- Proposition 3.2 Equivalent class streamline phase structure of ⁇ in a structure-stable Hamiltonian vector field corresponds to tree representation with unique root, labeled, and orientation.
- FIG. 14-A shows visualization of a graph expression of a structure-stable streamline pattern given by the same word expression IA 0 C and its regular expression.
- IA 0 C Graph representation of flow expressed by I-word and II-word
- the connected component of the route is selected directly below or directly above 1-source-sink point. Yes. As you can see, all regular expressions are different.
- FIG. 14-A shows a graph representation of a structurally stable streamline pattern having the word representation IA 0 C and its regular expression.
- the route corresponds to the connected component immediately below 1-source-sink point from its definition.
- the root connected component is copied to the outermost connected component on the right side.
- FIG. 14B is a flowchart for explaining a process of converting a tree into a regular expression.
- the conversion process of a tree into a regular expression shown in FIG. 14-B can be executed by a device such as a computer.
- id is given to all points of the tree as preprocessing. However, ids of different points are different.
- input is set as tree G (step S178).
- V is set as the vertex set of tree G
- X is set as empty set ⁇
- regular expression N (s, ⁇ ⁇ ) () (step S179).
- step S180 the result of reading the children of s from the left is expressed as (s (1) , ⁇ (1) ),. . . , (S (h) , ⁇ (h) ).
- (s, ⁇ * ) () in the regular expression N is changed to ⁇ * (s (1) , ⁇ (1) ) (),. . . , (S (h) , ⁇ (h) ) ()), and replace T with ⁇ s (1) ,. . . , S (h) ⁇ and ⁇ s ⁇ are added to X.
- the above operation is the process of converting the tree into a regular expression.
- an allowable regular expression refers to all regular expressions that can be obtained by applying forward replacement of a regular expression to a regular expression of a fundamental type among regular expressions corresponding to trees with roots, labels, and directions. .
- fundamental type is, + ⁇ , - ⁇ , is a regular expression that contains the o ⁇ .
- FIG. 15 shows five fundamental type TN and a regular expression N corresponding to the five fundamental type TN .
- These regular expressions correspond to a (ss-) saddle connection diagram including a route in the graph expression. That, + ⁇ (+ 0, + 0) and, o ⁇ (o 2, + 2, ...., + 2) , such as regular expression of ss-saddle connection diagram with a word representation consisting OB 0 and IC k It is a regular expression.
- FIG. 16 is a list of 14 forward replacements.
- the forward permutation A 0+ is given as o 0 ⁇ o 0 (o 0 , + 0 ).
- a connected component that does not have a streamline phase structure therein will be referred to as a simple connected component.
- Simple connected components correspond to vertices that do not have child connected components in the graph representation.
- forward replacement shown in FIG. 16 is performed when the operations A 0 , A 2 , B 0 , B 2 , and C are applied to ss-orbit and closed orbit in the simple connected component. It describes how the streamline structure and its regular expression change.
- FIG. 17 shows the change of forward replacement and streamline structure when the operations A 0 , A 2 , and C are performed. More specifically, FIG. 17 shows changes in the local structure of streamlines obtained by applying the operations A 0 , A 2 , and C to the ss-orbit in the simple connected component o 0 or o 2 in the ss-saddle connection diagram. Is a forward replacement of a regular expression corresponding to.
- forward replacement as shown in FIG. 18 can be defined when the operations B 0 , B 2 , and C are applied to the closed orbit included in the simple connected component.
- FIG. 18 shows excitation along with the change in streamline structure obtained when operations B 0 , B 2 , and C are applied to the closed orbit included in the simple connected components ⁇ 0 and ⁇ 2 in the (ss-) saddle connection diagram. It is a figure for demonstrating forward replacement of the regular expression to do.
- a set of regular expressions obtained by applying forward replacement to this fundamental type recursively is defined as follows.
- the regular expression is O-type (or I, II-type) when the regular expression is composed of the above rules from the basic form O, OB 0 , OB 2 C k (or IC k or II). Say. Since all local streamline structures obtained by the operation are covered in FIGS. 17 and 18, the following can be understood from the configuration method.
- the opposite of () is an operation of replacing a homoclinic saddle connection pair (or a circle boundary having exactly two ⁇ -saddles) with a circle boundary.
- the reverse operation of the operation C is to delete a simple connected component surrounded by a ⁇ -saddle connection that is attached to a circle boundary having two or more ⁇ -saddles.
- the backward replacement can be expressed as a change in the arrangement of character strings corresponding to the structure to be deleted of the allowable regular expression.
- FIG. 19 is a diagram illustrating an example of a backward replacement of a regular expression corresponding to a change in the local streamline structure in the (ss-) saddle connection diagram.
- the connected component ⁇ 0 is an outward homoclinic saddle connection and is surrounded as shown in FIG. 19 (a)
- the simple connected component surrounded by ⁇ -saddle connection is deleted from the (ss-) saddle connection diagram.
- backing replacement ⁇ 0 [[ ⁇ 2 ]]
- ⁇ ⁇ 0 is obtained.
- the parent connected component ⁇ 0 is surrounded by the inward homoclinic saddle connection (FIG. 19B)
- the backward replacement of the forward replacement C 1 B 2 is given by one of the followings according to the sign of ⁇ 2 from the rule (1) of the order relation with respect to the label.
- the backward replacement is ⁇ 0 ([[ ⁇ 0 , ⁇ 0 ]]) ⁇ ⁇ 0 .
- FIG. 19 (d) As backward replacement is shown in FIG. 19 (d) from order relation rules (1) when the connecting component sigma 0 is surrounded inwardly homoclinic saddle connection, + 0 ([ [+ 0, + 0]] , ⁇ 0 ) ⁇ + 0 ( ⁇ 0 ) or ⁇ 0 ( +0 , [[ ⁇ 0 , ⁇ 0 ]]) ⁇ ⁇ 0 ( +0 ).
- forward replacement B 0- is compared with three back replacements ⁇ 0 ([[ ⁇ 0 ( ⁇ 0 )])) ⁇ ⁇ 0 , + 0 ([[ +0 ( ⁇ 0 )]], ⁇ 0 ) ⁇ + 0 ( ⁇ 0 ), ⁇ 0 ( +0 , [[ ⁇ 0 ( +0 )]]) ⁇ ⁇ 0 ( +0 ).
- Forward replacement C l B 0+ in Figure 18 (d) and FIG. 18 (e) induces the following backward replacement.
- Backward replacement corresponding to deleting a simple connected component surrounded by ⁇ -saddle connection is fundamental type IC k (k ⁇ 0) and forward replacement A 2 C k , B 2 C k (k ⁇ 0), C l A 0+ , C l A 0 ⁇ , C l B 0+ , C l B 0 ⁇ (l ⁇ 0), C O l , C ⁇ l , C l A 2 C k , (l + k ⁇ 0), C l B 2 This corresponds to the reverse operation of C k .
- the backward replacement is a sequence (+ 2 ,..., + 2 ) or ( ⁇ 2 ) including simple connected components surrounded by ⁇ -saddle connections attached to the circle boundary. , ...,- 2 ) represents that one of the simple connected components is deleted.
- Backward replacement of Fundamental type IC k (k ⁇ 1) is as follows.
- the connected component o 0 is outward or inward homoclinic saddle connection as shown in FIGS. 19E and 19F.
- backward replacement obtained by erasing the ⁇ -saddle connection surrounded by a concatenation component + 2 is as follows.
- forward replacement C O l , C ⁇ l , C l A 0+ , C l A 0- , C l B 0+ , C l B 0- (l ⁇ 0) are all defined for the connected component o 2 or ⁇ 2 surrounded by ⁇ -saddle connection, the back replacement for it is naturally defined as it can.
- FIG. 20 shows a list of back replacement [B 2 ], [B 0 ] and [C] of regular expressions derived by the reverse operation of the operations B 0 , B 2 and C.
- the word expression of the regular expression finally obtained when the backward replacement in FIG. 20 is applied as much as possible to the last given allowable regular expression is as follows. This has proven to be mathematically correct.
- Lemma 4.2 When the given allowable regular expression N can no longer be applied to all the backward replacements included in [B 0 ], [B 2 ], [C], the word expression for the regular expression is one of the following: It is.
- N O 2
- the word representation of N is either IA 0 p + m A 2 c-2-p-m or IIA 0 c-2 .
- c, p, m is, o * contained in N, + 0, - is either 0.
- a partial word string CB 0 B 2 is obtained according to the extracted structure.
- FIGS. 22A to 22C are flowcharts for explaining the process of converting the regular expression into the word expression.
- the conversion processing of regular expressions into word expressions shown in FIGS. 22A to 22C can be executed by an apparatus such as a computer.
- the word W is set as an empty set ⁇ (step S185).
- step S186 it is determined whether sigma containing innermost of ⁇ 2 ⁇ ( ⁇ 2) or innermost of sigma 2 sigma 0 containing (sigma 2) are included in the regular expression N. If innermost of sigma 2 to comprise sigma phi (sigma 2) or innermost of sigma 2 sigma 0 containing (sigma 2) are included in the regular expression N is ( "Yes" in step S186), the process proceeds to step S187.
- step S187 the innermost ⁇ 2 included in ⁇ ⁇ ( ⁇ 2 ) or ⁇ 0 ( ⁇ 2 ) is extracted from the regular expression N, W is replaced with B 2 W (step S188), and the process returns to step S186.
- step S186 if the sigma containing innermost of ⁇ 2 ⁇ ( ⁇ 2) or innermost of sigma 2 sigma 0 containing (sigma 2) is not included in the regular expression N (step S186 "No"), The process proceeds to step S189.
- step S189 + 2 including innermost of + 2 in the regular expression N (+ 2, - 2, ..., - 2) determines whether there.
- step S189 + 2 including innermost of + 2 in the regular expression N (+ 2, - 2, ..., - 2) If there is no ( "No" in step S189), step S191 Migrate to
- step S191 a regular expression of innermost in the N - containing 2 - 2 (+ 2, ..., + 2, - 2) determines whether there.
- step S191 innermost of in a regular expression N - containing 2 - 2 (+ 2, ..., + 2, - 2) does not exist ( "No" in step S191), step S193 Migrate to
- step S193 it is determined whether or not two consecutive innermost ⁇ 0 and ⁇ 0 are included in the regular expression N.
- two consecutive innermost ⁇ 0 and ⁇ 0 are included in the regular expression N (“Yes” in step S193), such ⁇ 0 and ⁇ 0 are extracted from the regular expression N (step S194), and W is Replace with B 0 W (step S195), and return to step S193.
- step S193 when two consecutive innermost ⁇ 0 and ⁇ 0 are not included in the regular expression N in step S193 (“No” in step S193), the process proceeds to step S196.
- step S196 it is determined whether or not the innermost ⁇ 0 ( ⁇ 0 ) is included in the regular expression N.
- the innermost ⁇ 0 ( ⁇ 0 ) is included in the regular expression N (“Yes” in step S196)
- such ⁇ 0 ( ⁇ 0 ) is extracted from the regular expression N (step S197), and W is set to B 0. Replace with W (step S195), and proceed to step S193.
- step S196 if the innermost ⁇ 0 ( ⁇ 0 ) is not included in the regular expression N (“No” in step S196), the process proceeds to step S198.
- step S198 the regular expression N is added to two or more consecutive ⁇ 2 ,. . . , ⁇ 2 , whether or not the innermost ⁇ 2 is included is determined.
- the regular expression N includes two or more consecutive ⁇ 2 ,. . . , ⁇ 2 includes an innermost ⁇ 2 (“Yes” in step S198), such ⁇ 2 is extracted from the regular expression N (step S199), and W is replaced with CW ( Step S200) and return to Step S198.
- step S198 the regular expression N is added to two or more consecutive ⁇ 2 ,. . . , ⁇ 2 does not include the innermost ⁇ 2 (“No” in step S198), the process proceeds to step S201.
- step S201 it is determined whether or not ⁇ 2 that is a child of o * exists in the regular expression N. If the o * child and innermost ⁇ 2 exists in the regular expression N (“Yes” in step S201), such ⁇ 2 is removed from the regular expression N (step S199), and W is replaced with CW. (Step S200), the process returns to Step S198.
- step S201 if the o * innermost of sigma 2 child does not exist in the regular expression N ( "No" in step S201), and proceeds to step S202.
- step S202 innermost a mu 2 in children of sigma 2 to determine whether there regular expression N. If ⁇ 2 and innermost ⁇ 2 are present in the regular expression N (“Yes” in step S202), such ⁇ 2 is extracted from the regular expression N (step S203), and W is replaced with CW ( Step S200) and return to Step S198.
- step S202 if there is no innermost ⁇ 2 as a child of ⁇ 2 in step S202 (“No” in step S202), the process proceeds to step S204.
- step S204 it is determined whether or not ⁇ 2 exists in the regular expression N. If ⁇ 2 exists in the regular expression N (“Yes” in step S204), the process returns to step S186.
- step S204 if ⁇ 2 does not exist in the regular expression N in step S204 (“No” in step S204), the process proceeds to step S205.
- step S205 it is determined whether or not ⁇ 0 ( ⁇ 0 ) exists in the regular expression N.
- ⁇ 0 ( ⁇ 0 ) exists in the regular expression N (“Yes” in step S205)
- the process returns to step S186.
- step S205 if ⁇ 0 ( ⁇ 0 ) does not exist in the regular expression N in step S205 (“No” in step S205), the process proceeds to step S206.
- step S206 it is determined whether or not there are two ⁇ 0 and ⁇ 0 consecutive in the regular expression N. If there are two consecutive ⁇ 0 and ⁇ 0 in the regular expression N (“Yes” in step S206), the process returns to step S186.
- step S206 if there are no two ⁇ 0 and ⁇ 0 consecutive in the regular expression N in step S206 (“No” in step S206), the process proceeds to step S207.
- step S207 the regular expression N is equal to or a sigma phi. If the regular expression N is sigma phi ( "Yes" in step S207), the W was replaced by OW (step S208), the word W is output (step S212), the process ends.
- step S207 if the regular expression N is not sigma phi ( "No" in step S207), and proceeds to step S209.
- step S209 it is determined whether the regular expression N comprises o 2.
- the regular expression N includes o 2 (“Yes” in step S209), W is replaced with IA 0 p + m A 0 c-2-p ⁇ m W (step S210), and the word W is output (step S210). S212), the process ends.
- c, p, m is o * contained in N, + 0, - the number of 0.
- step S208 if the regular expression N does not contain o 2 ( "No" in step S208), W is substituted with IIA 0 c-2 W a (step S211), the word W is output (step S212), the process ends.
- the above processing is conversion processing of regular expressions into word expressions.
- FIG. 23 is a block diagram illustrating an example of the regular expression creation device 100 to which the present exemplary embodiment is applied, and conceptually illustrates only the portion related to the present exemplary embodiment of the configuration.
- the regular expression creation device 100 in this embodiment schematically includes at least a control unit 102 and a storage unit 106.
- the regular expression creation device 100 further includes an input / output control interface unit 108 and a communication control interface.
- the unit 104 is provided.
- the control unit 102 is a CPU or the like that comprehensively controls the entire regular expression creating apparatus 100.
- the communication control interface unit 104 is an interface connected to a communication device (not shown) such as a router connected to a communication line or the like, and the input / output control interface unit 108 is connected to the input device 112 or the output device 114.
- the storage unit 106 also stores various data (for example, FIG. 4 to FIG. 9, FIG. 11 to FIG. 12, FIG.
- each unit of the regular expression creating apparatus 100 is connected to be communicable via an arbitrary communication path. Further, the regular expression creation device 100 is communicably connected to the network 130 via a communication device such as a router and a wired or wireless communication line such as a dedicated line.
- the various data, database, table (simulation result file 106a, streamline diagram file 106b, regular expression file 106c, etc.) stored in the storage unit 106 are storage means such as a fixed disk device.
- the storage unit 106 stores various programs, tables, files, databases, web pages, and the like used for various processes.
- the simulation result file 106a is a simulation result storage unit that stores data indicating a simulation result mathematically simulated by the simulation unit 102a.
- the simulation result file 106a includes values of design variables indicating the shape of a structure, and hydrodynamic simulation results of a predetermined fluid (such as an ocean current or an air current) with respect to the structure (fluid pressure and flow at each spatial coordinate). Data indicating an orientation or the like).
- the simulation result file 106a may store, as simulation results, data input in advance via the input device 112 through model measurement in a laboratory such as a wind tunnel experiment.
- the streamline diagram file 106b is streamline data storage means for storing data indicating streamlines such as a streamline diagram.
- the streamline data stored in the streamline diagram file 106b may be data indicating streamlines analyzed by the streamline analysis unit 102b based on data indicating simulation results.
- the regular expression file 106c is regular expression storage means for storing regular expression data.
- the regular expression data stored in the regular expression file 106c is a character string or the like.
- the input / output control interface unit 108 controls the input device 112 and the output device 114.
- the output device 114 in addition to a monitor (including a home television), a speaker can be used (hereinafter, the output device 114 may be described as a monitor).
- the input device 112 a keyboard, a mouse, a microphone, and the like can be used.
- control unit 102 has an internal memory for storing a control program such as an OS (Operating System), a program defining various processing procedures, and necessary data. And the control part 102 performs the information processing for performing various processes by these programs.
- the control unit 102 includes a simulation unit 102a, a streamline analysis unit 102b, a graph expression creation unit 102c, a regular expression creation unit 102d, and a word expression conversion unit 102e in terms of functional concept.
- the simulation unit 102a is a simulation means for simulating a fluid with respect to a structure.
- the above-described design parameter selection step (see FIG. 24), the second design parameter selection step (see FIG. 29, etc.) Execute.
- the simulation unit 102a is not limited to a simulation in a two-dimensional plane, and may perform a fluid simulation in a three-dimensional space.
- the simulation part 102a may optimize a structure using a well-known optimization method.
- the simulation unit 102a performs a fluid simulation on the structure while repeatedly changing the design variable for determining the shape of the structure using an annealing method, a genetic algorithm method, or the like, thereby obtaining an appropriate shape of the structure.
- the simulation unit 102a stores data indicating the simulation result in the simulation result file 106a.
- the simulation unit 102a determines the value of a design variable indicating the shape of the structure, and the hydrodynamic simulation result of a predetermined fluid (such as an ocean current or an air current) with respect to the structure (the pressure or flow direction of the fluid in each spatial coordinate). Or data indicating resistance) may be stored.
- the streamline analysis unit 102b is streamline analysis means for performing streamline analysis.
- the streamline analysis unit 102b may derive a streamline diagram by performing streamline analysis on the simulation result of the simulation unit 102a.
- the streamline analysis unit 102b creates a streamline diagram from a numerical simulation or experiment data stored in the simulation result file 106a using a known method. Specifically, the streamline analysis unit 102b calculates all the saddle points, 1-source-sink points, etc. from the numerical simulation results, and then calculates the contours of the stream function having the same value as the stream function value at that point.
- a flow diagram can be created by drawing all the contours of the flow function having the same value as the value of the flow function on the boundary.
- the streamline analysis unit 102b may perform streamline analysis after converting it to two-dimensional data in a cross section of the structure.
- the plane used as a cross section is arbitrary, but preferably, the streamline analysis unit 102b may convert it into two-dimensional data in a cross section along the direction of the fluid flow (uniform flow). For example, in vehicles such as trains, automobiles, and aircraft, a cross section may be generated along the traveling direction.
- the streamline analysis part 102b may extract the characteristic structure which satisfy
- the streamline analysis unit 102b stores the created streamline diagram data in the streamline diagram file 106b.
- the graph expression creating unit 102c is a graph expression creating means for executing the above-described graph expression creating step (step S1). For example, the sad connection in the O series shown in FIGS. 10-A to 10-E. By executing the conversion process of the diagram to the tree and the conversion process of the ss-saddle connection diagram in the I and II series shown in FIGS. 13-A to 13-D, etc. (Where N is an integer greater than or equal to 1) A graph representation corresponding to the flow pattern in the multi-connected external region having a number of holes is created in a one-to-one correspondence.
- the child vertex set ⁇ (v) When the child vertex set ⁇ (v) is used, the child vertex set ⁇ (v) of v is rearranged according to a rule of a predetermined order relation, and from w ( ⁇ ) to l (w) for w ⁇ (v). You may include what was drawn by arranging the arrows from left to right.
- the flow pattern includes (1) two ss- ⁇ -saddle connections, which have a suction-out flow pair of two types of flow patterns that can be taken topologically in a single connected outer region having one hole.
- the flow pattern is converted so that the region containing the counterclockwise ss-orbit closest to the suction-and-out pair is the outermost region, and the converted flow
- the trajectory that appears in the (ss-) saddle connection diagram of the pattern is extracted from the entire region, and the vertex is set to the connected component obtained by excluding all the trajectories that appear in the (ss-) saddle connection diagram from the entire region.
- the connected component in is set as the root
- the current component is set as the root
- the connected components that are in contact with the current component are the children of the current component
- labels are assigned according to the trajectory corresponding to the boundary, and the labels are assigned in a predetermined order.
- the flow pattern starts from one or more of pattern words, and is one of operation words defining five types of operations that can be taken topologically when adding one hole to the flow pattern. May be a flow pattern diagram created by repeating the operation to give N until the number of holes reaches N.
- the regular expression creating unit 102d is a regular expression creating means for realizing the above-described regular expression creating step (step S2).
- the regular expression creating unit 102d performs, for example, a tree conversion process shown in FIG.
- a regular expression is created from the graph expression created by the graph expression creation unit 102c.
- the word expression conversion unit 102e is a word expression creating means for realizing the above-described word expression conversion step (step S3).
- the word expression conversion unit 102e converts the word expressions into the regular expressions shown in FIGS. 22A to 22C.
- the regular expression created by the regular expression creation unit 102d is converted into a word expression.
- the word expression represents a pattern that does not have a suction-and-out pair in a double connected outer region having two holes. Any of the operation words that define five types of operations that can be taken topologically when adding one hole to the flow pattern for the added pattern words that define three types of flow patterns
- a single word may be a symbol word formed by adding the number of holes added.
- the regular expression creation device 100 may be connected to the external system 120 via the network 130.
- the communication control interface unit 104 performs communication control between the regular expression creation device 100 and the network 300 (or a communication device such as a router). That is, the communication control interface unit 104 has a function of communicating data with other terminals via a communication line.
- the network 130 has a function of connecting the regular expression creation device 100 and the external system 200 to each other, such as the Internet.
- the external system 120 is connected to the regular expression creation device 100 via the network 130, and word representation is performed on an external database related to various data such as simulation result data and streamline diagram data, and connected information processing devices.
- the external system 120 may be configured as a WEB server, an ASP server, or the like.
- the hardware configuration of the external system 120 may be configured by an information processing device such as a commercially available workstation or personal computer, and an accessory device thereof.
- Each function of the external system 120 is realized by a CPU, a disk device, a memory device, an input device, an output device, a communication control device, and the like in the hardware configuration of the external system 120 and a program for controlling them.
- design method is used to determine the optimum parameters for a design object through the shape and arrangement of objects (hereinafter referred to as design objects) such as bridges and piers, and the control of the flow around them.
- design objects such as bridges and piers
- Assumption 1 There are design parameters that can be changed in the design object (shape, arrangement, flow control device, etc.).
- Assumption 2 In designing a design object, an “optimal state” corresponding to the problem is set, and the optimal state can be described as a feature of the streamline structure. For example, when the state where the separation vortex is confined is set to the optimum state, it is expected that the wings maximize the lift, and the piers minimize the drag.
- Assumption 3 In these designs, experiment and numerical calculation (and word expression / regular expression of streamline pattern obtained in it) can be performed by changing design parameters. Hereinafter, it is limited to a two-dimensional flow. In the case of 3D, it may be possible to design by taking a cross-section and making it 2D, etc. (Note that not all cases are possible in 3D).
- an ideal situation is set as a word expression or regular expression of a streamline pattern from the beginning for such a situation, and a parameter area is searched so that the situation is realized. Will be able to. In this way, it becomes possible to search for as many and as quickly as possible design parameters “candidates” for realizing optimum settings. Starting with those candidates, performing a known optimization method increases the possibility that many and highly feasible design parameters can be obtained.
- FIG. 24 is a flowchart for explaining a design method of an object in a fluid using word expressions and regular expressions, that is, the above-described design parameter selection process.
- the flowchart shown in FIG. 24 is executed by the simulation unit 102a.
- an upper limit and a lower limit of possible design parameters are determined (step S311).
- Word expressions and regular expressions are assigned to the obtained results (step S314). It is determined whether or not the word expression has an IC partial word representing the optimum state or is a structural expression having a regular expression corresponding thereto (step S315). If the word expression has an IC partial word representing the optimum state or a structural expression having a regular expression corresponding to the IC partial word (“Yes” in step S315), the word expression is adopted as a design parameter candidate (step S316). On the other hand, if the word expression is not a structural expression having an IC partial word representing the optimum state or a corresponding regular expression (“No” in step S315), it is not adopted as a design parameter candidate.
- step S317 it is determined whether there is a design parameter candidate (step S317). If there is a design candidate parameter (“Yes” in step S317), an existing optimization is performed on the design parameter candidate. A method is applied (step S319). In addition to applying the existing optimization method, it is ideal not only to quantitatively optimize the flow, but also to calculate and monitor word expressions and regular expressions at each stage of the optimization process. It is possible to optimize the streamline structure at the same time.
- step S317 if there is no design parameter candidate (“No” in step S317), the parameter area is further divided (step S318), and the processes of steps S313 to S317 are executed.
- FIG. 25 and FIG. 26 are diagrams for explaining an example of a specific example for explaining a method of designing an object in a fluid using the above-described word expression and regular expression.
- FIG. 25 it is assumed that there are two vortex structures (vortex 1 and vortex 2) behind the object 200 placed in a uniform flow. It is assumed that the uniform flow speed (or the traveling speed of the object) is U, and the object 200 can rotate at the angular velocity G.
- U can vary from 0 to 1.1
- G can vary from ⁇ 1.6 ⁇ 2 ⁇ to 1.6 ⁇ 2 ⁇ (the upper and lower limits of the design parameters are determined in step S311). .
- These parameter sections are divided into five equal parts to divide the design parameter area (step S312 above).
- the results of executing steps S313 to S319 are (a) to (f) in FIG.
- the division of these parameter areas is further repeated to find the best parameter area that maximizes the quantitative quantity such as lift, thereby confining the vortex and maximizing the lift. It is possible to know the speed of the object 200 and the rotation speeds.
- FIG. 27 and 28 are explanatory diagrams for explaining a method for optimizing a flow around an object in a fluid using word expressions and regular expressions.
- FIG. 29 is a flowchart for explaining a method for optimizing a flow around an object in a fluid using a word expression and a regular expression, that is, the above-described second design parameter selection step. The flowchart shown in FIG. 29 is executed by the simulation unit 102a.
- FIG. 27 shows a case where the flat blade 300 is placed at a constant angle with respect to the uniform flow U.
- FIG. 28 shows streamline patterns formed around the flat blade 300 in FIG. 27 and word expressions and regular expressions of the streamline patterns.
- FIG. 28A shows a streamline pattern extracted from a flow created around a flat blade 300 placed in a uniform flow U (“flow” can be calculated by a fluid experiment or numerical calculation). (Referred to as “pattern A”).
- FIG. 28C shows a pattern (referred to as “pattern B”) for confining the rotating flow structure on the flat blade 300.
- the design parameters of the flat blade 300 are suitably changed to find design parameters that realize the pattern B (target pattern) from the pattern A (current pattern), and increase the lift applied to the flat blade 300. The method to make it explain is demonstrated.
- step A the word expression (Japanese Patent Application No. 2012-203601 (PCT / JP2013 / 070939)) and the algorithm of the present embodiment are applied to pattern A and pattern B.
- the pattern A includes a word expression IA 0 CCB 0 and a regular expression N A (o ⁇ (o 0 (o 2 , ⁇ 0 ( ⁇ 0 , ⁇ 0 ), + 2 , + 2 )).
- the pattern B the word representation IA 0 CCB 0 and o ⁇ (o 2 (o 0 , + 0, - 2 (- 0, - 0, + 2))) to impart a regular expression N B of (Step S400, see FIGS. 28A and 28C). Since the word expressions of pattern A and pattern B are exactly the same, they cannot be distinguished in the prior art, but the regular expressions are different, so using these makes it possible to distinguish between the two flows. It becomes possible to specify the target shape of the optimum design.
- step S401 it is determined whether or not the regular expression N A of the pattern A and the regular expression N B of the pattern B are the same (step S401).
- the path P ⁇ is output (step S402). If the regular expression N A of the pattern A and the regular expression N B of the pattern B are different (“No” in step S401), the process proceeds to step S403.
- step B a transition path between pattern A and pattern B is determined (step S403).
- step C the design parameters are changed so as to make a transition along the route R i (steps S404 to S415).
- the route is determined, and the changed design parameter that matches the regular expression of the pattern B is output as the optimum design parameter.
- step S411 If i ⁇ N (“Yes” in step S411), the process returns to step S405 to search for the next route, while if i ⁇ N is not satisfied (“No” in step S411), all Since it is impossible to optimize the route, "impossible” is output (step S412).
- the design parameter is changed from the pattern A in FIG. 28A to search for a word expression and a regular expression in FIG. If the pattern shown in FIG. 28B is not found even after searching all the design parameters that can be changed, it is determined that the optimum design along this route is impossible, and the pattern shown in FIG. ) Repeat the same for routes other than the shortest route.
- step S415) If a design parameter that achieves the desired pattern B in FIG. 28C is suddenly found, this is the optimum design parameter, so this design parameter is output and the flow is terminated (step S415).
- this design parameter is selected, a range of design parameters that can be changed around this design parameter is specified, and it is divided. Then, an experiment or numerical calculation is performed on each of them to search whether there is a pattern B in FIG. When the design parameter that becomes the pattern B in FIG. 28C is found, this is the optimum design parameter, so this design parameter is output and the flow is terminated (step S415).
- step S412 If it is not found even after searching the range of design parameters that can be changed, it is determined that optimization on this route is impossible, and another route obtained in step B is searched. Even if all the routes acquired in step B are searched, if the design parameter that becomes the pattern B in FIG. 28C is not found, it is determined that the optimization is impossible (step S412).
- the regular expression creation device 100 performs processing in a stand-alone form
- the regular expression creation device 100 performs processing in response to a request from a client terminal, and the processing result is transmitted to the client terminal. You may make it return to.
- all or a part of the processes described as being automatically performed can be manually performed, or all of the processes described as being manually performed can be performed.
- a part can be automatically performed by a known method.
- each illustrated component is functionally conceptual and does not necessarily need to be physically configured as illustrated.
- each device of the regular expression creation device 100 in particular, the processing functions performed by the control unit 102, all or any part thereof are interpreted by a CPU (Central Processing Unit) and the CPU. It may be realized by a program to be executed, or may be realized as hardware by wired logic.
- the program is recorded on a recording medium to be described later, and is mechanically read by the regular expression creating apparatus 100 as necessary. That is, in the storage unit 106 such as a ROM or HD, a computer program for performing various processes by giving instructions to the CPU in cooperation as an OS (Operating System) is recorded. This computer program is executed by being loaded into the RAM, and constitutes the control unit 102 in cooperation with the CPU.
- OS Operating System
- the computer program may be stored in an application program server connected to the regular expression creation device 100 via an arbitrary network 300, and may be downloaded in whole or in part as necessary. Is possible.
- the program according to the present invention may be stored in a computer-readable recording medium, or may be configured as a program product.
- the “recording medium” includes a memory card, USB memory, SD card, flexible disk, magneto-optical disk, ROM, EPROM, EEPROM, CD-ROM, MO, DVD, and Blu-ray (registered trademark). It includes any “portable physical medium” such as Disc.
- program is a data processing method described in an arbitrary language or description method, and may be in any form such as source code or binary code. Note that the “program” is not necessarily limited to a single configuration, but is distributed in the form of a plurality of modules and libraries, or in cooperation with a separate program typified by an OS (Operating System). Including those that achieve the function. In addition, a well-known structure and procedure can be used about the specific structure for reading a recording medium in each apparatus shown in embodiment, a reading procedure, or the installation procedure after reading.
- Various databases and the like (simulation result file 106a, streamline diagram file 106b, word expression file 106c, etc.) stored in the storage unit 106 are memory devices such as RAM and ROM, fixed disk devices such as hard disks, flexible disks, and the like.
- the storage means such as an optical disk stores various programs, tables, databases, web page files, and the like used for various processes and website provision.
- the regular expression creating apparatus 100 may be configured as an information processing apparatus such as a known personal computer or workstation, or may be configured by connecting any peripheral device to the information processing apparatus. Further, the word expression creation device 100 may be realized by installing software (including programs, data, and the like) that causes the information processing device to realize the method of the present invention.
- the specific form of distribution / integration of the devices is not limited to that shown in the figure, and all or a part of them may be functional or physical in arbitrary units according to various additions or according to functional loads. Can be distributed and integrated. That is, the above-described embodiments may be arbitrarily combined and may be selectively implemented.
- a regular expression for creating a regular expression of a flow pattern in a multi-connected external region having topologically N (where N is an integer of 1 or more) holes is a creation method for creating a graph expression corresponding to the flow pattern in a one-to-one correspondence, a regular expression creating step for creating a regular expression from the graph expression created in the graph expression creation step, Therefore, there is an effect that it is possible to provide a new expression method that can be associated with the flow pattern on a one-to-one basis.
- V I a set of points called vertices
- E is a set of edges connecting vertices
- the graph representation is such that the parent vertex is v, the child vertex is w, the label assigned to the parent vertex v is l (v), and the label assigned to the child vertex w is Is the l (w), v child vertex set ⁇ (v), the child vertex set ⁇ (v) of v is rearranged according to a rule of a predetermined order relation, and l (v ) To l (w) are drawn side by side from left to right, so that it is possible to provide a graph expression in which the parent-child connection relationship can be easily recognized.
- the flow pattern has (1) a suction / outflow pair of two types of flow patterns that can be taken topologically in a single connected outer region having one hole.
- Pattern I having two ss- ⁇ -saddle connections
- (2) having two pairs of flow patterns that can be taken topologically in the single connected outer region having one hole.
- One saddle point a pattern II having a homoclinic saddle connection and two ss-saddle connections connecting the saddle points
- one or the other of the pattern O having no suction spring-out pair in the double connected external region having two holes Since there were multiple, all the basics Re can be given a regular expression for a pattern, an effect that will handle the regular expression of a specific flow pattern.
- the regular expression created in the regular expression creating step is provided with a word expression conversion step that converts the regular expression into a word representation, it is possible to convert the regular expression into a word representation. There is an effect.
- the word expression is a double connection having two holes in addition to two kinds of flow patterns that can be topologically taken in a single connection outer region having one hole.
- Any of the operation words that specify the topologically five types of operations for the pattern words that define a total of three types of flow patterns with the addition of a pattern that does not have a pair of suction and outflow in the external area Is a symbolic word formed by assigning the same number of holes as the number of added holes, so that the regular expression can be taken from all the basic flow patterns and topologically There is an effect that the operation can be converted into a defined word expression.
- the regular expression creating method when designing a structure in a flow field, a flow pattern that can be easily handled without relying on experience or intuition for the flow pattern that can be taken for the structure.
- the regular expression creating method, regular expression creating apparatus, and program can be provided.
- word expressions and regular expressions are structural, such as bridge pier design, breakwater arrangement, port contamination removal, wind power blade design, train pantograph structure, optimal arrangement of oil fences, etc. It is extremely useful in various fields involving object design and arrangement. Also, it can be applied to fields such as sports mechanics such as structural design of sports equipment.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
図1は、本発明の概略を説明するための説明図である。本願出願人が既に出願した特許文献1(国際公開第2014/041917号、特願2012-203601号、PCT/JP2013/070939号)の「流れパターンの語表現方法、語表現装置、および、プログラム」では、数値計算や実験で得られた流れパターンに対して,この文字列を付与し,そこに現れる流れの定量的な特徴(例えば揚抗比)を定性的な部分文字列として表現する語表現理論を提案した。
図2-A~図22を参照し、本実施の形態に係る流れパターンの正規表現作成方法について説明する。本実施の形態に係る流れパターンの正規表現作成方法はコンピュータ等の装置により実行可能である。図2-Aは、本実施の形態に係る流れパターンの正規表現作成方法の概略を説明するためのフローチャートである。
まず、本実施の形態の流れパターンの正規表現作成方法では、上述の語表現理論の一部を使用しているので、語表現理論について簡単に説明する。
ここで、上述した語表現を形成させる語変換アルゴリズムの概要について以下に説明する。ここで、図3は、語表現アルゴリズムの概要を示すフローチャートである。
1)吸い込み湧き出し対をもち、二つのss-∂-saddle connectionをもつパターンI、
2)吸い込み湧き出し対をもち、一つのsaddle point、それを結ぶhomoclinic saddle connectionと二つのss-saddle connectionをもつパターンII、および
3)吸い込み湧き出し対をもたないパターンO、
である。ここで、図6は、初期構造となる3種類の構造安定な流れパターンを模式的に示す図である。
帰納的に流れを構成していくために、穴を一つとそれに伴う流れの構造を追加するという「操作」について、図7および図8を参照して説明する。すなわち、穴の数がM個ある連結外部領域Dz(M-1)の流れに、一つの穴を加えて多重連結外部領域Dz(M)の流れを求める操作について説明する。
1)一本のss-orbitを、一つのsaddle point、それを結び内部に穴をもつhomoclinic saddle connectionと二つのss-saddle connectionに置き換えるA0操作、
2)一本のss-orbitを、二つのss-∂-saddle connectionと新たに追加した境界上の二つの∂-saddleに置き換えるA2操作、
3)一本のclosed orbitを、一つの穴とsaddle pointを追加して8の字をした2本のhomoclinic軌道に置き換えるB0操作、
4)一本のclosed orbitを、新たに追加した穴の境界上に二つ∂-saddleをつけて一本の∂-saddle connectionでつなぐような軌道に置き換えるB2操作、および、
5)既に2k個(k>0)の∂-saddleをもつ境界に、新たに二つの∂-saddleを付け加えて一本の∂-saddle connectionでつなぎ内部に新たに付け加えた穴を置くC操作、
である。ここで、図7は、穴を一つ付け加えて構造安定な流れを構成する5種類の操作を模式的に示した図である。
O-1)実際に施すことができる操作は、B0,B2,Cのみであり、その結果、Oから始まる語表現はこれら三つの語を列挙したものとなる。
O-2)操作列の語表現においてCの語が含まれるためには、それ以前に必ずB2が存在しなければならない。
I-1)実施可能な操作はA0,A2,B0,B2,Cの全てであり、その結果、Iから始まる語表現はこれら5種類の操作語を列挙したものである。
I-2)操作列の語表現において、B0あるいはB2の語が含まれるためには、それ以前に必ずCかA0が存在しなければならない。
II-1)実施可能な操作はA0,B0,B2,Cであり、その結果、IIから始まる語表現はこれら四つの語を列挙したものである。
II-2)操作列の語表現においてCの語が含まれるために
は、それ以前に必ずB2が存在しなければならない。
上記図2のグラフ表現作成工程(ステップS1)について詳細に説明する。まず、本実施の形態で使用しているグラフ理論について説明する。
グラフT=(V,E)とは、「vertex(頂点)」と呼ばれる点の集合(頂点集合)Vとその頂点の間を結ぶ「edge(エッジ)」と呼ばれる集合Eのペアとして与えられる集合である。一般にグラフは多様な構造を持ちうるが、本実施の形態のグラフ表現理論では、グラフ全体の集合におけるある特定の構造をもった以下のグラフの集合を考える。
2)ルート付き(Rooted)グラフとは、ある特定の頂点(以下、ルート(root)と呼ぶ)が存在しているグラフを指す。ルート付きグラフに対しては、このルートから各頂点v∈Vへのエッジの連結による最短経路を考えることができるので、これをvの高さ(height)と呼び、記号をht(v)と書く。これによりルート付きツリーTに対してはht(T):=maxv∈Vht(v)によって、ツリーT自体の高さを考えることができる。
3)グラフが向き有り(directed)であるとは、すべてのエッジに親子の順序が入っているようなものを指す。向き有りグラフにおける、頂点v∈Vからw∈Vへのエッジは、v⇒w∈Eと表わす。このとき、vはwの親、wはvの子と呼ぶ。Г(v)と書いて、頂点v∈Vの子供全体の集合を表す。すなわち、Г(v):={w∈V│v⇒w∈E}。また、その集合に含まれる子供頂点の数#Г(v)を持って,vのout-degreeとよび、逆にvに入ってくるエッジの数をvのin-degreeと呼ぶ。
本実施の形態のグラフ表現作成工程に係る二次元構造安定なハミルトンベクトル場のツリー表現について説明する。以下、O-wordで表現される流れパターンのグラフ表現と、I,II-wordで表現される流れパターンのグラフ表現について説明する。
Hを二次元領域Dz(M)上のO-wordで表現される構造安定なハミルトンベクトル場とし、Dをそのsaddle connection diagramとする。このハミルトンベクトル場Hに対して固有のルート付き、ラベル付き、及び向き有りのツリーTH=(V,E)を割り当てる方法とその平面グラフとしての可視化アルゴリズムを以下に説明する。
図10-A~図10-Eは、O系列におけるsaddle connection diagramのツリーへの変換処理を説明するためのフローチャートである。コンピュータ等の装置により、図10-A~図10-Eに示す、O系列におけるsaddle connection diagramのツリーへの変換処理を実行可能である。
HをDz(M)内に1-source-sink pointを持つ構造安定なハミルトンベクトル場、Dをそのss-saddle connection diagramとする。このとき、CH=Dz(M)\Dは、closed orbitを含む円環開領域またはss-orbitを含む開円板領域となる連結成分からなる。これに対して、ルート付き、ラベル付き向き有りツリーを以下のように構成する。O-wordの時と同様に、各CHの連結成分を頂点集合に対応づける。ルートとなる連結成分はCHの中で1-source-sink pointに最も近い開円板領域で、その閉包は1-source-sink pointを含みかつ内部に時計回りのss-orbitを含むものを選ぶ。この連結成分にラベルoφを割り当てる。このような決め方によりルートは一義的に決定することができる。
図13-A~図13-Dは、I,II系列におけるss-saddle connection diagramのツリーへの変換処理を説明するためのフローチャートである。図13-A~図13-Dに示す、I,II系列におけるss-saddle connection diagramのツリーへの変換処理は、コンピュータ等の装置によって実行可能である。
以上のことから、1-source-sink pointを持つss-saddle connection diagramに対して、そのルートを一義的に決定でき、また、そこから操作A0,A2,B0,B2,Cによって構成されるss-saddle connection diagramの局所構造と、そこから導入される連結成分の間の親子関係は図9と図12の中で全て表現されているので、以下のことが示されたことになる。
上記図2の正規表現作成工程(ステップS2)について詳細に説明する。さて、グラフ理論でよく知られた事実として、任意のルート付き、ラベル付き、向き有りツリーには固有の「正規表現(regular expression)」なるものを考えることができる。TH=(V,E)を上記方法で与えられた構造安定なハミルトンベクトル場Hに対して与えられたグラフ表現とする。このグラフ表現に対して、その正規表現は以下のようにして帰納的に与えられる。まず、ルート以外のすべての頂点のin-degreeはすべて1であることに注意する。もし、ht(TH)=0ならグラフはルートのみ、すなわちV={v0}であり、その正規表現はl(v0)である。いま、高さht(TH)=n-1の正規表現Nがあった時に、そこにある頂点集合Tn-1={v1,v2,...,vm}とすると、各頂点viの子頂点集合Г(vi)={vi1,vi2,...,vimi}とそれに対応するラベルli=l(vi)(i=1,...,m)を使うと、Nに対してliをli(li1,li2,...,limi)に置き換えることによって新しい正規表現が構成できる。ただし、lik=l(vik)(k=1,...,mi)である。このようにして構成されたTHの正規表現をNTHとすると、その構成手法から以下の命題を得る。
図14-Bは、ツリーの正規表現への変換処理を説明するためのフローチャートである。図14-Bに示す、ツリーの正規表現への変換処理は、コンピュータ等の装置により実行可能である。以下の処理では、前処理として,ツリーの全ての点にidが与える。ただし,異なる点のidは異なるものとする。図14-Bにおいて、inputをツリーGとする(ステップS178)。VをツリーGの頂点集合,s=0,T={0},Xを空集合φ,正規表現N=(s,σφ)()と置く(ステップS179)。
上記図2の語表現変換工程(ステップS3)について詳細に説明する。
(4-1.正規表現から語表現への変換アルゴリズム)
(4-1-1.許容正規表現(admissible regular expression))
以上説明したように、正規表現とss-saddle connection digramは1対1に対応する(単射)ことがわかるので、正規表現からその語表現へのアルゴリズムを与えることができる。ただし、ss-saddle connection diagramから正規表現を与える合成写像fN(fT(H))は全射ではないので、すべての正規表現にこのアルゴリズムを適用することはできず、可能なのは合成写像fN(fT(H))の像となっている正規表現のみである。このような正規表現を許容正規表現(admissible regular expression)と称する。許容正規表現を特徴づけるために、以下のような正規表現のfundamental type(基本形)とforward replacement(前方置換)を定義する。すなわち、許容正規表現とは、ルートつき,ラベル付き,および方向つきのツリーに対応する正規表現のうち,fundamental typeの正規表現に対して,正規表現のforward replacementを施してできる全ての正規表現をいう。
以上から分かるように、これから与える語表現への変換アルゴリズムはfundamental typeに各操作A0,A2,B0,B2,Cを施した時に得られるforward replacementを順次繰り返して得られる正規表現だけを入力として受け取るこができる。
2)Nの語表現はIA0 p+mA2 c-2-p-mかIIA0 c-2のいずれかである。ただし、c,p,mは、Nに含まれるo*,+0,-0のいずれかである。
図22-A~図22-Cは、正規表現の語表現への変換処理を説明するためのフローチャートである。図22-A~図22-Cに示す正規表現の語表現への変換処理は、コンピュータ等の装置で実行可能である。以下、σ∈{+,-}を表し、μ=-σとする。図22-A~図22-Cにおいて、まず、inputを正規表現Nとする(ステップS184)。語Wを空集合φと置く(ステップS185)。
次に、本実施の形態に係る正規表現作成装置の構成について図23を参照して説明する。図23は、本実施の形態が適用される正規表現作成装置100の一例を示すブロック図であり、該構成のうち本実施形態に関係する部分のみを概念的に示している。
例えば、橋や橋脚など流体中におかれた物体(以下設計対象と呼ぶ)の形状や配置、またその周囲の流れの制御などを通じて設計の対象にとって最適なパラメータを定めるような設計手法について,語表現と正規表現を使ってどのように設計を行うかを説明する。
前提2:設計対象を設計する上で、問題に応じた「最適な状態」が設定されており、その最適状態が流線構造の特徴として記述できているものとする。例えば、剥離渦を閉じこめる状態を最適状態とすると、翼であれば揚力の最大化,橋脚であれば抗力の最小化などが期待できる。
前提3:これらの設計において、設計パラメータを変えて実験および数値計算(そしてそれにおいて得られる流線パターンの語表現・正規表現)ができるものとする。以下、二次元の流れに限定する。三次元の場合は断面をとって考えたりして二次元化することなどで設計が可能になる場合もある(三次元の場合はすべての場合でできるとは限らないことに注意する)。
語表現と正規表現を使用して、流体中に置かれた物体(以下、「設計対象」と呼ぶ)のまわりの流れを最適化する設計手法について説明する。以下では、語表現と正規表現を使用して、一様流中に置かれた物体のまわりにできる流線パターン(現在のパターン)が、所望の流線パターン(目的のパターン)となるように、物体の設計パラメータ(物理パラメータ)を設計する手法(上述の第2の設計パラメータ選択工程)の一例について説明する。以下の例では、一様流中に平板翼を置いた場合の流線パターンについて説明する。なお、第2の設計パラメータ選択工程は、正規表現のみを使用しても原理上実行可能であるが、正規表現と語表現を使用することで、より好適な設計パラメータを設計することが可能となる。
さて、これまで本発明の実施形態について説明したが、本発明は、上述した実施形態以外にも、請求の範囲に記載した技術的思想の範囲内において種々の異なる実施形態にて実施されてよいものである。
102 制御部
102a シミュレーション部
102b 流線解析部
102c グラフ表現作成部
102d 正規表現作成部
102e 語表現変換部
104 通信制御インターフェース部
106 記憶部
106a シミュレーション結果ファイル
106b 流線図ファイル
106c 正規表現ファイル
108 入出力制御インターフェース部
112 入力装置
114 出力装置
120 外部システム
130 ネットワーク
200 物体
300 平板翼
Claims (16)
- 位相幾何学的にN(但し、Nは1以上の整数)個の穴を有する多重連結外部領域における流れパターンの正規表現を作成する正規表現作成方法であって、
前記流れパターンに1対1に対応するグラフ表現を作成するグラフ表現作成工程と、
前記グラフ表現作成工程で作成されたグラフ表現から正規表現を作成する正規表現作成工程と、
を含む流れパターンの正規表現作成方法。 - 前記グラフ表現は、前記流れパターンで規定される構造安定なハミルトンベクトル場Hに対して、固有のルート付き、ラベル付き、及び向き有りのツリーTH=(V,E)を割り当て(但し、Vは頂点と呼ばれる点の集合、Eは、頂点の間を結ぶエッジの集合である)、平面グラフとして可視化したものであることを特徴とする請求項1に記載の流れパターンの正規表現作成方法。
- 前記グラフ表現は、親の頂点をv、その子の頂点をw,親の頂点vに割り当てられたラベルをl(v)、子の頂点wに割り当てられたラベルをl(w),vの子頂点集合Γ(v)とした場合、vの子頂点集合Γ(v)を所定の順序関係のルールに従って並び替え、w∈Γ(v)について、l(v)からl(w)への矢印を左から右に並べて描画したものを含むことを特徴とする請求項1又は請求項2に記載の流れパターンの正規表現作成方法。
- 前記流れパターンは、
(1)一つの穴を有する単連結外部領域において位相幾何学的に採り得る2種類の流れパターンのうちの、吸い込み湧き出し対をもち、二つのss-∂-saddle connectionをもつパターンI、
(2)前記一つの穴を有する単連結外部領域において位相幾何学的に採り得る2種類の流れパターンのうちの、吸い込み湧き出し対をもち、一つのsaddle point、それを結ぶhomoclinic saddle connectionと二つのss-saddle connectionをもつパターンII、
(3)二つの穴を有する二重連結外部領域において吸い込み湧き出し対を持たないパターンO、
からなるパターン語の1又は複数で規定されることを特徴とする請求項1~請求項3のいずれか1つに記載の流れパターンの正規表現作成方法。 - 前記グラフ作成工程は、
前記流れパターンが吸い込み湧き出し対を有する場合は、前記流れパターンを、前記吸い込み湧き出し対に最も近い反時計回りのss-orbitを含む領域が一番外側領域になるように変換し、
前記変換した流れパターンの(ss-)saddle connection diagramに現れる軌道を領域全体から抽出し、
領域全体から(ss-)saddle connection diagramに現れる軌道をすべて除外して得られる連結成分に頂点を設定し、一番外側にある連結成分をルートとし、
カレント成分をルートに設定し、
前記カレント成分と互いに境界を接するような連結成分をカレント成分の子として、境界にあたる軌道に応じてラベルを割り当て,当該ラベルを所定の順序関係に従って並べ、
前記カレント成分の子をカレント成分に設定して、子がなくなるまで繰り返すこと、
を含むことを特徴とする請求項1~請求項4のいずれか1つに記載の流れパターンの正規表現作成方法。 - 前記流れパターンは、前記パターン語の1又は複数から開始し、流れパターンに一つの穴を加える場合に位相幾何学的に採り得る5種類の操作を規定した操作語のうちのいずれか一語を付与する操作を、穴の数がN個となるまで繰り返して作成された流れパターン図であることを特徴とする請求項5に記載の流れパターンの正規表現作成方法。
- さらに、前記正規表現作成工程で作成された正規表現を語表現に変換する語表現変換工程と、
を含むことを特徴とする請求項1~請求項6のいずれか1つに記載の流れパターンの正規表現作成方法。 - 前記語表現変換工程では、ルートつき,ラベル付き,及び方向つきのツリーに対応する正規表現のうちの基本タイプの正規表現に前方置換を施すことが可能な許容正規表現を前記語表現に変換することを特徴とする請求項7に記載の流れパターンの正規表現作成方法。
- 前記語表現は、一つの穴を有する単連結外部領域において位相幾何学的に採り得る2種類の流れパターンに加えて、二つの穴を有する二重連結外部領域において吸い込み湧き出し対を持たないパターンを追加した、合計3種類の流れパターンを規定するパターン語に対して、前記流れパターンに一つの穴を加える場合に位相幾何学的に採り得る5種類の操作を規定した操作語のうちのいずれか一語を、追加された穴の数だけ付与することにより形成された記号語であることを特徴とする請求項7又は請求項8に記載の流れパターンの正規表現作成方法。
- さらに、流体中の物体に対して設計パラメータの候補を選択する場合に、前記設計パラメータの上限及び下限を設定し、当該設計パラメータの上限と下限で規定されるパラメータ領域から複数のパラメータを選択し、選択した複数のパラメータに対して、それぞれ流れの実験及び/又は数値計算を行い、実験及び/又は数値計算の結果に対して、前記語表現及び/又は前記正規表現を割り当て、割り当てた前記語表現及び/又は前記正規表現のうち、最適状態を示す前記語表現及び/又は前記正規表現を有する設計パラメータを、前記設計パラメータの候補として選択する設計パラメータ選択工程を含むことを特徴とする請求項1~請求項9のいずれか1つに記載の流れパターンの正規表現作成方法。
- 前記設計パラメータ選択工程は、さらに、前記選択した設計パラメータを使用して最適化設計を行う工程を含むことを特徴とする請求項10に記載の流れパターンの正規表現作成方法。
- さらに、流体中の物体に対して最適な設計パラメータを選択する場合に、現在の流れパターンの前記正規表現から目的とする流れパターンの前記正規表現へ遷移するように設計パラメータを変更し、当該目的とする流れパターンの前記正規表現となる設計パラメータを選択する第2の設計パラメータ選択工程を含むことを特徴とする請求項1~請求項9のいずれか1つに記載の流れパターンの正規表現作成方法。
- 前記第2の設計パラメータ選択工程では、前記現在の流れパターンの前記正規表現及び語表現から目的とする流れパターンの前記正規表現及び語表現へ遷移するように設計パラメータを変更し、当該目的とする流れパターンの前記正規表現及び語表現となる設計パラメータを選択することを特徴とする請求項12に記載の流れパターンの正規表現作成方法。
- 前記第2の設計パラメータ選択工程は、
前記現在の流れパターンの前記正規表現及び語表現から前記目的とする流れパターンの正規表現及び語表現へ遷移するための1又は複数の経路を取得し、
前記取得した1又は複数の経路のうち、設計パラメータを変更して前記現在の流れパターンから遷移可能な経路を選択し、
前記選択した経路に対して、前記変更した設計パラメータを中心にして設計パラメータを変更し、前記目的とする流れパターンの前記正規表現及び語表現となる設計パラメータを選択することを特徴とする請求項13に記載の流れパターンの正規表現作成方法。 - 位相幾何学的にN(但し、Nは1以上の整数)個の穴を有する多重連結外部領域における流れパターンの正規表現を作成する正規表現作成装置であって、
前記流れパターンに1対1に対応するグラフ表現を作成するグラフ表現作成手段と、
前記グラフ表現作成工程で作成されたグラフ表現から正規表現を作成する正規表現作成手段と、
を備えたことを特徴とする流れパターンの正規表現作成装置。 - 位相幾何学的にN(但し、Nは1以上の整数)個の穴を有する多重連結外部領域における流れパターンの正規表現を作成する正規表現作成装置に搭載されるプログラムであって、
前記流れパターンに1対1に対応するグラフ表現を作成するグラフ表現作成工程と、
前記グラフ表現作成工程で作成されたグラフ表現から正規表現を作成する正規表現作成工程と、
をコンピュータに実行させることを特徴とするコンピュータが実行可能なプログラム。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2016557834A JP6401288B2 (ja) | 2014-11-06 | 2015-11-06 | 流れパターンの正規表現作成方法、正規表現作成装置、および、コンピュータが実行可能なプログラム |
US15/524,897 US10540460B2 (en) | 2014-11-06 | 2015-11-06 | Flow pattern regular expression creating method, regular expression creating apparatus, and computer-executable program |
EP15858028.2A EP3217303A4 (en) | 2014-11-06 | 2015-11-06 | Regular expression creation method and regular expression creation device of flow pattern, and computer-executable program |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2014226532 | 2014-11-06 | ||
JP2014-226532 | 2014-11-06 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2016072515A1 true WO2016072515A1 (ja) | 2016-05-12 |
Family
ID=55909238
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2015/081402 WO2016072515A1 (ja) | 2014-11-06 | 2015-11-06 | 流れパターンの正規表現作成方法、正規表現作成装置、および、コンピュータが実行可能なプログラム |
Country Status (4)
Country | Link |
---|---|
US (1) | US10540460B2 (ja) |
EP (1) | EP3217303A4 (ja) |
JP (1) | JP6401288B2 (ja) |
WO (1) | WO2016072515A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2021019883A1 (ja) | 2019-07-30 | 2021-02-04 | 国立研究開発法人科学技術振興機構 | 有限型の流れパターンの語表現装置、語表現方法、プログラム、構造物形状の学習方法および構造物設計方法 |
WO2021153721A1 (ja) | 2020-01-30 | 2021-08-05 | 国立大学法人京都大学 | 流れパターンの語表現装置、語表現方法およびプログラム |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108629065B (zh) * | 2017-11-09 | 2021-09-17 | 中车株洲电力机车有限公司 | 一种小转角受电弓弓头设计方法 |
CN112182922B (zh) * | 2020-09-07 | 2022-10-21 | 三峡大学 | 方形桥墩冲刷问题的绕流流场计算方法 |
CN112308051B (zh) * | 2020-12-29 | 2021-10-29 | 北京易真学思教育科技有限公司 | 文本框检测方法、装置、电子设备和计算机存储介质 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008532176A (ja) * | 2005-02-28 | 2008-08-14 | ザイ デクマ アクチボラゲット | 認識グラフ |
WO2014041917A1 (ja) * | 2012-09-14 | 2014-03-20 | 独立行政法人科学技術振興機構 | 流れパターンの語表現方法、語表現装置、および、プログラム |
-
2015
- 2015-11-06 WO PCT/JP2015/081402 patent/WO2016072515A1/ja active Application Filing
- 2015-11-06 EP EP15858028.2A patent/EP3217303A4/en not_active Ceased
- 2015-11-06 US US15/524,897 patent/US10540460B2/en active Active
- 2015-11-06 JP JP2016557834A patent/JP6401288B2/ja active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008532176A (ja) * | 2005-02-28 | 2008-08-14 | ザイ デクマ アクチボラゲット | 認識グラフ |
WO2014041917A1 (ja) * | 2012-09-14 | 2014-03-20 | 独立行政法人科学技術振興機構 | 流れパターンの語表現方法、語表現装置、および、プログラム |
Non-Patent Citations (2)
Title |
---|
JIN ARAI: "Researches on fluid mechanics from perspective of mathematical physics Towards topological understanding of the structure of fluid flows", NAGARE, vol. 33, no. 1, 25 February 2014 (2014-02-25), pages 23 - 28, XP055440865, ISSN: 0286-3154 * |
See also references of EP3217303A4 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2021019883A1 (ja) | 2019-07-30 | 2021-02-04 | 国立研究開発法人科学技術振興機構 | 有限型の流れパターンの語表現装置、語表現方法、プログラム、構造物形状の学習方法および構造物設計方法 |
WO2021153721A1 (ja) | 2020-01-30 | 2021-08-05 | 国立大学法人京都大学 | 流れパターンの語表現装置、語表現方法およびプログラム |
JP7418719B2 (ja) | 2020-01-30 | 2024-01-22 | 株式会社Cardio Flow Design | 流れパターンの語表現装置、語表現方法およびプログラム |
Also Published As
Publication number | Publication date |
---|---|
US10540460B2 (en) | 2020-01-21 |
US20170323033A1 (en) | 2017-11-09 |
EP3217303A4 (en) | 2018-06-20 |
JPWO2016072515A1 (ja) | 2017-08-17 |
JP6401288B2 (ja) | 2018-10-10 |
EP3217303A1 (en) | 2017-09-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6401288B2 (ja) | 流れパターンの正規表現作成方法、正規表現作成装置、および、コンピュータが実行可能なプログラム | |
Mackaness et al. | Generalisation of geographic information: cartographic modelling and applications | |
Št'ava et al. | Inverse procedural modeling by automatic generation of L‐systems | |
Yang et al. | Sketch-based modeling of parameterized objects. | |
Scheibel et al. | A Taxonomy of Treemap Visualization Techniques. | |
CN107248142B (zh) | 一种文物碎片自动拼接方法 | |
CN113487024A (zh) | 交替序列生成模型训练方法、从文本中抽取图的方法 | |
Schneider et al. | Interactive comparison of multifield scalar data based on largest contours | |
Van Ham et al. | Visualization of state transition graphs | |
De Carli et al. | Procedural generation of 3D canyons | |
JP6440629B2 (ja) | 流体遷移経路取得装置、流体遷移経路取得方法、および、プログラム | |
KR101635498B1 (ko) | 흐름 패턴의 워드 표현 방법, 워드 표현 장치 및 프로그램 | |
Overholser | Descendent tropical mirror symmetry for $\mathbb {P}^ 2$ | |
Yousif et al. | Shape clustering using k-medoids in architectural form finding | |
WO2021019883A1 (ja) | 有限型の流れパターンの語表現装置、語表現方法、プログラム、構造物形状の学習方法および構造物設計方法 | |
Naitzat et al. | M-Boost: Profiling and refining deep neural networks with topological data analysis | |
Akutsu et al. | A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications | |
Chen et al. | Automatic parameterisation of semantic 3D city models for urban design optimisation | |
Miranda Carranza | Convex maps, some basic concepts and a new method to generate them | |
Burch et al. | The aesthetics of rapidly-exploring random trees | |
Borsa et al. | The wreath process: A totally generative model of geometric shape based on nested symmetries | |
Thapa | High Clearance Collision-Free Paths | |
Liao et al. | Hierarchical Automatic Power Plane Generation with Genetic Optimization and Multilayer Perceptron | |
Su et al. | From a link-node-based network representation model to a lane-based network representation model: two-dimensional arrangements approach | |
Raj | Depth-based visualizations for ensemble data and graphs |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15858028 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2016557834 Country of ref document: JP Kind code of ref document: A |
|
REEP | Request for entry into the european phase |
Ref document number: 2015858028 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 15524897 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |