HDTenEightyP/NetNews huggingface dataset:
From: act@softserver.canberra.edu.au (Andrew Turner)
Subject: Re: Dr Dobb's Journal - available online?
Organization: University of Canberra
Date: Tue, 12 Jan 93 21:25:41 GMT

In article <1367@pivot-sts.sbi.com> ray@rann.sbi.com writes:
>the DDJFORUM on Compuserve, has files and source referenced in mag, they also (used to) have a BBS that carried much of the same stuff. Last time I looked, there was info. in the magazine giving details.

Why pay the exorbitant Compuserve fees when an Archie search 'prog ddj' will
give you the hordes of sites with DDJ stuff!

-- 
Renrut Werdna			Probable-Possible, my black hen,
				She lays eggs in the Relative When.
				She doesn't lay eggs in the Positive Now
act@ss.canberra.edu.au		Because she's unable to postulate how
Newsgroups: comp.programming
From: jas37876@uxa.cso.uiuc.edu (John A. Slagel)
Subject: Re: Dr Dobb's Journal - available online?
Organization: University of Illinois at Urbana
Distribution: usa
Date: Wed, 6 Jan 1993 20:53:49 GMT

ykim@cs.columbia.edu (Yong Su Kim) writes:

>I apologise if this is a FAQ, but...
>Where can I get current and back issues of Dr Dobb's Journal?  Is it
>available online on some ftp site?

   try at wuarchive.wustl.edu

   in the /mirrors/msdos/ddjmag directory.

-- 
-----------------------------------------------------------------------------
 John A. Slagel              "My old man used to tell me, before he left this
 j-slagel1@uiuc.edu           shitty world, never chase buses or women- you
 (217) 337-7930               always get left behind." -The Marlboro Man
From: perm@csd.uu.se (Per Mildner)
Newsgroups: comp.programming
Subject: Re: Locating duplicates
Date: 5 Jan 93 20:03:46 GMT
Organization: Computing Science Dept.,Uppsala University, Sweden
NNTP-Posting-Host: groucho.csd.uu.se
In-reply-to: ceblair@ux1.cso.uiuc.edu's message of 2 Jan 93 02:13:58 GMT


A general solution to this problem (ie not dependent on the values
being integers) can be found in an fairly recent CACM article (I don't
have it handy, probably first half of 1992, you probably could use
WAIS to find it... ).

From memory:

It uses hashing to compute a 'home' for a particular key in the
vector. It scans the vector while moving keys to their 'home' location
(and checking if the value at the 'home' is a duplicate or else do
some clash handling). I don't remember the various performance
characteristics for the algorithm but I think one of the good things
was that it was useful on disk based vectors (ie to large to be sorted
in memory).

--
Per Mildner			perm@CSD.UU.SE
Computing Science Dept.		tel: +46 18181049
Uppsala University, Sweden	fax: +46 18521270
From: martin@math.rwth-aachen.de (  Martin Schoenert)
Newsgroups: comp.programming
Subject: Re: Arbitrary precision with large bases
Date: 7 Jan 93 14:25:38 GMT
Organization: Rechnerbetrieb Informatik - RWTH Aachen
NNTP-Posting-Host: bert.math.rwth-aachen.de

emcoop@bnr.ca (hume smith) writes:

    In <martin.726311424@bert>, martin@math.rwth-aachen.de (  Martin Schoenert) said:
    > a)  the larger the base the fewer digits any given integer has in this
    >     base.  Since (for example) the performance of the multiplication
    >     is proportional to the product of the number of digits of the
    >     operands it is always a win to use larger bases (though the win
    >     with base 2^32 over base 10^9 is only about 12.5%).

    not quite true - see aho/hopcroft/ullman.  f1*f2 can be done
    in O(n log(n)) where n=max(log(f1), log(f2)).  there's a rather large
    constant involved though... it may be better to implement the two
    and find out empirically when to switch methods.

Well yes, but it is not so simple.  Those fancier algorithms also have to
multiply digits (just not so many).  That means that base 2^32 is still
going to win over base 10^10 (just not so much).  Also you need quite
large integer before the fancier methods are faster than the elementary
algorithm.  For example the one with the smallest overhead is Karatsuba's
trick.  With my large integer arithmetic running on an R3000, integers
must have about 200 decimal digits before one Karatsuba splitting pays,
and they must have about 2000 decimal digits before multiplication with
Karatsuba's trick is twice as fast as the elementary algorithm.  For
fourier transform the break-even point is even higher.

Martin.

-- .- .-. - .. -.  .-.. --- ...- . ...  .- -. -. .. -.- .-
Martin Sch"onert,   Martin.Schoenert@Math.RWTH-Aachen.DE,  +49 241 804551
Lehrstuhl D f"ur Mathematik, Templergraben 64, RWTH, D 51 Aachen, Germany
Newsgroups: comp.programming
From: ykim@cs.columbia.edu (Yong Su Kim)
Subject: Dr Dobb's Journal - available online?
Organization: Columbia University Department of Computer Science
Distribution: usa
Date: Wed, 6 Jan 1993 02:54:52 GMT


I apologise if this is a FAQ, but...

Where can I get current and back issues of Dr Dobb's Journal?  Is it
available online on some ftp site?

Thanks.
-- 
===============================================================================
Yong Su Kim, Class of 1993		|  Internet: yk4@cunixb.cc.columbia.edu
Columbia College, Columbia University   |        or  ykim@cs.columbia.edu
From: martin@math.rwth-aachen.de (  Martin Schoenert)
Newsgroups: comp.programming
Subject: Re: Arbitrary precision with large bases
Date: 7 Jan 93 14:33:58 GMT
Organization: Rechnerbetrieb Informatik - RWTH Aachen
NNTP-Posting-Host: bert.math.rwth-aachen.de

emcoop@bnr.ca (hume smith) writes:

    In <martin.726311424@bert>, martin@math.rwth-aachen.de (  Martin Schoenert) said:
    > I have looked at quite a few large integer arithmetic packages and have
    > written two myself.  Mark Riordan has collected several, they are
    > available for anonymous 'ftp' on 'cl-next2.cl.msu.edu' (35.8.4.22).

    uh oh.  i just looked there and it seems they had a disk crash last year.
    there's nothing there.

I have most of them.  I could install them on my local 'ftp' server if
there is sufficient interest (sufficient to find enough free space on
the 'fpt' server).

Martin.

-- .- .-. - .. -.  .-.. --- ...- . ...  .- -. -. .. -.- .-
Martin Sch"onert,   Martin.Schoenert@Math.RWTH-Aachen.DE,  +49 241 804551
Lehrstuhl D f"ur Mathematik, Templergraben 64, RWTH, D 51 Aachen, Germany
Newsgroups: comp.programming
From: goss@micor.ocunix.on.ca (Timothy D. Goss)
Subject: Re: Locating duplicates
Organization: M.B. Cormier INC., Orleans (Ont)
Date: Tue, 5 Jan 1993 04:34:56 GMT

You can locate ALL duplicates in a list of integers with a single pass of the
list which is O(n) in time but it will require an array with 64K elements.  The
program below should explain...

typedef unsigned char byte;

static byte found[65536];
int intlist[NUM];		

void main(void) 
{

   int i;
   int check;

   /* assume intlist is filled with NUM integers */

   for (i=0; i<NUM; i++) {
      check = intlist[i];
      if (found[check] > 0 && found[check] != 0xff) {
         printf("%d\n", check);
         found[check] = 0xff; /* don't report same dupe twice */
      } else {
         found[check] += 1; /* first time we saw this one */
      }
   }

}

Of course this program could be modified to use a hash table to store the found
integers at a slight performance penalty.  If memory is not a problem the 64K
found array could be malloc'ed then free'd after. 

I haven't actuall run this program but the idea is what I want to get across.
Sorting the list isn't really necessary, that's a very awkward way to solve
that particular problem.

For the really memory stingy you could you a bitmap for the found array but
it would require 2 bits for each integer to avoid reporting more than 2
occurrences of the same integer.

I can't really see a faster way to do this with an unordered list, O(n) is the
best you can hope for.

 +----------------------------------------------------------------------------+
 |         _   /|                                                             |
 |         \'o.O'	    We the unwilling, led by the unknowning,          |
 |         =(___)=          are doing the impossible for the ungrateful.      |
 |            U             We have done so much, for so long, with so little |
 |     Timothy D. Goss      we are now qualified to do anything with nothing. |
 | goss@micor.ocunix.on.ca                                                    |
 +----------------------------------------------------------------------------+
From: pete@sst.icl.co.uk (Pete Bevin)
Newsgroups: comp.programming
Subject: Re: Locating duplicates
Date: 7 Jan 93 17:07:04 GMT
Reply-To: pete@sst.icl.co.uk (Pete Bevin)
Originator: pete@jura

Per Mildner writes:
> A general solution to this problem (ie not dependent on the values
> being integers) can be found in an fairly recent CACM article (I don't
> have it handy, probably first half of 1992, you probably could use
> WAIS to find it... ).

The article is in CACM, March 1991, pp 62--73.

The algorithm given moves duplicated elements to the end of the list,
but it may not preserve the order of the non-duplicate elements.
However, it can preserve them if it is allowed O(n) space.  The authors
did not find a linear-time, constant space, stable algorithm.

Pete.
From: bsmith@mickey.NoSubdomain.NoDomain (Brian Smith)
Newsgroups: comp.programming
Subject: Re: Locating duplicates
Date: 5 Jan 1993 07:12:55 GMT
Organization: University of California, Berkeley
Distribution: world
NNTP-Posting-Host: mickey.cs.berkeley.edu

In article <1993Jan5.043456.29130@micor.ocunix.on.ca>, goss@micor.ocunix.on.ca (Timothy D. Goss) writes:
|> You can locate ALL duplicates in a list of integers with a single pass of the
|> list which is O(n) in time but it will require an array with 64K elements.  The
|> program below should explain...
|> 
|> typedef unsigned char byte;
|> 
|> static byte found[65536];
|> int intlist[NUM];		
|> 
|> void main(void) 
|> {
|> 
|>    int i;
|>    int check;
|> 
|>    /* assume intlist is filled with NUM integers */
|> 
|>    for (i=0; i<NUM; i++) {
|>       check = intlist[i];
|>       if (found[check] > 0 && found[check] != 0xff) {
|>          printf("%d\n", check);
|>          found[check] = 0xff; /* don't report same dupe twice */
|>       } else {
|>          found[check] += 1; /* first time we saw this one */
|>       }
|>    }
|> 
|> }

Uh, maybe I'm really missing something, but won't this crash and burn and
core-dump if the integers are > 16 bits?  Don't try this on an alpha...

-------
Brian C. Smith				arpa:  bsmith@cs.Berkeley.EDU
University of California, Berkeley	uucp: uunet!ucbvax!postgres!bsmith
Computer Sciences Department		phone: (510)642-9585
Newsgroups: comp.programming
From: mkuchyt@casbah.acns.nwu.edu (Michael Kuchyt)
Subject: Matrix Libraries for C
Organization: Northwestern University, Evanston Illinois.
Date: Tue, 12 Jan 1993 21:57:13 GMT

Can someone please help me?  I am looking for a C library (MS-Dos) that has
some matrix capabilities such as multiplying 2 matricies together and other
things like that.

Has anyone ever heard of such a library?  If so, can you please let me know
where I may find one.

Thank you very much
  


Newsgroups: comp.programming
From: mcasal@nyx.cs.du.edu (Massimo Casal)
Subject: complex.h
Organization: Nyx, Public Access Unix (sponsored by U. of Denver Math/CS dept.)
Disclaimer1: Nyx is a public access Unix system run by the University of
Disclaimer2: Denver for the Denver community.  The University has neither
Disclaimer3: control over nor responsibility for the opinions of users.
Date: Fri, 8 Jan 93 11:01:08 GMT

Hi!
Where can i find a complex.h library for a ultrix system?

Thanx
Max

mcasal@nyx.cs.du.edu

Newsgroups: comp.programming
From: markt@harlqn.co.uk (Mark Tillotson)
Subject: Re: Locating duplicates
Organization: Harlequin Limited, Cambridge, England
	<1993Jan5.150010.27104@ulysses.att.com>
Date: Thu, 7 Jan 1993 12:27:25 GMT

In article <1993Jan5.150010.27104@ulysses.att.com> kpv@ulysses.att.com
(Phong Vo) writes:

> In article <1993Jan2.041658.21596@organpipe.uug.arizona.edu> dave@cs.arizona.edu (Dave Schaumann) writes:
> >In article <C07FJo.4vq@ux1.cso.uiuc.edu>, ceblair@ux1 (Charles Blair) writes:
> >>   Given a large array of integers.  Is there a way to identify duplicates
> >>which is substantially less work than sorting the array?
> >
> >...lots of good suggestions for the general case...
> 
> But most often this kind of question comes up in practice
> because you have a large array of integers in a small range.
> In that case, using a bit map for the range, you can do it
> in linear time and space proportion to the range size.

Use a hash table from integers to the number of occurrences, then you
do N hash-lookups, and one scan of the hash table looking for
duplicates, giving an expected time O(N), with no bound on the range
of integers (other than word-size, and address-space!).  You need a
suitable hash function, but for integers taking the modulo w.r.t. some
prime p, where p is about the size of the incoming array.


------------------------------------------------------
|\  /|          | ,  M. Tillotson       Harlequin Ltd. \
| \/ |  /\| |/\ |<   markt@uk.co.harlqn  Barrington Hall,\
|    |  \_| |   | \  +44 223 872522       Barrington,      \
I came, I saw, I core-dumped...            Cambridge CB2 5RG \

Newsgroups: comp.programming
From: jhelling@cs.ruu.nl (Jeroen Hellingman)
Subject: Re: How to copyright?
Date: Mon, 4 Jan 1993 10:20:43 GMT
Organization: Utrecht University, Dept. of Computer Science
Keywords: copyright

In <tim.30.726110910@tim.src.utah.edu> tim@tim.src.utah.edu (Tim Ma) writes:


>This isn't really a programming question per se, but could anyone tell me 
>what the procedure is to officially copyright a program or portions of its 
>code?

No procedure is needed, by creating an original work that can be copyrighted,
you automatically gain the copyright (but if you are working in your boss'
time, you boss will get it)

It may be advisable to get some prove that you made it, in Holland you can go
to a tax-office and let them place a date-stamp on your work, and it may also
be advisable to include a notice that your work is indeed copyrighted,
although it is not essential.

Jeroen

(no expert though)

-- 
Jeroen Hellingman                 E-mail: <jhelling@cs.ruu.nl>
't Zand 2                         Phone: +31-3473-73935 (home)
4133 TB Vianen                    (18.00--21.00 GMT)
The Netherlands                   Answer in English, German, or Dutch.
Newsgroups: comp.programming
From: 890584r@dragon.acadiau.ca (Barrie Rody)
Subject: Help With String Comparisons
Organization: Acadia University
Date: Mon, 11 Jan 1993 22:45:15 GMT


    I am writing a database and I need some help in comparing strings.
What I need is an algorithm to compare 2 strings {PChar, array[]of Char}.
I need this algorithm to be able to identify similar strings.
ie. a misspelled word would be found in a list.
    I am writing this in Turbo Pascal for Windows.  Any pseudocode,
Pascal, C, C++ or text answers would be greatly appreciated.

Thanks in advance for any help,
Barrie.

-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+--
	Barrie Rody	        890584r@dragon.acadiau.ca
	4th. Year Computer Science
	Acadia University, Wolfville, Nova Scotia, Canada.
--------------------------------------------------------------------------------
Rugby /'rug-bi / n.  30 players on a field:  scrummin down, pushin and plowin,
	squashin, stompin, straight arming, binding and bending, ruckin and
	rollin, rakin and runnin, grunting, snortin and scissor'n, mauling,
	tackling, bruisin and bleedin, prop'n and hook'n, kicking, jumping,
	fakin and fumbling, callin the ball, passin backwards, makin the try,
	and coolin off with an ice cold beer.
--------------------------------------------------------------------------------
Newsgroups: comp.programming,comp.programming
From: emcoop@bnr.ca (hume smith)
Subject: Re: Re: Arbitrary precision with large bases
Organization: Bell-Northern Research, Ottawa, Canada
X-Poster: Emacs-NNTP-0.1
Date: Thu, 7 Jan 1993 16:29:25 GMT

In <martin.726416738@bert>, martin@math.rwth-aachen.de (  Martin Schoenert) said:
> emcoop@bnr.ca (hume smith) writes:
> 
>     not quite true - see aho/hopcroft/ullman.  f1*f2 can be done
>     in O(n log(n)) where n=max(log(f1), log(f2)).  there's a rather large
>     constant involved though... it may be better to implement the two
>     and find out empirically when to switch methods.
> 
> Well yes, but it is not so simple.  Those fancier algorithms also have to
> multiply digits (just not so many).  That means that base 2^32 is still
> going to win over base 10^10 (just not so much).

i don't understand what you mean - AH&U describe their algorithm working
bitwise, but i saw no particular tie to base 2.  i've done it in Emacs Lisp
using base 10000, only because it was easy to print... it should work
in 2^whatever makes your hardware happy.

(i also should say that i took some liberty with the O statement i made
over AH&U's; if someone finds that the "obvious" generalisation doesn't
fit my guess...)

>  Also you need quite
> large integer before the fancier methods are faster than the elementary
> algorithm.

i grant that.  it's up to the implementor whether to bother with a more
complex method for his own uses.  if you're thinking about general usage
though, like a Lisp bignum package, the extra work may be appreciated.

In <MARKT.93Jan7124834@wundt.harlqn.co.uk>, markt@harlqn.co.uk (Mark Tillotson) said:
> I believe a tight implementation can start to win over straight long
> division when the numbers get to be a few hundred digits long.   When
  --------
> the numbers get to be hundreds of millions of digits, it is the only
> practical way!!

(i hope he meant multiplication, not division)
--
Hume Smith                      Wenn ich des Tages nicht dreimal
hume.smith@acadiau.ca           mein Schaelchen Coffee trinken darf,
emcoop@bnr.ca              //   so werd' ich ju zu meiner Qual
                         \X/    wie ein verdorrtes Ziegenbraetchen.

Newsgroups: comp.programming
From: emcoop@bnr.ca (hume smith)
Subject: Re: Re: Arbitrary precision with large bases
Organization: Bell-Northern Research, Ottawa, Canada
X-Poster: Emacs-NNTP-0.1
Date: Wed, 6 Jan 1993 16:02:16 GMT

In <martin.726311424@bert>, martin@math.rwth-aachen.de (  Martin Schoenert) said:
> I have looked at quite a few large integer arithmetic packages and have
> written two myself.  Mark Riordan has collected several, they are
> available for anonymous 'ftp' on 'cl-next2.cl.msu.edu' (35.8.4.22).

uh oh.  i just looked there and it seems they had a disk crash last year.
there's nothing there.
--
Hume Smith                      Wenn ich des Tages nicht dreimal
hume.smith@acadiau.ca           mein Schaelchen Coffee trinken darf,
emcoop@bnr.ca              //   so werd' ich ju zu meiner Qual
                         \X/    wie ein verdorrtes Ziegenbraetchen.

Newsgroups: comp.programming
From: naoursla@eos.ncsu.edu (NORMAN ALAN OURSLAND)
Subject: LISP
Originator: naoursla@c00804-247dan.eos.ncsu.edu
Reply-To: naoursla@eos.ncsu.edu (NORMAN ALAN OURSLAND)
Organization: North Carolina State University, Project Eos
Date: Tue, 12 Jan 1993 15:58:11 GMT


Does anyone know where I can get a LISP interpretor for Unix, X-Windows, or 
MS-Dos? Thank you.
Newsgroups: comp.programming
From: hlam@bnr.ca (Hayward Lam)
Subject: NeXT User Group Of Ottawa Meeting on January 7th
Reply-To: hlam@bnr.ca (Hayward Lam)
Organization: Bell-Northern Research Ltd.
Date: Tue, 5 Jan 1993 20:22:24 GMT


NeXT User Group of Ottawa Meeting on January 7th
------------------------------------------------


When : Thursday, 7:00pm
Where: ComputerActive
       21 Antares Dr., Unit 112,
       Ottawa, Ontario, Canada


Topics: 
***  Database on NeXT  ***
Demo and discussion on databases and development tools 
available on NeXT.
Inlcude Parabase, Sybase, Oracle, DBkit, Objective DBtool kit etc.
Topic will be oriented for users and developers alike.
Demo machine is a NeXTcube with NeXTdimension board.

(A guest will talk about their experience with database 
development. Not confirmed yet.)


***  General discussion  ***
CD-ROM drive available for 3.0 upgrade.
Software packages discount for user group members.
NeXTWorld Expo etc.


Please pass the news around to whoever might be interested.
Feel free to contact me if you have any questions.


Regards,
Hayward

phone: 613-763-3663
email: hlam@bnr.ca
From: bstring@MAINZ-EMH2.ARMY.MIL (BOB STRINGFIELD)
Newsgroups: comp.society.futures
Subject: Re:  List Status
Date: 4 Jan 93 11:19:45 GMT
Distribution: world
Organization: The Internet
X-Unparsable-Date: Mon, 4 Jan 93 12:14:19 CET

>i ain't got no mail for ages.

hmmmmm.....   so the future is not what it was 'cracked' up to be. hah!!!
--bob

***********************************************************************
Robert (Bob) L. Stringfield      Mainz Army Depot
UNIT 24218  P.O. Box 52:  APO AE 09185
COML (No ETS or Autovon available): 06131-696328 (Germany)
FAX: 06131-696467  IRC Nick - DeathStar (:ds)
bstring@mainz-emh2.army.mil or bstring%mainz-emh2.army.mil@vm1.nodak.edu
                   Truth:  IGNORANCE hates knowledge....
*************************************************************************
From: eytan@DPT-INFO.U-STRASBG.FR (Michel Eytan, LILoL, Univ. Strasbourg II)
Newsgroups: comp.society.futures
Subject: Re:  List Status
Date: 4 Jan 93 11:58:48 GMT
Distribution: world
Organization: The Internet

>is this list still active?
>--bob

i ain't got no mail for ages.

happy new year to all those still subscribed

--
Michel Eytan                             eytan@dpt-info.u-strasbg.fr
Lab Info, Log & Lang                              V: +33 88 41 74 29
22 r. Descartes, 67084 Strasbourg     F: +33 88 41 74 40
From: bstring@MAINZ-EMH2.ARMY.MIL (BOB STRINGFIELD)
Newsgroups: comp.society.futures
Subject: Re:  List Status
Date: 4 Jan 93 09:48:49 GMT
Distribution: world
Organization: The Internet
X-Unparsable-Date: Mon, 4 Jan 93 10:39:02 CET

is this list still active?
--bob
From: bstring@MAINZ-EMH2.ARMY.MIL (BOB STRINGFIELD)
Newsgroups: comp.society.futures
Subject: Re:  List Status
Date: 4 Jan 93 11:20:09 GMT
Distribution: world
Organization: The Internet
X-Unparsable-Date: Mon, 4 Jan 93 12:14:19 CET

>i ain't got no mail for ages.

hmmmmm.....   so the future is not what it was 'cracked' up to be. hah!!!
--bob
 
***********************************************************************
Robert (Bob) L. Stringfield      Mainz Army Depot
UNIT 24218  P.O. Box 52:  APO AE 09185
COML (No ETS or Autovon available): 06131-696328 (Germany)
FAX: 06131-696467  IRC Nick - DeathStar (:ds)
bstring@mainz-emh2.army.mil or bstring%mainz-emh2.army.mil@vm1.nodak.edu
                   Truth:  IGNORANCE hates knowledge....
*************************************************************************
Date: Mon, 4 Jan 1993 06:30:25 GMT
From: Dick Grady <grady@world.std.com>
Newsgroups: comp.society.privacy
Subject: Re: Zip+4 Problems?
Organization: The World Public Access UNIX, Brookline, MA
X-Submissions-To: comp-privacy@pica.army.mil
X-Administrivia-To: comp-privacy-request@pica.army.mil
X-Computer-Privacy-Digest: Volume 2, Issue 001, Message 9 of 10

In article <comp-privacy1.120.8@pica.army.mil> Dewey Coffman <ibmpa!vpdbox.austin.ibm.com!dewey@ibminet.awdpa.ibm.com> writes:
>
>
>	I'm a big fan of using my Zip+4 on my mail, does giving out this
>	"extra" +4 of zip code give out any more info about yourself
>	other than "where to send the mail"?

No.  In fact, it usually is a little less specific than your street
address.  For example, on my street, there are about 10 houses per "+4"
code.

-- 
Dick Grady           Salem, NH,  USA            grady@world.std.com
So many newsgroups, so little time!