CN103513991B - Method for establishing bi-directional mapping among sequences under condition of difference limitation - Google Patents

Abstract

The present invention relates to a method for establishing a two-way mapping between number sequences under the condition of limited balance. It first arranges two sets of discrete data into two number sequences in order from small to large, and stores them in two comparison modules. The data item cursor variable modules CurX and CurY point to and compare them one by one. If there are two data in the two series that meet the limit conditions of the difference, a two-way mapping relationship is established and stored, and finally the two series are realized. The data items of the two-way mapping relationship are counted, so as to achieve the purpose of discovering the relevance and similarity of the two sets of data.

Description

A Method of Establishing Two-way Mapping Between Numeral Sequences under the Limitation Condition of Difference

technical field

The invention relates to a software technology, in particular to a method for establishing a two-way mapping relationship by comparing and analyzing numbers.

Background technique

Sequence: A sequence of numbers arranged in a certain order is called a sequence of numbers. Each number in the sequence is called a data item of the sequence, or item for short. .

Bidirectional mapping: A bidirectional pointing relationship between two data items. The bidirectional mapping in the present invention specifically refers to: (1) The two data items of the bidirectional mapping must belong to two different sequence; (2) When any data item has become an item in a certain bidirectional mapping, it must not become another One item in the two-way mapping, that is, there must be no overlap between the two-way mappings; (3) The difference between the two numbers of the previous item and the next item of any two-way mapping should meet the difference limit conditions.

Difference limit condition: This condition includes the minimum difference Min and the maximum difference Max between two values. The difference limit condition refers to the mathematical difference Diff between the two numbers of the previous item and the next item in the two-way mapping, which must not be less than Min, and must not If it is greater than Max, the following mathematical condition should be satisfied: Min≤Diff≤Max. Of course, Min must not be greater than Max, that is, Min≤Max.

Maximum two-way mapping relationship: After two given numbers (the previous number sequence SeqA and the next number sequence SeqB) and the given difference limit conditions, try to establish the most two-way mapping relationships that meet the difference limit conditions.

In the field of security, technicians often do not need to understand the similarity and correlation between multiple sets of data in order to realize the judgment of the similarity of these data. However, the existing data is often discrete, disordered, regular If the correlation is very weak, it is difficult to find out their rules, let alone judge the similarity and correlation between each set of data.

Contents of the invention

The present invention mainly solves the problems existing in the prior art that it is difficult to find out the relationship between two sets of discrete data, and it is impossible to judge their similarity and correlation, and provides a method that can quickly judge two sets of data Mutual mapping relationship, a method of establishing a two-way mapping between sequence of numbers under the condition of difference limit to explore their correlation and similarity.

Above-mentioned technical problem of the present invention is mainly solved by following technical scheme: a kind of method of setting up two-way mapping between sequence of numbers under the condition of difference limitation, it is characterized in that it comprises the following steps:

ⅰ Put two groups of data in the computer storage space, which are respectively SeqA and SeqB, and arrange SeqA and SeqB in two comparison modules according to the order from small to large, forming two sequence SeqX and SeqY, each data of sequence The item occupies a location in the comparison module, and the location where the data item is stored is called the effective location;

ⅱ Establish two data item cursor variable modules CurX, CurY, initialize CurX to point to the last valid location of SeqX to obtain the corresponding data item, initialize CurY to point to the last valid location of SeqY to obtain the corresponding data item;

ⅲ Discriminate the two data items obtained by CurX and CurY, obtain the difference Diff of the two data items of CurX and CurY, and set the difference limit condition of CurX and CurY to be greater than or equal to Min, and less than or equal to Max;

ⅳAccording to the comparison result of Diff and the difference limit condition, perform branch processing and move the corresponding cursor, and establish a two-way mapping relationship MapResult when the difference limit condition is met. MapResult is stored in the structural variable module ItemMap. ItemMap includes member variables OffX and OffY. as follows:

a If the Diff meets the difference limitation conditions, that is, Min ≤ Diff ≤ Max, the value of the member variable OffX is CurX, the value of the member variable OffY is the data of CurY, and store them, and then release the data of the two cursor variable modules CurX and CurY, SeqX and SeqY point to the previous effective location in the corresponding sequence, and then compare according to Diff and the difference limit condition;

b If Diff > Max, release the data of CurX, SeqX points to the previous effective location in the corresponding sequence, and then compare according to Diff and the difference limit condition;

c If Diff < Min, release the data of CurY, SeqY points to the previous effective location in the corresponding sequence, and then compare Diff with the difference limit condition;

d judge whether the location pointed to by CurX and CurY has exceeded the limit of the first effective location of SeqX and SeqY, if it has exceeded, end the loop, otherwise return to the loop work part;

ⅴThrough the statistics of the member variables OffX and OffY, the number Cnt of the two-way mapping relationship can be obtained, and all the obtained two-way mapping relationships can be summarized and compared with the two sequence of SeqX and SeqY, it can be obtained: no match can be obtained in the sequence of SeqX The number of data items MissX, and the number of matching data items MissY cannot be obtained in the SeqY array.

The beneficial effect of the present invention is that it solves the problem that it is difficult to find out the relationship between two sets of discrete data in the prior art, and it is impossible to judge their similarity and correlation. It is a method for establishing a two-way mapping between data series under the condition of difference limitation, which can quickly judge the mutual mapping relationship between two sets of data, and discover their correlation degree and similarity degree.

Description of drawings

Figure 1 is a schematic diagram of the sequence SeqX and SeqY after sorting;

Fig. 2 is a schematic diagram of the establishment result of bidirectional mapping;

Fig. 3 is a working principle diagram of the present invention.

detailed description

The technical solutions of the present invention will be further specifically described below through the embodiments and in conjunction with the accompanying drawings.

Embodiment: as shown in Figure 3, the present invention is a kind of method that sets up two-way mapping between sequence under the condition of difference limit, it is characterized in that it comprises the steps:

ⅰ Put two groups of data in the computer storage space, which are respectively SeqA and SeqB, and arrange SeqA and SeqB in the two comparison modules in order from small to large, forming two series of numbers SepX and SepY, each data of the series The item occupies a location in the comparison module, and the location where the data item is stored is called the effective location;

ⅱ Establish two data item cursor variable modules CurX, CurY, initialize CurX to point to the last valid location of SeqX to obtain the corresponding data item, initialize CurY to point to the last valid location of SeqY to obtain the corresponding data item;

ⅲ Discriminate the two data items obtained by CurX and CurY, obtain the difference Diff of the two data items of CurX and CurY, and set the difference limit condition of CurX and CurY to be greater than or equal to Min, and less than or equal to Max;

ⅳAccording to the comparison result of Diff and the difference limit condition, perform branch processing and move the corresponding cursor, and establish a two-way mapping relationship MapResult when the difference limit condition is met. MapResult is stored in the structural variable module ItemMap. ItemMap includes member variables OffX and OffY. as follows:

a If the Diff meets the limit condition of the difference, that is, Min ≤ Diff ≤ Max, the value of the member variable OffX is CurX, the value of the member variable OffY is the data of CurY, and store them, and then release the data of the two cursor variable modules CurX and CurY, SeqX and SeqY point to the previous effective location in the corresponding sequence, and then compare according to Diff and the difference limit condition;

b If Diff > Max, release the data of CurX, SeqX points to the previous effective location in the corresponding sequence, and then compare according to Diff and the difference limit condition;

c If Diff < Min, release the data of CurY, SeqY points to the previous effective location in the corresponding sequence, and then compare Diff with the difference limit condition;

d judge whether the location pointed to by CurX and CurY has exceeded the limit of the first effective location of SeqX and SeqY, if it has exceeded, end the loop, otherwise return to the loop work part;

ⅴThrough the statistics of the member variables OffX and OffY, the number Cnt of the two-way mapping relationship can be obtained, and all the obtained two-way mapping relationships can be summarized and compared with the two sequence of SeqX and SeqY, it can be obtained: no match can be obtained in the sequence of SeqX The number of data items MissX, and the number of matching data items MissY cannot be obtained in the SeqY array.

As shown in Figure 1, if,

SeqA includes the following data items: 33, 30, 33, 39, 55, 50, 45;

SeqA includes the following data items: 30, 34, 32, 36, 48, 50, 52.

Where Min is 0 and Max is 4.

Arrange them to get the sequence SeqX: 30, 33, 33, 39, 45, 50, 55;

SeqY: 30, 32, 34, 36, 48, 50, 52.

as shown in picture 2,

After the bidirectional mapping is established: the second data item of SeqX and the first data item of SeqY are bidirectionally mapped;

Two-way mapping between the third data item of SeqX and the second data item of SeqY;

Two-way mapping between the fourth data item of SeqX and the fourth data item of SeqY;

Two-way mapping between the sixth data item of SeqX and the sixth data item of SeqY;

The 7th data item of SeqX and the 7th data item of SeqY are bidirectionally mapped.

According to the statistics: the number Cnt of the two-way mapping relationship is 5;

The number of data items that cannot be matched in the SeqX sequence MissX is 2;

The number of missing data items MissY in the SeqY array is 2.

Therefore, the present invention realizes the analysis of the mutual mapping relationship between the two sets of data, and people can therefore judge the degree of correlation and similarity between the two sets of data.

Claims (1)

1. a kind of method that biaxial stress structure is set up between ordered series of numbers under condition of difference limitation, it is characterised in that it includes following step Suddenly：

I is stored in two groups of data, respectively SeqA, SeqB in Computer Storage space, and SeqA, SeqB are pressed respectively from it is little to Big is arranged sequentially in two comparison modules, forms two ordered series of numbers SeqX and SeqY, and each data item of ordered series of numbers is in relatively mould A position is taken in block, the position for having data item is referred to as effective position；

II sets up two data item vernier variable module CurX, CurY, initializes last effective district that CurX points to SeqX Position obtains corresponding data item, and last the effective position for initializing CurY sensing SeqY obtains corresponding data item；

III differentiates two data item that CurX, CurY are obtained, and obtains the poor Diff of two data item of CurX, CurY, and sets The condition of difference limitation for determining CurX, CurY is more than or equal to Min, and less than or equal to Max；

IV carries out branch process and the corresponding vernier of movement according to Diff and the comparative result of condition of difference limitation, and is meeting Biaxial stress structure relation MapResult is set up during condition of difference limitation, MapResult is stored in structure variable module I temMap, ItemMap includes member variable OffX, OffY, and process is as follows：

If a Diff meet condition of difference limitation, i.e. Min≤Diff≤Max, the value of member variable OffX is CurX, Cheng Yuanbian The value of amount OffY is the data of CurY, and is stored, and then discharges the data of two vernier variable modules of CurX, CurY, SeqX, SeqY point to previous effective position in corresponding ordered series of numbers, further according to the comparison according to Diff and condition of difference limitation；

If Diff>Max, the data of CurX are discharged, and SeqX points to previous effective position in corresponding ordered series of numbers, further according to root According to the comparison of Diff and condition of difference limitation；

If Diff<Min, the data of CurY are discharged, and SeqY points to previous effective position in corresponding ordered series of numbers, further according to The comparison of Diff and condition of difference limitation；

Differentiate whether the position pointed by CurX, CurY has exceeded the boundary of first effective position of SeqX, SeqY, if Exceed, end loop, otherwise returned to circulation working portion；

V is obtained quantity Cnt of biaxial stress structure relation by the statistics to member variable OffX, OffY, and collect statistics own The biaxial stress structure relation for obtaining, and compare with two ordered series of numbers of SeqX, SeqY, obtain：Fail to access in SeqX ordered series of numbers Data item quantity MissX matched somebody with somebody, fails data item quantity MissY for accessing matching in SeqY ordered series of numbers.