BROLOID Joke
pele...@geocub.greco-prog.fr
Great news !
We, at the ENSERB, have designed the most powerful image compress utility
in the whole world, using the BROL method : if we take a 1024x1024, 16
million colors, picture of a mandrill, and give it to our program "brol",
we get a resulting picture of *** 1 BYTE ***.
And if we use "unbrol" to unpack this resulting file, we get back the
original 1024x1024, 16 million colors, picture of the mandrill, with *** NO
LOSS OF QUALITY ***.
Unfortunately, if we brol the picture of a teapot and unbrol the resulting
file, we still get the 1024x1024, 16 million colors, picture of a mandrill.
Nevertheless, this small bug will not stop us from improving our method,
and we have great hope to shrink the size of the brolled file to 0 byte...
Needless to say, we will keep you informed of the next discoveries of our
researchers in the field of the brol theory...
Yours broloidely,
f.p.
------------------------------------------------------------------------------
! Zeu<FP> : The craziest programmer in France ! _________ !
!---------------------------------------------! / | \ \ !
! Francois Pellegrini is : ! / |__ ___/ \ !
! pele...@goofi.greco-prog.fr ! \ | | / !
! uunet!mcsun!inria!geocub!goofi!pelegrin ! \ | | / !
! pele...@goofi.UUCP ! !
------------------------------------------------------------------------------
hh@trillian
!hh
In article <15...@geocub.greco-prog.fr> Pele...@Goofi.UUCP (Uncle Ben's) writes:
> We, at the ENSERB, have designed the most powerful image compress utility
>in the whole world, using the BROL method : if we take a 1024x1024, 16
>million colors, picture of a mandrill, and give it to our program "brol",
>we get a resulting picture of *** 1 BYTE ***.
>And if we use "unbrol" to unpack this resulting file, we get back the
>original 1024x1024, 16 million colors, picture of the mandrill, with *** NO
>LOSS OF QUALITY ***.
> Unfortunately, if we brol the picture of a teapot and unbrol the resulting
>file, we still get the 1024x1024, 16 million colors, picture of a mandrill.
I've heard of such programs before. Most of them are about 3 Mega-Bytes
long, aren't they?
Snail mail: | E mail: h...@trillian.informatik.uni-dortmund.de
Hasko Heinecke +-------------------------------------------------
Ostenbergstr. 97 | Computers are different from telephones!
D-4600 Dortmund 50 | Computers do not ring! -Tanenbaum
pele...@geocub.greco-prog.fr
>In article <15...@geocub.greco-prog.fr> Pele...@Goofi.UUCP (Uncle Ben's) writes:
>> We, at the ENSERB, have designed the most powerful image compress utility
>>in the whole world, using the BROL method : if we take a 1024x1024, 16
>>million colors, picture of a mandrill, and give it to our program "brol",
>>we get a resulting picture of *** 1 BYTE ***.
>>And if we use "unbrol" to unpack this resulting file, we get back the
>>original 1024x1024, 16 million colors, picture of the mandrill, with *** NO
>>LOSS OF QUALITY ***.
>> Unfortunately, if we brol the picture of a teapot and unbrol the resulting
>>file, we still get the 1024x1024, 16 million colors, picture of a mandrill.
>
>I've heard of such programs before. Most of them are about 3 Mega-Bytes
>long, aren't they?
They used to. Now, with our new improved BROL method, the unbrolling code is
about 6 megabytes long, and we can unbrol both teapots and mandrills, with a
brolled picture size of ****1 BIT**** !!!
Still at the edge of progress,
The BROL theory research group.
Frans Meulenbroeks
BROL program which is rather small (a few dozen lines) which compresses
any image (including mandrills and teapots), into a 1 byte file.
Decompression yields the original picture.
I think my compression scheme is by all means the most advanced ones in
the world. It runs circles around things like Huffman coding and
Lempel-Ziv.
I might consider sharing the source with you provided that you can
proof to me that your system meets the requirements of my program.
Almost all unix system which supports a file name length and sh argument
size of 3 MB or more will meet the requirements.
I suppose that this qualifies for an ACM Turing Award.
Research continues for a compression algorithm which will allow
compaction into 0 byte files, thus yielding infinite compression.
Frans Meulenbroeks (meul...@cst.prl.philips.nl)
Centre for Software Technology
( or try: ...!mcvax!phigate!prle!cst!meulenbr)
pele...@geocub.greco-prog.fr
>Inspired by "The BROL theory research group" I've invented an advanced
>BROL program which is rather small (a few dozen lines) which compresses
>any image (including mandrills and teapots), into a 1 byte file.
>Almost all unix system which supports a file name length and sh argument
>size of 3 MB or more will meet the requirements.
Congratulations Frans ! The BROL research team manager, impressed by
your new discovery, is planning to hire you soon...
We will surely meet at ACM Siggraph.
By the way, I *DO* hope you have file completion...
f.p.