HDTenEightyP/NetNews huggingface dataset:
From: doug@happy.vf.ge.com (Doug Hughes)
Subject: Compressing sound on sun
Followup-To: comp.compression.researc
Reply-To: doug@happy.vf.ge.com
Organization: GE Aerospace - VF
Date: Fri, 28 Aug 1992 17:02:09 GMT


I'm looking for some good sound compression and silence detection
algorithms for a sun. So far, I've gotten the adpcm stuff and gotten
that to work on the sun. It seems okay, and I've been able to cut
the volume in half using that by translating from Ulaw to signed
16 and then doing the 16 -> 4bit quantization. However, I'm afraid
that all the conversions that are involved are going to slow up
my throughput as I plan on doing the conversion on the fly for 
packet voice.  I guess what I really need is to somehow detect when
the incoming volume on the audio port is below a certain threshhold
and then not send packets over the net until it breaks above that
threshold again.  It will probably mean smaller packets, but so be-it.
   I've also gotten the CELP stuff.. But, the documentation only tells
you how to compile the stuff.  It does not say what it should be used for.
I haven't really heard anything about CELP so I don't know what kind
of use I can get out of it or if it would be good for voice compression
on the fly.  It says something about an input file also, but it doesn't
really explain what the input file should be.
   Any help would be appreciated! Thanks!

-- 
 ___			|	GE software developer
( / ) _       _,	|	doug@happy.vf.ge.com
_/_/ <_>_/_/_<_>	|	uunet!crdgw1!ge-dab!happy.vf.ge.com!doug
             <_>	|	2B | !2B > The_Question
________________________|______________________________________________________

Newsgroups: comp.compression.research
From: nagle@netcom.com (John Nagle)
Subject: Re: Compression of pictures (e.g. star fields)
Date: Sun, 30 Aug 92 18:06:47 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 

       You could probably come up with a fractal compression scheme for
star fields that would compress an entire sky down to a few KB.  Of course,
the lesser stars wouldn't be in the same places after decompression, but
who would notice?

					John Nagle

Newsgroups: comp.compression.research
From: sh@cypress.com (Steve Haigh/VDSP)
Subject: QCIF decoding of MPEG1 bit streams
Originator: sh@kahuna
Organization: Cypress Semiconductor/San Jose, CA
Distribution: na
Date: Wed, 26 Aug 1992 00:16:04 GMT

Has anyone out there looked at decoding a QCIF size image from an MPEG1
stream (CIF size) at reduced computational performance, i.e. 1/4 of the
the IDCT's/MC's etc.

What about filtering in the transform domain or simply doing 4x4 IDCT's
on the 8x8's.

I would be interested in hearing about failures as well as successes in this
area.

Thanks Steve.
From: jupshaw@athena.cs.uga.edu (Joseph Upshaw)
Newsgroups: comp.compression.research
Subject: Re: using a compression routine.
Date: 31 Aug 92 15:15:53 GMT
Organization: University of Georgia, Athens

Newsgroups: comp.compression.research
Subject : Using Stacker on systems with Two physical hard drives
Sender:jupshaw@athena.cs.uga.edu  
Organization: University of Georgia, Athens

HELP !!!!!
    Recently I installed Stacker on a Friend's machine which was a 286 with two
physically distinct internal hard drives C: and D:. When I installed it, it par-tioned the C: drive into C: and D:(the compressed Stacker drive). Now he is un- able to gain access to his  
 original D: pysically seperate drive. I thought that if I booted the machine 
 from the floppy drive that it would allow me to get to the original drive but,
 instead if I do that, it then refuses to recognize either the original D: driveor the Stacker D: drive, giving me an invalid drive specification error in both
 instances. If I go to CMOS the second drive is still installed. Since I've onlyregistered the software for my machine at home with Stacker I cannot call their support line for help. If anyone can give some rather detailed instructions for me I would really appreciate it.
From: tgl+@cs.cmu.edu (Tom Lane)
Newsgroups: comp.compression.research
Subject: Re: JPEG software
Summary: read the FAQ...
Date: 30 Aug 92 22:20:22 GMT
Article-I.D.: cs.BttI1y.M93.2
Reply-To: jpeg-info@uunet.uu.net
Followup-To: comp.compression
Organization: School of Computer Science, Carnegie Mellon

subbu@octagon.cis.ohio-state.edu writes:
> I am looking for public domain compression software (JPEG).


From the JPEG FAQ, posted regularly in comp.graphics and news.answers
(not to mention a lot of alt groups):


6)  Where can I get JPEG software?

6B) If you are looking for source code to work with:

Free, portable C code for JPEG compression is available from the Independent
JPEG Group, which I lead.  A package containing our source code,
documentation, and some small test files is available from several places.
The "official" archive site for this source code is ftp.uu.net (137.39.1.9
or 192.48.96.9).  Look under directory /graphics/jpeg; the current release
is jpegsrc.v3.tar.Z.  (This is a compressed TAR file; don't forget to
retrieve in binary mode.)  You can retrieve this file by FTP or UUCP.
Folks in Europe may find it easier to FTP from nic.funet.fi (see directory
pub/graphics/programs/jpeg).  The source code is also available on
CompuServe, in the GRAPHSUPPORT forum (GO PICS), library 10, as jpsrc3.zip.
If you have no FTP access, you can retrieve the source from your nearest
comp.sources.misc archive; version 3 appeared as issues 1-18 of volume 29.
(If you don't know how to retrieve comp.sources.misc postings, see the FAQ
article "How to find sources".  This appears regularly in news.answers, or
you can get it by sending e-mail to mail-server@rtfm.mit.edu with
"send usenet/news.answers/finding-sources" in the body.)

The free JPEG code provides conversion between JPEG "JFIF" format and image
files in GIF, PBMPLUS PPM/PGM, Utah RLE, and Truevision Targa file formats.
The core compression and decompression modules can easily be reused in other
programs, such as image viewers.  The package is highly portable; we have
tested it on many machines ranging from PCs to Crays.

We have released this software for both noncommercial and commercial use.
Companies are welcome to use it as the basis for JPEG-related products.
We do not ask a royalty, although we do ask for an acknowledgement in
product literature (see the README file in the distribution for details).
We hope to make this software industrial-quality --- although, as with
anything that's free, we offer no warranty and accept no liability.

The Independent JPEG Group is a volunteer organization; if you'd like to
contribute to improving our software, you are welcome to join.

-- 
			tom lane
			organizer, Independent JPEG Group
Internet: tgl@cs.cmu.edu	BITNET: tgl%cs.cmu.edu@carnegie
From: aj681@cleveland.Freenet.Edu (Carlin Wiegner)
Newsgroups: comp.compression.research
Subject: Best Compression Algor...?
Date: 4 Sep 1992 20:50:15 GMT
Organization: Case Western Reserve University, Cleveland, Ohio (USA)
NNTP-Posting-Host: hela.ins.cwru.edu


BTW, I've been wondering what the best compression algol is...
For normal OS use that is.... Arcing (PC),Compactor (Mac),
TAR(UNIX)??? Please email me a reply if there is one....
CW
-- 
Carlin E. Wiegner    
cew6@po.cwru.edu                              Normal Account
rhino@eeap.cwru.edu                           Lab Account
"Any less [than a NeXT] would be uncivilized...."
From: aistmain@vntic.msk.su (Dispatcher of AIST-EuroAIST-RELCOM Boris I. Tarakanov)
Newsgroups: comp.compression.research
Subject: NEW CIPHER-SYSTEM
Summary: NEW CIPHER-SYSTEM
Keywords: NEW CIPHER-SYSTEM
Date: 30 Aug 92 22:12:59 GMT
Reply-To: aistmain@vntic.msk.su
Organization: AIST-VNTIC INFORMATION NETWORK


              New cipher-system

 1. When the original information is euciphered every bit is
    treaded and redundancy of this information is absent
 2. The amount of variants of eucipher may be so much great,
    for example n=10**91
 3. The quantity of encipher operations for 1 bit are <=22,
    but decipher operations are <= 9 for case n=10**91
 4. Ecodered file is deciphered in turn bit from the end  of
    the text.

    This new cipher-system may be  used  for  protection  of
    information  from   unauthorized  access  and  for  data
    communications by communication chanels.

    Relation by electronic mail.
Newsgroups: comp.compression.research
From: behrenss@Informatik.TU-Muenchen.DE (Soenke Behrens)
Subject: Looking for sample archives
Organization: Technische Universitaet Muenchen, Germany
Date: Sun, 30 Aug 1992 07:16:01 GMT

Good day,

I am aware that this may possibly be the wrong newsgroup, but nonetheless ...

To test a port of LHA 2.xx, I'd need archives packed with the following (no
longer "in-use") methods: -lh2-, -lh3-, -lzs-, -lz5-.

As I understand it, some of these were created by earlier versions of LHArc
(or related programs?).

Any help is greatly appreciated

Soenke behrens

-- 
===========================================================================
More than silver, more than gold, I need   !    behrenss@informatik.
electricity. I need it for my dreams.      !    tu-muenchen.de
(RACTER)                                   !  FIDO: 2:246/13 Soenke Behrens
Newsgroups: comp.compression.research
Subject: Compression of pictures (e.g. star fields)
From: phys169@csc.canterbury.ac.nz
Date: 26 Aug 92 14:53:43 +1200
Organization: University of Canterbury, Christchurch, New Zealand

Is there a name for the method of compressing video signals where the distance
before a certain amount of brightness change is stored, instead of the
brightness at regular points? And, any books/papers/etc about it, especially
relating to astronomical pictures.

Thanks for any help,
Mark Aitchison, University of Canterbury, New Zealand.
Newsgroups: comp.compression.research
From: grabenst@umbc4.umbc.edu (Mr. Michael Grabenstein; ACS (GUEST))
Subject: using a compression routine.
Organization: Univ. of MD, Baltimore County
Date: Fri, 28 Aug 1992 02:37:52 GMT

	OK, I have a programming question (hope this is the
appropriate sub). If I were to write a compression program (ie.
an archiving program) what are the implied legal problems?
Also Where could I find a C source that would compress various
types of files relatively well? Suggested books of algorithms?
Thanks!

Later,
	Mike
	ZMEG@AACC.bitnet
	or grabenst@umbc3.umbc.edu
From: jupshaw@athena.cs.uga.edu (Joseph Upshaw)
Newsgroups: comp.compression.research
Subject: Using Stacker on systems with Two physical hard drives
Date: 31 Aug 92 15:17:15 GMT
Organization: University of Georgia, Athens

HELP !!!!!
    Recently I installed Stacker on a Friend's machine which was a 286 with two
physically distinct internal hard drives C: and D:. When I installed it, it par-tioned the C: drive into C: and D:(the compressed Stacker drive). Now he is un- able to gain access to his  
 original D: pysically seperate drive. I thought that if I booted the machine 
 from the floppy drive that it would allow me to get to the original drive but,
 instead if I do that, it then refuses to recognize either the original D: driveor the Stacker D: drive, giving me an invalid drive specification error in both
 instances. If I go to CMOS the second drive is still installed. Since I've onlyregistered the software for my machine at home with Stacker I cannot call their support line for help. If anyone can give some rather detailed instructions for me I would really appreciate it. 
Newsgroups: comp.compression
From: rschnapp@metaflow.com (Russ Schnapp)
Subject: Re: STACKER OR PC STORE OR ????????
Organization: Metaflow Technologies Inc.
Date: Thu, 3 Sep 1992 17:09:41 GMT

In article <3SEP199200265438@zeus.tamu.edu>, rpb0804@zeus.tamu.edu (BATES, ROBERT PATRICK) writes:
|> ... As for the other program, I 
|> don't know about it... The only one I've heard of otherwise is SUPERSTORE on 
|> DR-DOS 6, and some people have complained about it, too.
|> 
|> Good luck, and have fun!

I've had pretty good luck with DR-DOS 6.0 and the SuperStore driver that
comes with it.  I even use Windows 3.1 with it...
-- 

...Russ Schnapp
BIX: rschnapp           Email: uunet!metaflow!rschnapp or rschnapp@metaflow.com
Metaflow Technologies   Voice: 619/452-6608x230;  FAX: 619/452-0401
La Jolla, CA  92037     Unless otw specified, I`m speaking only for myself!
Newsgroups: comp.compression
From: dec@gtech.com (Dehe Cui)
Subject: Re: Where are these archives???
Organization: GTECH Corporation, West Greenwich, RI
Date: Fri, 4 Sep 1992 19:50:12 GMT
From: nevries@accucx.cc.ruu.nl (Nico E de Vries)
Newsgroups: comp.compression
Subject: Re: MS-DOS ZIP 1.9 - How much memory needed?
Date: 1 Sep 92 08:20:22 GMT
Organization: Academic Computer Centre Utrecht

In <9209010105.AA06366@enet-gw.pa.dec.com> reisert@mast.enet.dec.com (Jim -- DTN 223-5747 -- Moved to MLO5-2/13A) writes:

>I shelled out of a DOS program, and have 279K free according to 4DOS.
  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
>However, when I try to ZIP some files, I get the error message:

>	Out of memory (window allocation)

>Is this because the DOS program is running in a DOS compatibility box under
>OS/2, and I have the wrong type of memory? Is my environment too small?
>Here's what 4DOS says I have:

If you are using OS/2 2.0 then using a new DOS box (an empty one) should
solve the problem flawlessly.

>- Jim


Nico E. de Vries
_ _
O O  USENET nevries@cc.ruu.nl  FIDO 2:281/708.1  COMPUSERVE "soon" ???? 
 o   This text reflects MY opinions, not that of my employer BITECH.      
\_/  This text is supplied 'AS IS', no waranties of any kind apply.      
     Don't waste your time on complaining about my hopeless typostyle.

"I would admit my mistakes, if I had any ..."  (Bumper Sticker)
Newsgroups: comp.compression,comp.multimedia
From: gtalatin@vartivar.ucs.indiana.edu  (Gerard V. Talatinian)
Subject: Need info on C-Cube CL550 JPEG chip.
Reply-To: gtalatin@ucs.indiana.edu
Organization: Indiana University
Date: Fri, 28 Aug 1992 17:11:52 GMT


'Anybody out there know the number for C-Cube Microsystems?
I am looking for technical information on their CL550 JPEG compression  
chip.
Any pointers appreciated.
Thanks! :-)

************************************************************
* Gerard Talatinian               gtalatin@ucs.indiana.edu *
* University Computing Services   Voice: (812)855-0962     *
* Network Research & Planning     FAX:   (812)855-8299     *
* Indiana University                                       *
************************************************************
Newsgroups: comp.compression,comp.binaries.ibm.pc.archives
From: kko@fraser.sfu.ca (Samuel Ko)
Subject: Re: zip 1.9 and unzip 5.0, Unix versions, at garbo
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Tue, 25 Aug 1992 19:09:58 GMT

 ts@uwasa.fi (Timo Salmi) writes:

>>301326 Aug 22 12:49 garbo.uwasa.fi:/unix/arcers/unzip50.tar.Z
>>246043 Aug 21 10:31 garbo.uwasa.fi:/unix/arcers/zip19.tar.Z
>
>First of all please note that I well might have blundered and thus I
>might now be giving false information.  But tread with certain care
>with zip19.  I tested it on some of my text files on garbo and chyde
>and some of the long files were stored at zero lenght.  I have
>naturally informed the authors. 

I've downloaded and compiled zip 1.9 ... and after some testings on
both System V and BSD machines ... I find no problems whatever with
zip 1.9 ... all text and executable files are compressed (deflated) ...
The compression ratio with zip 1.9 is slightly higher than that with
zip 1.0 ... And unzip 5.0 is fine as well ...

The PC (and other OSs) versions of zip and unzip can be found at 
valeria.cs.ucla.edu (in the /incoming/infozip directory) ... And you can
also find the MSDOS version of zip 1.9 and unzip 5.0 in /pub/MSDOS_UPLOADS
at wuarchive.wustl.edu ...

--
Samuel Ko (kko@sfu.ca)
The best archie server ...

Newsgroups: comp.compression
From: robison@iscnvx.lmsc.lockheed.com (Jordan H. Robison)
Subject: FAQ list
Organization: Lockheed Missiles and Space Co.
X-Newsreader: Tin 1.1 PL4
Date: Tue, 25 Aug 92 22:59:34 GMT

Does this group have a FAQ list? Is it available at an FTP site?

Thanks,
J.R.

-- 
Jordan Robison
Lockheed Missiles & Space Co.
robison@iscnvx.lmsc.lockheed.com
Newsgroups: comp.compression
From: peterlew@bnr.ca (Peter Lew)
Subject: PKZIP 1.93A Bugs? What are they?
Keywords: PKZIP
Reply-To: peterlew@bnr.ca (Peter Lew)
Organization: Bell-Northern Research Ltd.
Distribution: na
Date: Tue, 01 Sep 92 13:27:37 GMT

I haven't been following this news group so I apologize for the waste 
of bandwidth. I'm presently using PKZIP 1.93 Alpha version and I have
recently heard that the version has some major bugs. Is there a list 
of these bugs and would some kind person post them (I can't be reached
ala EMAIL). I would like to know if the bugs are going to affect the
ump-teen megabytes of stuff I have compressed.

Thanx

Peter Lew

.SIG under construction
From: "rafael ramirez" <rafael.ramirez@channel1.com>
Newsgroups: comp.compression
Subject: new better than jpeg?
Date: 27 Aug 92 00:39:57 EST
Reply-To: "rafael ramirez" <rafael.ramirez@channel1.com>
Distribution: comp
Organization: Channel 1 Communications

I just heard (and I'm on the process of finding out some more) about a
company called LEAD Technologies, Inc. (8701 Mallard Creek Road
Charlotte, NC  28262 1-800-637-4699 in NC 704-549-5532 Fax 704-548-8161)

They seem to have some code (including programmers .LIBs for PC's and
Windows DLL, as far as I know) to compress several types of images (they
all get converted to "true color"/gray scale, I believe) with better
ratio quality/size than JPEG.  They offer a hardware assisted option
powered by the C-Cube chip.  They announce their method as being
different from and better than JPEG.  Their software also deal with JPEG
code (JFIF), BTW, as they wanted to address the compatibility issue too.

Has anybody seen this stuff and can comment on it?  If I find out more
about it, is there anybody else out there interested?  You can e-mail
and I'll summarize.

 * SLMR 2.1a * Rafael.Ramirez@channel1.com from SPAIN! (A.K.A. RRC)
--
Channel 1 (R)   Cambridge, MA
From: James.Spaith@bbs.oit.unc.edu (James Spaith)
Newsgroups: comp.compression
Subject: Seeking reviews of SoftLogic's CUBIT
Date: 26 Aug 92 19:26:17 GMT
Distribution: usa
Organization: Extended Bulletin Board Service

Hey there - I'm considering buying SoftLogic's CUBIT on-the-fly
hard drive file compression utility for use on my Zeos 386/20.  I plan to 
alternate between using Windows 3.0 (and 3.1 when I get the bux :) ) but
I'm alarmed by SoftLogi's warnings about machinery problems with their
other products, specifically FAST!.  Anybody know about CUBIT and whether
this $20.00 program will cost me $500.00 for a new hard disk?

mail to jspaith@nas.edu

thanks

--
   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:  bbs.oit.unc.edu or 152.2.22.80
Newsgroups: comp.compression
From: dathomps@vela.acs.oakland.edu (dathomps)
Subject: Re: HELP: Need Message Signature (e.g. MD4 Message Digest Algorithm)!!!
Organization: Oakland University, Rochester MI.
Date: Fri, 28 Aug 1992 21:49:24 GMT

Never mind.

Although I did'nt think it would work, ARCHIE found several
places where md4 resides.

Thanks anyway

Newsgroups: comp.compression
From: markjan@cs.kun.nl (Mark-Jan Nederhof)
Subject: Representing unions of Cartesian products
Organization: University of Nijmegen, The Netherlands
Date: Wed, 26 Aug 1992 14:58:43 GMT


I am looking for an efficient way to store and manipulate unions of Cartesian
products. 

The application domain is abstract evaluation of certain 
programs (e.g.  datalog programs) and analysis of formal grammars 
(context-free grammars extended with features/parameters over a finite domain).

Our goal is to determine the set of parameters with which a
nonterminal can generate a terminal string. If this is done by means of
bottom-up analysis then we need the following operations:

-For two or more sets of tuples of the form A_1 * A_2 * ... * A_n, 
for fixed n, we have to compute the union in an efficient form.
(The operator * denotes the Cartesian product.)
Here the sets A_i consist of atomic values.

-For two unions of Cartesian products in such an efficient form, call
them C_1 and C_2, we have to compute a third set C_3 in the same form
which represents C_1 - C_2.
(The operator - denotes the subtraction of sets of tuples.)

-Let us consider two unions of Cartesian products in such an efficient 
form, call them again C_1 and C_2. We now have to compute the set C_3
which represents the set of tuples
{(a_1, a_2, ..., a_n) | (b_1, ..., b_m) <- C_1 AND
                        (c_1, ..., c_k) <- C_2 AND
                         R (a_1, ..., a_n, b_1, ..., b_m, c_1, ..., c_k)},
where R is some relation which for some fixed pairs of its arguments says
that they should have the same value. 
(The operator <- denotes inclusion.)
This operation would be needed in case of a grammar rule with two
members (with m and k parameters respectively; R is determined by 
``consistent substitution''). 
You can generalise this to arbitrary grammar rules.


This query is inspired by two things:
-The sets of atomic values are typically too big to represent sets of
tuples in a naive way by one element for every tuple.
-When the union of sets of the form A_1 * A_2 * ... * A_n is computed
then very often these sets overlap, and are even ``almost the same but not
quite''.

At this moment I am using a representation where a union of Cartesian
products is transformed into another such that the Cartesian products do
no longer overlap (i.e. they have no tuples in common).
If possible I merge two Cartesian products into one.
These transformations are however rather expensive.
Does anyone have a better suggestion? references to papers?

Mark-Jan Nederhof
University of Nijmegen
The Netherlands
From: davidsen@ariel.crd.GE.COM (william E Davidsen)
Newsgroups: comp.compression
Subject: Re: new better than jpeg?
Date: 28 Aug 92 13:55:34 GMT
Reply-To: davidsen@crd.ge.com (bill davidsen)
Distribution: comp
Organization: GE Corporate R&D Center, Schenectady NY

In article <1992Aug27.162859.19286@cco.caltech.edu>, madler@cco.caltech.edu (Mark Adler) writes:

| Highly likely.  JPEG does a global quantization, irregardless of the
| local image content.  You can do much better, especially if you can
| fit the image in memory, or at least take two or more passes through it.

  I think that a better algorithm would only be widely accepted if it
was a standard and if multiple sources offered implementations working
with a common filetype. That doesn't mean this method won't be useful or
popular, it certainly can be better than JPEG as Mark points out.
However, if it's really good someone will reverse engineer it and make a
public version available.

-- 
bill davidsen, GE Corp. R&D Center; Box 8; Schenectady NY 12345
    I admit that when I was in school I wrote COBOL. But I didn't compile.
From: edb_morten@debet.nhh.no
Newsgroups: comp.compression
Subject: Bug in UnZip 5.0?
Date: 3 Sep 92 15:27:18 MET
Organization: Norwegian School of Economics

Use Zip 1.9 to compress *one* file, in my example called "test". Use the
same name for the resulting zip-file.

>zip test test

This will generate "test.zip" which is a compressed version of "test".

Now, try to list the contents of "test.zip" using UnZip 5.0.

>unzip -v test

My version of UnZip is unable to read the archive.

Now, try to rename "test.zip" to "test1.zip".

>ren test.zip test1.zip

This time, UnZip can read the file!

IS THIS A BUG?

-Morten
---------------------------
Morten Lohre
EDB_MORTEN@DEBET.NHH.NO
Norwegian School of Economics
--------------------------