曝光台 注意防骗
网曝天猫店富美金盛家居专营店坑蒙拐骗欺诈消费者
COORDINATE = array[POINTRANGE] of real;
CMATRIX = array[LICRANGE,LICRANGE] of CONNECTORS;
BMATRIX = array[LICRANGE,LICRANGE] of boolean;
VECTOR = array[LICRANGE] of boolean;
COMPTYPE = (LT,EQ,GT);
var
- 28 -
X :COORDINATE; {X coordinates of data points}
Y :COORDINATE; {Y coordinates of data points}
NUMPOINTS : NPOINTS; {Number of data points}
PARAMETERS : record
LENGTH1 : real; {Length in LICs 1, 8, 13}
RADIUS1 : real; {Radius in LICs 2, 9, 14}
EPSILON : real; {Deviation from ’PI’ in LICs 3, 10}
AREA1 : real; {Area in LICs 4, 11, 15}
Q_PTS : NPOINTS; {No. of #consecutive# points in LIC 5}
QUADS : NUMQUADS; {No. of quadrants in LIC 5}
DIST : real; {Distance in LIC 7}
N_PTS : NPTYPE; {No. of #consecutive# pts. in LIC 7}
K_PTS : POINTRANGE; {No. of int. pts. in LICs 8, 13}
A_PTS : POINTRANGE; {No. of int. pts. in LICs 9, 14}
B_PTS : POINTRANGE; {No. of int. pts. in LICs 9, 14}
C_PTS : POINTRANGE; {No. of int. pts. in LIC 10}
D_PTS : POINTRANGE; {No. of int. pts. in LIC 10}
E_PTS : POINTRANGE; {No. of int. pts. in LICs 11, 15}
F_PTS : POINTRANGE; {No. of int. pts. in LICs 11, 15}
G_PTS : POINTRANGE; {No. of int. pts. in LIC 12}
LENGTH2 : real; {Maximum length in LIC 13}
RADIUS2 : real; {Maximum radius in LIC 14}
AREA2 : real {Maximum area in LIC 15}
end; {of record PARAMETERS}
LCM : CMATRIX; {Logical Connector Matrix}
PUM : BMATRIX; {Preliminary Unlocking Matrix}
CMV : VECTOR; {Conditions Met Vector}
FUV : VECTOR; {Final Unlocking Vector}
LAUNCH : boolean; {Decision: Launch or No Launch}
function REALCOMPARE (A,B : real) : COMPTYPE;
{compares real numbers -- see Nonfunctional Requirements}
- 29 -
Required Computations
It can be assumed that all input data and parameters that are measured in some form of units use the
same, consistent units. For example, all lengths are measured in the same units that are used to define the
planar space from which the input data comes. Therefore, no unit conversion is necessary.
Given the parameter values in the global record ’PARAMETERS’, the procedure DECIDE must
evaluate each of the #Launch Interceptor Conditions# (LICs) described below for the set of ’NUMPOINTS’
points:
(X[1],Y[1]) ,...., (X[NUMPOINTS],Y[NUMPOINTS])
where 2 <= NUMPOINTS <= 100
The #Conditions Met Vector# (CMV) should be set according to the results of these calculations, i.e. the
global array element CMV[i] should be set to true if and only if the ith LIC is met.
The Launch Interceptor Conditions (LIC) are defined as follows:
(1) There exists at least one set of two #consecutive# data points that are a distance greater than the
length, ’LENGTH1’, apart.
( 0 <= LENGTH1 )
(2) There exists at least one set of three #consecutive# data points that cannot all be contained within or
on a circle of radius ’RADIUS1’.
( 0 <= RADIUS1 )
- 30 -
(3) There exists at least one set of three #consecutive# data points which form an #angle# such that:
angle < (’PI’ - ’EPSILON’)
or
angle > (’PI’ + ’EPSILON’)
The second of the three #consecutive# points is always the #vertex# of the #angle#. If either the
first point or the last point (or both) coincides with the #vertex#, the #angle# is undefined and the
LIC is not satisfied by those three points.
( 0 <= EPSILON < PI )
(4) There exists at least one set of three #consecutive# data points that are the vertices of a triangle with
area greater than ’AREA1’.
( 0 <= AREA1 )
(5) There exists at least one set of ’Q_PTS’ #consecutive# data points that lie in more than ’QUADS’
#quadrants#. Where there is ambiguity as to which #quadrant# contains a given point, priority of
decision will be by #quadrant# number, i.e., I, II, III, IV. For example, the data point (0,0) is in
quadrant I, the point (-l,0) is in quadrant II, the point (0,-l) is in quadrant III, the point (0,1) is in
quadrant I and the point (1,0) is in quadrant I.
( 2 <= Q_PTS <= NUMPOINTS ) , ( 1 <= QUADS <= 3 )
(6) There exists at least one set of two #consecutive# data points, (X[i],Y[i]) and (X[j],Y[j]), such that
X[j] - X[i] < 0. (where i = j-1 )
- 31 -
(7) There exists at least one set of ’N_PTS’ #consecutive# data points such that at least one of the
points lies a distance greater than ’DIST’ from the line joining the first and last of these ’N_PTS’
points. If the first and last points of these ’N_PTS’ are identical, then the calculated distance to
compare with ’DIST’ will be the distance from the coincident point to all other points of the
中国航空网 www.aero.cn
航空翻译 www.aviation.cn
本文链接地址：
航空资料35(195)
