Form information extraction method and system based on template

文档序号:1861727 发布日期:2021-11-19 浏览:4次 中文

阅读说明:本技术 基于模板的表格信息抽取方法及系统 (Form information extraction method and system based on template ) 是由 柳晶晶 么新新 任骥 乔智君 马学兰 于 2021-08-25 设计创作,主要内容包括:本发明公开了一种基于模板的表格信息抽取方法及系统,所述方法包括:确定信息名key和对应的信息值value,得到表格信息抽取模板;基于所述表格信息抽取模板中的信息名key和信息值value,对表格进行信息抽取。本发明适用于大多数的表格,而不需提前判定待分析的表格形式。针对新的表格形式的信息抽取,只需增加新的模板规则即可,便于维护,抽取成本低。(The invention discloses a form information extraction method and a form information extraction system based on a template, wherein the method comprises the following steps: determining an information name key and a corresponding information value to obtain a table information extraction template; and extracting information of the table based on the information name key and the information value in the table information extraction template. The present invention is applicable to most forms without determining in advance the form to be analyzed. Aiming at the information extraction of a new table form, only a new template rule is needed to be added, so that the maintenance is convenient, and the extraction cost is low.)

1. A form information extraction method based on a template is characterized by comprising the following steps:

determining an information name key and a corresponding information value to obtain a table information extraction template;

and extracting information of the table based on the information name key and the information value in the table information extraction template.

2. The method of claim 1, wherein the type of the information name key comprises: the method comprises the following steps of table head name, a known table head name combination and an unknown table head name combination, wherein the expression of the unknown table head name is as follows: key ^ row change number, column change number.

3. The method according to claim 2, wherein extracting information from the table based on the information name key in the table information extraction template specifically comprises:

when the type of the information name key is an unknown header name combination, performing full matching according to the keywords in the unknown header name expression and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and column occupied by the initial cell as an initial row and an initial column;

operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number in the unknown header expression, wherein the expression of the row change number or the column change number comprises: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

4. The method according to claim 1, wherein determining the corresponding information value specifically comprises:

and determining the corresponding information value according to the expression of the information value, namely the keyword 1^ row change number 1, the column change number 1& & the keyword 2^ row change number 2, and the column change number 2& & … ….

5. The method according to claim 4, wherein extracting information of the table based on the information value in the table information extraction template specifically comprises:

splitting an expression of the information value into one or more minimum granularity rules according to the "& &", wherein the expression of the minimum granularity rules is as follows: key ^ row change number, column change number;

extracting information from the table according to each minimum granularity rule;

and obtaining cells according to each minimum granularity rule to solve intersection, wherein the common cells are the values of the final information values.

6. The method according to claim 5, wherein the extracting information from the table according to each minimum granularity rule specifically comprises:

performing full matching according to the keywords in the expression of the minimum granularity rule and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and the column occupied by the initial cell as an initial row and an initial column;

operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number, wherein the expression of the row change number or the column change number comprises the following steps: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

7. A template-based form information extraction system, comprising:

the template determining module is used for determining the information name key and the corresponding information value to obtain a table information extraction template;

and the extraction module is used for extracting the information of the table based on the information name key and the information value in the table information extraction template.

8. The system of claim 7, wherein the type of the information name key comprises: the method comprises the following steps of table head name, a known table head name combination and an unknown table head name combination, wherein the expression of the unknown table head name is as follows: key ^ row change number, column change number;

the extraction module is specifically configured to:

when the type of the information name key is an unknown header name combination, performing full matching according to the keywords in the unknown header name expression and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and column occupied by the initial cell as an initial row and an initial column;

operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number in the expression y of the unknown head name, wherein the expression of the row change number or the column change number comprises: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

9. The system according to claim 7, wherein determining the corresponding information value specifically comprises:

determining a corresponding information value according to an expression of the information value, wherein the expression comprises a keyword 1^ row change number 1, a column change number 1& & keyword 2^ row change number 2, and the column change number 2& & … …;

the extraction module is specifically configured to:

splitting an expression of the information value into one or more minimum granularity rules according to the "& &", wherein the expression of the minimum granularity rules is as follows: key ^ row change number, column change number;

extracting information from the table according to each minimum granularity rule;

and obtaining cells according to each minimum granularity rule to solve intersection, wherein the common cells are the values of the final information values.

10. The system of claim 9, wherein the extraction module is specifically configured to:

performing full matching according to the keywords in the expression of the minimum granularity rule and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and the column occupied by the initial cell as an initial row and an initial column;

operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number, wherein the expression of the row change number or the column change number comprises the following steps: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

Technical Field

The invention relates to the technical field of computers, in particular to a form information extraction method and system based on a template.

Background

With the rapid development of information technology, the construction of knowledge bases in various industries is applied to various systems such as intelligent question answering, intelligent search, personalized recommendation and the like. Information is extracted from the text to construct a knowledge base, and the extraction is carried out by utilizing the existing natural language processing technology, so that certain error probability exists, and manual verification is required. Consider that there is a large amount of tabular data in different industries and that semi-structured tables have higher data quality than unstructured text. How to correctly and effectively analyze the table data and extract information from the table data for expanding the knowledge base is a meaningful problem.

Currently, extraction of table information generally specifies a set of extraction rules for tables with different formats, that is, extraction rules are different for tables with different header formats. Thus, the extraction cost is high, and the maintenance is difficult.

Disclosure of Invention

The invention aims to provide a form information extraction method and system based on a template, and aims to solve the problems in the prior art.

The invention provides a form information extraction method based on a template, which comprises the following steps:

determining an information name key and a corresponding information value to obtain a table information extraction template;

and extracting information of the table based on the information name key and the information value in the table information extraction template.

The invention provides a form information extraction system based on a template, which comprises:

the template determining module is used for determining the information name key and the corresponding information value to obtain a table information extraction template;

and the extraction module is used for extracting the information of the table based on the information name key and the information value in the table information extraction template.

The technical scheme of the embodiment of the invention is suitable for most tables without judging the form of the table to be analyzed in advance. Aiming at the information extraction of a new table form, only a new template rule is needed to be added, so that the maintenance is convenient, and the extraction cost is low.

The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.

FIG. 1 is a flow chart of a template-based form information extraction method according to an embodiment of the present invention;

FIG. 2 is a diagram of a template-based form information extraction system according to an embodiment of the present invention.

Detailed Description

The technical solutions of the present invention will be described clearly and completely with reference to the following embodiments, and it should be understood that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In the description of the present invention, it is to be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", and the like, indicate orientations and positional relationships based on those shown in the drawings, and are used only for convenience of description and simplicity of description, and do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be considered as limiting the present invention.

Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, features defined as "first", "second", may explicitly or implicitly include one or more of the described features. In the description of the present invention, "a plurality" means two or more unless specifically defined otherwise. Furthermore, the terms "mounted," "connected," and "connected" are to be construed broadly and may, for example, be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.

Method embodiment

According to an embodiment of the present invention, a template-based form information extraction method is provided, fig. 1 is a flowchart of the template-based form information extraction method according to the embodiment of the present invention, and as shown in fig. 1, the template-based form information extraction method according to the embodiment of the present invention specifically includes:

step 101, determining an information name key and a corresponding information value to obtain a table information extraction template; wherein, the type of the information name key comprises: the method comprises the following steps of table head name, known table head name combination and unknown table head name combination, wherein the expression format of the unknown table head name is as follows: key ^ row change number, column change number. In step 101, determining the corresponding information value specifically includes:

and determining the corresponding information value according to the expression of the information value, namely the keyword 1^ row change number 1, the column change number 1& & the keyword 2^ row change number 2, and the column change number 2& & … ….

And 102, extracting information of the table based on the information name key and the information value in the table information extraction template. Step 102 specifically includes:

when the type of the information name key is an unknown header name combination, performing full matching according to the keywords in the unknown header name expression and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and column occupied by the initial cell as an initial row and an initial column;

operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number in the unknown header name expression, wherein the expression of the row change number or the column change number comprises the following steps: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

In step 102, the extracting information of the table based on the information value in the table information extraction template specifically includes:

1. splitting an expression of the information value into one or more minimum granularity rules according to the "& &", wherein the expression of the minimum granularity rules is as follows: key ^ row change number, column change number;

2. extracting information from the table according to each minimum granularity rule; specifically, the method comprises the following steps: performing full matching according to the keywords in the expression of the minimum granularity rule and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and the column occupied by the initial cell as an initial row and an initial column; operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number, wherein the expression of the row change number or the column change number comprises the following steps: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and adopting m-n, wherein n is larger than m, or n is larger than m, and the initial row is moved downwards by m rows, m +1 rows, m +2 rows,. the.

3. And obtaining cells according to each minimum granularity rule to solve intersection, wherein the common cells are the values of the final information values.

The technical solutions of the embodiments of the present invention are described in detail below with reference to tables 1 to 6.

TABLE 1

TABLE 2

Name of building Dining room Remarks for note
Main function Branch office and shift dormitory
Area of the book 23890m2 Without underground chamber part
Base area of building 1864m2
Number of stories and height of building Eighteen layers above ground and two layers below ground
Buried depth of basement - See the basement subentry
Design service life of main structure 50 years old
Fire protection category of buildings First class high layer
Fire resistance rating First stage
Building fireproof calculation height 6645 Rice Height of structural slab from outdoor terrace to main building roof
Basement waterproofing grade - See the basement subentry
Designed impervious grade of waterproof concrete P8
Seismic fortification intensity 7 degree
Main structure type selection Cast-in-place reinforced concrete frame shear wall structure

TABLE 3

Name of building Floor B7 Remarks for note
Main function Scientific research office
Area of buildings on the ground 10273.01m2
Floor area of building 1208.39m2
Number of stories and height of building 8F/2D,29.95m
Maximum building area of floor 1414.39m2
Building fireproof calculation height 29.95m
Fire protection category of buildings High-rise building of the second kind
Fire resistance rating The first level above ground and the first level below ground
Design life span 50 years old
Basic intensity of earthquake 7 degree
Main structure type selection Cast-in-place steelReinforced concrete frame structure
Basement waterproofing grade Second stage
Roof waterproof grade Class II

TABLE 4

TABLE 5

TABLE 6

The embodiment of the invention provides a form information extraction method based on a template, which is suitable for most forms without judging the form to be analyzed in advance. Aiming at the information extraction of a new table form, only a new template rule is needed to be added, so that the maintenance is convenient. The information (key, value) is represented by a binary structure, wherein the key represents an information name, and the value represents a specific information value, and the method provided by the embodiment of the invention has the following two characteristics:

firstly, the method comprises the following steps: the information key to be extracted is diversified, and can be a header (e.g., 'building name') or a combination of headers (e.g., 'restaurant main function', 'restaurant building base area').

Secondly, the method comprises the following steps: the information key to be extracted can be determined in advance, as shown in tables 2 and 3, the tables about different buildings, the information to be extracted is related to specific building names, for table 2, the extraction of the embodiment of the invention is 'restaurant main function', and for table 3, the 'B7 building main function' is extracted instead. As shown in table 4, for the extraction of 'different room summer temperatures', 5 pieces of information of 'exhibition room summer temperature', 'collection room summer temperature', 'office summer temperature', 'meeting room summer temperature', 'atrium summer temperature' are actually extracted.

As shown in table 1, in the template based on which the table information is extracted, a first column defines an information name key, a second column is used for determining an unknown part of the information name, and the second column is used for locating a specific information value. The specific extraction steps based on the template are as follows:

and step 1, determining an information name key.

keys are divided into three categories, the first category is the header name, and the 'summer outdoor air conditioner calculation dry bulb temperature' in the table 1 is the header of the table 6; the second type is a combination of known heads, such as "winter atmospheric pressure (Pa)" in table 1 is a combination of two heads "winter" and "atmospheric pressure (Pa)" of table 5; the third type is an unknown header combination, as [ X ] is unknown in "[ X ] main function" in table 1, in table 2, [ X ] denotes a restaurant, key denotes a combination of "restaurant" and "main function", in table 3, [ X ] denotes a B7 th floor, and key denotes a combination of "B7 th floor" and "main function".

For the unknown part of the third type of key, the determination can be made according to the second column of table 2, and the expression format is: key ^ row change number, column change number. The parsing rule is as follows:

1-1: determining an initial cell; and performing full matching according to the keywords and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and the column occupied by the initial cell as the initial row and the initial column. In table 4, the initial cell occupancy rows 1 to 3 are matched according to the "room name" and the occupancy column is 1, as shown in "room name ^1- +, 0" in table 1.

1-2: moving the cell; operating the initial rows and the initial columns, and obtaining rows and columns of the final cell according to the row change number and the column change number, wherein the expressions of the row change number or the column change number are two, the first expression is only one number m, which indicates that the initial rows move down by m rows to obtain the row number of the final cell, and the initial columns move right by m columns to obtain the column number of the final cell; the second is m-n (where n > m, or n ═ x), which means that the initial row is moved down by m rows, m +1 rows, m +2 rows, … … rows, n rows, and the initial column is moved right by m columns, m +1 columns, m +2 columns, … … columns, n columns, respectively. If the initial row for "room name ^1- +, 0" in attached table 1 is shifted down by rows 1, 2, 3 … …, respectively, and the initial column is shifted right by 0, respectively, then 5 final cells are obtained: exhibition hall (row 4, row 1 column), collection storeroom (row 5, row 1 column), office (row 6, row 1 column), conference room (row 7, row 1 column), atrium (row 8, row 1 column), so key "summer [ X ] indoor relative humidity" represents 5 keys in table 4, summer exhibition hall indoor relative humidity, summer collection storeroom indoor relative humidity, summer office indoor relative humidity, summer conference room indoor relative humidity, summer atrium indoor relative humidity.

2, determining a specific information value; as shown in the third column of attached Table 1, the expression used to determine value is: "keyword 1^ row change number 1, column change number 1& & keyword 2^ row change number 2, column change number 2& & … …". The parsing rule is as follows:

2-1: and (3) splitting the rule, namely splitting the expression for determining the value into one or more minimum granularity rules according to the "& &", wherein the expression of the minimum granularity rules is as follows: key ^ row change number, column change number. As shown in Table 1, winter ^1-, 0& & atmospheric pressure (Pa) ^0,1 is split into winter ^1-, 0, atmospheric pressure (Pa) ^0,1 two minimum particle size rules.

2-2: and (3) analysis of the minimum granularity rule: and extracting information of the table according to each minimum granularity rule, wherein the specific extraction rule is as follows:

2-2-1: determining an initial cell; and performing full matching according to the keywords and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and the column occupied by the initial cell as the initial row and the initial column.

2-2-2: moving the cell; operating the initial rows and the initial columns, and obtaining rows and columns of the final cell according to the row change number and the column change number, wherein the expressions of the row change number or the column change number are two, the first expression is only one number m, which indicates that the initial rows move down by m rows to obtain the row number of the final cell, and the initial columns move right by m columns to obtain the column number of the final cell; the second is m-n (where n > m, or n ═ x), which means that the initial row is moved down by m rows, m +1 rows, m +2 rows, … … rows, n rows, and the initial column is moved right by m columns, m +1 columns, m +2 columns, … … columns, n columns, respectively.

Such as: in table 5, winter ^1- > 0 the initial row is (1, 3-4), the passing mobile unit cell row is (2, 3), (2, 4), (3, 3), (3, 4), (4, 3), (4, 4), (5, 3), (5, 4), (6, 3), (6, 4); atmospheric pressure (Pa) ^0,1 the initial row and column is (2, 1), (2, 3) the cell row and column are (2, 2), (2, 4) after moving.

2-3: determination of value: and obtaining cells according to each minimum granularity rule to obtain intersection, wherein the common cells are the final value. For example, in table 5, the unit cell row where the winter ^1-, 0& & atmospheric pressure (Pa) ^0,1 intersects the unit cell obtained by analyzing the winter ^1-, 0, and atmospheric pressure (Pa) ^0,1 is (2, 4), that is, "winter atmospheric pressure (Pa)" is "96320".

In summary, the technical solution of the embodiments of the present invention is applicable to most forms without determining the form to be analyzed in advance. Aiming at the information extraction of a new table form, only a new template rule is needed to be added, so that the maintenance is convenient, and the extraction cost is low.

System embodiment

According to an embodiment of the present invention, a form information extraction system based on a template is provided, fig. 2 is a schematic diagram of the form information extraction system based on the template according to the embodiment of the present invention, as shown in fig. 2, the form information extraction system based on the template according to the embodiment of the present invention specifically includes:

the template determining module 20 is configured to determine the information name key and the corresponding information value to obtain a table information extraction template; wherein the type of the information name key comprises: the method comprises the following steps of table head name, a known table head name combination and an unknown table head name combination, wherein the expression of the unknown table head name is as follows: key ^ row change number, column change number; the template determination module 20 is specifically configured to:

determining a corresponding information value according to an expression of the information value, wherein the expression comprises a keyword 1^ row change number 1, a column change number 1& & keyword 2^ row change number 2, and the column change number 2& & … …;

and the extraction module 22 is configured to extract information from the table based on the information name key and the information value in the table information extraction template. The extraction module 22 is specifically configured to:

when the type of the information name key is an unknown header name combination, performing full matching according to the keywords in the unknown header expression and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and column occupied by the initial cell as an initial row and an initial column;

operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number in the information name key, wherein the expression of the row change number or the column change number comprises the following steps: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

Splitting an expression of the information value into one or more minimum granularity rules according to the "& &", wherein the expression of the minimum granularity rules is as follows: key ^ row change number, column change number;

extracting information from the table according to each minimum granularity rule; specifically, the method comprises the following steps: performing full matching according to the keywords in the expression of the minimum granularity rule and the content of each cell in the table, naming the matched cell as an initial cell, and defining the row and the column occupied by the initial cell as an initial row and an initial column; operating the initial row and the initial column, and obtaining the row and the column of the final cell according to the row change number and the column change number, wherein the expression of the row change number or the column change number comprises the following steps: the first condition is as follows: only one number m represents that the initial row moves down by m rows to obtain the row number of the final cell, and the initial column moves right by m columns to obtain the column number of the final cell; case two: and m-n is adopted, wherein n is larger than m, or n is larger than m, and means that the initial row is moved downwards by m rows, m +1 rows, m +2 rows, … … and n rows respectively, the initial column is moved to the right by m columns, m +1 columns, m +2 columns, … … and n columns respectively, and if n is larger than m, the table is not limited to the upper limit until the last row or the last column of the table.

And obtaining cells according to each minimum granularity rule to solve intersection, wherein the common cells are the values of the final information values.

The embodiment of the present invention is a system embodiment corresponding to the above method embodiment, and specific operations of each module may be understood with reference to the description of the method embodiment, which is not described herein again.

The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.

In the 30 s of the 20 th century, improvements in a technology could clearly be distinguished between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.

The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.

The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the units may be implemented in the same software and/or hardware or in multiple software and/or hardware when implementing the embodiments of the present description.

One skilled in the art will recognize that one or more embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, one or more embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The description has been presented with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the description. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

One or more embodiments of the present description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. One or more embodiments of the specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.

The above description is only an example of this document and is not intended to limit this document. Various modifications and changes may occur to those skilled in the art from this document. Any modifications, equivalents, improvements, etc. which come within the spirit and principle of the disclosure are intended to be included within the scope of the claims of this document.

14页详细技术资料下载
上一篇:一种医用注射器针头装配设备
下一篇:信息清单的对齐方法、装置、存储介质和电子设备

网友询问留言

已有0条留言

还没有人留言评论。精彩留言会获得点赞!

精彩留言,会给你点赞!