Slashdot Mirror

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

Calgary/Canterbury corpus will be blown away by what they see here. I can easily do 100x on them without even breaking a sweat!

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

I use a variety of means that first actually increase the file at a variety of stages, but make it into an easily reduced format.

I skew the ratio's statistically early, giving me a larger chance of occurrence elsewhere. I use a variety of change outs to make the most likely ratio to occur items into then the best to compress types of data. I also utilize a revolutionary new means to track actual data flow, reducing the size in one region by 25%. In all I can achieve a standardized compression rate of approximately 84% on random binary data, with no loss, and repeatable.

All the information is on this website http://www.security1.free2host.net/Compress/compre ssstart.php and will prove without a doubt in the math section the actual capabilities of this code for those who can follow higher end computer based mathematics.

I even go so far as to say that I can compress the entire worlds knowledge to a DVD at worst, and a floppy at best, and I can prove it on this website.

This is my personal White Paper on lossless compression. Note this is no joke thread like that newb who posted he can get his to 1 bit. I affect random binary data. It achieves approximately, per cycle, a 81% remaining size of the origional file. I theorize the end limit to the size is in a range of 10 bytes to 10 kb. It will be different for every file type. Note this is an EXCEL filed that has been RARed. It was to big to upload normally. It is MEMORY intensive. I would prefer not to do it in excel except I lack the proper software to replace that crappy program. Here is the link to my website: http://www.security1.free2host.net/Compress.php

It wasn't the crime of the century, but taking place barely two weeks ahead of the fifth anniversary of the Columbine massacre, the hoaxes unnerved some residents of the Detroit suburb, which boasts a population in the high four digits. "I don't put anything past these kids now days, I really don't," says Keck.