CN102063571A - Infection source lookup method and system based on grid - Google Patents
Infection source lookup method and system based on grid Download PDFInfo
- Publication number
- CN102063571A CN102063571A CN2010106139984A CN201010613998A CN102063571A CN 102063571 A CN102063571 A CN 102063571A CN 2010106139984 A CN2010106139984 A CN 2010106139984A CN 201010613998 A CN201010613998 A CN 201010613998A CN 102063571 A CN102063571 A CN 102063571A
- Authority
- CN
- China
- Prior art keywords
- infection
- girth
- convex domain
- information
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Medical Treatment And Welfare Office Work (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses infection source lookup method and system based on a grid. The method comprises the following steps of: collecting infection information and inducing into a node of a grid source pool; distributing a lookup task according to the collected infection information; and calculating and determining an infection source by the node according to the distributed lookup task. In the infection source lookup method and system, the node of the grid source pool is adopted for parallel calculation to greatly improve transportation speed and efficiency and quickly look up and determine the infection source.
Description
[technical field]
The present invention relates to a kind of lookup method, particularly relate to a kind of infection sources lookup method and system based on grid.
[background technology]
Along with people improve constantly in the concern aspect the health care, being reported in that various new and old infectious diseases are wreaked havoc causes great repercussion in the human society.How to face, search the infection sources and also calm down infectious disease rapidly and become the severe problem that human society is badly in need of solution.According to the report of the World Health Organization (WHO), nearly 24% disease is caused by avoidable environmental exposure.China is one of big country of infectious disease in the world, however because China is populous, and the region is wide, circumstance complication, China searches infectious disease, and monitoring lags behind developed country always in the treatment.
Along with China hygiene department, government department improved constantly the concern of infectious disease in recent years, and the continuous development and the application of GIS technology, searched epidemic disease for China uses a computer to monitor, and the application of infectious disease has brought new opportunities and challenges.
Yet in the research aspect traditional infection sources calculating mainly is that the information that combines the geography information aspect is analyzed epidemic disease, but the efficient that large-scale disease data are analyzed be can't bear ideal, to such an extent as to find the speed of the infection sources slow.
[summary of the invention]
Based on this, be necessary to provide a kind of infection sources lookup method of searching the infection sources fast.
In addition, also be necessary to provide a kind of infection sources of searching the infection sources fast to search system.
A kind of infection sources lookup method based on grid may further comprise the steps: collection infection information also imports in the node in gridding resource pond; Infect information distribution according to described collection and search task; Utilize described node to calculate definite infection sources according to the task of searching of distributing.
Preferably, the step of searching task according to described collection infection information distribution comprises: cutting apart the task of searching according to described collection infection information is the subtask; Described node is inquired about the acquisition idle node, and dispatch described subtask to described idle node.
Preferably, the described task of searching according to distribution comprises the described step of utilizing node to calculate definite infection sources: choose alternative summit and constitute vertex set according to described collection infection information; Form convex domain according to described vertex set, and calculate the girth of described convex domain; The girth of more described convex domain, with the shortest pairing convex domain of girth as the infection sources.
Preferably, form convex domain according to described vertex set, and comprise after calculating the step of girth of described convex domain: the information of storing the girth and the vertex set of described convex domain described.
Preferably, after the step of the information of storing described girth and vertex set, comprise: judge whether finish described subtask, is, then enters the girth of more described convex domain, the step of the shortest pairing convex domain of girth as the infection sources; , do not wait for that then described subtask is finished.
A kind of infection sources based on grid is searched system, comprising: acquisition module is used to gather infection information; Database is used to store described infection information; Distribution module is used for infecting information distribution according to described collection and searches task; Computing module is used for utilizing described node to calculate definite infection sources according to the task of searching of distributing.
Preferably, described distribution module comprises: cutting unit: being used for cutting apart the task of searching according to described collection infection information is the subtask; Scheduling unit: be used for described node is inquired about the acquisition idle node, and dispatch described subtask to described idle node.
Preferably, described computing module comprises: the vertex set computing unit is used for choosing alternative summit and constituting vertex set according to described collection infection information; Convex domain girth computing unit is used for forming convex domain according to described vertex set, and calculates the girth of described convex domain; Comparing unit is used for the girth of more described convex domain, with the shortest pairing convex domain of girth as the infection sources.
Preferably, described computing module also comprises: storage unit is used to store the information of the girth and the vertex set of described convex domain.
Preferably, described computing module also comprises: judging unit is used to judge whether finish described subtask, is, then enters the girth of more described convex domain, with the step of the shortest pairing convex domain of girth as the infection sources; , do not wait for that then described subtask is finished.
Adopt the lookup method and the system of the infection sources, calculate, improved travelling speed and efficient greatly, can search and confirm the infection sources fast by the node executed in parallel in gridding resource pond.
[description of drawings]
Fig. 1 is the process flow diagram based on the infection sources lookup method of grid;
Fig. 2 is the particular flow sheet of step B among Fig. 1;
Fig. 3 is the scheduling synoptic diagram of the grid acting server among the embodiment;
Fig. 4 is the particular flow sheet of step C among Fig. 1;
Fig. 5 is the synoptic diagram of an embodiment convexity area circumference algorithm;
Fig. 6 is the method flow diagram of step C one embodiment among Fig. 1;
Fig. 7 is the method flow diagram of another embodiment of step C among Fig. 1;
Fig. 8 is for searching the detailed block diagram of system based on the infection sources of grid.
[embodiment]
Please in conjunction with the accompanying drawings 1, a kind of infection sources lookup method based on grid may further comprise the steps:
A: collection infection information also imports in the node in gridding resource pond.Gather the infection information in a period of time t before all infected patients' the disease time point, i.e. historical track dot information, this time t can be 1 week, one month or 1 season etc.This historical track dot information comprises that interrelated information has: tracing point unique identification DPID, time point, the locus of tracing point, infected patient's unique identification SPID, infected patient name, infected ID (identity number) card No., infected information such as address, set up patient's history's trace information database then, and this database is imported in each node in gridding resource pond, in specific embodiment, for the machine in the same cluster, utilize NFS (Network File System) to carry out data sharing, then connect or communicate based on the data grids of WebService by remote data base for the data sharing between different clusters.
B: search task according to gathering the infection information distribution.By the grid acting server, search the distribution of task according to the infection information of being gathered, the node in each gridding resource pond is all made full use of, increase operation rate.
C: utilize node to calculate definite infection sources according to the task of searching of distributing.Searching the node of Task Distribution to the gridding resource pond, then the node executed in parallel in gridding resource pond is calculated, and definite infection sources.The node executed in parallel in gridding resource pond is calculated, and has improved travelling speed and efficient greatly, can search and confirm the infection sources fast.
See also accompanying drawing 2 and 3, in one embodiment, above-mentioned steps B comprises:
B1, cutting apart the task of searching according to collection infection information is the subtask.The grid acting server will be searched the task self-adaptation and be divided into the subtask, concrete, infection information according to all infected patients is obtained historical track point number, be divided into the subtask of equivalent amount according to the number correspondence of historical track point, be the corresponding subtask of each historical track point, the pairing historical track point in each subtask be made as " the right limit " of this subtask.For example, total N infected patient, and whole historical track point numbers of N infected patient are that K is individual, then the task of searching are divided into K subtask according to the number K of historical track point, and the pairing historical track point in each subtask is made as " the right limit " of this subtask.
B2 inquires about the acquisition idle node to node, and the scheduling sublayer task is to this idle node.The grid acting server is inquired about node, seeks idle node, if find idle node, then the adaptive scheduling subtask is to this idle node.Particularly, by the batch processing job system of grid acting server, ranked in a formation in the subtask; By the dynamic resource of each grid Virtual Organization is organized, realize the integration of gridding resource, carry out the idle node inquiry by the grid resource module of grid acting server again, in case discovery idle node, then be dispatched to the subtask in the formation on this idle node dynamically and calculate, improve the efficient of computing.
See also attached Figure 4 and 5, in one embodiment, above-mentioned steps C comprises:
C1: choose alternative summit and constitute vertex set according to gathering infection information.Particularly, the tracing point unique identification DPID of all infected patients' infection information and the locus of tracing point are directed on the geographical graphical interfaces.Choose a subtask,, suppose that this " right limit " belongs to infected patient b according to the DPID of " the right limit " confirmed in this subtask
iOn track, select each infected patient b so successively
j(0＜j≤n wherein, j ≠ i, n is infected patient's sum) the locus of tracing point in from " right limit " nearest and at the DPID of the tracing point in " right limit " left side, all satisfactory DPID are as the alternative summit of transmission convex domain these, and the information aggregating on these alternative summits then is a vertex set.
Wherein, 5 and one object lesson elaborates the choosing method that " right limit " reaches the DPID on the left of it in conjunction with the accompanying drawings.At first, the DPID of all tracing points of infected patient and locus are directed on the geographical graphical interfaces, and choose a subtask, the DPID of " right limit " in this subtask is P
1, establish P
1Corresponding to patient b
1Then, be reference with the positive apparent direction of this geography graphical interfaces, up north and down south, left west and right east is then with selected " right limit " P
1And with the North and South direction is the boundary; At last, belonging to epidemic victim b successively
2, b
3, b
4... b
nTracing point in be chosen in " right limit " P
1The DPID in left side (being the west) is alternative summit P
2, P
3... P
n, it then is vertex set that all alternative summits are compiled.
C2: form convex domain according to vertex set, and calculate the girth of described convex domain.Particularly, form convex domain according to vertex set, in conjunction with the accompanying drawings 5, in the present embodiment, the concrete grammar that this convex domain forms is as follows: at first, cross right limit P
1Beginning connects P
1With the DPID in other all vertex set.Secondly, cross P
1DPID in connection and other all vertex set (is P
2, P
3... P
n), direction is with P
1The angle that directions of rays forms in positive north is according to formed corner dimension ordering.Then, suppose that this angle ordering pairing DPID in back is P
2, P
3, P
4, P
5, connect P
1P
2, and record length SUM
P1P2Connect P
2P
3, judge
With respect to
Whether exist
The counter clockwise direction place (promptly
The left side), be then to think this P
1P
2P
3Belong in the convex domain SUM=SUM
P1P2+ SUM
P2P3, not, then do not think P
3Do not belong on the same convex domain, and deletion P
2, SUM=SUM
P1P3In the present embodiment,
With respect to
For
Counter clockwise direction (promptly
The left side), P then
2With respect to P
1Belong to same convex domain.Connect P
3P
4,
With respect to
Be positioned at
Clockwise direction (promptly
The right side), then delete P
3, SUM=SUM
P1P2+ SUM
P2P4Connect P
4P
5,
With respect to
(because P
3Deleted, do not belong to same convex domain) be positioned at
The clockwise direction place (promptly
The right side), P then
4With respect to P
2Do not belong to same convex domain, deletion P
4, at this moment, SUM=SUM
P1P2+ SUM
P2P5At last, according to above-mentioned determination methods and the like the summit of the same convex domain that meets of searching, and calculate all length on same convex domain summit, be a convex domain girth SUM.Calculate the girth SUM that obtains all convex domains according to above-mentioned method
1, SUM
2, SUM
3... SUM
n
C3: the girth of convex domain relatively, with the shortest pairing convex domain of girth as the infection sources.Particularly, the girth of all convex domains relatively one by one, girth is the shortest, and then this convex domain is the infection sources.
See also Fig. 6, in one embodiment,, after step C2, comprise based on such scheme:
C21: the girth of storage convex domain and the information of vertex set.Particularly, the node in gridding resource pond feeds back to the grid acting server to the convex domain girth and the summit in this convex domain girth of calculating, and store according to certain tuple, this memory module is:＜convex domain girth, the DPID on each summit in the convex domain vertex set 〉.
See also Fig. 7, in one embodiment,, after the step of the information of storage girth of convex domain and vertex set, comprise based on such scheme:
C22: judge whether finish the subtask, is, then enters the girth of more described convex domain, with the step of the shortest pairing convex domain of girth as the infection sources; , do not wait for that then the subtask is finished.
Adopt said method,, can inquire the infection sources fast by the node concurrent technique in gridding resource pond.
See also accompanying drawing 8,, also be necessary to provide a kind of infection sources to search system, comprising based on grid based on this:
Acquisition module is used to gather infection information.Particularly, gather the infection information in a period of time t before all infected patients' the disease time point, i.e. historical track information, this time t can be 1 week, one month or 1 season etc.This historical track information comprises that interrelated information has: tracing point unique identification DPID, time point, infected patient's locus, infected patient's unique identification SPID, infected patient name, infected ID (identity number) card No., infected information such as address.
Database is used to store described infection information.
Distribution module is used for infecting information distribution according to described collection and searches task.By the grid acting server is provided, search the distribution of task according to the infection information of being gathered, the node in each gridding resource pond is all made full use of, increase operation rate.Particularly, this distribution module also comprises:
Cutting unit: being used for cutting apart the task of searching according to described collection infection information is the subtask.The grid acting server will be searched the task self-adaptation and be divided into the subtask, and will be concrete, obtain historical track point number according to infected patient's infection information, be divided into the subtask of equivalent amount according to the number correspondence of historical track point.
Scheduling unit: be used for described node is inquired about the acquisition idle node, and dispatch described subtask to described idle node.The grid acting server is inquired about node, seeks idle node, if find idle node, then the adaptive scheduling subtask is to this idle node.
Computing module is used for utilizing described node to calculate definite infection sources according to the task of searching of distributing.Searching the node of Task Distribution to the gridding resource pond, then the node executed in parallel in gridding resource pond is calculated, and definite infection sources.Particularly, this technology modules also comprises:
The vertex set computing unit is used for choosing alternative summit and constituting vertex set according to described collection infection information.
Convex domain girth computing unit is used for forming convex domain according to described vertex set, and calculates the girth of described convex domain.
Comparing unit is used for the girth of more described convex domain, with the shortest pairing convex domain of girth as the infection sources.
Storage unit is used to store the information of the girth and the vertex set of described convex domain.Particularly, the node in gridding resource pond feeds back to the grid acting server to the convex domain girth and the summit in this convex domain girth of calculating.
Judging unit is used to judge whether finish the subtask, then enters the girth of more described convex domain, with the step of the shortest pairing convex domain of girth as the infection sources; , do not wait for that then the subtask is finished.
Adopt the aforementioned calculation scheme,, can search the infection sources fast by the parallel computation of node.
The above embodiment has only expressed several embodiment of the present invention, and it describes comparatively concrete and detailed, but can not therefore be interpreted as the restriction to claim of the present invention.Should be pointed out that for the person of ordinary skill of the art without departing from the inventive concept of the premise, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection domain of patent of the present invention should be as the criterion with claims.
Claims (10)
1. the infection sources lookup method based on grid is characterized in that, may further comprise the steps:
Collection infection information also imports in the node in gridding resource pond;
Infect information distribution according to described collection and search task;
Utilize described node to calculate definite infection sources according to the task of searching of distributing.
2. the infection sources lookup method based on grid according to claim 1 is characterized in that, the step of searching task according to described collection infection information distribution comprises:
Cutting apart the task of searching according to described collection infection information is the subtask;
Described node is inquired about the acquisition idle node, and dispatch described subtask to described idle node.
3. the infection sources lookup method based on grid according to claim 1 is characterized in that, the described task of searching according to distribution comprises the described step of utilizing node to calculate definite infection sources:
Choose alternative summit and constitute vertex set according to described collection infection information;
Form convex domain according to described vertex set, and calculate the girth of described convex domain;
The girth of more described convex domain, with the shortest pairing convex domain of girth as the infection sources.
4. the infection sources lookup method based on grid according to claim 3 is characterized in that, forms convex domain described according to described vertex set, and comprises after calculating the step of girth of described convex domain:
Store the information of the girth and the vertex set of described convex domain.
5. the infection sources lookup method based on grid according to claim 4 is characterized in that, comprises after the step of the information of storing described girth and vertex set:
Judge whether finish described subtask, is, then enters the girth of more described convex domain, with the step of the shortest pairing convex domain of girth as the infection sources; , do not wait for that then described subtask is finished.
6. the infection sources based on grid is searched system, it is characterized in that, comprising:
Acquisition module is used to gather infection information;
Database is used to store described infection information;
Distribution module is used for infecting information distribution according to described collection and searches task;
Computing module is used for utilizing described node to calculate definite infection sources according to the task of searching of distributing.
7. the infection sources based on grid according to claim 6 is searched system, it is characterized in that, described distribution module comprises:
Cutting unit: being used for cutting apart the task of searching according to described collection infection information is the subtask;
Scheduling unit: be used for described node is inquired about the acquisition idle node, and dispatch described subtask to described idle node.
8. the infection sources based on grid according to claim 6 is searched system, it is characterized in that, described computing module comprises:
The vertex set computing unit is used for choosing alternative summit and constituting vertex set according to described collection infection information;
Convex domain girth computing unit is used for forming convex domain according to described vertex set, and calculates the girth of described convex domain;
Comparing unit is used for the girth of more described convex domain, with the shortest pairing convex domain of girth as the infection sources.
9. the infection sources based on grid according to claim 8 is searched system, it is characterized in that, described computing module also comprises: storage unit is used to store the information of the girth and the vertex set of described convex domain.
10. the infection sources based on grid according to claim 9 is searched system, it is characterized in that, described computing module also comprises: judging unit, be used to judge whether described subtask finishes, be, then enter the girth of more described convex domain, with the step of the shortest pairing convex domain of girth as the infection sources; , do not wait for that then described subtask is finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106139984A CN102063571A (en) | 2010-12-30 | 2010-12-30 | Infection source lookup method and system based on grid |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106139984A CN102063571A (en) | 2010-12-30 | 2010-12-30 | Infection source lookup method and system based on grid |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102063571A true CN102063571A (en) | 2011-05-18 |
Family
ID=43998845
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010106139984A Pending CN102063571A (en) | 2010-12-30 | 2010-12-30 | Infection source lookup method and system based on grid |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102063571A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622272A (en) * | 2012-01-18 | 2012-08-01 | 北京华迪宏图信息技术有限公司 | Massive satellite data processing system and massive satellite data processing method based on cluster and parallel technology |
| CN108475297A (en) * | 2015-10-30 | 2018-08-31 | 皇家飞利浦有限公司 | Determine the method, system and process of the route of transmission of infectious agent |
-
2010
- 2010-12-30 CN CN2010106139984A patent/CN102063571A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622272A (en) * | 2012-01-18 | 2012-08-01 | 北京华迪宏图信息技术有限公司 | Massive satellite data processing system and massive satellite data processing method based on cluster and parallel technology |
| CN108475297A (en) * | 2015-10-30 | 2018-08-31 | 皇家飞利浦有限公司 | Determine the method, system and process of the route of transmission of infectious agent |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103092950B (en) | A kind of network public-opinion geographic position real-time monitoring system and method | |
| CN104216895B (en) | A kind of method and device for generating POI data | |
| CN104268695A (en) | Multi-center watershed water environment distributed cluster management system and method | |
| CN103631922B (en) | Extensive Web information extracting method and system based on Hadoop clusters | |
| CN104254865A (en) | Empirical expert determination and question routing system and method | |
| CN105184455A (en) | High dimension visualized analysis method facing urban electric power data analysis | |
| CN105117497B (en) | Ocean big data principal and subordinate directory system and method based on Spark cloud network | |
| CN102890725B (en) | The result ordering method of search engine | |
| GB2606114A (en) | Community life circle space identification method and system, computer device and storage medium | |
| CN112687389A (en) | Artificial intelligent medical graded treatment method and system based on 5G and block chain | |
| CN101887367A (en) | Multi-level parallel programming method | |
| CN102521364B (en) | Method for inquiring shortest path between two points on map | |
| CN111586091A (en) | Edge computing gateway system for realizing computing power assembly | |
| CN104298669A (en) | Person geographic information mining model based on social network | |
| CN107682395A (en) | A kind of big data cloud computing runtime and method | |
| Jing et al. | An optimized method of HDFS for massive small files storage | |
| Kong et al. | The method and application of big data mining for mobile trajectory of taxi based on MapReduce | |
| CN109947826A (en) | A method of with big data technology building region portrait analysis model | |
| KR20170016168A (en) | Tile-based map data updating system and method thereof | |
| Bao et al. | Evaluating the human use efficiency of urban built environment and their coordinated development in a spatially refined manner | |
| CN102063571A (en) | Infection source lookup method and system based on grid | |
| CN104765763B (en) | A kind of semantic matching method of the Heterogeneous Spatial Information classification of service based on concept lattice | |
| CN109753541A (en) | A kind of relational network construction method and device, computer readable storage medium | |
| CN102749987B (en) | High energy efficiency resource allocating method for isomorphic cluster system of computer | |
| CN108694247B (en) | Typhoon disaster analysis method based on microblog topic popularity |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110518 |