HDTenEightyP/NetNews huggingface dataset:
From: mp2@irz406.inf.tu-dresden.de. (Matthias Paschke,SG 91/08/11,,)
Newsgroups: comp.compression
Subject: Re: ARJ "Security Envelopes" Broken
Date: 25 Jan 1993 15:22:23 GMT
Organization: Sun Microsystems
Distribution: world
Reply-To: mp2@irz406.inf.tu-dresden.de.
NNTP-Posting-Host: irz406.inf.tu-dresden.de

Hello!

I am new to this group. I own an Archimedes A3000 (made by acorn). I have a question:
Is there any possibility of converting ARJ on my computertype?

---
------------------------+---------------------------------------------.
| Matthias Paschke       | TCP/IP-Mail: paschke@freia.inf.tu-dresden.de|
|   (91/08/11)           |                                             |
+------------------------+---------------------------------------------+
|   Who said this:                                                     |
|                                                                      |
|                   I want to be Robin to Bush's Batman.               |
`----------------------------------------------------------------------'


Newsgroups: comp.compression
From: stasiak@tartarus.uwa.edu.au (Stanley Stasiak)
Newsgroups: comp.compression
Subject: Selfextracting ARJ's
Date: 28 Jan 1993 04:05:22 GMT
Organization: The University of Western Australia
NNTP-Posting-Host: tartarus.uwa.edu.au
Keywords: ARJ
X-Newsreader: NN version 6.4.19 #1

Hi,
	I have a question.
Is there a way to convert ARJ archives to self-extracting
.exe files??

Thanks for any help.

Stan.
Newsgroups: comp.compression
From: bontchev@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Re: Some Info-ZIP problems
Reply-To: bontchev@fbihh.informatik.uni-hamburg.de
Organization: Virus Test Center, University of Hamburg
Date: 21 Jan 93 11:30:28 GMT

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

> I've been playing around with the latest Info-ZIP ZIP program (v1.9 Aug 26 92)
> for MSDOS and have come across two problems:

> 1. Recursion fails if the specified files aren't in the top directory.
>    For example, if I wanted to create an archive of all DOC files on my system
>    using PKZIP, I could go: PKZIP -r TEXTFILE *.doc, and it will recurse
>    through all of the directories below the starting one, working on any .doc
>    files that it encounters. LHA and ARJ work in a similar way. However, if
>    Info-ZIP's ZIP can not find any matching files in the starting directory, i
>    will abort with the following message, without even recursing below for
>    matching files:

>       ZIP -r TEXTFILE *.doc
>   
>       results in:
>    
>       zip warning: name not matched: tools\*.doc
>       zip error: nothing to do! (textfile.zip)


This is true not only for the MS-DOS version. The Unix version behaves
in exactly the same way (only the command there must be

	zip -r textfile '*.doc'

I agree that this should be fixed.

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
Newsgroups: comp.compression
From: cescript@physerver (Charles Scripter)
Subject: Re: zipsplit with pkzip204c Was: Re: Unix release? (Was etc.
Organization: Michigan Technological University
X-Newsreader: TIN [version 1.1 PL8]
Date: Mon, 25 Jan 1993 06:00:51 GMT

Mark Adler (madler@cco.caltech.edu) wrote:

> The Info-zip version tries to optimize the chunks as well, unless you
> ask it not to.  Perhaps the difference is that the other zipsplit has
> options with built-in sizes for the common floppy sizes, where Info-zip's
> zipsplit requires that you provide the number of bytes to be used on the
> media.

Actually, the advantage I found with J. Holm's zipsplit is it allows
on to split *directly* to floppy; One need not force the zip file to
devour *twice* the diskspace of the zip file, before moving to floppy. 

> Or perhaps you think that the other zipsplit optimizes the chunks
> better. [...]

I haven't noticed any difference in the efficiency between the 2
programs.  The only annoying feature of J. Holm's zipsplit is the
inability to force sequential (non-optimal) splits...  Info-Zip's does
this (but as I pointed out above, Info-Zip's doesn't split directly
onto floppy).  I often zip up data files which are sorted by date, and
I find it *very* annoying to have them shuffled when I split to disk. 

Each of these programs have strong and weak points.  I used
either/both depending on current my needs.  The multi-volume Info-Zip
should eliminate most of the need for these zipsplit programs...  :-)

--
Charles Scripter   *   cescript@phy.mtu.edu
Dept of Physics, Michigan Tech University, Houghton, MI 49931
-------------------------------------------------------------
"...when all government... in little as in great things, shall be
drawn to Washington as the centre of all power, it will render
powerless the checks provided of one government on another and will
become as venal and oppressive as the government from which we
separated."   Thomas Jefferson, 1821
Newsgroups: comp.compression
From: fred@genesis.demon.co.uk (Lawrence Kirby)
Subject: Re: Unix release? (Was etc. 
Distribution: world
Organization: BT
X-Mailer: Simple NEWS 1.90 (ka9q DIS 1.19)
Date: Thu, 28 Jan 1993 18:42:45 +0000

In article <1993Jan26.044940.6569@rei.com> fox@rei.com writes:

>Where can I find a write-up or description of an algorithm which solves
>the Knapsack Problem?  I have been unable to locate such a description
>(or even source code).
>

I have it here in 'Algorithms' by Robert Sedgewick.

-----------------------------------------
Lawrence Kirby | fred@genesis.demon.co.uk
Wilts, England | 70734.126@compuserve.com
-----------------------------------------
From: fred@genesis.demon.co.uk (Lawrence Kirby)
Newsgroups: comp.compression
Subject: Re: Unix release? (Was etc.
Date: 24 Jan 93 15:34:53 GMT
Organization: BT
X-Mailer: Simple NEWS 1.90 (ka9q DIS 1.19)

In article <9cl333-@rpi.edu> sigma@degas.ipl.rpi.edu writes:

>madler@cco.caltech.edu (Mark Adler) writes:
>>Or perhaps you think that the other zipsplit optimizes the chunks
>>better.  I don't know what algorithm the other zipsplit uses, but
>>our's uses a simple "greedy" algorithm that achieves the optimum in
>>nearly all cases with typical distributions of entry sizes.  The
>>chunk optimization is an NP-complete problem, so there are lots of
>>approximate approaches to the solution.
>
>This is what's called the Knapsack Problem.  It's NP-complete, but since
>your knapsack is usually relatively small compared to the total size of the
>files, an early-out algorithm which avoids combinations which will
>obviously not fit actually has to check very few combinations.  Even with
>four hundred files, I've never had to check more than 30000 combinations
>(well, my program does - not myself by hand) to get a perfect fit.
>

The knapsack problem deals with a single knapsack (i.e. disk) and is NOT
NP-complete. It's a common example of dynamic programming where the optimal
solution can be derived in order NM time where N is the number of items
(files) and M is the knapsack size (i.e. number of disk allocation units). To
put it another way for a fixed disk size (such as 1.44MB) the algorithm is
linear in N.

Optimising allocation over multiple volumes is more complex and the solution
isn't in general the same as optimising each volume in sequence. This *may*
be NP-complete, but I would need to be convinced!

-----------------------------------------
Lawrence Kirby | fred@genesis.demon.co.uk
Wilts, England | 70734.126@compuserve.com
-----------------------------------------
Newsgroups: comp.compression
From: cuffell@spot.Colorado.EDU (CUFFELL TIMOTHY MICH)
Subject: Re: NEW PKZIP 2.04E 
Organization: University of Colorado, Boulder
Distribution: usa
Date: Wed, 27 Jan 1993 18:40:12 GMT

What happened to 2.04d?
-- 
-Tim Cuffel	Finger for PGP 2.1  

Two wrongs don't make a right, but three lefts do.
Newsgroups: comp.compression
From: djweisbe@unix.amherst.edu (David Weisberger)
Subject: Re: Unix release? (Was etc.
Organization: large
X-Newsreader: TIN [version 1.1 PL7]
Date: Mon, 25 Jan 1993 05:47:49 GMT

Lawrence Kirby (fred@genesis.demon.co.uk) wrote:
: In article <9cl333-@rpi.edu> sigma@degas.ipl.rpi.edu writes:
: 
: >madler@cco.caltech.edu (Mark Adler) writes:
: >>Or perhaps you think that the other zipsplit optimizes the chunks
: >>better.  I don't know what algorithm the other zipsplit uses, but
: >>our's uses a simple "greedy" algorithm that achieves the optimum in
: >>nearly all cases with typical distributions of entry sizes.  The
: >>chunk optimization is an NP-complete problem, so there are lots of
: >>approximate approaches to the solution.
: >
: >This is what's called the Knapsack Problem.  It's NP-complete, but since

This is actually the Bin Packing problem, not the Knapsack problem.

: The knapsack problem deals with a single knapsack (i.e. disk) and is NOT
: NP-complete. It's a common example of dynamic programming where the optimal

The Knapsack problem sure is NP complete.  I believe the following
explanation is correct, if simple (check in comp.theory, though):

There is an algorithm which is linear in N, the number of items, but
the specification of N is of length proportional to log N, so the
running time is actually exponential in the length of the input.

Just a humble undergrad,
  David

--
Davebo                    "Don't believe I'm taken in by stories I have heard.
                           I just read the Daily News and swear by every word."
djweisbe@unix.amherst.edu
Newsgroups: comp.compression,comp.os.coherent
From: dgm@corvus (David Matusow)
Subject: porting of info-zip programs to Coherent 4.0
Followup-To: dgm@adonis.az05.bull.com
Organization: Online Communication Consultants
Date: Mon, 25 Jan 93 20:59:56 GMT

Has anyone ported the info-zip programs to Coherent 4.0?  I have
checked the raven archive (pub/conherent), but have not found
this.  I would be most interested in this port.

Thanks,
David Matusow                                    Online Communication Consultants      
dgm@adonis.az05.bull.com (on contract to Bull)   2015 N. Dobson Rd. Ste. 4-B10
CS - 70243.2410@CompuServe.COM                   Chandler, AZ. 85224 
(602) 862-5223 (at Bull)                         (602) 786-3533
-- 
David Matusow                                    Online Communication Consultants      
dgm@adonis.az05.bull.com (on contract to Bull)   2015 N. Dobson Rd. Ste. 4-B10
CS - 70243.2410@CompuServe.COM                   Chandler, AZ. 85224 
(602) 862-5223 (at Bull)                         (602) 786-3533
Newsgroups: comp.compression
From: cuffell@spot.Colorado.EDU (CUFFELL TIMOTHY MICH)
Subject: Re: Is This Possible (or is it B.S)? [200: 1 Lossless Compression]
Organization: University of Colorado, Boulder
Date: Sat, 23 Jan 1993 21:35:30 GMT

In article <71GF03Q9c9oC00@amdahl.uts.amdahl.com> fadden@uts.amdahl.com (Andy McFadden) writes:
>In article <1jndtq$odg@agate.berkeley.edu> forrest@nobozo.CS.Berkeley.EDU (Jon Forrest) writes:
>>                                    Is this B.S. or should I raise
>>my arms and cry hallelujah?

Amazing "up to 200:1 compression" with InfoZip!


 Length  Method   Size  Ratio   Date    Time   CRC-32     Name ("^" ==> case
 ------  ------   ----  -----   ----    ----   ------     ----   conversion)
2710341  Deflate   9214 100%  01-23-93  14:27  59678375   file
 ------          ------  ---                              -------
2710341            9214 100%                              1      

From 2.7 megs to 9214 bytes.

(This usually happens with an 80:1 mix of 0's and newlines.)

As long as there is at least one case that compresses 200:1, the claim is true.
-- 
-Tim Cuffel	Finger for PGP 2.1  

Two wrongs don't make a right, but three lefts do.
Newsgroups: comp.compression
From: LJ01066@LMSC5.IS.LMSC.LOCKHEED.COM
Subject: PkWare BBS phone # wanted
Organization: Lockheed Missiles & Space Company, Inc.
Date: Thu, 28 Jan 93 07:03:13 PST

Could anyone please give the phone number for pkwares BBS so I can
get a copy of PKZIP204E as I can't get anywhere else I have access
to. E-mail or post is fine. Many thanks in advance.


*******************************************************************
Newsgroups: comp.compression
From: Alex.Strasheim@launchpad.unc.edu (Alex Strasheim)
Subject: Re: PKZIP 2.04E now available...
Organization: University of North Carolina Extended Bulletin Board Service
Date: Thu, 28 Jan 1993 22:52:26 GMT

>Can someone who downloaded pkz204e.exe directly from the PKWare BBS
>please post the size of the file in bytes, and a zip crc, Unix sum,
>or both?  Thanks.  (An MD5 signature would be nice too, but I'm not
>picky.)

I downloaded pkz204e.exe directly from the pkware bbs.  The size of the
file is 196424.  I'm not sure what you mean by a zip crc, but I did one of
these:

	pkzip stf pkz204e.exe

and when I listed the archive, the crc-32 column contained this entry:

	54a5bfd7

I used the 2.04e version of pkzip to make the archive, if that makes any
difference (and it seems that it shouldn't -- the crc is taken from the
uncompressed file, not the compressed image, isn't it?).

Has anyone written a program that makes md5 signatures (or checksums) and
exists on both the msdos and unix platforms?  I would like to be able to
see if files on my unix account and my msdos box are the same without
doing an upload or a download.  (I know that this is the wrong group for
this, but it *did* come up...)

	Alex


--
   The opinions expressed are not necessarily those of the University of
     North Carolina at Chapel Hill, the Campus Office for Information
        Technology, or the Experimental Bulletin Board Service.
           internet:  laUNChpad.unc.edu or 152.2.22.80
Newsgroups: comp.compression
From: roe2@ellis.uchicago.edu (Cave Newt)
Subject: Re: Some Info-ZIP problems
Reply-To: roe2@midway.uchicago.edu
Organization: University of Chicago
Date: Thu, 21 Jan 1993 07:12:23 GMT

Graeme Cross <chegc@lure.latrobe.edu.au> writes:

>>> 1. Recursion fails if the specified files aren't in the top directory.
>>>    For example, if I wanted to create an archive of all DOC files on my
>>>    system, using PKZIP, I could go: PKZIP -r TEXTFILE *.doc, and it will
>>>    recurse through all of the directories below the starting one, working
>>>    on any .doc files that it encounters.

Gary.Woodman@anu.edu.au (Gary Woodman) writes:

>I've noticed this too... darn annoying if you ask me, ZIP is _not_ a 
>replacement for PKZIP without this feature.

Yes, well, some of us argued for this feature (even under Unix) but
were outvoted (them that actually writes the code in question gets
bigger votes :-) ).  More votes might tip the balance the other way
(or at least result in the option Jean-loup mentioned), but note that
*all* of the Info-ZIP authors are pretty backlogged these days.  Jean-
loup has been busy writing GNU's replacement for compress, among other
things (which has been causing quite a stir amongst the Linux folks,
yuk yuk).

Greg
From: jang@acsu.buffalo.edu (Euee S. Jang)
Newsgroups: comp.compression
Subject: HELP: JPEG ISO draft.
Date: 25 Jan 93 21:44:43 GMT
Distribution: usa
Organization: UB

Subject: HELP: ISO JPEG DRAFT.

Hi.
I am looking for ISO JPEG(draft). The exact name of it is:

"Digital Compression and Coding of Continuoustone Still Images",
Part 1, Requirements and Guidelines, ISO/IEC JTC1 Draft International
Standard 10918-1, Nov. 1991.

If there is any Postscript version, it would be better.
Any kind of help would be appreciated.

Erik
From: droelke@spirit.aud.alcatel.com (Daniel R. Oelke)
Newsgroups: comp.compression
Subject: PKzip 2.04e
Date: 28 Jan 1993 15:24:51 -0600
Organization: UTexas Mail-to-News Gateway
NNTP-Posting-Host: cs.utexas.edu

I have uploaded it to:

wuarchive.wustl.edu /pub/MSDOS_UPLOADS/utilities

$ sum pkz204e.exe
23908   192

Have fun.

-----------------------------------_---_--------------------------------------
Dan Oelke                         / \ / \              Alcatel Network Systems
droelke@aud.alcatel.com           \  V  /                       Richardson, TX
Phone: (214) 996-5013              \VMS/             #include <std-disclaim.h>
  Fax: (214) 996-7119               \ / 
-------------------------------------V----------------------------------------
From: mrmarcel@eos.ncsu.edu (Mike Marcelais)
Subject: Re: Selfextracting ARJ's
Keywords: ARJ
Organization: North Carolina State University
Date: Thu, 28 Jan 1993 16:22:54 GMT

In article <1k7m22INNh9t@uniwa.uwa.edu.au>, stasiak@tartarus.uwa.edu.au (Stanley Stasiak) writes:
|> Hi,
|> 	I have a question.
|> Is there a way to convert ARJ archives to self-extracting
|> .exe files??
|> 
|> Thanks for any help.
|> 
|> Stan.

I think it's

arj f -js (file.arj)

(It's one of the options, do an arj -help.  You can also generate an EXE
directly with arj a -js (file.exe) (files to arj))
-- 

+-------------------------------------+------------------------------+
|  Mike Marcelais                     | mrmarcel@eos.ncsu.edu        |
|  356 Tucker, Box 04783, NCSU        | Fourth Bryan Productions     |
|  Raleigh, NC  27607                 | #include <disclaim.h>        |
+-------------------------------------+------------------------------+
| if the above address bounces, then try the address below:          |
| mrmarcel%eos.ncsu.edu@ncsuvx.ncsu.edu                              |
+--------------------------------------------------------------------+
Newsgroups: comp.compression
From: pdh@netcom.com (Phil Howard )
Subject: Re: Legal Discussion
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Date: Thu, 28 Jan 1993 11:32:43 GMT

David James Alexander Hanley <U16244@uicvm.uic.edu> writes:

>  I think this is an important problem, becuase many independant programmers
>may be forced out of the industry.  Imagine if quicksort had been patented!

What????  Not yet patented?

[ ... as I join the stampede to the patent office .... just kidding ]
-- 
/************************************************************************\
| Phil Howard,  pdh@netcom.com,  KA9WGN    Spell protection?  "1(911)A1" |
| "It's not broken... it's just functionally challenged" --Phil and Pete |
\************************************************************************/
From: caeser@csd4.csd.uwm.edu (Robert Michael Trotter)
Newsgroups: comp.compression
Subject: PKZIP 2.04E now available...
Date: 27 Jan 1993 02:59:39 GMT
Organization: Computing Services Division, University of Wisconsin - Milwaukee
NNTP-Posting-Host: 129.89.7.4

	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!
Newsgroups: comp.compression
From: alewis@gibbs.oit.unc.edu (Andrew Lewis)
Subject: PKZip 2.04: c vs. e
Organization: University of North Carolina at Chapel Hill
Date: Thu, 28 Jan 1993 04:29:57 GMT

Could someone (perhaps the maintainer of the 2.04c bugs list) post an
independent evaluation of the differences between 2.04c and 2.04e?  I have
the item (unlike revision c, I'm using it), but I'd like to see a list of
what was broken that has been fixed; what was broken that hasn't been
fixed; what wasn't broken, but was maybe a little bent, and whether it got
resolved or not.  Yes, I've read v204e.new.  It goes into detail about
DPMI, and I am still unsure if all DPMI implementations will now work. 
Also, I guess I'd just like to see what Real People [tm] experienced. 
Should I advise my local BBS operators to stay away from this version, too?

alewis@gibbs.oit.unc.edu
Newsgroups: comp.compression
From: hansoo@kum (Kim HanSoo (Daewoo Elec.))
Subject: E.E.Mail to Mr. Zammits
Organization: KAIST in Seoul, Korea
X-Newsreader: Tin 1.1 PL4
Date: Tue, 26 Jan 93 06:15:24 GMT


To : Zammits

Thank you Zammits.
I appreciate your message for H.261 sequence. I have 'Table Tennis' sequ
ence for MPEG I standards. But this sequence's specification is not CCIR
601-format(original format) but Source Input Format for MPEG-I(filteredversion from CCIR601), i.e 352 pixels/line x 288 lines/picture x 25 pict
ures/1 sec.

The site, kum.kaist.ac.kr, is my friend's site, and my site is ksseo@vis
sol.kaist.ac.kr. But my site can not receive any mail messages and not c
onnected for foreign host. Also friend's site(kum.kaist.ac.kr) have smal
l hard disk. Hence I have to receive H.261 sequence and send Table Tenni
s sequence by my operation. I am sorry for these bad enviroments. Please
 say FTP-ing method to me : I want to know connection address (134.151.9
2.27 ?), login method, disk path, and a period of connection .....

Thank you for your assistance.

Mail Address : hansoo@kum.kaist.ac.kr (hansoo@128.134.1.1)

From : ksseo@vissol.kaist.ac.kr

Newsgroups: comp.compression
From: law40003@nusunix1.nus.sg (TAN YEW KEONG)
Subject: Legal Discussion
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 25 Jan 1993 16:40:55 GMT



Please ignore ALL my previous postings on the subject.

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.

It would be interesting for me to get to know real world legal problems 
regarding computers. If you have any legal problems or experiences,
post to me, and I will be glad to discuss them with you. The experience will
prove invaluable to me.

Disclaimers :

I will not be liable for any prosecution, both civil and criminal,
arising in any way connected to our discussion, whether it may be
your reliance on our discussion, or our discussion leading to criminal 
behaviour.

Nobody should regard our discussions as final and conclusive, and I do not
profess any expert knowledge whatsoever.

I disclaim responsibility for any losses you incur by relying on our 
discussions, and if any of our discussions lead to criminal behaviour,
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!!!       |
________________________________________________________________________|
Newsgroups: comp.compression
From: Mark_Gendron@mindlink.bc.ca (Mark Gendron)
Subject: Re: PKZIP 2.04E now available...
Organization: MIND LINK! - British Columbia, Canada
Date: Thu, 28 Jan 1993 15:18:09 GMT

> Achim Schaefer writes:
>
> What's about anonymous ftp. Where can I get it?
>
>  -Achim
>


garbo.uwasa.fi       /pc/arcers/pkz204e.exe       size=196,624




--
-----------------------------------------------------------------
 Mark_Gendron@mindlink.bc.ca   |   There is no excellent beauty
 housed@unixg.ubc.ca           |   that has not some strangeness
 fgndm051@bcit.bc.ca           |   in the proportion.
-----------------------------------------------------------------
Newsgroups: comp.compression.research
From: quandt@cs.umr.edu (Brian Quandt)
Subject: motion estimation
Date: Mon, 25 Jan 1993 20:46:06 GMT
Organization: University of Missouri - Rolla, Rolla, MO


Newsgroups: comp.compression.research