Re: Random Ideas

On Nov 23, 10:34 am, "George Johnson" <matri...@xxxxxxxxxxx> wrote:
"Nimo" <azeez...@xxxxxxxxx> wrote in message

news:577de546-f63c-44f9-ba0b-b269a9b4cc3c@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

leave that topics,
come to the point, here

if the out put is like this
4 8 10 16 20 24 28 30 36 40
do u have any contractions for that?

I'll tell you how to change any data into a dummy signal later on,

knowing Fourier concepts in 24 Hrs is really hard,
and I tried my best, here are more than 100 applets very informative.

I'm trying to get the data in some meaningful way
so that we can estimate it.

Thanks
every now and then I hear this phrase
'An image is worth than 1000 words'
then y can't a signal for our data?

That particular pattern is basic IQ test stuff.
04 08 10 16 20 24 28 30 36 40

Difference between data points is
4   2   6  4  4   4   2   6   4

If this were a "Guess the next numbers" the odds would be 44, 48, 50, 56,
60...

Trying to use this pattern on such a small data set would require a
listing like this.
[Start number] (4) (with the number of binary bits indicating the bit-length
of the data set numbers)
000100
[Escape character]
[Total number of numbers in the series] = 1010    (10)
[Escape character]
[Pattern number quantity] (5 numbers)
101
[Escape character]
100    (4)
[Escape character]
010    (2)
[Escape character]
110    (6)
[Escape character]
100    (4)
[Escape character]
100    (4) - End of 5 number series
[Escape character]

In short, this particular routine would cost more bits to accurately
represent this set.  Skip this and try Hauffman.  If the set were larger,
then the expense might be worth a savings payoff for a super-low entropy
data set.

The logical conclusion is that indexing this tiny series has no payoff
aside from shaving a few bits.
Using a data mask would also give some profit, but you have to list what
the mask is, which bits are disposable and if there are any exceptions in
the series.  The number 40 requires 6 bits to represent so the entire series
has to have a length of 6 bits.  Since all of the numbers increase in value,
you can ignore positive + negative number signing for now.

04 -- 000100
08 -- 001000
10 -- 001010
16 -- 010000
20 -- 010100
24 -- 011000
28 -- 011100
30 -- 011110
36 -- 100100
40 -- 101000

The last bit on the right is entirely disposable since all of the
numbers are even.
Not much of a savings gain (10 bits) to justify indexing in this manner.
It doesn't fit a simple pattern-matching compression, but a Hauffman
routine would probably compress this pretty easy.

no, no,

don't go with that path.

here comes Joseph Fourier to rescue us.

Thanks
.

Relevant Pages

• Yan: debian-user-digest Digest V2012 #620
...   ... but that purged elinks-lite and install konqueror which I definitely do not want to use, 'cos I'm happy with firefox.Does clicking on a link now load a web browser? ... +the correct conditions for ssh to catch the escape character. ... I can be wrong but the bug seems aimed to correct the package which ...
(Debian-User)
• Re: Difference between randomness and automated selection
... be in either the pattern or design sense. ... The information storage mechanism of DNA ...     * DNA Language ...     * What makes a language? ...
(talk.origins)
• Re: Recent Ignored Research Findings In Climate Science - An Illustration Of A Broken Scientific
... heating of regions of the atmosphere, is 60 times greater than due to ... on this NH.Ts.txt data set are all above the 1951-1980 ...   -- 799 of them are at or above the norm. ... USA Today/Gallup poll - LIMBAUGH is the REPUBLICAN LEADER! ...
(uk.sci.weather)
• Re: Random Ideas
... That particular pattern is basic IQ test stuff. ... of the data set numbers) ... It doesn't fit a simple pattern-matching compression, ...
(comp.compression)
• Re: Interface Delegation or ??
... it seems that you're trying to use a Design ... Pattern called the "Strategy Pattern". ...     public void dosomething; ...
(comp.lang.java.programmer)