HDTenEightyP/NetNews huggingface dataset:
From: dseal@armltd.co.uk (David Seal)
Newsgroups: comp.compression
Subject: Re: LZ-JUNG patent
Date: 14 Oct 92 10:22:18 GMT
Distribution: comp
Organization: A.R.M. Ltd, Swaffham Bulbeck, Cambs, UK

In article <1992Oct12.135003.20553@crd.ge.com> davidsen@ariel.crd.GE.COM
(william E Davidsen) writes:

>In article <718481272@pike.cs.duke.edu>, srt@duke.cs.duke.edu (Stephen R. Tate) writes:
>
>| So you can't just browse Scientific American for patentable
>| ideas unless you wrote the article.  You still have to prove "no prior
>| art" in a patent, meaning that if someone else published before you
>| did (or your patent application), then you have no grounds for a patent.
>
>  Are you sure? As long as you reveal prior art, I don't see a
>restriction on applying for a patent. You might not be able to defend
>it, but it's so costly to challenge a patent that you might not have to
>if license fees were low. There are lots of bad patents, and more being
>issued every day.

Isn't there an originality requirement in the patent laws? I.e. if
*everything* you claim is covered by the prior art you reveal, including the
idea of putting the various parts of it together, you won't be granted a
patent because you're not actually claiming to have invented something.
People don't need to worry about the cost of challenging a non-existent
patent!

Of course, if you're clever enough about it, you may be able to pull the
wool over the patent examiner's eyes by making it appear that you have added
something to the prior art...

David Seal
dseal@armltd.co.uk

All opinions are mine only...
From: madler@cco.caltech.edu (Mark Adler)
Newsgroups: comp.compression
Subject: Re: Info-Zip's zip1.9 -k option
Date: 10 Oct 1992 00:49:35 GMT
Organization: California Institute of Technology, Pasadena
NNTP-Posting-Host: sandman.caltech.edu


>> My question is how different from a zip created file is the output
>> of zip1.9 sans -k?

There are places in the zip file format that you can put things like the
operating system that made the zip file and the version of zip that made
the zip file.  zip -k sets those to indicate MSDOS and 2.0, even if the
zip is running on VMS or Unix or an Amiga, or whatnot.  -k also makes
the names uppercase in the zip entries, and makes the names conform to
the MSDOS 8.3 name size.

Even without the -k, PKUNZIP can extract files made by Zip 1.9, so long
as the names aren't too long and don't have too many dots in them.
PKUNZIP is not really concerned about the names being in upper or lower
case, since MSDOS converts them on creation to upper case anyway.

Mark Adler
madler@cco.caltech.edu
Newsgroups: comp.compression
Subject: HELP!!! VAX COMPRESSION PROGRAM WANTED
From: $ennsnr@brandonu.ca (Neil Enns)
Date: 9 Oct 92 15:10:29 CST
Organization: Brandon University

Could someone please tell me an ftp address where I can find a compression
program for the vax?

Please send all replies to $ennsnr@brandonU.ca as I am not a regular reader of
this newsgroup.

Thanks in advance.

Neil Enns
$ennsnr@brandonU.ca

(My .sig is currently unavailable)
From: nevries@accucx.cc.ruu.nl (Nico E de Vries)
Newsgroups: comp.compression
Subject: Re: data compression
Date: 13 Oct 92 23:06:58 GMT
Distribution: comp.compression
Organization: Academic Computer Centre Utrecht

In <1992Oct13.004804.15828@nusdecs.uucp> rplatero@nusdecs.uucp (2439818-Rogelio Platero(12-31-92)) writes:

>I'm involved with the senior project at N.U.
>The compression routines that we have don't seem to do the 
>job. 

Just curious what they are. RLE? (Run length encoding).

>  I'm looking for any "C" source code or any algorithms
>that might work for text and .exe files.

For algorithms and sources look up the comp.compression FAQ. AR002
might be perfect for you, readable C source (at least more readable
than some others) and good text and .exe compression (near ARJ
ratio). Both ZIP and ARJ are derivates of AR002.

>               Roger J. Platero.

Nico E. de Vries  (nevries@cc.ruu.nl) |------------------*   AA   III  PPP
_ This text is supplied AS IS, no warranties of any kind |  A  A   I   P  P
| apply. No rights can be derived from this text. This   |  AAAA   I   PPP
| text is likely to contain spelling and grammar errors. |  A  A   I   P
*---------------------------( Donate to GreenPeace! )----*  A  A  III  P

"The IBM PC is still waiting for a version of the CP/M OS.", G.M. Vose, 1982.
From: rplatero@nusdecs.uucp (2439818-Rogelio Platero(12-31-92))
Newsgroups: comp.compression
Subject: data compression
Date: 13 Oct 92 00:48:04 GMT
Distribution: comp.compression
Organization: National University, San Diego

I'm involved with the senior project at N.U.
The compression routines that we have don't seem to do the 
job. 
  I'm looking for any "C" source code or any algorithms
that might work for text and .exe files.

             first time sender.
               Roger J. Platero.
From: jeremy@plx.com (Jeremy Shaw)
Newsgroups: comp.compression
Subject: Anyone know about CELL compression?
Keywords: CELL compression
Date: 14 Oct 92 19:47:10 GMT
Organization: PLEXUS Software, a division of REI

Sorry if this is a FAQ - the FAQ seems broken.

Does anyone know anything about CELL compression?  I read about it in
relation to image/video compression, but I can't find out anything about
it.

All information gratefully recieved.

Thanks,

jeremy.

jeremy@plx.com
Newsgroups: comp.compression
From: sl313028@silver.ucs.indiana.edu (O.K. I'm Jon)
Subject: Problem w/stacker(?)
Summary: read fault error 
Keywords: abort, retry, fail?
Organization: Indiana University
Distribution: comp.compression
Date: Wed, 7 Oct 1992 17:46:20 GMT

i am running  a 386-16 with a 105M quantum prodrive and have stacker
on it.  in one of my directories (sloopman, for sloopmanager for
windows) i get a "read fault error on drive C:"(which is my stacked
drive) "abort,retry...". how can i fix it? i tried ndisk doctor, and
it gave me the info that it couldn't read the file, but when it tried
to fix it, it couldn't (norton v4.something, though).  i'm panicked, and
don't know what to do!  could anyone give me a clue?

(maybe sloopman has a ScareWare Virus...i've not registered yet, and it's been
past 30 days (i think) (-: ) 

-Jon Madison
no .sig (i think)
sl313028@silver.ucs.indiana.edu
Newsgroups: comp.compression
From: benc@htsa.aha.nl (Ben Castricum)
Subject: Re: The hunt for latest versions of PKZip, Arj, Zoo.
Organization: Algemene Hogeschool Amsterdam, The Netherlands
Date: Thu, 15 Oct 1992 15:01:55 GMT

In article <AAFV9ogW54@lvvhq.adam.kiev.ua> lvv@lvvhq.adam.kiev.ua writes:
>>   > I have heard this before (and actually I agree). Yet noone ever cracked
>>   > $100.ARJ. Why???

Well i succeeded in created such a security envelope with v1.something 
with the current version this is a lot more difficult


>>
>>   Hey, what's $100.ARJ??? Is it an ARJ password breaking contest? Where
>>   is it available from?
>>
>>   More exactly, I am able to do the following:
>>   ...
>
>Moreover, I've rigistrator for ARJ 2.30 :-)
                ^^^^^^^^^^ 

oh sorry to hear that.. is that very painfull? :-)

-- 
/****************************************************************************/
/* benc@solist.htsa.aha.nl               Who cares anyway?                  */
/****************************************************************************/
From: jls11@po.CWRU.Edu (John L. Spetz)
Newsgroups: comp.compression
Subject: Info-Zip's zip1.9 -k option
Date: 9 Oct 1992 21:22:57 GMT
Organization: Case Western Reserve University, Cleveland, OH (USA)
Reply-To: jls11@po.CWRU.Edu (John L. Spetz)
NNTP-Posting-Host: thor.ins.cwru.edu


	I was under the impression that zip is compatible with pkzip 
(at least the available alpha/beta versions of 1.93).  The -k option
states in the built-in help screen that it causes zip to "simulate" a
pkzip made zipfile.  My question is how different from a zip created
file is the output of zip1.9 sans -k?  
	As a side question how compatible is the unofficial pkzip3.05 or
whatever?  Is this a hack of the 1.93 beta or what??
Newsgroups: comp.compression
From: jepler@nyx.cs.du.edu (Jeff)
Subject: Re: Why does PKZIP 2.X have hardware conflicts????
X-Disclaimer: Nyx is a public access Unix system run by the University
	of Denver for the Denver community.  The University has neither
	control over nor responsibility for the opinions of users.
Organization: Nyx, Public Access Unix at U. of Denver Math/CS dept.
Date: Thu, 8 Oct 92 00:13:31 GMT

In article <1992Oct7.040456.185822@ns1.cc.lehigh.edu> ry01@ns1.cc.lehigh.edu (ROBERT YUNG) writes:
>PKZIP 2.X is being delayed because of hardware problems. Why is this. Does 2.X
>use some really "bypass DOS and go right to the hardware" kind of magic to get
>good compression? I thought they just have to stick in a new algorithm or
>something.

The algorythm that is planned for the new PKZIP works fine, apparently.  The
big delay is blamed on a problem with their low-level code and fast processors.

The code for the DOS version has a lot of hardware-level optimizations to get
the maximum speed possible.  The problems they got from the Alpha version seem
to be because of an intermittent problem with processor caches and (DMA) disk
access (Which is apparently otherwise the most efficient way of doing it.)

Info-Zip's version of the new algorithm is supposed to be ready for release,
they're just politely waiting for PKZIP.

Question -- Is the Zip 1.9 (for unix, etc.) that I've seen mention of an 
implementation of the deflate algorithm of 1.93a or what?

>   I like ARJ but it's too slow. Is ARJ 3.X *much* faster at decompressing?
>Thanks!

I'd be interested to find out -- I'll be happy when the new compression
ideas finally get to *me*... Of course, with a 12-mhz machine speed is
also important.. :)
Newsgroups: comp.compression
From: benc@htsa.aha.nl (Ben Castricum)
Subject: Re: arj239.exe/arj
Organization: Algemene Hogeschool Amsterdam, The Netherlands
Date: Thu, 15 Oct 1992 14:50:10 GMT

In article <3096@accucx.cc.ruu.nl> nevries@accucx.cc.ruu.nl (Nico E de Vries) writes:
>In <1992Sep29.182906.14002@tamsun.tamu.edu> henrik@stat.tamu.edu (Henrik Schmiediche) writes:
>
>>...
>>I can confirm that arj239 is a official Beta test release of arj 2.4
>>sceduled to be released soon. The main purpose of this release is not
>>increased compression, but increased speed and ofcourse a few new
>>switches.... 
>
>Lets send Jung a present for his 1000th switch :-)
>
>>    - Henrik
>

I friend of mine told me arj v2.42 has been released in the states..
does anyone know if this is possible?

-- 
/****************************************************************************/
/* benc@solist.htsa.aha.nl               Who cares anyway?                  */
/****************************************************************************/
From: davidsen@ariel.crd.GE.COM (william E Davidsen)
Newsgroups: comp.compression
Subject: Re: pkzip 3.05
Date: 8 Oct 92 14:45:59 GMT
Reply-To: davidsen@crd.ge.com (bill davidsen)
Organization: GE Corporate R&D Center, Schenectady NY

In article <3106@accucx.cc.ruu.nl>, nevries@accucx.cc.ruu.nl (Nico E de Vries) writes:

| Switching away from PKZIP might be a good idea. PKZIP 1.10 is slow,
| compresses less than e.g. ARJ 2.30, it is unreliable (some files
| can not be compressed wihout damaging them) has less features
| (althought ARJ might have too much).

The free zip (not PKZIP) v1.9 has better compression than any PKZIP
versions, is compatible with 1.93beta, runs on dos/unix/vms/amiga/mac
and is available in source. Zoo 2.10 is also better in compression than
zip 1.10, has generations for keeping old versions, and is also free,
widely ported and available in source.

With those choices I would have no problem deciding that switching away
from pkzip was a great idea.
-- 
bill davidsen, GE Corp. R&D Center; Box 8; Schenectady NY 12345
    Keyboard controller has been disabled, press F1 to continue.
Newsgroups: comp.compression,comp.compression.research
From: kim@phaedrus.jts.com (T. Kim Nguyen )
Subject: CCITT G4 image compression problems
Reply-To: kim@watnow.uwaterloo.ca
Organization: JTS Computer Systems Ltd.
Distribution: comp
Date: Thu, 8 Oct 1992 17:50:40 GMT

We are in the process of testing a CCITT G4 compression and expansion
routine.  The program is relatively stable, however we have been able
to generate some images which do not seem to compress properly.  We
are comparing our results with those of a G4 compression executable
supplied by TMS.  We've been able to isolate how, where and when the
differences occur, but not why.

We used the CCITT G4 source code cited in the comp.compression FAQ
(from TIFF utilites v.3.1) as the basis for our own code.  

If anyone has the C source for a CCITT G4 compressor and expander and
is willing to share it, we would appreciate being able to examine it!


Thanks very much!

	Kim
-- 
T. Kim Nguyen                                       kim@jts.com
Systems Design Engineer                       k.nguyen@ieee.org
Document Imaging Systems                   uunet.ca!jts.com!kim
JTS Computer Systems Ltd., Toronto      kim@watnow.uwaterloo.ca
From: rlee@csugrad.cs.vt.edu (Rich Lee)
Newsgroups: comp.compression
Subject: Re: The new Swedish Archiver
Date: 16 Oct 92 19:28:43 GMT
Distribution: na
Organization: Virginia Tech Computer Science Dept, Blacksburg, VA


Arj is far better than zip.  I can't say about SQZ.  but when I can say
arj a -jm -va -r b:whatever
and it will make a arj file with max compression (-jm  way slow though but I'm
on a 486) it will prompt me for more disks....I can use high or low density
mixed(-va  volume auto)  and recurse subdir (-r).  What more could you want :)

oh well,  I'm hoping for ARJ for UNIX!!!!


-- 
 | What if life was |   Richard Lee               |                         |
 | an EtchaSketch   |   1711 Whipple Dr.          | rlee@csugrad.cs.vt.edu  |
 | and GOD decided  |   Apt 11                    |                         |
 | to start over    |   Blacksburg,Va 24060       | rlee@earth.tjhsst.edu   |
From: jt@fuw.edu.pl (Jerzy Tarasiuk)
Newsgroups: comp.compression
Subject: Re: On the fly compression
Date: 16 Oct 92 19:42:15 GMT
Followup-To: comp.compression
Organization: Warsaw University Physics Dept.

>>>>> On 13 Oct 92 19:49:51 GMT, nevries@accucx.cc.ruu.nl (Nico E de Vries) said:
Nico> Ronan Melennec writes:
>Hello,
>This is not exactly a research topic, but...
>I have data to send/receive over a communication channel.
>The data is highly redundant, but more in the style LZW
>algorithms are made to deal with (i.e. there are a lot of redundant
>strings).
>I'd like to have this data compressed/decompressed on the fly
>(precisely, I'd like to compress/decompress the contents of a memory
>area).
>Did anyone do the same ? Which algorithms were used ? Is there
>any source code available ?

Nico> It depends a bit on machine and memory what you should do. If you have
Nico> enough speed and memory (speed is likely in datacommunication since
Nico> most channels are reletively slow) LZHUF should be usable or even
Nico> LZARI. Look in the FAQ for sources of AR002 and INFO-Zip. If you
Nico> want maximum speed for LZHUF buy the NoGate or the PKWARE data compression
Nico> library.  
Nico> If LZHUF is too large or too complex you might considder the LZRW
Nico> family or the Finish turbocompressor in the Dr Dobbs compression
Nico> contest. They are both memory oriented. See the FAQ for more info.
>Ronan Melennec 

Can take any LZ compressor source and change only one procedure to
compress to memory, assuming have enough memory (need 128kB extra
if code size up to 16 bits is used) - simply store in array every
code produced by LZ algorithm. As I remember, I used it when wanted
to check if Huffman squeezing can improve compression after LZ.

A question: where can I find the compressors (LZHUF,LZARI) ?
(if the info isn't in FAQ-s) And where are the FAQ-s ?
Newsgroups: comp.compression
From: anil@clyde.tcs.com (Anil Ananthaswamy)
Subject: Info needed on Compression Labs, Picturetel
Organization: Teknekron Communications, Inc
Date: Fri, 16 Oct 1992 00:24:18 GMT

Hi folks,

I'm posting this for a friend. Please reply to him at

NRAO1@hbs.hbs.harvard.edu

--------------

Hi,
I am an MBA student at the Harvard Business School and am currently working
on a project to analyze the potential market for video conferencing.  I am
specifically interested in the marriage of videconferencing and computer
technologies.  I am especiallu keen on talking to engineers at Compression
Labs, Picturetel and any other companies in the field.  I would appreciate
any help in this regard.  Pl. send me your e-mail address or phone number
and I will get in touch with you.  Thanks.

Nagi Rao


----------------
From: ry01@ns1.cc.lehigh.edu (ROBERT YUNG)
Newsgroups: comp.compression
Subject: Why does PKZIP 2.X have hardware conflicts????
Date: 7 Oct 92 04:04:56 GMT
Organization: Lehigh University

PKZIP 2.X is being delayed because of hardware problems. Why is this. Does 2.X
use some really "bypass DOS and go right to the hardware" kind of magic to get
good compression? I thought they just have to stick in a new algorithm or
something.
   I like ARJ but it's too slow. Is ARJ 3.X *much* faster at decompressing?
Thanks!
-- 
       /~~~~~~~~~~~~~~~~~~~~~~~ILAN~~~~~~~~~~~~~~~~~~~~\
       \___(Robert) Bobby Yung_______RY01@Lehigh.Edu___/
Newsgroups: comp.compression
From: fh8n@uvacs.cs.Virginia.EDU (Frank Houston)
Subject: Zipchunker for unix
Originator: fh8n@jade.cs.Virginia.EDU
Organization: University of Virginia Computer Science Department
Distribution: usa
Date: Tue, 13 Oct 1992 00:42:05 GMT

Is there a program for unix that will spil humongous files to nice 
sizes. (1.44 Meg)

Thanks
-- 
											 Frank Houston 
    								     |   University of Virginia
VOICE   : (804)982-2294                  |   Thornton / Comp Sci
Internet: fh8n@opal.cs.virginia.edu      |   Charlottesville Va 22901
Newsgroups: comp.compression.research
From: esimon@wd.estec.nl (Erik Simonsen)
Subject: Re: dithering help wanted
Reply-To: esimon@wd.estec.esa.nl
Organization: ESA/ESTEC
Date: 15 Oct 92 15:31:00 GMT

In <1992Oct13.212424.10505@uoft02.utoledo.edu> kmurali2@uoft02.utoledo.edu writes:
Hi there,

I recommend the following article which presents, illustrates and compares
a series of direthering methods from the simple threshold array methods over
the classic Floyd-Steinberg method to the authors good performing blue noise
dithering method. Program examples aren't included, but the article gives a 
good starting point for an implementation. Further on it's good reading if
you're into dithering...

Robert A. Ulichney "Dithering with blue noise",
Proc. IEEE, vol. 76, no.1, jan 1988

Good luck,
Erik
----
--
Erik Simonsen, ESA/ESTEC WDP                __  __   _  European
Postbus 299, 2200 AG Noordwijk             /_  (_   /_| Space
Phone: +31 1719 3133 Fax: +31 1719 84295  /__  __) /  | Agency
E-mail: esimon@wd.estec.esa.nl           =======================
From: george@tut.fi (Campbell George)
Newsgroups: comp.compression.research
Subject: Re: dithering help wanted
Date: 14 Oct 1992 16:31:51 GMT
Organization: Technical University of Tampere, Dep. of Computer Science ,Finland 
Distribution: world
NNTP-Posting-Host: pikkutiira.cs.tut.fi


You might find:

W. F. Schreiber,
{\sl Fundamentals of Electronic Imageing Systems,}
Springer-Verlag,
1991.

useful.  Look under randomization of quantization noise.
A very significant reference is:

L. G. Roberts,
{\sl Picture Coding Using Pseudorandom Noise,}
IRE Trans.  IT-8 (2), 125-154,
1962.

dithering is often called "Roberts Pseudo-noise technique" because of this
paper.

good luck

george
From: bsmith@mickey.NoSubdomain.NoDomain (Brian Smith)
Newsgroups: comp.compression.research
Subject: Re: dithering help wanted
Date: 14 Oct 1992 20:18:17 GMT
Organization: University of California, Berkeley
Distribution: world
NNTP-Posting-Host: mickey.cs.berkeley.edu

In article <1992Oct13.212424.10505@uoft02.utoledo.edu>, kmurali2@uoft02.utoledo.edu writes:
|> 
|> Hi Netters,
|> 
|> Can anybody help me to implement Dithering in Image coding? Is there any
|> artilcles or papers that I could find. I checked at our university for 
|> any papers or articles, but I could not find any. 
|> 
|> Thanks.
|> murali. k

Check out "Digital Halftoning" by Robert Ulicheny, copyright 1987 MIT Press.
It discusses primarily black and white techniques, but they are easily
extended to color images.

-------
Brian C. Smith				arpa:  bsmith@cs.Berkeley.EDU
University of California, Berkeley	uucp: uunet!ucbvax!postgres!bsmith
Computer Sciences Department		phone: (510)642-9585
From: kmurali2@uoft02.utoledo.edu
Newsgroups: comp.compression.research
Subject: dithering help wanted
Date: 13 Oct 92 21:24:24 EST
Organization: University of Toledo, Computer Services


Hi Netters,

Can anybody help me to implement Dithering in Image coding? Is there any
artilcles or papers that I could find. I checked at our university for 
any papers or articles, but I could not find any. 

Thanks.
murali. k
Newsgroups: comp.compression
From: gmribeir@david.wheaton.edu (Glauber)
Subject: Re: The new Swedish Archiver
Keywords: SQZ Compression archive Squeeze
Organization: Bush-bashers Unlimited
Distribution: na
Date: Wed, 14 Oct 1992 20:08:00 GMT

Assorted comments:

SQZ can be MUCH slower than ARJ, but only if you ask it to
(i.e.: ask for "infinite" compression). Usually it's just a
bit slower.

SQZ does compress significantly more than ARJ (i'd say 5%
more or so).

SQZ's sfx module is paranoid. If you don't tell it
explicitly where to put the extracted files, it dumps them
on the root directory or the current drive (Huh?).

ARJ IS as fast as PKZIP for comparable degree of
compression (/m3). The thing is, ARJ has so many switches,
most people probably don't know this one.

If i had to vote for a standard, i'd always vote for
something that is on public-domain (like ZIP and LZH) over
ARJ. I am an unconditional ARJ fan, but the new ZIP does
just as good, and is PD. Do you realize that if something
that is copyrighted becomes the standard, the company that
sells it has a very large degree of control over us all? Let
PD programs be the standard, and copyrighted programs be
used for specialized applications, IMHO.


						Glauber
-- 
Glauber Ribeiro - Wheaton College, IL  (USA)
                  glauber@david.wheaton.edu 
                  glauber@vpnet.chi.il.us
Newsgroups: comp.compression
From: sigma@picasso.ipl.rpi.edu (Kevin Martin)
Subject: Re: The new Swedish Archiver
Keywords: SQZ Squeeze Archive Compression Swedish
Distribution: na
Date: Wed, 14 Oct 1992 01:27:28 GMT

I have to ask... in the comparisons being posted, is anyone specifying the
maximum compression options for ZIP and ARJ?  Particularly ARJ.  I use
these religiously; if I'm compressing something I won't be using for a
while, I'm willing to take the speed penalty, and people are already saying
that SQZ is slow.  So why not run a slower ARJ?

-- 
Kevin Martin
sigma@ipl.rpi.edu
"We're gonna need another Timmy!"