stakar said:
Hi !
i m back with questions!! Because of the demo limits i cant test all the things that u posted so ...
Algorithms
---------------------------
ok with the Bounds
---------------------------
Occurence
please explain me the max100% and how do u calculate this because i dont get it.
You give 100% to the max value. whats the calculation to find out the next values ?
---------------------------
Delays
give me an example
the min delay info = 1 . So, give me the results that have a delay more then 1% ?
---------------------------
Difference
The difference starts from the begining to the end or opposite?
eg.
1->50
2->80
3->20
=50-80=-30, 80-20=60 etc? or theres another way?
---------------------------
Options
The choices % from start and % from end ,offset from other point.
Can u give me some examples that i can understand the functions?
It will be very usefull if u explain the above using one or two senarios step by step.
You have made a complex system that isnt so easy to understand !
Thanks lottoarchitect
Stathis
Well, I'll descibe the idea of algorithms in the general sense. An algorithm takes an input (series of data) and tries to evaluate what values to accept/reject for the next value to come. It uses any information derived from the series. Among the information that can be extracted is the dominant value, mix/max detected, average etc.
For example consider a sequence of sums: 10 20 30 20 40 30 50 10 55 46 etc
This sequence can come from any analysis. The algorithms do not know if this sequence is sums, common numbers or any other source. All it knows is the order (sequence) of the results and possibly a classic probability of every value to occur (this is applicable to rejection filters). So, an algorithm has all this information available, along the possible range of values (e.g. if the series comes from sums in 6/49 game, the possible range is 21-279 etc).
So, the 1st obvious thing to do is to count the occurences of each value in the series. So, a table holds information like value 10: 5 times, value 11: 0 times etc.
From this table, we can extract all the above information like min/max detected. Also, we can find the dominant value(s) which are those that appeared most. So, if on the above serie the dominant value was 30 : 10 times, then if we assign to this the Max 100%, all other values can be displayed as a % related to the 100%. So, the value 10 : 5 times has 5/10*100%=50% relative appearance compared to the dominant value. This is useful to quickly identify values and their relative appearance compared to other values, so you instantly know which values appear more frequently. Anywhere the Max 100% appears, is based on the above. So, for the Occurence algorithm, the above is exactly what max 100% does. So, when you set to the Max 100% e.g. reject 0-10%, then the algorithm will reject any values that have their max 100% occurence within the above range. I think it is clear now how this works.
On the other algorithms, the analysis takes place on the new derived internal table as described in the previous post. A delay table is generated where the valuea now are the delay and its occurence and any Max 100%, exact values, sum 100% information is derived from that table. Similar is the difference table with using information from the "jump" of values.
the min delay info = 1 . So, give me the results that have a delay more then 1%
I suppose here you mean to remove any values that have a delay that occured less than 1% (incl.) of all delays (sum 100%). Max 100% is not available to delays algorithm.
Go to "Delays" algorithm, set "Sum 100%", min=0%, max=1%, to ensure a better operation of the algorihm set min. data to e.g. 10 (reduce it for filters that return a very large range of possible values like sums), swithc to options panel, select all data to be used and the action to "reject". Save this step and you have created the above algorithm.
Now, whenever you pick this algorithm, the analysis will create an internal delay table, and remove any values that have occured less than 1% of all detected delays. So, if we have information of 100 delays and the algorithm finds that the delay value 2 has occured 0 or 1 times (0%-1%), then it will reject the value that has a current delay of 2. The possible delay range is from 1(value occured in previous draw) to infinity. The possible occurencies of delays are from 0 (never found such a delay) to infinity.
Difference
The difference starts from the begining to the end or opposite?
eg.
1->50
2->80
3->20
=50-80=-30, 80-20=60 etc? or theres another way?
It is the opposite as I described in the previous post. So the jumps are 80-50=30, 20-80=-60 etc
Options
The choices % from start and % from end ,offset from other point.
Can u give me some examples that i can understand the functions?
It will be very usefull if u explain the above using one or two senarios step by step.
You have made a complex system that isnt so easy to understand !
The options panel defines the range of the serie to take into account for the analysis. So, if the data sequence to analyse is
1 2 3 4 5 6 7 8 9 10=10 data in total
you can set the algorithm to extract information from all the above data (the checkbox), or set the starting point/end point and put on offset. Thus, if you set the end point to 2 from end, the last data to be used will be the 8th position (10 data in total-2). If you set an offset from end point to to be 3, then as the end point is the 8th position in your series, the starting point will be 8-3=5th position. Thus the algorithm will use the data 5 6 7 8 for the analysis. This allows to design a complex algorithm that operates on different areas of the available data.
For example, you might want to remove all values that occured less than 5% in all data [sum 100%] (use all serie data) but to accept those values (that might have been rejected by previous step) that have occured enough lately (so you need to restrict the algorithm to use information only from the last range of your serie of data. The above can form a complex algorithm.
cheers
lottoarchitect
