HDTenEightyP/NetNews huggingface dataset:
From: alopez-o@neumann.uwaterloo.ca (Alex Lopez-Ortiz)
Subject: Re: A sorting Exercise
Organization: University of Waterloo
Date: Tue, 25 Aug 1992 21:17:45 GMT

In article <1992Aug25.184708.352@dartvax.dartmouth.edu>, scot@moosilauke.dartmouth.edu (Scot Drysdale) writes:
> The question about sorting a sequence on a closed loop with every crossing
> labeled is called Jordan Sorting (from the Jordan Curve theorem, I assume).
> It can be done in linear time.  See
> 
> K. Hoffman, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan, "Sorting
> Jordan Sequences in Linear Time," Proc. Symp. Computational Geometry,
> pp. 196-203 (1985).
> 

Jordan Sequences are a bit different than those proposed by the original
posting. In fact 6 1 5 4 3 2 is a jordan sequence corresponding to a 
Jordan curve crossing the real line in 6 then at 1, 5, 4, 3, 2.

This sequence does not have a Jorden sequence traversing through them
in the sense of the original posting.

>  I-----------------------------------I
>  I                                   I
>  I       I-------------------I       I                 
>  I       I                   I       I                     
>  I       I   I-----------I   I       I
>  I       I   I           I   I       I
>  I   I   I   I   I---I   I   I       I 
>  I   I   I   I   I   I   I   I       I
>=87==93===7==45==54==62==32==15=======I=====
>  I   I   I   I   I   I   I   I       I
>  I---I   I   I---I   I   I---I       I
>          I           I               I
>          I           I---------------I
>          I

Hope it helps.

-- 
Alex Lopez-Ortiz                              alopez-o@maytag.UWaterloo.ca
Deparment of Computer Science                       University of Waterloo
Waterloo, Ontario                                                   Canada
Newsgroups: comp.theory
From: mittle@watson.ibm.com (Josh Mittleman)
Subject: Closest center
Date: Thu, 03 Sep 1992 17:22:02 GMT
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
Organization: IBM T.J. Watson Research Center

I would appreciate any references on the following problem:

Given k sites, and n query vertices.  For each query vertex, report the
nearest site.

I am interested in the three-dimensional version of the problem.  Clearly,
one wants to pre-compute a data structure which allows fast queries.  Can
anyone suggest a good solution?

Thanks.

===========================================================================
Josh Mittleman (mittle@watson.ibm.com)
J2-C28 T.J. Watson Research Center, PO Box 704, Yorktown Heights, NY  10598
From: tim@normal.georgetown.edu (Tim Snyder)
Newsgroups: comp.theory
Subject: Looking for Edmund Ihler
Date: 26 Aug 92 23:22:46 GMT
Followup-To: tim@normal.georgetown.edu,comp.theory
Organization: Georgetown University, Washington DC

Hi.  I am looking for Edmund Ihler, W-7800 Freiburg, author of 
"Min. rectilinear Steiner trees for intervals on two parallel
lines."  The only information I have is what is here.  If anybody
knows of an address, electronic or virtual, please let me know.

Thanks kindly,
 Timothy Law Snyder
 Department of Computer Science
 Reiss 225
 Georgetown University
 Washington, DC 20057

tim@normal.georgetown.edu
(202) 687-6208
From: guest13@acsu.buffalo.edu (Javaid Aslam)
Newsgroups: comp.theory
Subject: NC-Completeness of Transitive Closure
Keywords: NC-completeness, NC-reduction
Date: 30 Aug 92 23:42:45 GMT
Organization: UB

I have this conjecture which might be refuted with some contradicting
evidence. Hope somebody can provide me at least some insight why this
can not be true:

Conjecture: The Transitive Closure problem is complete for the class NC
            (with respect to some "NC-reduction").

Thank you all ..

 -Javaid Aslam : guest13@eng.buffalo.edu
Newsgroups: comp.theory
From: femibyte@athena.mit.edu (Olufemi G Anthony)
Subject: Steiner Tree problem
Organization: Massachusetts Institute of Technology
Date: Sat, 29 Aug 1992 00:03:07 GMT

The problem is as follows :

	Given a Steiner tree, find an arrangements of cuts directed away
	from the root, each crossing one edge of the tree
        such that no two cuts "clash" i.e no two cuts cross an edge of
        the lattice (hexagonal or otherwise) of which the tree is part
	of in the same direction. 

Does anyone know of a geometrical approach to this problem. If
so, please send some references. 

Thanx,
Olufemi G. Anthony.
From: svalle@diku.dk (Per Laursen)
Newsgroups: comp.theory
Subject: Simulated Annealing for Weighted Vertex Cover
Date: 1 Sep 92 10:08:57 GMT
Organization: Department of Computer Science, U of Copenhagen

Does anyone out there know of any successful applications of Simulated
Annealing to the Weighted Vertex Cover Problem? I would appreciate any
pointers to publications or work in progress.

Thanks in advance,

Per S. Laursen (svalle@diku.dk)
Newsgroups: comp.theory
From: rabjab@golem.ucsd.edu (Jeff Bytof)
Newsgroups: comp.theory
Subject: Alien([s]|[\^]([3-9]|[1-9]([0-9])+))?
Date: 28 Aug 1992 20:28:05 GMT
Organization: sio
NNTP-Posting-Host: lutherlab.ucsd.edu
Keywords: regular expressions


     Is      

              Alien([s]|[\^]([3-9]|[1-9]([0-9])+))?       (37 chars.) 

     a correct regular expression matching the series of movie titles
     Alien, Aliens, Alien^3, Alien^4.... ?
     Are shorter regular expressions possible?


Jeff Bytof
rabjab@golem.ucsd
From: pmontgom@MATH.ORST.EDU (Peter Montgomery)
Newsgroups: comp.theory
Subject: Warning - Maple V lattice returns non-reduced basis
Date: 26 Aug 92 15:45:42 GMT
Reply-To: Peter Montgomery <pmontgom@MATH.ORST.EDU>

#       The lattice basis {v1, v2} where

#           v1 = [ 5,  7]      squared norm 74
#           v2 = [-3,  7]      squared norm 58

#       is not row-reduced, because
#       v1 - v2 = [8, 0] has squared norm 64 < 74.
#       However,  Maple V's lattice function
#       returns a basis with the two input vectors.

#       The problem seems to occur sometimes when

#       dot(v1, v1) > 2 |dot(v1, v2)| > dot(v2, v2)

readlib(lattice);
v1 := [ 5, 7];
v2 := [-3, 7];

outvecs1 := lattice(v1, v2);    # Fails to return reduced basis
outvecs2 := lattice(v2, v1);    # OK if smaller vector is input first
quit;
From: beigel-richard@CS.YALE.EDU (Richard Beigel)
Newsgroups: comp.theory
Subject: automata theory question
Date: 1 Sep 92 19:53:52 GMT
Reply-To: Richard Beigel <beigel-richard@CS.YALE.EDU>

We know that DPDAs can solve every decision problem that NFAs can
solve, because NFAs are equivalent to DFAs.  The same does not appear
to be true for function computation.  Allow NFAs and DPDAs to read a
character, write a character, or perform a stack operation during each
step.

Then an NFA can compute the function that maps xc to cx, for all x in
{a,b}^* and all c in {a,b}.  Clearly a deterministic Turing machine
can compute this function as well.  My question: Can a DPDA compute
this function?  Any other candidates for a function computable by NFAs
but not by DPDAs?
Newsgroups: comp.theory
From: chen@cs.tamu.edu (Jianer Chen )
Subject: Re: NC-Completeness of Transitive Closure
Keywords: NC-completeness, NC-reduction
Organization: Computer Science Department, Texas A&M University
Date: Mon, 31 Aug 1992 02:08:30 GMT

In article <BttLv9.Ao5@acsu.buffalo.edu> guest13@acsu.buffalo.edu (Javaid Aslam) writes:
>I have this conjecture which might be refuted with some contradicting
>evidence. Hope somebody can provide me at least some insight why this
>can not be true:
>
>Conjecture: The Transitive Closure problem is complete for the class NC
>            (with respect to some "NC-reduction").
>
>Thank you all ..
>
> -Javaid Aslam : guest13@eng.buffalo.edu

It is easy to show that NC has no complete problems with respect to 
any NC-reduction (as long as the reduction is in NC^k for some k) 
unless the NC hierarchy collapses, which is a very strong 
consequence. 

--- JC
From: zachr@solb1.essex.ac.uk (Zach R)
Newsgroups: comp.theory
Subject: Re: A Graph Theory Newsgroup, Perhaps?
Date: 26 Aug 92 16:50:14 GMT
Reply-To: zachr@essex.ac.uk (Zach R)
Organization: University of Essex, Colchester, UK

In article <BtB2vr.FF@news.cso.uiuc.edu> west@symcom.math.uiuc.edu (Douglas West) writes:
>There is a similar list called THEORY-NET, but it is much easier to handle
>the traffic in these newsgroups (many of the articles are the same).



I thought that THEORY-NET was the listserver version of comp.theory
A misconception?

Wake me up when there's a CFV for that, it's a good idea.

Richard
Newsgroups: comp.theory
From: litow@csd4.csd.uwm.edu (bruce e litow)
Subject: complexity of rational function integration
Originator: litow@proclus.csd.uwm.edu
Keywords: parallel complexity, rational functions, definite integrals
 
Organization: Computing Services Division, University of Wisconsin - Milwaukee
Date: Fri, 4 Sep 1992 13:28:30 GMT

Newsgroups: comp.theory
From: jfbuss@maytag.uwaterloo.ca (Jonathan Buss)
Subject: Re: Constructive proof of directed graph unconectivity
Keywords: CON NLOG NLOG-Complete
Organization: University of Waterloo
Date: Fri, 4 Sep 1992 14:51:19 GMT

In article <1992Sep3.161109.22586@sbil.co.uk> tdk@spitws75.sbil.co.uk writes:
>Immerman and Szelepcsenyi have shown NLOG = CO-NLOG so combining these
>results we see UNCON is indeed in NLOG.
>
>Is there a direct constructive proof of this fact ?

Yes.  Both Immerman and Szelepcsenyi proved the result by direct
construction.  An alternative formulation is given by Balcazar, Diaz
and Gabarro in _Structural_Complexity_II_, Springer-Verlag, 1990.

>Tim Kempster

Jonathan Buss
From: kurt@dna.lth.se (Kurt Swanson)
Subject: Mulitple Dimension Voronoi Diagrams (was Re: Closest center)
Organization: Lund Institute of Technology, Sweden
Date: Fri, 4 Sep 1992 07:21:52 GMT

mittle@watson.ibm.com (Josh Mittleman) writes:
>After a few minutes thought, I realize that what I wanted was a 3D Voronoi
>diagram.  Can someone therefore direct me to a reference on that subject?

See: "Computational Geometry: An Introduction", Franco Preparata and
        Michael Ian Shamos, section 6.3.2, pages 253--255, Springer-Verlag,
        1988;
for a general discussion, and the following two journal references:

F. P. Preparata, Steps into computational geometry, Technical Report.
        Coordinated Science Laboratory, University of Illinois, 1977.

V. Klee, On the complexity of d-dimensional Voronoi diagrams, Archiv
        der Mathematik, vol 34, pg 75--80, 1980. 

-- 
Kurt Swanson, Dept. of Computer Science,
Lunds universitet.  Kurt.Swanson@dna.lth.se
Newsgroups: comp.periphs
From: rattan@crs.cl.msu.edu ()
Subject: help with C-A-D on SIH 486B motherboard
Followup-To: rattan@crs.cl.msu.edu
Keywords: SIH 80486B motherboard, Ctrl-Alt-Del problem
Organization: Michigan State University
Distribution: na
Date: Sun, 30 Aug 92 15:24:35 GMT

I may be posting to the wrong group, apologies for that. Recently
I bought a 486 motherboard with AMI BIOS (SIH 486B Cache Main Board),
and it hangs on a software reset (Ctrl-Alt-Del)! What could be
wrong? There is no option in the CMOS setup (advanced or standard)
to enable /keyboard interupt/. IS the board bad or I am missing
something nontrivial. Please e-mail the response and thanks in advance.
- ishwar (rattan@crs.cl.msu.edu)
From: kmeyer@daisy.ee.und.ac.za (Kevin Meyer)
Newsgroups: comp.periphs
Subject: How to read AT-HD controller sector buffer?
Date: 31 Aug 1992 12:14:35 GMT
Organization: Univ. Natal, Durban, S. Africa
NNTP-Posting-Host: daisy.ee.und.ac.za

Hi,
Could anyone (someone? everyone?!?) out there please give me the code
necessary to read/write the hard-drive controller sector buffer on the AT?

I have the complete command list, and command sequences, but need to know how
to write to the sector buffer itself. It has been my experience that 
 REP INSB (or INSW) do NOT work (returning only every odd byte) and that
 perhaps DMA transfers are called for.

 Thanks for any replies,
   Kevin
Newsgroups: comp.periphs
From: kr@asacsg.mh.nl (Koos Remigius)
Subject: Re: old hard disk drive
Organization: ASAC Nederland b.v.
Date: Wed, 26 Aug 92 07:10:59 GMT

sk@jenny.informatik.uni-dortmund.de (Stefan Kirchberg) writes:
: I recently got a Micropolis 1325 hard disk (85 MBytes, ST 506
: interface, built 1985) together with a SCSI -> ST506 adapter. Now there
: is a problem formatting the disk. Is there anyone who knows the
: parameters of the drive?
: 
: Thanks in advance!
: 
: 	Stefan
: 
: -- 
:  Stefan Kirchberg                      sk@irb.informatik.uni-dortmund.de
:  Computer Science Department - IRB     Tel. from inside UniDO: 4700
:  University of Dortmund                     from outside: 0231/755-2422
:  W-4600 Dortmund 50,PO-Box 500500, Germany  Office: GB V/R.325
: 
: 
	This drive has 1024 cylinders.
			17  sect/track
			 8  heads, 71MB netto capacity.

	Cheers,

		Koos Remigius
 
-- 
Koos Remigius			      kr@mh.nl via internet backbones
Asac Nederland B.V	              uucp: ..!{uunet,hp4nl}!mh.nl!kr
Coenecoop 7, 2741 PG Waddinxveen,  The Netherlands
---------------- "/\/\/\/\/ K O O S /\/\/\/\/\/\/\/" ----------------
Newsgroups: comp.periphs
From: jaseguin@watserv1.uwaterloo.ca (John Seguin)
Subject: Calcomp DesignMate
Organization: University of Waterloo
Date: Fri, 28 Aug 1992 19:27:09 GMT

I'm considering purchasing a Calcomp DesignMate plotter.  It's a brand
new low-end Calcomp product.  It prints A - D size at up to 20"/s & at
.0005 resolution.  

I would be very grateful if anyone could fill me in on any rumours or
anything on this product.  I need a *dependable* product most of all.
The only problem is money ... I don't have much.  This CalComp product
seems to be a dream come true ... someone either pinch me or set me
straight.

Thanks tonnes in advance,

John.

(P.S.  Propaganda based on the name of a product is not very
convincing.  Many companies are having to put out junk/lesser quality
stuff to survive in a lowest-price/recession market.)
From: km@mathcs.emory.edu (Ken Mandelberg)
Newsgroups: comp.periphs
Subject: Safe for Backup Tapes?
Date: 31 Aug 92 14:44:19 GMT
Reply-To: km@mathcs.emory.edu
Organization: Emory University, Dept of Math and CS

I know the right way to handle backup tapes is to take them off site
so that a fire doesn't get your server and backup tapes at once.

However, is there any value in putting tapes that are going to be on
site into an inexpensive safe (a few hundred dollar model). Even if
the safe is fireproof, wouldn't the heat destroy the data?

---
Ken Mandelberg      | km@mathcs.emory.edu          PREFERRED
Emory University    | {rutgers,gatech}!emory!km    UUCP 
Dept of Math and CS | km@emory.bitnet              NON-DOMAIN BITNET  
Atlanta, GA 30322   | Phone: Voice (404) 727-7963, FAX 727-5611
Xref: sparky comp.periphs:1207 comp.periphs.printers:2519
From: tpeasant@cipc1.DaytonOH.NCR.COM (Tony Peasant)
Newsgroups: comp.periphs,comp.periphs.printers
Subject: deskwriter or stylewriter
Date: 1 Sep 92 16:59:54 GMT
Reply-To: tpeasant@cipc1.UUCP (Tony Peasant)
Organization: NCR Corporation - Dayton, OH

I need some help on choosing between the two printers mentioned above.
I know the style writer has 360 dpi vs 300 for the deskwriter but what are the
other differences, fonts true type ... Is the quality that much different on
resumes and buisness letters?  Thanks in advance.
-- 
Tony Peasant
Tony.Peasant@cipc1.Dayton.NCR.COM
...!uunet!ncrcom!cipc1!tpeasant
Xref: sparky comp.periphs:1187 misc.wanted:8071
From: pechter@ocpt.ccur.com (Bill Pechter)
Newsgroups: comp.periphs,misc.wanted
Subject: QICO2 info needed for Coherent Driver
Date: 30 Aug 92 16:00:04 GMT
Followup-To: comp.periphs
Organization: Concurrent Computer Corp.,Information Services


Also  -  anyone out there have specs and info on the Qic-02 command set and
register stuff. I've got  Genoa 3200 Galaxy tape unit (Archive QIC-36 drive
-60 mb-- with QIC02 interface adapter and a Genoa QIC02 interface to my 
pc.  The drive is standard - but the interface doesn't use the Archive
driver or a Wangtec driver under BSD... 

Just how different are these QIC02's anyway?
-- 
--------------------------------------------------------------------------------
        Bill Pechter, N2RDI           | The postman always pings twice.
        Concurrent Computer Corp.     | pechter@ocpt.ccur.com
        2 Crescent Place, Oceanport, NJ 07757 - Tel:908-870-4780 
Xref: sparky comp.periphs:1204 comp.sources.wanted:4165 alt.sources.wanted:1442 comp.misc:3487 comp.periphs.scsi:4318
From: news@mgse.UUCP (News Administator)
Newsgroups: comp.periphs,comp.sources.wanted,alt.sources.wanted,comp.misc,comp.periphs.scsi
Subject: SCSI archive files
Date: 1 Sep 92 05:00:01 GMT
Followup-To: comp.periphs
Distribution: world
Organization: mgse


Last Changed:	Sat Aug 29 20:06:05 CDT 1992

This is a periodic posting of information about some of the archives at
ftp.cs.tulane.edu and the available files from the SCSI-BBS, including
SCSI, ESDI, IPI, and Fiber Channel documents from the standards committees.

These files are available for FTP from ftp.cs.tulane.edu in the directory
pub/scsi. Files are stored in file areas as they are found in the BBS with
each area having a file named 'files.bbs' that tells what each file is. The
file pub/scsi/index.Z list each file area, it's descriptions and it's files.

Thanks to John Lohmeyer of NCR, a majority of the SCSI related files from the
SCSI BBS are now available for anonymous ftp. These files were sent to me by
Mr. Lohmeyer at his expense so that more people would have access to them.
The SCSI BBS (316-636-8700) contains a large amount of data relating to SCSI,
and ESDI as well as SCSI-2, IPI, and Fiber Channel, as well as the last
revision of the SCSI-1 standard before it went to publication by ANSI.

Most of the files in the SCSI archive are either archived with the ZIP utility
or compressed with the 'compress' program. Most of the text files are stored
as Wordstar word processing files. PKzip for PC/MS-DOS is included in the 
archive to allow users to break up the .ZIP files, and the PC/MS-DOS binaries
and .C source are also in the archive to convert the Wordstar documents to
ASCII text.

---
Mark Seiffert,  Metairie, LA.
uucp:           rex.cs.tulane.edu!mgse!marks or rex!mgse!marks
bitnet:         marks%mgse@REX.CS.TULANE.EDU
internet:       marks%mgse@rex.cs.tulane.edu or marks@mgse.UUCP

Newsgroups: comp.periphs
From: mfineman@cad018..intel.com ( Mark S. Fineman )
Subject: Re: Safe for Backup Tapes?
Organization: Intel Corporation, Santa Clara, CA
Date: Mon, 31 Aug 1992 19:07:39 GMT

In article <9421@emory.mathcs.emory.edu> km@mathcs.emory.edu writes:
>..., is there any value in putting tapes that are going to be on
>site into an inexpensive safe (a few hundred dollar model). Even if
>the safe is fireproof, wouldn't the heat destroy the data?
 You are correct: the temperature is important.

 Paper safes, drawers, etc., have a 350 (degrees F) rating.
 For a 350-1 (350 degrees, 1 hour) letter size file drawer, the,
 cost is $100 or more than for a normal file drawer, and the weight
 is  about 50 to 100 pounds more than a non-file rated file.  
 350-3 safes, etc., are available and probably can be moved by
 one person with some assistance from a second.

 Magnetic media safes have a 150 rating.  A 150-1 3 drawer cabinet
 the I saw in 1970 weighed 1200+ pounds and cost $1500 then.  It was
 not moveable by 3 normal people.  I didn't see any single drawe
 units around at that time.  (Magnetic media needs the 150 rating
 and may need additional control of humidity, which some vendors
 don't have, even though they sell their products specifically
 for storage of magnetic media, so what out.)

 For a while Sears had various fire rated cabinets, etc., in their
 office catalog.  You might try them.

 
-- 
(408) 765-4277; MS SC3-36, 2220 Mission College Blvd.,
P.O. Box 58119, Santa Clara, CA 95052-8119
 mfineman@scdt.intel.com
Newsgroups: comp.periphs
Subject: Re: Safe for Backup Tapes?
From: Graeme.Hart@bbs.actrix.gen.nz
Date: Mon, 31 Aug 1992 19:14:01 GMT
Organization: Actrix Information Exchange

In article <9421@emory.mathcs.emory.edu> km@mathcs.emory.edu writes:
> I know the right way to handle backup tapes is to take them off site
> so that a fire doesn't get your server and backup tapes at once.
> 
> However, is there any value in putting tapes that are going to be on
> site into an inexpensive safe (a few hundred dollar model). Even if
> the safe is fireproof, wouldn't the heat destroy the data?

NOT if the safe is designed as a fireproof safe.  Our safe at work has
walls 2 inches thick.  Sure, if the fire is hot enough for long enough,
the contents of the safe won't survive, but hopefully the fire brigade,
and the fire protection systems in your building can stop that from happening.

Once a week we send tapes offsite, but the rest just live in the safe.

> 
> ---
> Ken Mandelberg      | km@mathcs.emory.edu          PREFERRED
> Emory University    | {rutgers,gatech}!emory!km    UUCP 
> Dept of Math and CS | km@emory.bitnet              NON-DOMAIN BITNET  
> Atlanta, GA 30322   | Phone: Voice (404) 727-7963, FAX 727-5611

Graeme
Newsgroups: comp.periphs
From: berger@atropa (Mike Berger)
Subject: Re: SKUZZY drives driving me bonkers.... any suggestions ?
Organization: University of Illinois at Urbana
Date: Tue, 1 Sep 1992 04:38:06 GMT

afdenis@lims02.lerc.nasa.gov (Stephen Dennison) writes:
>1) The thumbwheels were incorrectly cabled and the settings (device 0, 1, 2 , 
>   3 , 4 etc.) are not what is actually being fed to the Adaptec

>2) The D-Shell terminator block on the *outside* of the 2-drive box is not 
>   doing the same thing as the internal terminator blocks (supplied with the 
>   SONY drives) do.

>3) The CD-ROM drives are defective.

>Has *anybody* else had similar experiences with trying to get these devices 
>to talk ? Does the MSCDEX.EXE file in the Adaptec software kit (which I 
>didn't purchase because the software I am trying to use these CD-ROMS with 
>*came* with a MSCDEX.EXE driver) differ in some way from the MSCDEX.EXE 
>that I *am* using ? 

>I have used the *internal* cable that came with the Adaptec host adapter 
>but got pretty much the same results. 
*----
It's always a good idea to try the most basic configuration.
Disconnect all other SCSI devices from the Adaptec controller.
Make sure all its jumpers are set correctly.  Be sure the internal
termination resistors are installed, the fuse is good, and the 
supply-terminator-power option is jumpered.

Use shorting jumpers to set the SCSI device ID on a CD-ROM drive.
Install internal termination resistors on the Sony CD-ROM if possible.
If you can install internal termination resistors, then you can use
a simple 50 pin cable with retangular headers on both ends.  Otherwise
you will need an in-line terminator for the internal cable, or you
will have to cable externally (possibly introducing another problem to
check for).

The idea, of course, is to make the simplest case work first.  Once
you've confirmed that both drives can be made to work by themselves,
you can work out the details to get them functioning together.
--
	Mike Berger
	Department of Statistics, University of Illinois
	AT&TNET     217-244-6067
	Internet    berger@atropa.stat.uiuc.edu
Newsgroups: comp.periphs
From: N51L5201@ncsuvm.cc.ncsu.edu (David Auerbach)
Subject: DELL monitors: 15LR
Organization: North Carolina State University
Date: Fri, 4 Sep 1992 19:52:12 GMT

Does anyone know much about the above named; it is supposed to be made for
DELL by NEC but doesn't exactly correspond to any particular NEC model.  Would
like comments from anyone who has one or who has investigated.  Thanks.