TOP > クイック検索 > 外国特許検索 > REGULAR EXPRESSION CREATION METHOD AND REGULAR EXPRESSION CREATION DEVICE OF FLOW PATTERN, AND COMPUTER-EXECUTABLE PROGRAM

REGULAR EXPRESSION CREATION METHOD AND REGULAR EXPRESSION CREATION DEVICE OF FLOW PATTERN, AND COMPUTER-EXECUTABLE PROGRAM NEW

外国特許コード F170008968
整理番号 AF16-08WO
掲載日 2017年3月13日
出願国 世界知的所有権機関(WIPO)
国際出願番号 2015JP081402
国際公開番号 WO 2016072515
国際出願日 平成27年11月6日(2015.11.6)
国際公開日 平成28年5月12日(2016.5.12)
優先権データ
  • 特願2014-226532 (2014.11.6) JP
発明の名称 (英語) REGULAR EXPRESSION CREATION METHOD AND REGULAR EXPRESSION CREATION DEVICE OF FLOW PATTERN, AND COMPUTER-EXECUTABLE PROGRAM NEW
発明の概要(英語) The purpose of the present invention is to provide a regular expression creation method and regular expression creation device of a flow pattern, and a program, which are capable of providing a new expression method which is capable of one-to-one correspondence with a flow pattern. Provided is a regular expression creation method which creates a regular expression of a flow pattern topologically in a multiply connected exterior domain having N holes (where N is an integer greater than or equal to 1), said method comprising: a graph expression creation step of creating a graph expression in one-to-one correspondence with the flow pattern; and a regular expression creation step of creating a regular expression from the graph expression which is created in the graph expression creation step.
特許請求の範囲(英語) [claim1]
1. Topology N (however, as for N integer of 1 or more) outside multiple connecting where has the hole being the regular expression compilation method of drawing up the regular expression of the flow pattern in the territory,
The graph expression compilation process which draws up the graph expression which corresponds to 1 to 1 in the aforementioned flow pattern and,
The regular expression compilation process which draws up regular expression from the graph expression which was drawn up with the aforementioned graph expression compilation process and,
Regular expression compilation method of the flow pattern which is included.
[claim2]
2. As for gathering and E of the point where the specific route attachment and the label it is attached the structural stability which is stipulated with the aforementioned flow pattern vis-a-vis Hamilton vector field H, and faces and tree T [H] = (V, E) allots the aforementioned graph expression and, (however, as for V is called apex, in the claim 1 which features that it is something which it visualizes gathering of the edge which ties between apex is), as the plane surface graph regular expression compilation method of flow pattern of statement.
[claim3]
3. The aforementioned graph expression, apex of the parent v, apex of that child the label which is allotted to the apex v of w and the parent l (v), when the label which is allotted to the apex w of the child l (w), it makes v child apex gathering .Gamma.(v), following v child apex gathering .Gamma.(v) to the rule of specified order relationship, the claim 1 which features that it includes those where it lines up and change, from l (v) l (w) to from the left arranging the arrow into the right concerning w .Gamma.(v), they draw or in claim 2 regular expression compilation method of flow pattern of statement.
[claim4]
4. As for the aforementioned flow pattern,
The pattern I where has two ss- -saddle connection among flow patterns of 2 types which topology it can take, it sucks (1) in the single string joining external territory which possesses one hole and erupts and with opposite,
The pattern II which has homoclinic saddle connection and two ss-saddle connection where among flow patterns of 2 types which topology it can take, it sucks (2) in the single string joining external territory which possesses the hole of the aforementioned one and erupts and with opposite, one saddle point, tie that,
(3) the pattern O where it sucks the territory and outside duplication connecting which possesses two holes in erupts and does not have opposite,
The pattern language which consists of 1 or either of the claim 1- claim 3 which features that it is stipulated with plural in one regular expression compilation method of flow pattern of statement.
[claim5]
5. As for the aforementioned graph compilation process,
The aforementioned flow pattern sucks and erupts and when it possesses opposite, the description above sucks and erupts aforementioned flow pattern and, in order the territory where counterclockwise ss-orbit which is closest to opposite is included most to become the outer part territory, converts,
The description above (ss-) of the flow pattern which is converted the track which in saddle connection diagram appears is extracted from the whole territory,
(Ss-) excluding the track which in saddle connection diagram appears entirely from the whole territory, it sets apex to the connected component which can, most it designates the connected component which is outside as the route,
The current component is set to the route,
To allot the label according to the track which hits to boundary the aforementioned current component and mutually boundary, the kind of connected component which touches as a child of the current component, following the particular label to specified order relationship, arranging,
Setting the child of the aforementioned current component to the current component, until there is no child, repeat,
Either of the claim 1- claim 4 which features that it includes in one regular expression compilation method of flow pattern of statement.
[claim6]
6. The aforementioned pattern language 1 or it starts the aforementioned flow pattern, from plural, flows and until either among the operation languages which stipulate the operation of 5 types which topology it can take the operation of granting one language, the number of holes N becomes when one hole is added to pattern in the claim 5 which features that it is the flow pattern figure which was drawn up over again regular expression compilation method of flow pattern of statement.
[claim7]
7. Furthermore, the language expression conversion process which converts the regular expression which was drawn up with the aforementioned regular expression compilation process to language expression and,
Either of the claim 1- claim 6 which features that it includes in one regular expression compilation method of flow pattern of statement.
[claim8]
8. With the aforementioned language expression conversion process, in the claim 7 which features that the allowance regular expression whose it is possible to administer front substitution to the route being attached, the labeled, and regular expression of basic type among regular expressions which correspond to the tree of the direction being attached is converted to the aforementioned language expression regular expression compilation method of flow pattern of statement.
[claim9]
9. Being the symbolic language which was formed either among the operation languages which stipulate the operation of 5 types which topology it can take equal to the number of holes which one language, are added by granting when one hole is added to the aforementioned flow pattern vis-a-vis the pattern language where the aforementioned language expression the territory in the single string joining external territory which possesses one hole and outside duplication connecting which possesses two holes in addition to the flow pattern of 2 types which topology it can take, sucked in erupted and added the pattern which does not have opposite, stipulates the flow pattern of total 3 types, featureWith the claim 7 which is done or in claim 8 regular expression compilation method of flow pattern of statement.
[claim10]
10. Furthermore, when candidacy of design parameter is selected vis-a-vis the object in the fluid, it sets the upper limit and the lower limit of the aforementioned design parameter, it selects plural parameters from the upper limit of particular design parameter, and the parameter territory which is stipulated in the lower limit experiment of the respective flow and/or it calculates numerically vis-a-vis the plural parameters which are selected, the aforementioned language expression and/or it allots the aforementioned regular expression experiment and/or vis-a-vis the result of numerical calculation, the aforementioned language expression which is allotted and/or among the aforementioned regular expressions, the aforementioned language expression which shows optimum state and/or it possesses the aforementioned regular expressionEither of the claim 1- claim 9 which features that the design parameter selective process which it selects design parameter, as candidacy of the aforementioned design parameter is included in one regular expression compilation method of flow pattern of statement.
[claim11]
11. As for the aforementioned design parameter selective process, furthermore, the description above using the design parameter which is selected, in the claim 10 which features that it includes the process which does the optimization design regular expression compilation method of flow pattern of statement.
[claim12]
12. Furthermore, in order when optimum design parameter is selected vis-a-vis the object in the fluid, to transit to the aforementioned regular expression of the flow pattern which is made purpose from the aforementioned regular expression of present flow pattern, either of the claim 1- claim 9 which features that the 2nd design parameter selective process which selects the design parameter which becomes the aforementioned regular expression of the flow pattern which modifies design parameter, makes particular purpose is included in one regular expression compilation method of flow pattern of statement.
[claim13]
13. In the claim 12 which features that the design parameter which becomes the aforementioned regular expression and language expression of the flow pattern which with the aforementioned 2nd design parameter selective process, in order to transit to the aforementioned regular expression and language expression of the flow pattern which is made purpose from the aforementioned regular expression and language expression of the aforementioned present flow pattern, modifies design parameter, makes particular purpose is selected regular expression compilation method of flow pattern of statement.
[claim14]
14. As for the aforementioned 2nd design parameter selective process,
In order to transit 1 or plural routes are acquired to regular expression and language expression of the flow pattern which is made the aforementioned purpose from the aforementioned regular expression and language expression of the aforementioned present flow pattern,
The description above inside 1 or the plural routes which is acquired, modifying design parameter, it selects transition possible route from the aforementioned present flow pattern,
In the claim 13 which features that the design parameter which becomes the aforementioned regular expression and language expression of the flow pattern which modifies design parameter with the design parameter which is modified as a center the description above vis-a-vis the route which is selected, the description above, makes the aforementioned purpose is selected regular expression compilation method of flow pattern of statement.
[claim15]
15. Topology N (however, as for N integer of 1 or more) outside multiple connecting where has the hole being the regular expression compilation device which draws up the regular expression of the flow pattern in the territory,
The graph expression compilation expedient which draws up the graph expression which corresponds to 1 to 1 in the aforementioned flow pattern and,
The regular expression compilation expedient which draws up regular expression from the graph expression which was drawn up with the aforementioned graph expression compilation process and,
The regular expression compilation device of the flow pattern which features that it has.
[claim16]
16. Topology N (however, as for N integer of 1 or more) outside multiple connecting where has the hole being the program which is loaded onto the regular expression compilation device which draws up the regular expression of the flow pattern in the territory,
The graph expression compilation process which draws up the graph expression which corresponds to 1 to 1 in the aforementioned flow pattern and,
The regular expression compilation process which draws up regular expression from the graph expression which was drawn up with the aforementioned graph expression compilation process and,
The computer which features that it makes the computer execute the program which is feasibility.
  • 出願人(英語)
  • ※2012年7月以前掲載分については米国以外のすべての指定国
  • JAPAN SCIENCE AND TECHNOLOGY AGENCY
  • 発明者(英語)
  • SAKAJO TAKASHI
  • YOKOYAMA TOMOO
国際特許分類(IPC)
指定国 (WO201672515)
National States: AE AG AL AM AO AT AU AZ BA BB BG BH BN BR BW BY BZ CA CH CL CN CO CR CU CZ DE DK DM DO DZ EC EE EG ES FI GB GD GE GH GM GT HN HR HU ID IL IN IR IS JP KE KG KN KP KR KZ LA LC LK LR LS LU LY MA MD ME MG MK MN MW MX MY MZ NA NG NI NO NZ OM PA PE PG PH PL PT QA RO RS RU RW SA SC SD SE SG SK SL SM ST SV SY TH TJ TM TN TR TT TZ UA UG US UZ VC VN ZA ZM ZW
ARIPO: BW GH GM KE LR LS MW MZ NA RW SD SL SZ TZ UG ZM ZW
EAPO: AM AZ BY KG KZ RU TJ TM
EPO: AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR
OAPI: BF BJ CF CG CI CM GA GN GQ GW KM ML MR NE SN ST TD TG
参考情報 (研究プロジェクト等) CREST Alliance for Breakthrough between Mathematics and Sciences (ABMS) AREA
ライセンスをご希望の方、特許の内容に興味を持たれた方は、問合せボタンを押してください。

PAGE TOP

close
close
close
close
close
close