HDTenEightyP/NetNews huggingface dataset:
From: gage@obelix.gaul.csd.uwo.ca (Darren Gage)
Subject: HELP: Problem with old zipped files
Reply-To: gage@obelix.gaul.csd.uwo.ca (Darren Gage)
Organization: The Univesity of Western Ontario, London, Ontario, Canada
Date: Sun, 20 Dec 1992 22:37:14 GMT
Keywords: zip


	I have had a most interesting thing occur to me. Many
moons ago, I compressed much of my personal work with ZIP 1.0
on a unix machine. I was leaving that educational facility,
and wished to retain my data files. I am  recently unable to
unzip them. They have sat in a box of 1.44 floppies for
a year, so nothing has happened to them since I compressed.
them. I, at the time would have tested whether I was able to
unzip them so they should have been fine. I likely also
unzipped them on my PC at home, and possibly rezipped them.

	As I re-enter the educational world, I thought about
getting out my old material. I am shocked that I am as of yet
unable to!. I've tried up-loading onto a unix, and unzipping
with my old utilities, but this has failed. I've tried unzipping
with every version of pkzip/unzip I could dig up, but still no
success. Is it possible that I used some hacked version, that is
not compatible with others? I thought about problems if the
transfer was not in binary mode (when I down-loaded) but there
too many high order bits set in the zipped files to allow for
that. One other possibility, is that a virus altered the zip
program such that it added bits of data into the zip file.

	Regardless, I am given this message with * unzip 5.0:
*         (this program was used as it offered the most information
		as to why it was unable to unzip)

warning:  extra 766 bytes at beginning or within zipfile
	(attempting to process anyway)

error:  start of central directory not found; zipfile corrupt.
    (please check that you have transferred or created the zipfile in the
    appropriate BINARY mode and that you have compiled unzip properly)

	I have viewed the zipped files with a hex editor, and
it appears that the data is in fact there, but extra bits
appear here and there. For instance, when ever the "version
made by" bytes, and the "version needed to uncompress" bytes
are output into the stream, a '0D' is placed before them. I
have attempted to remove them, but this is not enough. The rest
of the signature parts are fine, except for possibly the file
sizes, and other data addressing values. They may be correct,
but I cannot tell without knowing if the data is correct.
BTW: the "version made by" bytes indicate that the files were
made with zip 1.0 on a *nix [0A 03].

	I am hopping that someone may know the reason this has
happened, and even better, can suggest a method to retrieve my
files.

				Thanx in advance,


				          Darren.

			      gage@obelix.gaul.csd.uwo.ca


no sig. [Sorry, I don't smoke   ;^) ]
Newsgroups: comp.compression
From: fox@rei.com (Fuzzy Fox)
Subject: Floppy-sized Zipping (was: when Zip is a LOT better ...)
Date: Fri, 11 Dec 1992 18:55:30 GMT
Organization: Recognition Equipment, Inc.

les@chinet.chi.il.us (Leslie Mikesell) writes:

>I've done it with zoo and a horribly ugly shell script added one file
>at a time making a backup copy before each addition so it could back
>off and copy the biggest version that would still fit on a floppy, but
>there's gotta be a better way.

There is.  For ZIP, there is a program called "ZIP Chunker" for MS-DOS
which will take a large ZIP file and break it into floppy-sized chunks,
where each chunk is still a full and complete ZIP file.

Note that it does not create the ZIP on the fly (as ARJ does), so it
requires enough temporary space to hold the entire ZIP file, but it does
work, and quite well.

I heard that there was supposed to be an upgraded version of this
program which would apply the concept to any archive (ZIP, ZOO, ARJ,
etc.), but I have not been able to locate any such program.

-- 
#ifdef TRUE        | Fuzzy Fox (a.k.a. David DeSimone)       fuzzy@netcom.com
#define  TRUE   0  |
#define  FALSE  1  |  "You have been recruited by the Star League to defend
#endif             |     the Frontier against Xur and the Kodan Armada."
From: s2942275@techst02.technion.ac.il (Yaniv Golan)
Newsgroups: comp.compression
Subject: compression sources in Cobol ?
Date: 20 Dec 92 19:53:34 GMT
Reply-To: s2942275@techst02.technion.ac.il (Yaniv Golan)
Organization: Technion

Yeah yeah I know it sounds funny. But does any one happen to have sources
for any kind of compression program in Cobol?

Thanks,

Yaniv Golan

-- 
E-Mail : s2942275@techst02.technion.ac.il
From: staubach@messua.informatik.rwth-aachen.de (Holger Staubach)
Newsgroups: comp.compression
Subject: Question to hpack078
Date: 15 Dec 92 13:53:16 GMT
Organization: Rechnerbetrieb Informatik - RWTH Aachen
NNTP-Posting-Host: messua.informatik.rwth-aachen.de
Keywords: hpack


Hallo,

recently I got the Version 0.78 of hpack. I tried to use it under DOS and OS/2.
The "normal" packing works very well, but using encryption makes trouble.

if I pack some files with
    hpack a -u -c test
and unpack it with
    hpack x test 
the unpack files are corruptet.
I tried this with the unix version too.

can anybody help me?
Thanks in advance

Holger

Email:  staubach@pool.informatik.rwth-aachen.de
From: madler@cco.caltech.edu (Mark Adler)
Newsgroups: comp.compression
Subject: Re: Motion Compensation?
Date: 18 Dec 1992 18:48:40 GMT
Organization: California Institute of Technology, Pasadena
NNTP-Posting-Host: sandman.caltech.edu


>> If we find an efficient method of coding the resulting flow field, then
>> we would almost certainly achieve much better compression than is
>> possible with the protocols of the MPGE's fixed block structure.

Big If.  Even with 16x16 blocks, the motion vectors take up a large
proportion of the bits.

mark
From: haddadi@sipi.usc.edu (Navid Haddadi)
Newsgroups: comp.compression
Subject: Re: Motion Compensation?
Date: 15 Dec 1992 04:55:11 -0800
Organization: USC, Los Angeles, CA
NNTP-Posting-Host: sipi.usc.edu

In article <1992Dec14.161316.38402@ns1.cc.lehigh.edu> cre1@ns1.cc.lehigh.edu (CHRISTOPHER R. EMERSON) writes:
>Can anyone tell me (is this in a FAQ?) in plain english, what motion
>compensation is, how it is done and what it does for you?  I've heard it
>mentioned in many papers, but I guess everyone assumes that you know what they
>are talking about.  Any help would be appreciated.  Thanks.
>
>Chris
>
I don't know if it is in the FAQ or not, but here is a simple explanation.

Say you have a sequence of images E1,E2,E3,... of an object in motion
in front of a stationary background. You want to transmit or store
these images and want to compress them. One way is to compress each
image individually. Of course, the idea behind compression is to use
the correlation in data to generate a non-correlated sequence (i.e.
energy compaction). It turns out that, there is a lot of temporal correlation
(as compared to spatial correlation). However, classical predictive
coding method perform very poorly when applied along a temporal line.
This is because when an object moves it creates sharp discont along
temporal lines. However, if the motion of the object can be represented by
a 2-D vector field (motion field) then each frame can be compensated.
That is, by using the motion field, we perform interpolation in each frame
E2,E3,... to make them look similar to E1 (and hence similar to
one another). Now predictive coding can be applied along temporal lines
since we have eleminated the discont.'s. The same approach can be
used for motion compensated noise reduction where after the compensation
all frames are averaged in order to reduce noise without bluring the image.
There are many, many applications for motion field like navigation, 
segmentation, shape from motion,....

Now the trick is that how do you compute the motion field from
the sequence E1,E2,...? This is the topic of active research here
in USC as well as many other places. One simple way is to sustitude
optical flow field for the motion field. This gives satisfactory
result for motion compensation, but not so good a result for 3-D
applications. There are well known algorithms for computation
of optical flow (e.g. Horn and Schunck, Heeger, etc.). There are
two basic problems known as the aprature problem and oversmoothing
of the flow field. Some newer methods such as (Haddadi and Kuo)
offer very good results for motions as large as 10 pixels per frame
for moderate size images (256x256 to 512x512).

I'll give more explanation of the computation if there is a general
interest in this topic.

Navid
haddadi@sipi.usc.edu
From: steve_krause@qm.sri.com (Steve Krause)
Newsgroups: comp.compression
Subject: What Happened to MIT's Subband HDTV Scheme?
Date: 20 Dec 92 02:44:14 GMT
Followup-To: comp.compression
Organization: SRI International

I've got a copy of the original MIT HDTV proposal to the FCC (dated
February 1991), which clearly lays out the intraframe coding as subband
coding. However, in the latest IEEE Micro ("Digital Video Coding Techniques
for U.S. High-Definition TV"), it has the now renamed MIT/GI system using a
DCT. The reference to the system is from an April 1992 document, so I
assume that somewhere between 2/91 and 4/92, MIT decided that the earlier
system with subband coding wasn't going to work out. Is this what happened?
Does anyone know why? Finally, is the current compression method in the
MIT/GI Channel Compatible DigiCipher MIT's or GI's?

Thanks in advance to anyone who can help clear up the confusion

Steve Krause
(steve_krause@qm.sri.com)
Newsgroups: comp.compression
From: fox@rei.com (Fuzzy Fox)
Subject: Re: pkunzip or unzip 1.93
Date: Tue, 15 Dec 1992 17:04:10 GMT
Organization: Recognition Equipment, Inc.

kbw@po.CWRU.Edu (Kevin B. Williams) writes:

>I've found a zipper pkz19p1x.zip  that is compatable with a file I have in
>1.93 format, but I can't find the unzipper for this format.  Can someone
>please point me in the right direction?

Get UNZIP50.ZIP, at your favorite archive site.

-- 
#ifdef TRUE        | Fuzzy Fox (a.k.a. David DeSimone)       fuzzy@netcom.com
#define  TRUE   0  |
#define  FALSE  1  |  "You have been recruited by the Star League to defend
#endif             |     the Frontier against Xur and the Kodan Armada."
Newsgroups: comp.compression
From: leo@zelator.in-berlin.de (Stefan Hartmann)
Subject: Re: MPEG audio compression
Organization: Puplic-Access-Xenix-System
Date: Sat, 19 Dec 92 13:00:42 GMT
Keywords: mpeg audio compression

In <1992Dec17.144554.20729@nsc.nsc.com> celita@nsc.nsc.com (Eli Lopez) writes:

>Hi,

>I am looking for an MPEG audio compression/decompression C program.
>Would greatly appreciate any pointers. Alternatively, I would like to get
>access to an MPEG compressed file preferebaly along with the original samples.
>Thanks in advance.


>Regards.

>____________________________________________________________________________
>        David Almagor, National Semiconductor (IC) Ltd., P.O. Box 3007,
>                        Herzliya B 46104, Israel.
>Tel: 011-972-52-594255  FAX: 011-972-52-558322 E-MAIL: cdaata@taux01.nsc.com
>____________________________________________________________________________


Hi,

I would like also to get software utilities in this direction, who do
lossy audio compression on WAV (16 bits stereo or less) or VOC or any
other PCM soundfiles...

This software utilities could be a non-realtime implementation !

So it would be possible to compact the WAV-audio that comes with the
new MPEG movies to a smaller format, so that the audio doesn't take so
much disk space. Then it could be converted back with a nonrealtime
decompressor to WAV again and can then be played together with the
MPEG video file.
This would help to store a MPEG video and audio clip in a very small
file size...

Best regards, Stefan Hartmann,c/o Gatz & Hartmann
email to: leo@zelator.in-berlin.de


-- 
 
*************************************************************
*  Stefan Hartmann, c/o Gatz & Hartmann                     *
*  Ingenieurbuero fuer Multimedia-Anwendungen               *
*  Fehrbelliner Str. 32                                     *
*  W-1000 Berlin 20, Germany                                *
*  This is how to contact us:                               *
*  EMAIL: leo@zelator.in-berlin.de                          *
Newsgroups: comp.compression
From: bhh@isis.cs.wayne.edu (Bhaskar Holur)
Subject: Re: Motion Compensation?
Organization: Wayne State University
Date: Fri, 18 Dec 1992 00:37:48 GMT

In article <1gkkjfINN7c6@sipi.usc.edu> haddadi@sipi.usc.edu (Navid Haddadi) writes:
>In article <1992Dec14.161316.38402@ns1.cc.lehigh.edu> cre1@ns1.cc.lehigh.edu (CHRISTOPHER R. EMERSON) writes:
>>Can anyone tell me (is this in a FAQ?) in plain english, what motion
>>compensation is, how it is done and what it does for you?  I've heard it
>>mentioned in many papers, but I guess everyone assumes that you know what they
>>are talking about.  Any help would be appreciated.  Thanks.
>>
>>Chris
>>
>Now the trick is that how do you compute the motion field from
>the sequence E1,E2,...? This is the topic of active research here
>in USC as well as many other places. One simple way is to sustitude
>optical flow field for the motion field. This gives satisfactory
>result for motion compensation, but not so good a result for 3-D
>applications. There are well known algorithms for computation
>of optical flow (e.g. Horn and Schunck, Heeger, etc.). There are
>two basic problems known as the aprature problem and oversmoothing
>of the flow field. Some newer methods such as (Haddadi and Kuo)
>offer very good results for motions as large as 10 pixels per frame
>for moderate size images (256x256 to 512x512).
>
>I'll give more explanation of the computation if there is a general
>interest in this topic.
>
>Navid
>haddadi@sipi.usc.edu

Well, you did not mention the method of motion compensation used
in MPEG Video Compression Standard. Although the MPEG does not specify
any particular method for it, the main idea is block-based
motion compensation.  The method is to search for  a best matching
block in the reference frame within a predetermined search area (depending
on the speed and type of motion in the frames) around the point
corresponding to the target block in the current frame. The cost function
or the matching function can be any one of : Mean Absolute Difference,
MSE, or a correlation function, etc. There are fast search procedures
to idendify the match in the search area, like the 3-step procedure.

Note: for block based motion compensation, the frame is divided into
non-overlapping square blocks of size 16x16 or application specific
size.

--Bascar
bhh@cs.wayne.edu



Newsgroups: comp.compression
From: cuffell@spot.Colorado.EDU (CUFFELL TIMOTHY MICH)
Subject: Re: Floppy-sized Zipping (was: when Zip is a LOT better ...)
Organization: University of Colorado, Boulder
Date: Sat, 12 Dec 1992 03:34:58 GMT

In article <1992Dec11.185530.11564@rei.com> fox@rei.com (Fuzzy Fox) writes:
>les@chinet.chi.il.us (Leslie Mikesell) writes:
>
>>I've done it with zoo and a horribly ugly shell script added one file
>>at a time making a backup copy before each addition so it could back
>>off and copy the biggest version that would still fit on a floppy, but
>>there's gotta be a better way.
>
>There is.  For ZIP, there is a program called "ZIP Chunker" for MS-DOS
>which will take a large ZIP file and break it into floppy-sized chunks,
>where each chunk is still a full and complete ZIP file.
>
>Note that it does not create the ZIP on the fly (as ARJ does), so it
>requires enough temporary space to hold the entire ZIP file, but it does
>work, and quite well.
>
Furthermore, it cannot divide individual compressed files in the archive.
This means that with file slight smaller than the media size, space is 
wasted, and with compressed files bigger than the media, it doesn't work
at all.

>I heard that there was supposed to be an upgraded version of this
>program which would apply the concept to any archive (ZIP, ZOO, ARJ,
>etc.), but I have not been able to locate any such program.
>
>-- 
>#ifdef TRUE        | Fuzzy Fox (a.k.a. David DeSimone)       fuzzy@netcom.com
>#define  TRUE   0  |
>#define  FALSE  1  |  "You have been recruited by the Star League to defend
>#endif             |     the Frontier against Xur and the Kodan Armada."


-- 
-Tim Cuffel	Finger for PGP 2.1 

CIA, FBI, terrorism, assassination, cryptography, RSA, cocaine, DEA, Swiss bank
account.
Newsgroups: comp.compression
From: hliu@wiliki.eng.hawaii.edu (Hui Liu)
Subject: Figures in H261 Documents
Organization: University of Engineering, College of Engineering
Date: Sat, 12 Dec 1992 08:31:03 GMT

Hi, netters, I got the h261.doc (and h261.rtf) from src.doc.ic.ac.uk.
The problem is that when I use Winword 2.0 to print it, the winword can
not open the figures. So I can only get the text parts.  Can anyone tell
me how to print these figure? Thanks in advance.

-Hui Liu
 Electrical Engineering Department
 University of Hawaii at Manoa
 hliu@wiliki.eng.hawaii.edu

Newsgroups: comp.compression
From: celita@nsc.nsc.com (Eli Lopez)
Subject: MPEG audio compression
Keywords: mpeg audio compression
Reply-To: cdaata@taux01.nsc.com (David Almagor)
Organization: National Semiconductor, Santa Clara
Date: Thu, 17 Dec 1992 14:45:54 GMT

Hi,

I am looking for an MPEG audio compression/decompression C program.
Would greatly appreciate any pointers. Alternatively, I would like to get
access to an MPEG compressed file preferebaly along with the original samples.
Thanks in advance.


Regards.

____________________________________________________________________________
        David Almagor, National Semiconductor (IC) Ltd., P.O. Box 3007,
                        Herzliya B 46104, Israel.
Tel: 011-972-52-594255  FAX: 011-972-52-558322 E-MAIL: cdaata@taux01.nsc.com
____________________________________________________________________________
From: defee@cs.tut.fi (Irek Defee)
Newsgroups: comp.compression
Subject: Re: Motion Compensation?
Date: 18 Dec 1992 11:32:49 GMT
Organization: Tampere University of Technology
Distribution: world
NNTP-Posting-Host: peltopyy.cs.tut.fi

In article <1gs9pcINNl4l@sipi.usc.edu> haddadi@sipi.usc.edu (Navid Haddadi) writes:
>True. However, the concept of block matching (not the computation)
>is so tivial that there is not much to be said about it 
>(although, some variations such as Anandon's work is by no means trivial).
Can you give a reference to this work?

>If we find an 
>efficient method of coding the resulting flow field, then we would almost 
>certainly achieve much better compression than is possible with the protocols
>of the MPGE's fixed block structure. We need a protocol in which different
>block sizes can be used in the same frame. 

Such things seem to be used partially in a recent proposal for an HDTV
system called HD-DIVINE, from Sweden. Although there are no detailed
descriptions, they use 4x2 (v x h) blocks and  motion compenastion
for resulting motion fields. HD-DIVINE is described in the Proc. of
the Workshop HDTV'92, Kawasaki, Japan, Nov. 18-20, 1992.

Irek Defee
Signal rocessing Lab.,
Tampere University of Technology,
Tampere, Finland, Europe.

Newsgroups: comp.compression,comp.lang.pascal
From: amead@s.psych.uiuc.edu (Alan Mead)
Subject: Re: LZW or Run-length compression source code
Organization: UIUC Department of Psychology
Date: Mon, 14 Dec 1992 16:56:26 GMT

amead@s.psych.uiuc.edu (Alan Mead) writes:

><TAMGC@CUNYVM.BITNET> writes:

I just recieveed email that is, I think, misdirected, so I will post
the main point here.  Thanks to llggll@mixcom.mixcom.com.  Mail follows.

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

><TAMGC@CUNYVM.BITNET> writes:

There are at least two such programs available at wuarchive.wustl.edu in
the systems/msdos/simtel20/turbopas directory:

shrink12.zip    - use LZW shrinking algorithm (compatible with ZIP)
dezip20.zip     - uncompresses files made with shrink

These two files contain all source code, and while they are not nearly
as fast as PkZIP or ARJ, they still are fairly quick and efficient. 

Best Regards,

Mike (llggll@mixcom.mixcom.com)
From: fadden@uts.amdahl.com (Andy McFadden)
Newsgroups: comp.compression
Subject: Re: How do AV Codes Work? (PKZIP)
Date: 14 Dec 92 22:36:33 GMT
Organization: Amdahl Corporation, Sunnyvale CA

In article <1992Dec12.042955.18961@leland.Stanford.EDU> kocherp@leland.Stanford.EDU (Paul Carl Kocher) writes:
>                                                                    I don't
>really know what PKWARE *ought* to do for the next release, since political
>considerations make RSA unusable.  Possibly some public-key system that has
>been broken could be used successfully, since very little plaintext (and 
>essentially no chosen plaintext) would be available to crackers?

First check to see what the RSA patent covers.  I don't remember exactly,
but it may cover ALL public key schemes (which wouldn't be surprising given
how patents are granted).

>-- Paul Kocher

-- 
fadden@uts.amdahl.com (Andy McFadden)
[ Above opinions are mine, Amdahl has nothing to do with them, etc, etc. ]
From: thompson@kuhub.cc.ukans.edu
Newsgroups: comp.compression
Subject: Where to find algorithms?
Date: 16 Dec 92 18:12:09 CST
Organization: University of Kansas Academic Computing Services

Hello all,

I am writing a recipe database system in Turbo Pascal for Windows 
(I'm waiting for the OS/2 version).  I was thinking of using compression
for storing the recipes (I have several thousand).  I few ideas 
occured in my head on how to do the compression, but alas, I
am no compression expert.  Where should I go to find compression 
algorithms?  Do people post algorithms to this conference?  Should
I look in the library?  Also, I plan on making this recipe database
shareware, so I guess I need permission to use algorithms...?

By the way, this would be text only...I bet an algorithm can be tailored
to work with text to improve performance...

-- 
| Charles A. Thompson      | thompson@ukanvm.cc.ukans.edu        |
| University of Kansas     | thompson@ukanvax.cc.ukans.edu       |
| > They call me SkiBum <  | 32 bit OS/2 2.0 is for you!         |
|----------------------------------------------------------------|
| Listen to Rush Limbaugh from 12-3 EST on the radio EVERYWHERE! |
------------------------------------------------------------------
Xref: sparky comp.compression:4164 comp.os.msdos.misc:6563
From: nevries@accucx.cc.ruu.nl (Nico E de Vries)
Newsgroups: comp.compression,comp.os.msdos.misc
Subject: Re: *.sea uncompression on MS-DOS
Date: 15 Dec 92 17:33:41 GMT
Followup-To: comp.compression
Organization: Academic Computer Centre Utrecht

In <1gjt8jINNo09@usenet.INS.CWRU.Edu> axa12@po.CWRU.Edu (Ashok Aiyar) writes:


>A program that I would like to try is compressed in some format
>that ends in *.sea

This file might just be in the ARC format since ARC is made by SEA.

>It may have been compressed on a Mac.  Any ideas on how I can uncompress
>it on my PC?

If it is ARC try ARC-E, PKXARC, PAK etc.

>Ashok


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

To get (many) ==> LOSSLESS DATA COMPRESSION SOURCES <== get lds_10.zip at 
garbo.uwasa.fi /pc/programming. Make files for Borland C are included. 
Newsgroups: comp.compression.research