HDTenEightyP/NetNews huggingface dataset:
From: bing@zinc.cchem.berkeley.edu (Bing Ho)
Newsgroups: comp.compression
Subject: PKZIP 2.04e BUG?
Date: 28 Jan 1993 04:05:21 GMT
Organization: UC Berkeley
Distribution: world
NNTP-Posting-Host: zinc.cchem.berkeley.edu

I have had this small problem with pkzip and I wanted to know if I
was just doing something wrong.

I zipped up an archive with Info-Zip's zip program which consisted of
files with combinations of lower and uppercase characters and when I
downloaded it and tried to decompress with pkzip 2.04e, it said it
couldn't handle files with both lower and uppercase characters in its name.

Anybody else get this problem?

Anybody else notice a speed hit with this version?
 
Otherwise, all bugs I was experiencing before seem gone!

This is what pkware should have released in the first place...

 
-- 
Bing Ho
bing@zinc.cchem.berkeley.edu   University of California, Berkeley   
Newsgroups: comp.compression
From: tope@enea.se (Tommy Petersson)
Subject: Re: problems unzipping
Organization: Enea Data AB
X-Newsreader: Tin 1.1 PL3
Date: Tue, 26 Jan 1993 12:44:06 GMT

am49469@uxa.cso.uiuc.edu (Alexander Mesin) writes:
: I was running into problems lately trying to unzip files.  I have tried running
:  PKUNZIP V1.01 and V1.93, and both give me the same error message.  They
:  say they can't find the file and to use PKZipFix.  Is something wrong
:  with the file or my disk or what?  Also is there a place I can get 
:  PKZipFix via an FTP site?

I got the same problem with an archive that probably was done with a newer
zip program. After running PKZipFix, PKUNZIP found the files in the archive
but said it didn't know what to do with them.

I used the new Info-zip version (5.0p1?) and it worked without a hitch.

-- 
=============================================================================
 Tommy Petersson              tope@enea.se              Enea Data AB, Sweden
=============================================================================
From: fuzzy@netcom.com (Fuzzy Fox)
Newsgroups: comp.compression
Subject: Re: Diet v1.44
Date: 22 Jan 93 06:15:10 GMT
Organization: Foxes 'R' Us - Seven locations to serve you

CHEGC@LURE.LATROBE.EDU.AU (CROSS,Graeme) writes:

>Disadvantages:
>2. As mentioned by the previous poster, DIET can be slow with some overlaid
>programs.

This is probably because of all the file open/close requests that the
overlay manager performs.  It's possible that using DIET's -K option
will fix this, as it causes DIET to keep the temporary uncompressed
versions of files around, in case they are opened again.  The files are
only deleted when the program exits back to DOS.

-- 
#ifdef TRUE         | Fuzzy Fox                  fuzzy@netcom.com
#define  TRUE   0   | a.k.a. David DeSimone      an207@cleveland.freenet.edu
#define  FALSE  1   |
#endif              | "911 Emergency Rescue Service - Can you hold, please?"
Newsgroups: comp.compression
From: law40003@nusunix1.nus.sg (TAN YEW KEONG)
Subject: Legal Advice
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 25 Jan 1993 09:54:48 GMT



I am a final year law student planning to specialise in law regarding
all aspects of computing. I am computer literate and will be able to
understand most computer jargon except highly technical subjects like
Huffman coding etc.

If you have any legal problems or queries, post to me, and I will
endeavour to give free advice as far as possible.

It will be good practice for me, and free legal advice for you.

Disclaimer :

I will not be liable for any prosecution, both civil and criminal,
arising in any way connected to my giving the advice, whether it may be
your reliance on my advice, or my advice leading to criminal behaviour.
No one should interpret my advice as conclusive, and my advice is given
in the same manner as suggestions, and I do not profess any expert
knowledge on the advice I give. I disclaim responsibility for any losses
you incur by relying on my advice, and if any advice I give is illegal,
let it be known that I have no knowledge of collaboration with any
criminal.

I wonder if this disclaimer works, but it sure sounds legal. But I mean
all this mumbo jumbo, and if my drafting skills leave much to be
desired, read it in spirit, not in form.
--

_________________________________________________________________________
Michael Tan Yew Keong | law40003@nusunix1.nus.sg | law40003@nusvm.nus.sg|
Final Year Law student - OH GOD, IT'S BEEN A HELLUVA LONG TIME!!!       |
________________________________________________________________________|
--

_________________________________________________________________________
Michael Tan Yew Keong | law40003@nusunix1.nus.sg | law40003@nusvm.nus.sg|
Final Year Law student - OH GOD, IT'S BEEN A HELLUVA LONG TIME!!!       |
________________________________________________________________________|
From: hsusoong@trsvax.tandy.com
Date: 27 Jan 93 10:09 CST
Newsgroups: comp.compression
Subject: Re: Help: CCITT test sequence for H.261
Message-ID: <-908899998@trsvax>
Nf-ID: #R:kum.kaist.ac.kr:4300:trsvax:-908899998:000:74
Nf-From: trsvax.tandy.com!hsusoong    Jan 27 10:09:00 1993


I need the same help too. Thanks.

Hsu 
(email) hsusoong@trsvax.tandy.com

Newsgroups: comp.compression
From: jmd@tyrolia.Princeton.EDU (John M. Danskin)
Subject: Re: request for compression algorithm for small text buffers
Originator: news@nimaster
Reply-To: jmd@tyrolia.Princeton.EDU (John M. Danskin)
Organization: Dept. of Computer Science, Princeton University
Date: Wed, 20 Jan 1993 14:36:05 GMT

In article <23244@venera.isi.edu>, sondeen@isi.edu (Jeff Sondeen) writes:
|> I'm looking for a compression routine that I can use for small text
|> buffers accessed separately within huge text files.  For example, a
|> dictionary whose word entries are hashed (ala gdbm) to their
|> definition text -- but I want the definition text strings to be
|> compressed with minimal (space) overhead.  Would the separate "table"
|> overheads of LZ type compressions be a disadvantage compared to a
|> huffman/arithmetic compression based on a fixed table?  Thanks for any
|> tips.
|> 
|> /jeff

It seems to me that you could improve on the effect of a fixed huffman table by
generating a standard LZW table from a small sample subset of your dictionary
definitions. When you want to encode a new definition, always start from this
sample table. Sizing the sample table is an interesting trade off between
initial code size and code power. In practice, once you had a system
running, it would be easy to try sample tables resulting in several different
code sizes, and just use the best one.


John Danskin			|
(609) 258-5386			| Gradual student
(609) 258-1771 fax              | Graphics systems
jmd@cs.princeton.edu		| (efficient low bandwidth graphics?)
From: brandt@oclc.org (Dave S. Brandt)
Newsgroups: comp.compression
Subject: ??Where.. pkz204
Date: 26 Jan 93 20:23:30 GMT
Organization: OCLC Online Computer Library Center, Inc.
X-Newsreader: Tin 1.1 PL3

I am looking for an ftp site for pkz204. I would greatly appreciate an e-mail. Thanks in advance.
Newsgroups: comp.compression
From: law40003@nusunix1.nus.sg (TAN YEW KEONG)
Subject: Legal Advice
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 25 Jan 1993 09:54:17 GMT


I am a final year law student planning to specialise in law regarding
all aspects of computing. I am computer literate and will be able to
understand most computer jargon except highly technical subjects like
Huffman coding etc.

If you have any legal problems or queries, post to me, and I will
endeavour to give free advice as far as possible.

It will be good practice for me, and free legal advice for you.

Disclaimer :

I will not be liable for any prosecution, both civil and criminal,
arising in any way connected to my giving the advice, whether it may be
your reliance on my advice, or my advice leading to criminal behaviour.
No one should interpret my advice as conclusive, and my advice is given
in the same manner as suggestions, and I do not profess any expert
knowledge on the advice I give. I disclaim responsibility for any losses
you incur by relying on my advice, and if any advice I give is illegal,
let it be known that I have no knowledge of collaboration with any
criminal.

I wonder if this disclaimer works, but it sure sounds legal. But I mean
all this mumbo jumbo, and if my drafting skills leave much to be
desired, read it in spirit, not in form.
--

_________________________________________________________________________
Michael Tan Yew Keong | law40003@nusunix1.nus.sg | law40003@nusvm.nus.sg|
Final Year Law student - OH GOD, IT'S BEEN A HELLUVA LONG TIME!!!       |
________________________________________________________________________|
Newsgroups: comp.compression
From: cmcgldrk@unix2.tcd.ie (Wowbagger - the infinitely Prolonged)
Subject: Re: Help: CCITT test sequence for H.261
Organization: Trinity College, Dublin
Date: Mon, 25 Jan 1993 13:31:27 GMT

In <1993Jan21.064452.4300@kum.kaist.ac.kr> hansoo@kum (Kim HanSoo (Daewoo Elec.)) writes:

>I lost the CCITT test sequence for H.261. Thus I want to know the place of those sequence which get by FTP. Wanted specifications of sequence is following:

>  a. Sequence Name : TREVOR, MISS AMERICA, CLAIR, ALIXIS,
>                     SWING, SALES MEN, ...
>  b. Sequence Spec : CIF (Common Intermediate Format)
>                     30 frame/sec or 25 frame/sec
>                     352 pixels/line x 288 lines/frame
>                     color component : Y, R-Y, B-Y

>  If the sequence is encoded by any-algorithms (ex: GIF, ppm, etc), I want to also get the decoding software.

>  Mail address : hansoo@kum.kaist.ac.kr (hansoo@128.134.1.1)
Can you send me the site too.
Thanks.

Ciaran  Mc  Goldrick.          cmcgldrk@vax1.tcd.ie

Newsgroups: comp.compression
From: hm@opus40.ix.de (Harald Milz)
Subject: Which compressors under Unix?
Organization: iX-Redaktion
Date: Wed, 27 Jan 1993 20:24:44 GMT


I apologize if it's a FAQ... I'm new in this group.

I found some of PC-world's compressors for Unix (LHA, GZIP).
Are there already any other compressors ported to Unix? Where
can I get them?

Pointers to FAQ are also appreciated. 

THX.


-- 
Harald Milz (hm@ix.de)
iX Multiuser Multitasking Magazine
Helstorfer Str. 7, D-3000 Hannover 61
phone +49 511/547 47 66, fax +49 511/547 47 33
Newsgroups: comp.compression
From: monty@iesd.auc.dk (Torben Thellefsen Nielsen)
Subject: Re: JPEG book release date?
Organization: Mathematics and Computer Science, Aalborg University
Distribution: comp
Date: 25 Jan 93 15:21:23

Hi again all!
  Thanks to all who responded! It does seem that my bookstore is to
blame, as some people received the book several weeks ago...

Torben
--
*******************************************************************************
Torben Thellefsen Nielsen                             E-mail: monty@iesd.auc.dk

Oh, what sad times are these when passing ruffians can say 'NI' at will to old
ladies. There is a pestilence upon this land, nothing is sacred.
							Roger The Shrubber
*******************************************************************************
From: std_u22c@uni-duesseldorf.de (verehrte(r) Benutzer(in))
Newsgroups: comp.compression
Subject: RE:PKZIP - Download
Date: Fri, 22 Jan 1993 10:16:26 GMT
Organization: Universitaetsrechenzentrum, Heinrich-Heine-Universitaet Duesseldorf
NNTP-Posting-Host: 134.99.8.54

Try 134.95.80.1 !!!
From: tgl+@cs.cmu.edu (Tom Lane)
Newsgroups: comp.compression
Subject: Re: JPEG compression
Summary: it ain't that simple
Keywords: JPEG, compression
Date: 25 Jan 93 17:13:09 GMT
Article-I.D.: cs.C1F6I4.675.2
Organization: School of Computer Science, Carnegie Mellon

peterb@cs.uwa.oz.au (Peter Bousfield) asks:
> It is my understanding that JPEG compression works in basically two parts.
> Step 1: DCT (Discrete Cosine Transform)
> and
> Step 2: Huffman Coding ...
> 
> I was wanting to know which of these two steps contributes more to the
> compression.  That is, how good is the compression without Huffman coding
> (eg is it 50% worse or only 10% worse.)

Well, it's not really that simple.  The DCT is done to make the data more
compressible, not to achieve any compression itself.  (In fact, the raw
volume of data that comes out of the DCT stage is more than what goes into
it: 11 bits/pixel instead of 8.)  So in one sense the Huffman stage
achieves *all* the compression.  But obviously that statement doesn't
capture what's going on.

This is analogous to the distinction between modeling and coding.  (I believe
the comp.compression FAQ talks about this; or see Mark Nelson's book, or any
other recent textbook on data compression.)  You express the data in a form
that exposes redundancy, then you use a coding technique to remove the
redundancy.

I think of JPEG as containing three types of steps:

1. Transformation of the data into a more suitable form.
   This covers two stages: colorspace change and DCT.
   The data volume is not reduced here, and in fact these steps are 100%
   reversible except for roundoff error.

2. Data reduction.
   This likewise covers two stages: downsampling and DCT coefficient
   quantization.
   In these steps we deliberately throw away data, being careful to throw
   away that data which is least visible to the human eye (which the
   preceding steps have separated out for us).  These steps are
   parameterized so that we can trade off file size against image quality,
   by adjusting how much data is thrown away.

3. Entropy coding.
   This is either Huffman or arithmetic coding, depending on the depth of
   your wallet :-).
   In this step we efficiently encode the remaining data.  This step is
   lossless (the entropy decoder will exactly reconstruct what was given
   to the entropy encoder).  We rely on the prior steps to have presented us
   with data in a highly redundant form --- for example, there are typically
   a LOT of zeroes.

I think the initial question might really have meant "can I use a different
entropy encoder?".  Sure, any lossless compression technique will work for
step 3.  (In my group's initial experiments with JPEG, we ran the output of
step 2 through good old Unix compress, and got reasonable compression.)
But the particular variants of Huffman and arithmetic coding specified by
the standard are tuned to the characteristics of the data stream that
normally emerges from the prior stages.  You won't get as good compression
if you use a general-purpose compression method.

			tom lane
			organizer, Independent JPEG Group
Newsgroups: comp.compression
From: ts@uwasa.fi (Timo Salmi)
Subject: Re: problems unzipping
Organization: University of Vaasa, Finland
Date: Mon, 25 Jan 1993 18:40:20 GMT

In article <C1F0wC.3A7@news.cso.uiuc.edu> am49469@uxa.cso.uiuc.edu (Alexander Mesin ) writes:
>I was running into problems lately trying to unzip files.  I have tried running
> PKUNZIP V1.01 and V1.93, and both give me the same error message.  They
> say they can't find the file and to use PKZipFix.  Is something wrong
> with the file or my disk or what?  Also is there a place I can get 
> PKZipFix via an FTP site?

Before doing anything else, I suggest taking a look at the
comp.archives.msdos.announce FAQ that I post each Saturday.  It is
still there since the expiry is eight days.  In most cases of
similar problems the answer can be found in there even if naturally
I can't give absolute guarantees.

   All the best, Timo

..................................................................
Prof. Timo Salmi      Co-moderator of comp.archives.msdos.announce
Moderating at garbo.uwasa.fi anonymous FTP archives 128.214.87.1
Faculty of Accounting & Industrial Management; University of Vaasa
Internet: ts@uwasa.fi Bitnet: salmi@finfun   ; SF-65101, Finland

Newsgroups: comp.compression
From: markus@clement.info.umoncton.ca (PAULIN MARC)
Subject: Re: PKZIP 2.04E now available...
Organization: Universite de Moncton
Date: Wed, 27 Jan 1993 21:03:59 GMT

In article <1993Jan27.151443.13922@nuscc.nus.sg> law40003@nusunix1.nus.sg (TAN YEW KEONG) writes:
>From: law40003@nusunix1.nus.sg (TAN YEW KEONG)
>Subject: Re: PKZIP 2.04E now available...
>Date: Wed, 27 Jan 1993 15:14:43 GMT

>Robert Michael Trotter (caeser@csd4.csd.uwm.edu) wrote:
>:       Just got off the PKWARE BBS, the new PKZIP 2.04E is now available
>:       for download. though some would find that interesting here.
>: 
>:       Caeser
>: -- 

>If you want it by ftp it is available in garbo.uwasa.fi in the pc/arcers
>directory, filename pkzip204e.exe

	There's a PKZIP204C.EXE on wuarchive.  What is it?
                                         ____
              _  _  _                  / \   \ 
            /' )' )' )                |   |   |           
              /  /  /                 | (_|__/         \   
             /     /  __. .__    ___  |   |  __.  . .   \  .   ___ 
            /     (__(_/|__) )__/(__   \_/__(_/|__)\_)__/\__)__) <_ 
                    Markus on QuartzPARADISE and AfterFive
                            (506)855-4974 - Canada
+---------------------------------------------+-----------------------------+
|            markus@info.umoncton.ca          | "My son, ask for thyself    |
| For Talk:  markus@clement.info.umoncton.ca  |  another kingdom.  For that |
|---------------------------------------------+  which I leave is too small |
| When all else fails,  read the instructions |  for thee" - King Philippe  |
+---------------------------------------------+-----------------------------+

Newsgroups: comp.compression
From: greg@inmos.co.uk (Greg Nunan)
Newsgroups: comp.compression,comp.compression.research
Subject: Re: Help: CCITT test sequence for H.261
Date: 26 Jan 93 15:41:26 GMT
Organization: INMOS
X-Newsreader: TIN [version 1.1 PL7]

In article <<1993Jan21.064452.4300@kum.kaist.ac.kr>> Kim HanSoo (Daewoo Elec.) (hansoo@kum) wrote:
: I lost the CCITT test sequence for H.261. Thus I want to know the place of those sequence which get by FTP. Wanted specifications of sequence is following:
: 
:   a. Sequence Name : TREVOR, MISS AMERICA, CLAIR, ALIXIS,
:                      SWING, SALES MEN, ...
:   b. Sequence Spec : CIF (Common Intermediate Format)
:                      30 frame/sec or 25 frame/sec
:                      352 pixels/line x 288 lines/frame
:                      color component : Y, R-Y, B-Y
: 
:   If the sequence is encoded by any-algorithms (ex: GIF, ppm, etc), I want to also get the decoding software.
: 
:   Mail address : hansoo@kum.kaist.ac.kr (hansoo@128.134.1.1)
: 
:   Bye.

I too have been looking for these sequences. Any information will be
gratefully received.

Thanks,

Greg.
--
Greg Nunan,  INMOS Ltd         |  Tel +44 454 616616 x664
1000 Aztec West,  Almondsbury  |  UK: greg@inmos.co.uk
Bristol BS12 4SQ,  UK          |  US: greg@inmos.com
From: xyzzy@imagen.com (David McIntyre)
Newsgroups: comp.compression
Subject: setting options for zip19/VMS
Date: 22 Jan 93 22:24:42 GMT
Organization: IMAGEN

I picked up zip19 for VMS off of ftp.uu.net, and I can't find anything in
the documentation that tells how to give it the command line options it
needs.  I found the option string for unzip50, but not zip19.  Can someone
please email me the correct definition name for VMS zip?
-- 
xyzzy@     | Opinions expressed  | I'm not half as think | More fun than I
imagen.com | are entirely my own | as confused you am.   | I should be having
Newsgroups: comp.compression
From: eng10205@nusunix1.nus.sg (LING SIEW WEE)
Subject: Re: PKZIP 2.04E now available...
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Wed, 27 Jan 1993 11:08:09 GMT

Robert Michael Trotter (caeser@csd4.csd.uwm.edu) wrote:
: 	Just got off the PKWARE BBS, the new PKZIP 2.04E is now available
: 	for download. though some would find that interesting here.
: 
: 	Caeser
: -- 
: Minnesota Vikings	11-5	NFC Central Division Champions 1992-93!
: 
: Salisbury back in the pocket,DRAW to Allen,Allen bursts up the middle,TOUCHDOWN!
Do you know where I can get that via ftp?

Wilfred Ling

--
***********************************************************************
*Name	    : Wilfred Ling Siew Wee   | National University of S'pore *
*Internet   : eng10205@nusunix.nus.sg | Electrical Engineering        *
*Bitnet	    : eng10205@nusvm.bitnet   |                               *
*********************************************************************** 
Newsgroups: comp.compression
From: bontchev@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Is there a "zipcat" program?
Reply-To: bontchev@fbihh.informatik.uni-hamburg.de
Organization: Virus Test Center, University of Hamburg
Date: 25 Jan 93 15:50:57 GMT

There are several "zipsplit" utilities - programs that can take a
large ZIP archive and split it into several smaller, but still
unZIPable archives. However, does anybody know whether a program for
the reverse operation exists? That is, a program that can take several
ZIP archives and merge them into a single large ZIP archive?

Regards,
Vesselin
-- 
Vesselin Vladimirov Bontchev          Virus Test Center, University of Hamburg
Tel.:+49-40-54715-224, Fax: +49-40-54715-226      Fachbereich Informatik - AGN
< PGP 2.1 public key available on request. > Vogt-Koelln-Strasse 30, rm. 107 C
e-mail: bontchev@fbihh.informatik.uni-hamburg.de    D-2000 Hamburg 54, Germany
From: std_u22c@uni-duesseldorf.de (verehrte(r) Benutzer(in))
Newsgroups: comp.compression
Subject: LHA
Date: Thu, 21 Jan 1993 15:05:48 GMT
Organization: Universitaetsrechenzentrum, Heinrich-Heine-Universitaet Duesseldorf
Distribution: Steliosoft
NNTP-Posting-Host: 134.99.8.55
Summary: Uni-Dsseldorf
Keywords: LHA

Does anybody know the construction of .LZH - Files ??????
Xref: sparky comp.compression:4837 comp.misc:5023
From: wally@Auspex.COM (Wally Bass)
Newsgroups: comp.compression,comp.misc
Subject: Re: hard disk stacker?
Date: 28 Jan 93 18:14:09 GMT
Followup-To: comp.compression
Organization: Auspex Systems, Santa Clara

In article <C1IzEB.2MJ@inews.Intel.COM> jtan@cad071.NoSubdomain.NoDomain
   (Jeffrey Tan) writes (concerning the compression achieved by Stacker):
>  The average compression rate on most files is 1.7-1.8 times, not including
>already compressed files, such as .zip and .gif.  No further compression could
>be done to those files.

Although DIR listing don't show it, it might be worth keeping in mind that,
with a Stacker drive, it is really Stacker that allocates physical disk space,
rather than DOS. Typically, the DOS allocation unit is 2K (4 sectors), whereas
the Stacker allocation unit is 1 sector. Therefore, particularly for small
files, there can be a significant savings due to the 'allocation roundoff'
phenomena, even when no savings occur as a result of actual data compression.

Wally Bass


Newsgroups: comp.compression
From: peterb@cs.uwa.oz.au (Peter Bousfield)
Subject: JPEG compression
Summary: Where is most of the compression achieved?
Keywords: JPEG, compression
Organization: Dept. Computer Science, University of Western Australia.
Date: Mon, 25 Jan 1993 01:56:00 GMT

Hello fellow compressors,

It is my understanding that JPEG compression
works in basically two parts.
Step 1: DCT (Discrete Cosine Transform)
and
Step 2: Huffman Coding (for those of us
			who don't wish to
			pay for a license.)

I was wanting to know which of these
two steps contributes more to the compression.
That is, how good is the compression without
Huffman coding (eg is it 50% worse or only 10%
worse.)

Thankyou

peterb
----------------------------------------------------------------------
  Peter Bousfield           ,-_|\     E-mail: peterb@cs.uwa.edu.au
  285 Robinson Ave         /     \    
  Cloverdale, WA 6105   -->*_.-._/    Honestly, it was not me!!!
  Australia                     v
----------------------------------------------------------------------