CN107422369B - A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault - Google Patents

A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault Download PDF

Info

Publication number
CN107422369B
CN107422369B CN201710625127.6A CN201710625127A CN107422369B CN 107422369 B CN107422369 B CN 107422369B CN 201710625127 A CN201710625127 A CN 201710625127A CN 107422369 B CN107422369 B CN 107422369B
Authority
CN
China
Prior art keywords
msub
mtd
mrow
mtr
msup
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.)
Active
Application number
CN201710625127.6A
Other languages
Chinese (zh)
Other versions
CN107422369A (en
Inventor
张小咏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Information Science and Technology University
Original Assignee
Beijing Information Science and Technology University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Information Science and Technology University filed Critical Beijing Information Science and Technology University
Priority to CN201710625127.6A priority Critical patent/CN107422369B/en
Publication of CN107422369A publication Critical patent/CN107422369A/en
Application granted granted Critical
Publication of CN107422369B publication Critical patent/CN107422369B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
    • G01V1/00—Seismology; Seismic or acoustic prospecting or detecting
    • G01V1/01—Measuring or predicting earthquakes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G06F17/12—Simultaneous equations, e.g. systems of linear equations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Algebra (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Acoustics & Sound (AREA)
  • Operations Research (AREA)
  • Computing Systems (AREA)
  • Environmental & Geological Engineering (AREA)
  • Geology (AREA)
  • Remote Sensing (AREA)
  • General Life Sciences & Earth Sciences (AREA)
  • Geophysics (AREA)
  • Other Investigation Or Analysis Of Materials By Electrical Means (AREA)

Abstract

The present invention provides a kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault, including：Utilize failure base station data after communication base station data before shake and shake, the failure base stations caused by non-earthquake factor such as communication network destruction are excluded, failure base station distribution caused by earthquake factor is analyzed, build convex closure model, concave point is rejected, forms the salient point point set of earthquake failure base station discrete point；Calculate the geometric center of gravity of convex closure, the geometric center of gravity is the oval center of circle；Major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method, in conjunction with the center of circle of ellipse, draws the Areas of High Earthquake Intensity area based on communication base station failure.Advantage is：The present invention is based on the communication base station network data for being laid in the whole nation, severely afflicated area scope is quick and precisely estimated using least square fitting ellipse, field direction is influenceed with severely afflicated area and determines the advantages of speed is fast and Macro orientation is accurate, and foundation is provided for very first time emergency management and rescue decision-making after the earthquake.

Description

A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault
Technical field
The invention belongs to natural calamity integrated disaster reduction technical field, and in particular to one kind is based on communication network and equipment fault Areas of High Earthquake Intensity area quick judgment method.
Background technology
Due to sudden, the first two hour especially after disaster generation, for the fast of earthquake-stricken area of earthquake disaster Speed, correctly obtain the matter of utmost importance that always annoying earthquake emergency rescue worker.At present, China's pole disaster area model after shake Enclosing method for rapidly judging is mainly：Earthquake pole based on Intensity Attenuation model to earthquake intensity rapid evaluation, based on aftershock information Disaster area method for rapidly judging, carry out using taphrogeny earthquake intensity fast evaluation method, be quick based on seismic structure and focal mechanism Method for determining damage envelope and meizoseismal area etc..The above method all plays in the emergency at all previous earthquake disaster initial stage Effect.Foreign countries, it is mainly the earthquake intensity instrument by being laid in the whole nation that Japan, which obtains the condition of a disaster, is laid in taking the photograph for national highest priority region As head mode, the U.S. mainly schemes to obtain by SHAPMAP.
However, pole disaster area scope decision method after above-mentioned shake, still suffers from deficiency in accuracy and actual effect, can not meet The demand of social development.
The content of the invention
The defects of existing for prior art, the present invention provide a kind of earthquake Gao Lie based on communication network and equipment fault Area's quick judgment method is spent, can effectively be solved the above problems.
The technical solution adopted by the present invention is as follows：
A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault of present invention offer, including with Lower step：
Step 1：After the earthquake, earthquake region origination base station data are obtained, and the origination base station data are located in advance Reason, obtains the base station data list of reference format；Wherein, the base station data list is made up of a plurality of base station data；Every institute Stating base station data includes：Base station name, latitude and longitude of base station and base station state；The base station state refers to failure base station or non-faulting Base station state；
Step 2：Using the failure base station mode recognition methods of earthquake factor and non-earthquake factor, the event obtained from step 1 Hinder base station in, reject non-earthquake factor caused by failure base station, tentatively obtain failure base station distribution caused by earthquake factor；
Step 3：Failure base station distribution caused by the earthquake factor obtained to step 2 is further analyzed, and builds convex closure Model, concave point is rejected, ultimately form the salient point point set of earthquake failure base station discrete point；Each salient point joins end to end successively, obtains Convex closure；
Step 4：The geometric center of gravity for the convex closure that measuring and calculating step 3 obtains, the geometric center of gravity are the oval center of circle；
Step 5：Major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method, in conjunction with ellipse The round center of circle, draw the Areas of High Earthquake Intensity area based on communication base station failure.
Preferably, step 2 is specially：Earthquake region failure base station spatial distribution is analyzed, with reference to earthquake region electrical power wiring figure and optical cable Transmission figure, analysis obtain failure base station distribution caused by the non-earthquake factor in earthquake region；Meanwhile moved back with reference to mobile communication base station and take failure Tree-model, analysis cause base station service quit probability of malfunction, thus reject failure base station caused by non-earthquake factor.
Preferably, step 3 specifically includes：
Step 3.1, failure base station distribution caused by earthquake factor that step 2 tentatively obtains is shown in x-y coordinate system； The position coordinates of each failure base station is (x, y)；
In the x-y coordinate system, the failure base sites of the maximum failure base sites in x directions and x directions minimum are determined；Its In, the maximum failure base sites in x directions are designated as point B (xmax, ymax), the minimum failure base sites in x directions are designated as point A (xmin, ymin)；
Step 3.2, all discrete points are divided into m section at equal intervals by x directions, the width in each section is using following Formula calculates：
W=(xmax-xmin)/m=xinterval/m；
Wherein, w represents the width in each section；xintervalRepresent total length of all discrete points in x directions；
Step 3.3, the direction increased by x, m section is designated as successively：k[0]、k[1]…k[m-1]；Find respectively Maximum extreme point k [i] of each section in y directionsmaxyWith minimum extreme point k [i]miny；Wherein, i ∈ (0,1 ... m-1)；
Step 3.4, by the minimum extreme point in the maximum extreme point in point A, each section, point B and each section according to In the following manner connects, and forms the polygon of a closing；
According to the order that i values are ascending, k [i] is sequentially connectedminy, i.e.,：k[0]miny、k[1]miny…k[m-1]minyAccording to Secondary connection, form a line segment；Similarly, according to the ascending order of i values, it is sequentially connected k [i]maxy, i.e.,：k[0]maxy、k [1]maxy…k[m-1]maxyIt is sequentially connected, forms a line segment；Finally, point A respectively with k [0]maxyWith k [0]minyConnection, point B Respectively with k [m-1]maxyWith k [m-1]minyConnection, the polygon of a closing is thus formed, the polygon of the closing is by 2m+2 Summit forms；
Step 3.5, the 2m+2 summit obtained for step 3.6, according to the concavity and convexity determination methods of point, each is judged The concavity and convexity on summit, if summit is concave point, delete；If summit is salient point, retain；Therefore, institute's salient point with a grain of salt Between be sequentially connected from beginning to end, formed convex closure；Institute's salient point with a grain of salt forms salient point point set.
Preferably, in step 3.5, the concavity and convexity determination methods of the point judge for the concavity and convexity of continuous three vector vertex Method, more specifically vector cross-products method judge the concavity and convexity of continuous three vector vertex, and step is as follows：
Step 3.5.1, it is assumed that any summit is Vi(xi,yi), its front and rear adjacent vertex is respectively Vi-1(xi-1,yi-1) and Vi+1(xi+1,yi+1)；Wherein, xi,yiRespectively summit ViAbscissa and ordinate；xi-1,yi-1Respectively summit Vi-1Horizontal seat Mark and ordinate；xi+1,yi+1Respectively summit Vi+1Abscissa and ordinate；
Step 3.5.2, makees vector cross-products as the following formula：
T=Vi-1Vi×ViVi+1
Wherein, the end value of T representative vectors cross product；
Step 3.5.3, T z coordinate component is taken, the concavity and convexity discriminant function S of following point can be obtained：
S(Vi, Vi-1)=(xi-xi-1)×(yi+1-yi)-(xi+1-xi)×(yi-yi-1)
Point V is judged according to S signiConcavity and convexity：
If 1) S>0, ViFor salient point；
If 2) S=0, ViFor neutral point；
If 3) S<0, ViFor concave point.
Preferably, in step 5, major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method Degree, it is specially：
Step 5.1, oval conic section is represented with binary quadratic equation, form such as following formula：
Ax2+Bxy+Cy2+ Dx+Ey+F=0 (formula 1)
Wherein：A, B, C are respectively the coefficient of quadratic term, and at least one in A, B, C is not zero；D, E is respectively once The coefficient of item, F is constant term；
Step 5.2, to avoid equation null solution, when carrying out elliptic equation resolving, it is assumed that A+C=1, then elliptic equation conversion For following form：
Bxiyi+C(y2 i-x2 i)+Dxi+Eyi+ F=-x2 i(formula 2)
Wherein：xiFor any salient point abscissa, yiFor any salient point ordinate；I=1,2 ..., n；N is salient point point set convexity Point number；
Step 5.3, all salient point coordinates are substituted into above-mentioned formula 2, can obtain one group of equation group, it is specific as follows：
Above-mentioned equation group is expressed as matrix form：
MX=Y, i.e.,
Wherein, M is coefficient matrix, is the matrix of n × 5, i.e.,
X is unknown matrix number, i.e.,：Elliptic parameter to be asked, 5 × 1 matrixes, i.e.,
Y is constant matrices, the matrix of specially n × 1, i.e.,
Step 5.4, according to the principle of least square, normal equation system is obtained, matrix representation forms are as follows：
KX=f, i.e.,
Wherein, K is the coefficient matrix of normal equation system, is the matrix of n × 5, i.e.,
K=MTM
K11=x1 2y1 2+x2 2y2 2+x3 2y3 2+x4 2y4 2+…+xn 2yn 2
K12=x1y1(y1 2-x1 2)+x2y2(y2 2-x2 2)+x3y3(y3 2-x3 2)+x4y4(y4 2-x4 2)
+…+xnyn(yn2-xn2)
……
Kn1=x1y1+x2y2+x3y3+x4y4+…+xnyn
Kn2=y1 2-x1 2+y2 2-x2 2+y3 2-x3 2+y4 2-x4 2+…+yn 2-xn 2
Ki,jFor the element of normal equation system coefficient matrix, i=1,2 .., n, j=1,2,3,4,5
F is the constant matrices of normal equation system, is the matrix of n × 1, i.e.,
F=MTY
fuFor the element of normal equation system constant matrices, wherein, u=1,2 ..., n；
MTFor matrix M transposed matrix；
Step 5.5, using complete pivot gaussian elimination normal equation system, parameter B, C, D, E, F are obtained；
Step 5.6, based on qualifications A+C=1, parameter A=1-C is obtained, so far, the ellipse of conic section representation Parameter A, B, C, D, E, F of equation are all obtained；
Step 5.7, oval method for expressing also can use the form table of geometric parameter in addition to the representation of conic section Show, for ease of visual representation, conic section form is converted into geometric parameter form, conversion formula is as follows：
Major semiaxis a：
Semi-minor axis b：
Rotation angle θ：
Then the oval center of circle, major semiaxis a, semi-minor axis b, oval direction i.e. rotation angle θ is calculated in this；
Step 5.8, field direction, major axis and minor axis length are influenceed as ground using transverse direction as Areas of High Earthquake Intensity area Shake the major axis and short axle of highly seismic region；Wherein, major axis is 2 times of major semiaxis a；Short axle is 2 times of semi-minor axis b；Thus draw To the Areas of High Earthquake Intensity area based on communication base station failure.
Provided by the invention a kind of had based on communication network and the Areas of High Earthquake Intensity area quick judgment method of equipment fault Advantages below：
The present invention is quick and precisely estimated based on the communication base station network data for being laid in the whole nation using least square fitting ellipse Severely afflicated area scope is calculated, there is severely afflicated area to influence field direction and determine the advantages of speed is fast and Macro orientation is accurate, be earthquake Very first time emergency management and rescue decision-making afterwards provides foundation.
Brief description of the drawings
Fig. 1 is a kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault provided by the invention Schematic flow sheet；
Fig. 2 is the polygon for the closing that step 3.4 obtains；
Fig. 3 is the convex closure figure that step 3.5 obtains；
Fig. 4 calculates major axis and minor axis radius and the anglec of rotation to be provided by the invention using least square fitting ellipse method The flow chart of degree.
Embodiment
In order that technical problem solved by the invention, technical scheme and beneficial effect are more clearly understood, below in conjunction with Drawings and Examples, the present invention will be described in further detail.It should be appreciated that specific embodiment described herein only to The present invention is explained, is not intended to limit the present invention.
Mobile communication base station is the infrastructure for supporting mobile communication service, is the most basic unit of mobile communications network. As mobile communications network is constantly expanded, the mobile communication base station almost spread over all over the world constitutes a huge wireless public affairs Common communication network.After the earthquake, it is impaired etc. due to forming the cable breakout of mobile communications network, power breakdown and base station equipment Reason, destroy base station communication network.However, base station communication network is destroyed reflects earthquake disaster influence from another side Scope.The present invention is based on being laid in the communication base station network data in the whole nation, quick using least square fitting ellipse method Accurate estimation severely afflicated area scope, foundation is provided for very first time emergency management and rescue decision-making after the earthquake.
Areas of High Earthquake Intensity area quick judgment method provided by the invention based on communication network and equipment fault, mainly includes Herein below：Base station data is pre-processed, the macroscopic epicenter in Areas of High Earthquake Intensity area determines, the major axis and short axle in Areas of High Earthquake Intensity area And its direction measuring and calculating, it is final to determine earthquake highly seismic region.In to base station data preprocessing process, it is necessary to base station data according to Unified form carries out classification typing, including at least base station name, longitude and latitude, failure base station, by failure base station and non-faulting base station Numbered, at the same it is non-according to the optical fiber transmission relation of communication system network structure and the pattern analysis progress of failure base station Reject failure base station caused by earthquake factor；In being determined to earthquake highly seismic region macroscopic epicenter, sample data is analyzed, Convex closure model construction is carried out, excludes concave point, forms the salient point point set of earthquake failure base station discrete point；Calculate the geometry weight of convex closure The heart；Using least square fitting ellipse algorithm, its major axis and minor axis length, the anglec of rotation, using its long axis direction as ground are obtained Shaking highly seismic region influences field direction, the major axis and short axle of major axis and minor axis length as Areas of High Earthquake Intensity area.
Specifically, with reference to figure 1, the Areas of High Earthquake Intensity area provided by the invention based on communication network and equipment fault is quickly sentenced Disconnected method, comprises the following steps：
Step 1：After the earthquake, earthquake region origination base station data are obtained, and the origination base station data are located in advance Reason, obtains the base station data list of reference format；Wherein, the base station data list is made up of a plurality of base station data；Every institute Stating base station data includes：Base station name, latitude and longitude of base station and base station state；The base station state refers to failure base station or non-faulting Base station state；
Therefore, it is necessary to classification typing be carried out according to unified form to base station data, including at least base station name, base station longitude and latitude Degree, failure base station or non-faulting base station；Wherein, failure base station and non-faulting base station are numbered.
Step 2：Using the failure base station mode recognition methods of earthquake factor and non-earthquake factor, the event obtained from step 1 Hinder base station in, reject non-earthquake factor caused by failure base station, tentatively obtain failure base station distribution caused by earthquake factor；
Step 2 is specially：Earthquake region failure base station spatial distribution is analyzed, with reference to earthquake region electrical power wiring figure and optical cable transmission figure, Analysis obtains failure base station distribution caused by the non-earthquake factor in earthquake region；Meanwhile moved back with reference to mobile communication base station and take fault tree models, Analysis causes base station service quit probability of malfunction, thus rejects failure base station caused by non-earthquake factor.
Step 3：Failure base station distribution caused by the earthquake factor obtained to step 2 is further analyzed, and builds convex closure Model, concave point is rejected, ultimately form the salient point point set of earthquake failure base station discrete point；Each salient point joins end to end successively, obtains Convex closure；
Step 3 specifically includes：
Step 3.1, failure base station distribution caused by earthquake factor that step 2 tentatively obtains is shown in x-y coordinate system； The position coordinates of each failure base station is (x, y)；
In the x-y coordinate system, the failure base sites of the maximum failure base sites in x directions and x directions minimum are determined；Its In, the maximum failure base sites in x directions are designated as point B (xmax, ymax), the minimum failure base sites in x directions are designated as point A (xmin, ymin)；
Step 3.2, all discrete points are divided into m section at equal intervals by x directions, the width in each section is using following Formula calculates：
W=(xmax-xmin)/m=xinterval/m；
Wherein, w represents the width in each section；xintervalRepresent total length of all discrete points in x directions；
Step 3.3, the direction increased by x, m section is designated as successively：k[0]、k[1]…k[m-1]；Find respectively Maximum extreme point k [i] of each section in y directionsmaxyWith minimum extreme point k [i]miny；Wherein, i ∈ (0,1 ... m-1)；
Step 3.4, by the minimum extreme point in the maximum extreme point in point A, each section, point B and each section according to In the following manner connects, and forms the polygon of a closing, obtains the polygon of the closing shown in Fig. 2.
According to the order that i values are ascending, k [i] is sequentially connectedminy, i.e.,：k[0]miny、k[1]miny…k[m-1]minyAccording to Secondary connection, form a line segment；Similarly, according to the ascending order of i values, it is sequentially connected k [i]maxy, i.e.,：k[0]maxy、k [1]maxy…k[m-1]maxyIt is sequentially connected, forms a line segment；Finally, point A respectively with k [0]maxyWith k [0]minyConnection, point B Respectively with k [m-1]maxyWith k [m-1]minyConnection, the polygon of a closing is thus formed, the polygon of the closing is by 2m+2 Summit forms；
Step 3.5, the 2m+2 summit obtained for step 3.6, according to the concavity and convexity determination methods of point, each is judged The concavity and convexity on summit, if summit is concave point, delete；If summit is salient point, retain；Therefore, institute's salient point with a grain of salt Between be sequentially connected from beginning to end, formed convex closure, obtain the convex closure figure shown in Fig. 3；Institute's salient point with a grain of salt forms salient point point set.
In step 3.5, the concavity and convexity determination methods of the point are the concavity and convexity determination methods of continuous three vector vertex, more Specially vector cross-products method judges the concavity and convexity of continuous three vector vertex, and step is as follows：
Step 3.5.1, it is assumed that any summit is Vi(xi,yi), its front and rear adjacent vertex is respectively Vi-1(xi-1,yi-1) and Vi+1(xi+1,yi+1)；Wherein, xi,yiRespectively summit ViAbscissa and ordinate；xi-1,yi-1Respectively summit Vi-1Horizontal seat Mark and ordinate；xi+1,yi+1Respectively summit Vi+1Abscissa and ordinate；
Step 3.5.2, makees vector cross-products as the following formula：
T=Vi-1Vi×ViVi+1
Wherein, the end value of T representative vectors cross product；
Step 3.5.3, T z coordinate component is taken, the concavity and convexity discriminant function S of following point can be obtained：
S(Vi, Vi-1)=(xi-xi-1)×(yi+1-yi)-(xi+1-xi)×(yi-yi-1)
Point V is judged according to S signiConcavity and convexity：
If 1) S>0, ViFor salient point；
If 2) S=0, ViFor neutral point；
If 3) S<0, ViFor concave point.
Step 4：The geometric center of gravity for the convex closure that measuring and calculating step 3 obtains, the geometric center of gravity are the oval center of circle；
Step 5：Major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method, in conjunction with ellipse The round center of circle, draw the Areas of High Earthquake Intensity area based on communication base station failure.
In step 5, major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method, specifically For：
Step 5.1, oval conic section is represented with binary quadratic equation, form such as following formula：
Ax2+Bxy+Cy2+ Dx+Ey+F=0 (formula 1)
Wherein：A, B, C are respectively the coefficient of quadratic term, and at least one in A, B, C is not zero；D, E is respectively once The coefficient of item, F is constant term；
Step 5.2, to avoid equation null solution, when carrying out elliptic equation resolving, it is assumed that A+C=1, then elliptic equation conversion For following form：
Bxiyi+C(y2 i-x2 i)+Dxi+Eyi+ F=-x2 i(formula 2)
Wherein：xiFor any salient point abscissa, yiFor any salient point ordinate；I=1,2 ..., n；N is salient point point set convexity Point number；
Step 5.3, all salient point coordinates are substituted into above-mentioned formula 2, can obtain one group of equation group, it is specific as follows：
Above-mentioned equation group is expressed as matrix form：
MX=Y, i.e.,
Wherein, M is coefficient matrix, is the matrix of n × 5, i.e.,
X is unknown matrix number, i.e.,：Elliptic parameter to be asked, 5 × 1 matrixes, i.e.,
Y is constant matrices, the matrix of specially n × 1, i.e.,
Step 5.4, according to the principle of least square, normal equation system is obtained, matrix representation forms are as follows：
KX=f, i.e.,
Wherein, K is the coefficient matrix of normal equation system, is the matrix of n × 5, i.e.,
K=MTM
K11=x1 2y1 2+x2 2y2 2+x3 2y3 2+x4 2y4 2+…+xn 2yn 2
K12=x1y1(y1 2-x1 2)+x2y2(y2 2-x2 2)+x3y3(y3 2-x3 2)+x4y4(y4 2-x4 2)
+…+xnyn(yn 2-xn 2)
……
Kn1=x1y1+x2y2+x3y3+x4y4+…+xnyn
Kn2=y1 2-x1 2+y2 2-x2 2+y3 2-x3 2+y4 2-x4 2+…+yn 2-xn 2
Ki,jFor the element of normal equation system coefficient matrix, i=1,2 .., n, j=1,2,3,4,5
F is the constant matrices of normal equation system, is the matrix of n × 1, i.e.,
F=MTY
fuFor the element of normal equation system constant matrices, wherein, u=1,2 ..., n；
MTFor matrix M transposed matrix；
Step 5.5, using complete pivot gaussian elimination normal equation system, parameter B, C, D, E, F are obtained；
Step 5.6, based on qualifications A+C=1, parameter A=1-C is obtained, so far, the ellipse of conic section representation Parameter A, B, C, D, E, F of equation are all obtained；
Step 5.7, oval method for expressing also can use the form table of geometric parameter in addition to the representation of conic section Show, for ease of visual representation, conic section form is converted into geometric parameter form, conversion formula is as follows：
Major semiaxis a：
Semi-minor axis b：
Rotation angle θ：
Then the oval center of circle, major semiaxis a, semi-minor axis b, oval direction i.e. rotation angle θ is calculated in this；
Step 5.8, field direction, major axis and minor axis length are influenceed as ground using transverse direction as Areas of High Earthquake Intensity area Shake the major axis and short axle of highly seismic region；Wherein, major axis is 2 times of major semiaxis a；Short axle is 2 times of semi-minor axis b；Thus draw To the Areas of High Earthquake Intensity area based on communication base station failure.
Earthquake pole disaster area decision technology of the present invention based on mobile communication facility and Web Grafiti information carries out earthquake disaster Obtaining, the work is to attempt to obtain earthquake disaster using relevant industries information first, and research shows that the means have feasibility, Fast and accurately the condition of a disaster acquisition of information after occurring for big shake catastrophe serves exploration effect, and for following further research and Using providing the foundation.
Provided by the invention a kind of had based on communication network and the Areas of High Earthquake Intensity area quick judgment method of equipment fault Advantages below：
The present invention is quick and precisely estimated based on the communication base station network data for being laid in the whole nation using least square fitting ellipse Severely afflicated area scope is calculated, there is severely afflicated area to influence field direction and determine the advantages of speed is fast and Macro orientation is accurate, be earthquake Very first time emergency management and rescue decision-making afterwards provides foundation.
Described above is only the preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art For member, under the premise without departing from the principles of the invention, some improvements and modifications can also be made, these improvements and modifications also should Depending on protection scope of the present invention.

Claims (5)

  1. A kind of 1. Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault, it is characterised in that including with Lower step：
    Step 1：After the earthquake, earthquake region origination base station data are obtained, and the origination base station data are pre-processed, are obtained To the base station data list of reference format；Wherein, the base station data list is made up of a plurality of base station data；Every base station Data include：Base station name, latitude and longitude of base station and base station state；The base station state refers to failure base station or non-faulting base station shape State；
    Step 2：Using the failure base station mode recognition methods of earthquake factor and non-earthquake factor, the failure base obtained from step 1 In standing, reject non-earthquake factor caused by failure base station, tentatively obtain failure base station distribution caused by earthquake factor；
    Step 3：Failure base station distribution caused by the earthquake factor obtained to step 2 is further analyzed, and builds convex closure model, Concave point is rejected, ultimately forms the salient point point set of earthquake failure base station discrete point；Each salient point joins end to end successively, obtains convex closure；
    Step 4：The geometric center of gravity for the convex closure that measuring and calculating step 3 obtains, the geometric center of gravity are the oval center of circle；
    Step 5：Major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method, in conjunction with ellipse The center of circle, draw the Areas of High Earthquake Intensity area based on communication base station failure.
  2. A kind of 2. quick side of judgement of Areas of High Earthquake Intensity area based on communication network and equipment fault according to claim 1 Method, it is characterised in that step 2 is specially：Earthquake region failure base station spatial distribution is analyzed, is passed with reference to earthquake region electrical power wiring figure and optical cable Defeated figure, analysis obtain failure base station distribution caused by the non-earthquake factor in earthquake region；Meanwhile moved back with reference to mobile communication base station and take fault tree Model, analysis cause base station service quit probability of malfunction, thus reject failure base station caused by non-earthquake factor.
  3. A kind of 3. quick side of judgement of Areas of High Earthquake Intensity area based on communication network and equipment fault according to claim 1 Method, it is characterised in that step 3 specifically includes：
    Step 3.1, failure base station distribution caused by earthquake factor that step 2 tentatively obtains is shown in x-y coordinate system；Each The position coordinates of failure base station is (x, y)；
    In the x-y coordinate system, the failure base sites of the maximum failure base sites in x directions and x directions minimum are determined；Wherein, x The maximum failure base sites in direction are designated as point B (xmax, ymax), the minimum failure base sites in x directions are designated as point A (xmin, ymin)；
    Step 3.2, all discrete points are divided into m section at equal intervals by x directions, the width in each section uses below equation Calculate：
    W=(xmax-xmin)/m=xinterval/m；
    Wherein, w represents the width in each section；xintervalRepresent total length of all discrete points in x directions；
    Step 3.3, the direction increased by x, m section is designated as successively：k[0]、k[1]…k[m-1]；Find respectively each Maximum extreme point k [i] of the section in y directionsmaxyWith minimum extreme point k [i]miny；Wherein, i ∈ (0,1 ... m-1)；
    Step 3.4, by the minimum extreme point in the maximum extreme point in point A, each section, point B and each section according to following Mode connects, and forms the polygon of a closing；
    According to the order that i values are ascending, k [i] is sequentially connectedminy, i.e.,：k[0]miny、k[1]miny…k[m-1]minyConnect successively Connect, form a line segment；Similarly, according to the ascending order of i values, it is sequentially connected k [i]maxy, i.e.,：k[0]maxy、k [1]maxy…k[m-1]maxyIt is sequentially connected, forms a line segment；Finally, point A respectively with k [0]maxyWith k [0]minyConnection, point B Respectively with k [m-1]maxyWith k [m-1]minyConnection, the polygon of a closing is thus formed, the polygon of the closing is by 2m+2 Summit forms；
    Step 3.5, the 2m+2 summit obtained for step 3.6, according to the concavity and convexity determination methods of point, each summit is judged Concavity and convexity, if summit is concave point, delete；If summit is salient point, retain；Therefore, between institute's salient point with a grain of salt Head and the tail are sequentially connected, and form convex closure；Institute's salient point with a grain of salt forms salient point point set.
  4. A kind of 4. quick side of judgement of Areas of High Earthquake Intensity area based on communication network and equipment fault according to claim 3 Method, it is characterised in that in step 3.5, the concavity and convexity determination methods of the point judge for the concavity and convexity of continuous three vector vertex Method, more specifically vector cross-products method judge the concavity and convexity of continuous three vector vertex, and step is as follows：
    Step 3.5.1, it is assumed that any summit is Vi(xi,yi), its front and rear adjacent vertex is respectively Vi-1(xi-1,yi-1) and Vi+1 (xi+1,yi+1)；Wherein, xi,yiRespectively summit ViAbscissa and ordinate；xi-1,yi-1Respectively summit Vi-1Abscissa And ordinate；xi+1,yi+1Respectively summit Vi+1Abscissa and ordinate；
    Step 3.5.2, makees vector cross-products as the following formula：
    T=Vi-1Vi×ViVi+1
    Wherein, the end value of T representative vectors cross product；
    Step 3.5.3, T z coordinate component is taken, the concavity and convexity discriminant function S of following point can be obtained：
    S(Vi, Vi-1)=(xi-xi-1)×(yi+1-yi)-(xi+1-xi)×(yi-yi-1)
    Point V is judged according to S signiConcavity and convexity：
    If 1) S ＞ 0, ViFor salient point；
    If 2) S=0, ViFor neutral point；
    If 3) S ＜ 0, ViFor concave point.
  5. A kind of 5. quick side of judgement of Areas of High Earthquake Intensity area based on communication network and equipment fault according to claim 1 Method, it is characterised in that in step 5, major axis and minor axis radius and the anglec of rotation are calculated using least square fitting ellipse method, Specially：
    Step 5.1, oval conic section is represented with binary quadratic equation, form such as following formula：
    Ax2+Bxy+Cy2+ Dx+Ey+F (formula 1)
    Wherein：A, B, C are respectively the coefficient of quadratic term, and at least one in A, B, C is not zero；D, E is respectively first order Coefficient, F are constant term；
    Step 5.2, to avoid equation null solution, when carrying out elliptic equation resolving, it is assumed that A+C=1, then elliptic equation be transformed to as Lower form：
    Bxiyi+C(y2 i-x2 i)+Dxi+Eyi+ F=(formula 2)
    Wherein：xiFor any salient point abscissa, yiFor any salient point ordinate；I=1,2 ..., n；N is salient point point set bumps Number；
    Step 5.3, all salient point coordinates are substituted into above-mentioned formula 2, can obtain one group of equation group, it is specific as follows：
    <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msub> <mi>Bx</mi> <mn>1</mn> </msub> <msub> <mi>y</mi> <mn>1</mn> </msub> <mo>+</mo> <mi>C</mi> <mrow> <mo>(</mo> <msub> <msup> <mi>y</mi> <mn>2</mn> </msup> <mn>1</mn> </msub> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>Dx</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>Ey</mi> <mn>1</mn> </msub> <mo>+</mo> <mi>F</mi> <mo>=</mo> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>1</mn> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>Bx</mi> <mn>2</mn> </msub> <msub> <mi>y</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>C</mi> <mrow> <mo>(</mo> <msub> <msup> <mi>y</mi> <mn>2</mn> </msup> <mn>2</mn> </msub> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>Dx</mi> <mn>2</mn> </msub> <mo>+</mo> <msub> <mi>Ey</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>F</mi> <mo>=</mo> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>2</mn> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>Bx</mi> <mn>3</mn> </msub> <msub> <mi>y</mi> <mn>3</mn> </msub> <mo>+</mo> <mi>C</mi> <mrow> <mo>(</mo> <msub> <msup> <mi>y</mi> <mn>2</mn> </msup> <mn>3</mn> </msub> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>3</mn> </msub> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>Dx</mi> <mn>3</mn> </msub> <mo>+</mo> <msub> <mi>Ey</mi> <mn>3</mn> </msub> <mo>+</mo> <mi>F</mi> <mo>=</mo> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>3</mn> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>Bx</mi> <mn>4</mn> </msub> <msub> <mi>y</mi> <mn>4</mn> </msub> <mo>+</mo> <mi>C</mi> <mrow> <mo>(</mo> <msub> <msup> <mi>y</mi> <mn>2</mn> </msup> <mn>4</mn> </msub> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>4</mn> </msub> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>Dx</mi> <mn>4</mn> </msub> <mo>+</mo> <msub> <mi>Ey</mi> <mn>4</mn> </msub> <mo>+</mo> <mi>F</mi> <mo>=</mo> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mn>4</mn> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>......</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>Bx</mi> <mi>n</mi> </msub> <msub> <mi>y</mi> <mi>n</mi> </msub> <mo>+</mo> <mi>C</mi> <mrow> <mo>(</mo> <msub> <msup> <mi>y</mi> <mn>2</mn> </msup> <mi>n</mi> </msub> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mi>n</mi> </msub> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>Dx</mi> <mi>n</mi> </msub> <mo>+</mo> <msub> <mi>Ey</mi> <mi>n</mi> </msub> <mo>+</mo> <mi>F</mi> <mo>=</mo> <mo>-</mo> <msub> <msup> <mi>x</mi> <mn>2</mn> </msup> <mi>n</mi> </msub> </mrow> </mtd> </mtr> </mtable> </mfenced>
    Above-mentioned equation group is expressed as matrix form：
    MX=Y, i.e.,
    <mrow> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <msub> <mi>y</mi> <mn>1</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>1</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>1</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>2</mn> </msub> <msub> <mi>y</mi> <mn>2</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>2</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>2</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>3</mn> </msub> <msub> <mi>y</mi> <mn>3</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>3</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>3</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>4</mn> </msub> <msub> <mi>y</mi> <mn>4</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>4</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>4</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow></mrow> </mtd> <mtd> <mn>......</mn> </mtd> <mtd> <mrow></mrow> </mtd> <mtd> <mrow></mrow> </mtd> <mtd> <mrow></mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mi>n</mi> </msub> <msub> <mi>y</mi> <mi>n</mi> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mi>n</mi> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mi>n</mi> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mi>B</mi> </mtd> </mtr> <mtr> <mtd> <mi>C</mi> </mtd> </mtr> <mtr> <mtd> <mi>D</mi> </mtd> </mtr> <mtr> <mtd> <mi>E</mi> </mtd> </mtr> <mtr> <mtd> <mi>F</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>......</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Wherein, M is coefficient matrix, is the matrix of n × 5, i.e.,
    <mrow> <mi>M</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <msub> <mi>y</mi> <mn>1</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>1</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>1</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>2</mn> </msub> <msub> <mi>y</mi> <mn>2</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>2</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>2</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>3</mn> </msub> <msub> <mi>y</mi> <mn>3</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>3</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>3</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>4</mn> </msub> <msub> <mi>y</mi> <mn>4</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mn>4</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>4</mn> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow></mrow> </mtd> <mtd> <mn>......</mn> </mtd> <mtd> <mrow></mrow> </mtd> <mtd> <mrow></mrow> </mtd> <mtd> <mrow></mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mi>n</mi> </msub> <msub> <mi>y</mi> <mi>n</mi> </msub> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <msub> <mi>x</mi> <mi>n</mi> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mi>n</mi> </msub> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced> </mrow>
    X is unknown matrix number, i.e.,：Elliptic parameter to be asked, 5 × 1 matrixes, i.e.,
    <mrow> <mi>X</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mi>B</mi> </mtd> </mtr> <mtr> <mtd> <mi>C</mi> </mtd> </mtr> <mtr> <mtd> <mi>D</mi> </mtd> </mtr> <mtr> <mtd> <mi>E</mi> </mtd> </mtr> <mtr> <mtd> <mi>F</mi> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Y is constant matrices, the matrix of specially n × 1, i.e.,
    <mrow> <mi>Y</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>......</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Step 5.4, according to the principle of least square, normal equation system is obtained, matrix representation forms are as follows：
    KX=f, i.e.,
    <mrow> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <msub> <mi>K</mi> <mn>11</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>12</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>13</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>14</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>15</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>K</mi> <mn>21</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>22</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>23</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>24</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>25</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>K</mi> <mn>31</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>32</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>33</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>34</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>35</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>K</mi> <mn>41</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>42</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>43</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>44</mn> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mn>45</mn> </msub> </mtd> </mtr> <mtr> <mtd> <mrow></mrow> </mtd> <mtd> <mrow></mrow> </mtd> <mtd> <mn>......</mn> </mtd> <mtd> <mrow></mrow> </mtd> <mtd> <mrow></mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>K</mi> <mrow> <mi>n</mi> <mn>1</mn> </mrow> </msub> <msub> <mi>K</mi> <mrow> <mi>n</mi> <mn>2</mn> </mrow> </msub> </mrow> </mtd> <mtd> <msub> <mi>K</mi> <mrow> <mi>n</mi> <mn>2</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mrow> <mi>n</mi> <mn>3</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mrow> <mi>n</mi> <mn>4</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>K</mi> <mrow> <mi>n</mi> <mn>5</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mi>B</mi> </mtd> </mtr> <mtr> <mtd> <mi>C</mi> </mtd> </mtr> <mtr> <mtd> <mi>D</mi> </mtd> </mtr> <mtr> <mtd> <mi>E</mi> </mtd> </mtr> <mtr> <mtd> <mi>F</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <msub> <mi>f</mi> <mn>1</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>f</mi> <mn>2</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>f</mi> <mn>3</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>f</mi> <mn>4</mn> </msub> </mtd> </mtr> <mtr> <mtd> <mn>......</mn> </mtd> </mtr> <mtr> <mtd> <msub> <mi>f</mi> <mi>n</mi> </msub> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Wherein, K is the coefficient matrix of normal equation system, is the matrix of n × 5, i.e.,
    K=MTM
    K11=x1 2y1 2+x2 2y2 2+x3 2y3 2+x4 2y4 2+…+xn 2yn 2
    K12=x1y1(y1 2-x1 2)+x2y2(y2 2-x2 2)+x3y3(y3 2-x3 2)+x4y4(y4 2-x4 2)+…+xnyn(yn 2-xn 2)
    ……
    Kn1=x1y1+x2y2+x3y3+x4y4+…+xnyn
    Kn2=y1 2-x1 2+y2 2-x2 2+y3 2-x3 2+y4 2-x4 2+…+yn 2-xn 2
    KI, jFor the element of normal equation system coefficient matrix, i=1,2 .., n, j=1,2,3,4,5
    F is the constant matrices of normal equation system, is the matrix of n × 1, i.e.,
    F=MTY
    <mrow> <mi>f</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <msub> <mi>y</mi> <mn>1</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msub> <mi>x</mi> <mn>2</mn> </msub> <msub> <mi>y</mi> <mn>2</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msub> <mi>x</mi> <mn>3</mn> </msub> <msub> <mi>y</mi> <mn>3</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msub> <mi>x</mi> <mn>4</mn> </msub> <msub> <mi>y</mi> <mn>4</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msub> <mi>x</mi> <mn>..</mn> </msub> <msub> <mi>y</mi> <mn>..</mn> </msub> </mrow> </mtd> <mtd> <mrow> <msub> <mi>x</mi> <mi>n</mi> </msub> <msub> <mi>y</mi> <mi>n</mi> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mn>..</mn> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>..</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> <mtd> <mrow> <msup> <msub> <mi>y</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>x</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <msub> <mi>x</mi> <mn>1</mn> </msub> </mtd> <mtd> <msub> <mi>x</mi> <mn>2</mn> </msub> </mtd> <mtd> <msub> <mi>x</mi> <mn>3</mn> </msub> </mtd> <mtd> <msub> <mi>x</mi> <mn>4</mn> </msub> </mtd> <mtd> <msub> <mi>x</mi> <mn>..</mn> </msub> </mtd> <mtd> <msub> <mi>x</mi> <mi>n</mi> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>y</mi> <mn>1</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>2</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>3</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>4</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mn>..</mn> </msub> </mtd> <mtd> <msub> <mi>y</mi> <mi>n</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>2</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>3</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>4</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mn>..</mn> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <msup> <msub> <mi>x</mi> <mi>n</mi> </msub> <mn>2</mn> </msup> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    fuFor the element of normal equation system constant matrices, wherein, u=1,2 ..., n；
    MTFor matrix M transposed matrix；
    Step 5.5, using complete pivot gaussian elimination normal equation system, parameter B, C, D, E, F are obtained；
    Step 5.6, based on qualifications A+C=1, parameter A=1-C is obtained, so far, the elliptic equation of conic section representation Parameter A, B, C, D, E, F all obtain；
    Step 5.7, oval method for expressing also can use the form of geometric parameter to represent in addition to the representation of conic section, For ease of visual representation, conic section form is converted into geometric parameter form, conversion formula is as follows：
    Major semiaxis a：
    Semi-minor axis b：
    Rotation angle θ：
    Then the oval center of circle, major semiaxis a, semi-minor axis b, oval direction i.e. rotation angle θ is calculated in this；
    Step 5.8, field direction, major axis and minor axis length are influenceed as earthquake height using transverse direction as Areas of High Earthquake Intensity area The major axis and short axle of intensity area；Wherein, major axis is 2 times of major semiaxis a；Short axle is 2 times of semi-minor axis b；Thus draw and obtain base In the Areas of High Earthquake Intensity area of communication base station failure.
CN201710625127.6A 2017-07-27 2017-07-27 A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault Active CN107422369B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710625127.6A CN107422369B (en) 2017-07-27 2017-07-27 A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710625127.6A CN107422369B (en) 2017-07-27 2017-07-27 A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault

Publications (2)

Publication Number Publication Date
CN107422369A CN107422369A (en) 2017-12-01
CN107422369B true CN107422369B (en) 2018-04-10

Family

ID=60430451

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710625127.6A Active CN107422369B (en) 2017-07-27 2017-07-27 A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault

Country Status (1)

Country Link
CN (1) CN107422369B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108934036B (en) * 2018-07-11 2021-07-20 中国联合网络通信集团有限公司 Method and device for acquiring state information of base station
CN109379703B (en) * 2018-12-18 2020-09-08 浙江每日互动网络科技股份有限公司 Disaster area judgment method based on mobile terminal networking data
CN114565802B (en) * 2021-12-15 2023-04-07 北京信息科技大学 Wind driven generator extraction method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1867839A (en) * 2003-10-31 2006-11-22 松下电器产业株式会社 Disaster prediction system
CN103428626A (en) * 2012-05-15 2013-12-04 成都市美幻科技有限公司 Disaster area population distribution statistical method based on mobile phone base station
CN105376771A (en) * 2015-10-20 2016-03-02 四川公用信息产业有限责任公司 Method for evaluating degree of influence of earthquake on suffered region based on communication data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1867839A (en) * 2003-10-31 2006-11-22 松下电器产业株式会社 Disaster prediction system
CN103428626A (en) * 2012-05-15 2013-12-04 成都市美幻科技有限公司 Disaster area population distribution statistical method based on mobile phone base station
CN105376771A (en) * 2015-10-20 2016-03-02 四川公用信息产业有限责任公司 Method for evaluating degree of influence of earthquake on suffered region based on communication data

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
基于中分辨率遥感影像的居民区震害信息提取;张小咏 等;《地震学报》;20160515;第38卷(第3期);第486-495页 *
芦山7.0级地震通讯***震害调查分析;刘金龙 等;《自然灾害学报》;20131015;第22卷(第5期);第91-97页 *
通信基站地震破坏等级划分探讨;臧战胜 等;《地震工程与工程振动》;20140815;第34卷;第1025-1030页 *

Also Published As

Publication number Publication date
CN107422369A (en) 2017-12-01

Similar Documents

Publication Publication Date Title
CN107422369B (en) A kind of Areas of High Earthquake Intensity area quick judgment method based on communication network and equipment fault
CN109977921B (en) Method for detecting hidden danger of power transmission line
CN106657882A (en) Real-time monitoring method for power transmission and transformation system based on unmanned aerial vehicle
CN106600399A (en) Loan approval method and system
CN110070530A (en) A kind of powerline ice-covering detection method based on deep neural network
CN109919058A (en) A kind of multisource video image highest priority rapid detection method based on Yolo V3
CN109829908B (en) Binocular image-based method and device for detecting safety distance of ground object below power line
CN110377674A (en) A kind of Typhoon Storm Surge Over methods of risk assessment and system based on ArcGIS platform
CN112966589A (en) Behavior identification method in dangerous area
CN109935080A (en) The monitoring system and method that a kind of vehicle flowrate on traffic route calculates in real time
KR102157592B1 (en) System and method for beach safety management for prevention of beach safety accident and computer program for the same
CN112925870B (en) Population spatialization method and system
CN107221006A (en) A kind of communication single pipe tower slant detection method based on unmanned plane imaging platform
CN115909092A (en) Light-weight power transmission channel hidden danger distance measuring method and hidden danger early warning device
CN108775890A (en) A kind of bridge remote monitoring system and method
CN116202427A (en) Unmanned aerial vehicle image-based power transmission line ranging method, system, equipment and medium
CN108197395A (en) A kind of construction method of transmission line of electricity total load head model and application
CN111538059A (en) Self-adaptive rapid dynamic positioning system and method based on improved Boltzmann machine
CN113625731B (en) Unmanned aerial vehicle terrain matching ground-imitating flight method based on DEM data
CN112380945B (en) Method and system for identifying potential hazards of power transmission channel environment based on satellite remote sensing image
CN106802930A (en) A kind of method of calibration in electric power line pole tower model geographical position
CN109325911A (en) A kind of space base rail detection method based on attention enhancing mechanism
CN116844309B (en) Meteorological data real-time monitoring multichannel early warning system
CN115424276B (en) Ship license plate number detection method based on deep learning technology
CN112446232A (en) Continuous self-learning image identification method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant