Database and method for evaluating data therefrom
Database and method for evaluating data therefrom
 CN 102,648,467 A
 Filed: 09/22/2010
 Published: 08/22/2012
 Est. Priority Date: 09/25/2009
 Status: Active Application
First Claim
1. computer system that is used for coming according to the set of input value number of computations, said computer system comprise and are configured to store the first input value x _{n}The database of sequence, wherein, n=1,2 ... I, Wherein, for arbitrary n value, x _{n}In said sequence, be positioned at x _{N+1}And x _{N1}Between, and be associated with following value:
 The second input value y _{n}Conversion value p _{n}, according to transfer algorithm by y _{n}Calculate;
And Output valve z _{n}, wherein, z _{n}=z _{N1}+ p _{n}Said database further is configured to store a plurality of output valve z _{n}
Chinese PRB Reexamination
Abstract
A computer system for calculating a quantity from a set of input values. The computer system comprises a database that is configured to store a sequence of first input values Xn wherein n=1,2,...i, wherein for any value of n, Xn lies between Xn+1 and x in the sequence. Each value of x has associated with it a second input value yn, a conversion value pn that is calculated from yn according to a conversion algorithm, and an output value zn, wherein z n = zn1 + pn. The database is configured to store the plurality of output values zn.; The database may also be configured to identify a minimum and/or maximum value from a sequence of values stored therein, and to define at least a first subsequence of values and a second subsequence of values immediately following the first subsequence of values, wherein the boundary between the first and second subsequences is located at the position of either the minimum or maximum value of the sequence.

4 Citations
A kind of acquisition can test several devices and methods therefors at random  
Patent #
CN 107,832,258 A
Filed 11/16/2017

Current Assignee

Realtime message puttingout Internet project  
Patent #
CN 1,357,848 A
Filed 12/11/2000

Current Assignee

Computer Implemented Method and System of Trading Indicators Based on Price and Volume  
Patent #
US 20040225592A1
Filed 05/08/2003

Current Assignee
N/A

Method for weighed computation of moving average by using turnover  
Patent #
CN 101,315,694 A
Filed 06/01/2007

Current Assignee

31 Claims

1. computer system that is used for coming according to the set of input value number of computations, said computer system comprise and are configured to store the first input value x _{n}The database of sequence, wherein, n=1,2 ... I,
Wherein, for arbitrary n value, x _{n}In said sequence, be positioned at x _{N+1}And x _{N1}Between, and be associated with following value: 
The second input value y _{n} Conversion value p _{n}, according to transfer algorithm by y _{n}Calculate;
AndOutput valve z _{n}, wherein, z _{n}=z _{N1}+ p _{n} Said database further is configured to store a plurality of output valve z _{n}


2. computer system according to claim 1, wherein, x _{n}Be time value.

3. computer system according to claim 1 and 2, wherein, x _{n}Be digital value.

4. computer system according to claim 3, wherein, x _{N+1}x _{n}=x _{n}x _{N1}

5. computer system according to claim 4, wherein, x _{n}Be time value, and x _{n}x _{N1}Less than 0.5s, preferably less than 0.1s, more preferably less than 0.05s.

6. according to the described computer system of abovementioned arbitrary claim, wherein, i＞
 1000.

7. according to the described computer system of abovementioned arbitrary claim, wherein, the said second input value y _{n}For describing the variable of financial transaction.

8. according to the described computer system of abovementioned arbitrary claim, wherein,
p _{n}=y _{n}； 
p _{n}=y _{n}^{2}；
p _{n}=x _{n}Y _{n}Perhaps p _{n}Be y _{n}And the function of the distance between another second input value.


9. according to the described computer system of abovementioned arbitrary claim, wherein, for arbitrary n value, x _{n}With another input value y '"'"' _{n}Be associated, and p _{n}=y _{n}Y '"'"' _{n}

10. a computer implemented method is used for basis and the first input value x that extends to n=b from n=a _{n}The a part of corresponding second input value y of sequence _{n}Set come number of computations, and comprise from according to extracting at least one output valve z the described database of abovementioned arbitrary claim _{n}, wherein, n=b.

11. method according to claim 10 comprises and from said database, extracts another output valve z _{n}Another step, wherein, n=a.

12. according to claim 10 or 11 described methods, wherein, the quantity of said calculating is:

With the said first input value x _{n}The corresponding said second input value y of said part of sequence _{n}Summation;
With the said first input value x _{n}The corresponding said second input value y of said part of sequence _{n}Mean value;
With the said first input value x _{n}The corresponding said second input value y of said part of sequence _{n}Variance;
By with the said first input value x _{n}The corresponding said second input value y of said part of sequence _{n}The distance that contains;
PerhapsThe said second input value y _{n}With corresponding to the said first input value x _{n}The said first input value x of said part of sequence _{n}Correlativity.


13. according to claim 10 or 11 described methods, adopt database according to claim 9, wherein, the quantity of said calculating is:

The second input value y _{n}With corresponding to the said first input value x _{n}The another input value y '"'"' of said part of sequence _{n}The mean value of product;
PerhapsThe second input value y _{n}With corresponding to the said first input value x _{n}The said another input value y '"'"' of said part of sequence _{n}Correlativity.


14. according to each the described method in the claim 11 to 13, from said database, extract the step of added value when also being included in the step of extracting said another output valve, said added value is stored in and is used for subsequent calculations in the highspeed cache.

15. method according to claim 14, wherein, said another output valve and said added value provide output valve z together _{n}The subsequence of sequence.

16. a computer implemented method that is used for the preceding value of contingent variable storage time in time t editing data storehouse, comprise select with from the step of time t to the set of the value of the corresponding time dependence variable of sequence that returns the predetermined time interval of measuring.

17. method according to claim 16 comprises the step of selection corresponding to the value of the said time dependence variable of time t.

18. according to claim 16 or 17 described methods, wherein, the difference at interval of two maximum times in the sequence of said predetermined time interval poor greater than two minimum intervals in the said sequence.

19. method according to claim 18 wherein, comprises to the sequence of returning the said predetermined time interval of measuring from time t:

All less than two continuous time intervals of one minute, and Two other continuous time intervals in the said sequence, the difference in said two other time intervals was at least one minute.


20. according to claim 18 or 19 described methods, wherein, the difference of the continuous time interval in the sequence of said predetermined time interval is along with increasing to time increase of the amplitude in the time interval of measurement from time t.

21. a computer implemented method of classifying according to collection according to the predtermined category standard logarithmic may further comprise the steps:

Take an overall view of said data set confirming according to said predtermined category standard whether all values of said data centralization is unordered, and If all values of said data centralization is unordered, then said data set is classified according to said preassigned.


22. method according to claim 21, wherein, each value of said data centralization is the function of a plurality of measured data values.

23. method according to claim 22, wherein, each value of said data centralization is:

A) mean value of said a plurality of measured data values; B) summation of said a plurality of measured data values; C) maximal value of said a plurality of measured data values or minimum value;
OrD) standard deviation of said a plurality of measured data values.


24. a minimum value and/or a Computation of Maximal Waiting machine system that is used for the appointment subsequence of determined value sequence, said computer system comprises database, and said database is configured to:

(i) sequence of storing value; (ii) discern the minimum value and/or the maximal value of the sequence of said value;
And(iii) first subsequence of limit value and immediately following second subsequence of value after first subsequence of said value at least, Wherein, the border between said first subsequence and said second subsequence is positioned at the said minimum value or the said peaked position of said sequence.


25. computer system according to claim 24, wherein, the border between said first subsequence and said second subsequence is positioned at the position of the said minimum value of said sequence, and wherein, said database further is configured to:

(i) identification local minimum, said local minimum is corresponding to the minimum value of the value after said first subsequence; (ii) limit the 3rd subsequence immediately following the value after said second subsequence of value, wherein, the border between said second subsequence and said the 3rd subsequence is positioned at the position of said local minimum; (iii) discern another local minimum, said another local minimum is corresponding to the minimum value of the value after the n subsequence, wherein, and n=2; (iv) limit (n+2) subsequence immediately following the value after (n+1) subsequence of value, wherein, the border between said (n+1) subsequence and said (n+2) subsequence is positioned at the position of another local minimum;
And(v) to all round values n repeating steps (iii) with (iv) up to n=k, wherein, when n=k, do not have another local minimum to can be used for limiting the border between the adjacent subsequence.


26. computer system according to claim 24, wherein, the said border between said first subsequence and said second subsequence is positioned at the said peaked position of said sequence, and wherein, said database further is configured to:

(i) identification local maximum, said local maximum is corresponding to the maximal value of the value after said first subsequence; (ii) limit the 3rd subsequence immediately following the value after said second subsequence of value, wherein, the border between said second subsequence and said the 3rd subsequence is positioned at the position of said local maximum; (iii) discern another local maximum, said another local maximum is corresponding to the maximal value of the value after the n subsequence, wherein, and n=2; (iv) limit (n+2) subsequence immediately following the value after (n+1) subsequence of value, wherein, the border between said (n+1) subsequence and said (n+2) subsequence is positioned at the position of another local maximum;
And(v) to all round values n repeating steps (iii) with (iv) up to n=k, wherein, when n=k, do not have another local maximum to can be used for limiting the border between the adjacent subsequence.


27. according to each the described computer system in the claim 24 to 26;
 Wherein, Said database further is configured to provides mark to each value in said first subsequence of value, and said mark is corresponding to the said minimum value or the said peaked value of the said boundary between said first subsequence and said second subsequence.

28. according to the described computer system of the claim 27 that is subordinated to claim 25 or 26;
 Wherein, Each value that said database further is configured to in each subsequence of n=k provides mark, and said mark is corresponding to the local minimum of the boundary between n subsequence and (n+1) subsequence or the value of local maximum.

29. computer system according to claim 28, wherein, each value that said database further is configured to in (k+1) subsequence provides mark, and said mark is worth corresponding to each.

30. minimum value of the appointment subsequence of a determined value sequence and/or Computation of Maximal Waiting machine implementation method may further comprise the steps:

(i) provide according to each the described computer system in the claim 24 to 29; Confirm (ii) whether said appointment subsequence crosses over said first subsequence and said second subsequence;
AndIf (iii) said appointment subsequence crosses over said first subsequence and said second subsequence, then extract the value of the boundary between said first subsequence and said second subsequence.


31. method according to claim 30 is used the described computer system of claim 29,
Wherein, said appointment subsequence has starting point and end point, and the said end point of said appointment subsequence is corresponding to the end point of said value sequence, and The mark of the value of the position through reading the said starting point that is positioned at said appointment subsequence is confirmed said minimum value or maximal value of specifying subsequence.
Specification(s)