HDTenEightyP/NetNews huggingface dataset:
From: jwhiting@joyce.Doc.Provo.Novell.COM (Joyce Whiting)
Newsgroups: comp.human-factors
Subject: job opening
Date: 16 Dec 92 22:08:46 GMT
Organization: Novell, Inc.

Usability Services Specialist

Novell, Inc. is seeking Usability Specialists to help us develop usability  
services at Novell corporate headquarters in Provo, Utah.

Candidates for this new position should have an MA in Human Factors  
Engineering, Experimental Psychology, or closely related field. Experience  
should include 5+ years in usability evaluation, plus significant  
experience in interface design, technical writing and editing, or software  
programming and testing. Experience with GUI interfaces and project lead  
experience are also helpful.

Because the persons we hire will serve as usability consultants to  
development teams, strong negotiating and interpersonal skills are a must.  
A demonstrated aptitude for working with computers and computer software  
is also a must.

Specific assignments may include 
	-Mentoring others as they develop usability skills 
	-Evaluating interface, documentation, help, and electronic manuals  
	-Writing usability test plans, scripts, and reports
 	-Conducting lab and field usability studies
 	-Installing, operating, and maintaining networks and lab equipment

Novell, Inc. provides a competitive benefits package and is an equal  
opportunity employer. Salary is negotiable, depending on experience.

To apply, please send your resume and an introductory letter with your  
salary history to

Joyce Whiting, Usability Services Manager
MS C-23-1
Novell, Inc.
122 E. 1700 S.
Provo, Utah 84606-6194
Phone: (801) 429-3270
Fax: (801) 429-3002
From: anielsen@uniwa.uwa.edu.au (Andrew Nielsen)
Newsgroups: comp.human-factors
Subject: Storyboarding
Followup-To: comp.human-factors
Date: 15 Dec 1992 04:04:37 GMT
Organization: Winthrop Technology
Distribution: world
NNTP-Posting-Host: andrewn-mac.wt.uwa.edu.au

Hello world,

I think this is the correct place to post this, but please correct me
if I'm wrong.

I've been asked to assist staff at our campus in designing multimedia
projects, and one of them asked for more information on the concept
of storyboarding.  After scouring my reference library, I'm at a loss,
so am looking for good references to books/articles which might help.

Any advice gratefully received!

_________________________________________________________________________
Andrew D. Nielsen                    Internet : anielsen@uniwa.uwa.edu.au
Computer Support Officer             AppleLink: AUST0190
Winthrop Technology                  
The University of Western Australia                    Tel: +61-9-3801757
NEDLANDS WA 6009   AUSTRALIA                           FAX: +61-9-3821688
Xref: sparky comp.theory:2719 sci.crypt:5771
From: george@minster.york.ac.uk
Newsgroups: comp.theory,sci.crypt
Subject: High-order Primitive Polynomials for CRC's
Date: 16 Dec 92 13:54:41 GMT
Organization: Department of Computer Science, University of York, England

Does anyone have a reference or references for primitive polynomials
of order >40. Am needing very reliable burst-error detection. Also,
references on burst-error detection techniques would be useful. Esp.
interested in evaluating how effective a prim. polynomial of order N
is for burst-error detection.

Many thanks - George Bolt

Email: george@psychmips.york.ac.uk
(Try george@minster.york.ac.uk if any problems)
Newsgroups: comp.theory,sci.crypt
From: rgep@emu.pmms.cam.ac.uk (Richard Pinch)
Subject: Re: High-order Primitive Polynomials for CRC's
Summary: See W. Stahnke, Maths of Computation 27 (1973) 977-980.
Keywords: Primitive polynomial
Organization: Department of Pure Mathematics, University of Cambridge
Date: Thu, 17 Dec 1992 12:03:04 GMT

In article <724514081.15434@minster.york.ac.uk> 
george@minster.york.ac.uk writes:
>Does anyone have a reference or references for primitive polynomials
>of order >40.
[...]
>
According to Lidl and Niederreiter's book "Finite fields", there is
a list of primitive polynomials over GF(2) [which I presume is what
is wanted] of degrees up to 168 in a paper of W. Stahnke, Maths of
Computation 27 (1973) 977-980.

Richard Pinch
From: cs89nnj@brunel.ac.uk (Nina Joshi)
Newsgroups: comp.theory
Subject: damsel in distress over comp. theory
Date: 21 Dec 92 01:06:06 GMT
Organization: Brunel University, Uxbridge, UK
X-Newsreader: TIN [version 1.1 PL8]

I studied software and hardware standards and practices in a unit and have come
to the conclusion that most are too idealistic. The assumption prevalent in
most computing theory is that it is possible to maintain an engineering
standard....it isn't unless enforced....a car can be built in a large
production plant in one way, leaving less room to mess up the production
stage...however, software can be designed and constructed in umpteen number of
ways and unless a guideline is adhered to, the end product may be an
inefficient piece of junk... 

I am not revering standards in all situations, but they would help maintain
consistency in software production and use...I am currently undertaking a
consultancy project with a large firm. The chaos is apparent, and to recommend
standards for use of the software seems to be too optimistic. The particular
section I am dealing with needs to be recommended practical, realistic
standards, applicable in a workshop...

Any ideas??
-- 
***********************************
* Nina Joshi                      * 
* at Brunel University            *  
* doing Applied Computer Systems  *  
*                                 *
* But I don't know why!!          * 
Newsgroups: comp.theory
From: belkacem@pop.ibp.fr (Zerrouk BELKACEM)
Subject: Interval Routing
Organization: Laboratoire MASI, Paris, France
Date: Wed, 16 Dec 1992 12:41:58 GMT

Hi, 

I'm working on a VLSI implementation of a message router using interval
 labeling like in the INMOS C104.

I would like to have some contacts with persons working in this field.
And, welcome for informations on  recent advances concerning
 this topic.

 The only refences i have are the following:  

J.Leeuwen and R.B Tan, "Interval labeling", the computer journal vol30 1987.

N.Santoro and R.Khatib, "Labeling and implicit routing in networks", the
computer journal vol 28 1985. 

If you have e-mails of these authors please send them to me.

Thanks in advance.

Belk.
-- 
......................................
Belkacem ZERROUK                        
CAO_VLSI/MASI UPMC PARIS VI            
e-mail: zerrouk@masi.ibp.fr             
Newsgroups: comp.theory,comp.compilers
From: assmann@karlsruhe.gmd.de (Uwe Assmann)
Subject: graph grammar classes
Reply-To: assmann@karlsruhe.gmd.de (Uwe Assmann)
Organization: Compilers Central
Date: Wed, 16 Dec 1992 08:51:45 GMT
Followup-To: comp.theory
Keywords: theory, question

1) Does anybody know some literature about graph grammar classes /
hierarchy / classification analogous to the hierarchy of attribute
grammars?

I know the LNCS volumes on graph grammars but it seems that nothing is in
there.

2) Are there any papers on the correspondence between graphs and the
Entity-Relationship model from databases? (Relationships are graphs or
hypergraphs).

3) Besides graph grammars, are there other graph manipulation formalisms?

Thanks for your effort. I'll post a summary.

Uwe Assmann
GMD Forschungsstelle an der Universitaet Karlsruhe
Vincenz-Priessnitz-Str. 1     
7500 Karlsruhe GERMANY
Email: assmann@karlsruhe.gmd.de Tel: 0721/662255 Fax: 0721/6622968
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.
From: robg@wsinfo11.info.win.tue.nl (Rob Gerth)
Newsgroups: comp.theory
Subject: Re: P=NP??? $50,000
Keywords: Money
Date: 17 Dec 92 00:30:00 GMT
Reply-To: robg@info.win.tue.nl
Distribution: inet
Organization: Eindhoven University of Technology, the Netherlands

In article <1glp51INN1gg@nunki.anu.edu.au> jmr@cs.anu.edu.au (Mike Robson) writes:
>>From: nrswart@phonon.uwaterloo.ca (Nicholas R. Swart)
>>Subject: S. Gismondi and E.R. Swart's research reports.....
>[a few lines omitted]
>
>>So far things are looking very good. In an earlier post someone said they
>>would put $10,000 down that the proof is correct. I'll raise that to
>>$50,000.
>>Nicholas Swart
>
>If this offer has not been withdrawn yet, I hereby accept.
>
>The ways in which the proof is incorrect are at least three. Of course
>only one step needs to be incorrect for the whole proof to be incorrect.
>
	< pointing out some mistakes >

What puzzles me is the complete silence of Gismondi and Swart in this thread.
From the potential winners of the next Turing award, who knows
maybe the field medal, I expect some interest in getting the proofs debugged.
Of course all of this discussion might have occured off-line but somehow I
doubt it.

So how about it Swart? Why not put your mouth where your money is.
Rob










-- 
# internet:     robg@win.tue.nl         | Rob Gerth		              #
# EUT:		HG 8.85			| Department of Computing Science     #
# voice:	+31-(0)40-474389/4124	| Eindhoven University of Technology  #
# fax:		+31-(0)40-463992	| 5600 MB Eindhoven, The Netherlands  #
From: fry@tara.harvard.edu (David Fry)
Newsgroups: comp.theory
Subject: Re: Are Knuth's "Art of Computer Programming" books s
Keywords: Knuth books
Date: 17 Dec 92 07:12:53 GMT
Article-I.D.: husc3.1992Dec17.021254.18601
Organization: Harvard Math Department

In article <1992Dec16.231320.12021@tellab5.tellabs.com> jab@tellabs.com (Jeff Brooks) writes:
>I've recently completed my first couple of classed towards a Masters in CS
>and was told by one of my professors that Knuth's multi-volume set of books
>"The Art of Computer Programming" are THE classic computer science books.
>
>My questions are, are these books still worth reading or are they outdated?
>The copy of volume 1 I found has a copyright date of 1973, so, should I
>just read them as a historical reference or is most of the technical content
>still applicable to today's programming methods?
>
>Thanks in advance for your opinion or any other references that you can
>recommend instead.

I believe the Knuth books are the greatest books I've ever seen.
I'm continually amazed by their breadth, depth, and outright
scholarship.  They're a remarkable accomplishment and I hope the
fourth volume comes out soon.

I'm sure they're a tad dated now, maybe reflecting a mindset that is
not entirely modern, rather than filled with material that is better
understood now.  And certainly some modern topics are missing or
under-represented, such as parallel programming.  But if you read
those books, and complete the exercises, I think you'll be very
well prepared to tackle any problem.  And, yes, 99% of the material is
still applicable to current day-to-day programming.

David Fry                                  fry@math.harvard.edu
Division of Applied Sciences               fry@huma1.bitnet
Harvard University                      ...!harvard!huma1!fry
Cambridge, MA  02138
Newsgroups: comp.theory
Subject: 2 stack PDA and other questions
From: khmak@miavx1.acs.muohio.edu
Date: 13 Dec 92 16:20:48 -0500
Organization: Miami University Academic Computer Service"

A few days ago someone posted a few questions that I was also curious about
knowing the answer to.  Here they are:


Why is a 2 stack PDA equivalent to a turing machine?
Why is it important to know if there is at least one decision problem that is
undecidable?

Who cares if P=NP?  Or what is the significance of the question "Is P=NP"?

Here is one of mine:

Why is L={www|wE{a,b}+}  not contect free?


Thank you for the information.

Karl
Newsgroups: comp.theory
From: charles@probitas.cs.utas.edu.au (Charles Lakos)
Subject: LOOPN - Language for Object-Oriented Petri Nets
Organization: University of Tasmania, Australia.
Date: Tue, 15 Dec 1992 05:21:32 GMT


I wish to announce the availability of a compiler, simulator and associated
source control for an object-oriented petri net language called LOOPN.

In LOOPN, a petri net is an extension of coloured timed petri nets.  The 
extension means firstly that token types are classes.  In other words, they 
consist of both data fields and functions, they can be declared by 
inheriting from other token types, and they can be used polymorphically.  
The object-oriented extensions also mean that module or subnet types are 
classes.  In other words, the declaration of a subnet encapsulates 
constants, types, places, transitions, access functions and parameters.  
These module types may be declared by inheriting from other modules and can 
be used polymorphically.

LOOPN has been developed over a period of about 5 years at the University of
Tasmania, where it has been used in teaching computer simulation and the
modelling of network protocols.

Further details on the syntax of LOOPN, its application and the conditions
under which it is distributed are available in the distribution.

The LOOPN compiler, simulator and associated documentation is available by
anonymous ftp from 
        ftp.utas.edu.au         (131.217.10.1)
as 
        departments/computer_science/loopn.tar.Z

-- 
--
Charles Lakos.                               C.A.Lakos@cs.utas.edu.au
Computer Science Department,                 charles@probitas.cs.utas.edu.au
University of Tasmania,                      Phone:    +61 02 20 2959
Sandy Bay, TAS, Australia.                   Fax:      +61 02 20 2913
Newsgroups: comp.theory
From: boerncke@kirk.fmi.uni-passau.de (Frank-Roland Boernke)
Subject: Real Numbers vs. Rational Numbers?
Organization: University of Passau, Germany
Date: Wed, 16 Dec 1992 09:54:12 GMT

In lectures we talked about the RAM, a formal machine-model that is proved
to be as powerful as turing-machines(TM) and vice versa, according to the
Church-Turing-Thesis. This seems to be ok until you say, that the RAM allows
only natural numbers in its registers (or rational-numbers, since they are 
countable). Our professor told us, that RAMs are allowed to store REAL numbers
too AND they are  still as powerful as an ordinary turing machine. I claimed, this
can`t be true, since there isn`t any possibility to work with irrational 
numbers in TMs. 

Of course, e.g. you can compute Pi up to as many digits as you want, but in every
step  of computation you only have an approximation - a rational number.

Therefore, a machine-model, that allows real numbers, must be more powerful
than another one that does not. My professor said, that isn`t a problem but
I don`t agree. Who is right?

If I am wrong, please let me know where the fault is.

Thanks in advance.

 
-------------------------------------------------------------------------
Frank Boerncke                       ,,,   University of Passau - Germany
boerncke@kirk.fmi.uni-passau.de     (.~.)            phone: +49 0851 2267
--------------------------------oOO--(_)--OOo---------------------------
From: rst@vuse.vanderbilt.edu (R. Sritharan)
Subject: Re: 2 stack PDA and other questions
Organization: Vanderbilt University School of Engineering, Nashville, TN, USA
Date: Sun, 13 Dec 1992 23:57:05 GMT

In article <1992Dec13.162048.14632@miavx1.acs.muohio.edu> khmak@miavx1.acs.muohio.edu writes:
>A few days ago someone posted a few questions that I was also curious about
>knowing the answer to.  Here they are:
>
>
>Why is a 2 stack PDA equivalent to a turing machine?
>Why is it important to know if there is at least one decision problem that is
>undecidable?
>
>Who cares if P=NP?  Or what is the significance of the question "Is P=NP"?
>
>Here is one of mine:
>
>Why is L={www|wE{a,b}+}  not contect free?
>
>
>Thank you for the information.
>
>Karl


and here is the previous post that is referred to.


>>Article: 3636 of comp.theory
>>Newsgroups: comp.theory
>>Subject: quit
>>Message-ID: <1992Dec11.113208.14609@miavx1.acs.muohio.edu>
>>From: jmcrider@miavx1.acs.muohio.edu
>>Date: 11 Dec 92 11:32:08 -0500
>>Followup-To: comp.theory
>>Distribution: world
>>Organization: Miami University Academic Computer Service"
>>Summary: sorry about the subject
>>Lines: 14

>>I have a few questions that you wizards should be able to answer easily.


>>Why is a two stack PDA equivalent to a Turing machine?

>>Why is it important to know that there is at least one problem that is
>>undecidable?

>>Who cares if P=NP?  What is the significance?


>>Thanks alot

>>JMcrider

Why do I get the feeling that someone is trying to get
solutions to his/her home work problems ? Please note
that both the messages have originated from the same
site.

R. Sritharan
From: clong@romulus.rutgers.edu (Chris Long)
Newsgroups: comp.theory
Subject: Knuth's "Art of Computer Programming"
Date: 21 Dec 92 04:28:27 GMT
Organization: Rutgers Univ., New Brunswick, N.J.


Speaking of Knuth's _Art of Computer Programming_, does anyone know
when the next volume is coming out?  I've been waiting for it and
the next "Star Wars" movie seemingly forever (come to think of it,
has anyone ever seen Knuth and Lucas at the same time?).
-- 
Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618

"S.B., with an I.Q. of 161, failed to complete his course of study,
running away instead with his professor's wife."
H. J. Eysenck, _Know Your Own I.Q._
Newsgroups: comp.theory
From: klaus@hal.nta.no (Klaus Gaarder FNI)
Subject: Re: 2 stack PDA and other questions
Organization: Norwegian Telecom Research
Date: Mon, 14 Dec 92 12:54:05 GMT

So - they presumably did get their homework done...........

(ref :  5027	Re: 2 stack PDA and other questions           [57] R. Sritharan)

Isn't there a 'comp.lazy.homework' group??
-- 
    __o   
  _`\<,_  
 (*)/ (*) Claudio Caputti
+++++++++++++++++++++++++++++++++++++++^++++++++++++++++++++++++++++++++++++++
Free will - the result of chaotic amplification of quantum events in the brain.
------------------------------------------------------------------------------
From: yousten@atlantis.CS.ORST.EDU (Ken Yousten)
Newsgroups: comp.theory
Subject: Re: Pattern matching: three problems
Date: 17 Dec 92 02:37:54 GMT
Article-I.D.: leela.1gop63INNn2n
Distribution: inet
Organization: Computer Science Outreach Services - Oregon State University
NNTP-Posting-Host: atlantis.cs.orst.edu


In article <ByzqMv.9F@clss1.bangor.ac.uk> gerry@sees.bangor.ac.uk (Gerry Wolff) writes:
>Here are three problems related to pattern matching. Solutions will
>be gratefully received!

You may want check out a recent comprehensive technical report
surveying a wide variety of string matching problems.  From what I've
heard and read so far, this looks like a nice thorough piece of
work.  It mentions the theoretical work of Arratia and Waterman on
string matching with i.i.d. random sequences, which may be relevant
to your problems.

The report can be obtained from princeton.edu (from what I remember it
is in directory pub/graham) using anonymous ftp.

Sorry I can't be of more direct help right now, but it seems likely that
this report will be of more help to you than I would be anyway.
--
Ken Yousten
yousten@atlantis.cs.orst.edu
Newsgroups: comp.theory
From: gtall@ogre.cica.indiana.edu (Gerry Allwein)
Subject: Re: LOOPN - Language for Object-Oriented Petri Nets
Organization: Indiana University
Date: Tue, 15 Dec 1992 11:41:48 GMT

What kind of an interface does LOOPN have? Does it have a Mac interface?

Gerry

Newsgroups: comp.theory
From: greg@cs.washington.edu (Greg Barnes)
Subject: Re: P=NP??? $50,000
Keywords: Money
Organization: Judy Vickery Fan Club, Saarbr\"ucken Chapter
Date: Fri, 18 Dec 92 13:12:05 GMT

In article <4839@svin09.info.win.tue.nl> robg@info.win.tue.nl writes:
>What puzzles me is the complete silence of Gismondi and Swart in this thread.
>From the potential winners of the next Turing award, who knows
>maybe the field medal, I expect some interest in getting the proofs debugged.

From the Home Office in Puyallup, Washington, it's the...

Top Ten Reasons Gismondi and Swart Haven't Responded to the Postings on
  comp.theory
-----------------------------------------------------------------------
10.  Gismondi's dog ate the crucial lemma.
 9.  Haven't logged in since Mike Robson flooded their mailboxes with
        e-mail messages demanding his $50,000.
 8.  On advice of counsel, further details will not be revealed until the
        patent is obtained.
 7.  On the run from the NSA after using their algorithm to break numerous
        government public-key encryption schemes.
 6.  Rubbed out by Chris Long to avoid paying off his $1000 bet.
 5.  After seeing pictures of Somalia, decided a bunch of optimization
        problems just aren't so damned relevant; joined the Peace Corps.
 4.  Don't want a bunch of pesky New York Times reporters calling them up
        at all hours.
 3.  Car overturned while driving to Guelph with their new manuscript;
        currently convalescing in the cabin of their `number one fan.'
 2.  After factoring a few million numbers, caught a glimpse of the
        ultimate pattern of Creation; last seen gibbering in a dark corner.
 1.  Busy simulating their $O(n^{6}$ Graph Isomorphism algorithm by hand on
        two 100-node graphs; should be done by 32,992 AD.


                                Greg Barnes
                                greg@cs.washington.edu
-----------------------------------------------------------------------
I hope everyone's taking notes in case there's another STOC Follies.
From: jmr@cs.anu.edu.au (Mike Robson)
Newsgroups: comp.theory
Subject: P=NP??? $50,000
Date: 16 Dec 1992 10:18:57 +1100
Organization: Computer Science Department, ANU, Australia
Distribution: inet
NNTP-Posting-Host: nunki.anu.edu.au
Summary: The proof is clearly wrong
Keywords: Money



>Newsgroups: comp.theory
>Path: gene.fwi.uva.nl!fwi.uva.nl!sun4nl!mcsun!uunet!zaphod.mps.ohio-state.edu!uwm.edu!cs.utexas.edu!torn!watserv2.uwaterloo.ca!watserv1!phonon.uwaterloo.ca!nrswart
>From: nrswart@phonon.uwaterloo.ca (Nicholas R. Swart)
>Subject: S. Gismondi and E.R. Swart's research reports.....
>Message-ID: <ByJIsL.B4y@watserv1.uwaterloo.ca>
>Sender: news@watserv1.uwaterloo.ca
>Organization: University of Waterloo
>Date: Mon, 30 Nov 1992 17:48:20 GMT
>Lines: 20

[a few lines omitted]

>So far things are looking very good. In an earlier post someone said they
>would put $10,000 down that the proof is correct. I'll raise that to
>$50,000.
>
>Nicholas Swart
>Dept. of Elec. and Comp. Engineering
>University of Waterloo
>Waterloo, Ontario
>CANADA
>N2L 3G1
>
>

If this offer has not been withdrawn yet, I hereby accept.

The ways in which the proof is incorrect are at least three. Of course
only one step needs to be incorrect for the whole proof to be incorrect.

1. The isomorphism paper relies on a claim that "Every solution to formulation
F3 can be represented by an expression of the form"
t = \sum \alpha _i q_i;
no proof of this claim is made and the authors do not know a proof.

2. The main theorem of the isomorphism paper is not merely unproven
but invalid. I have already posted a counterexample to comp.theory.

3. The "N=1" paper's claim for solution of NP-Complete problems would
not follow even if the theorem of the isomorphism paper were correct.
In detail corollary 1 of the isomorphism paper (which would be valid
if the theorem were valid) relies on the fact that if Ta=b and T has nonzero
entries wherever Q does (and T has no negative entries), Qa has nonzero
entries which are a subset of the nonzero entries of Ta (i.e. of b)
and so, since Qa has the same number of nonzero entries as b, it follows that
Qa=b.
In the claimed proofs of linear programming formulations of NP-Complete
problems in the "N=1" paper, there is no such argument possible, since
we have merely a condition that Ta= some matrix with specified values
in a subset of its entries; this is not sufficient to prove Qa= another
such matrix.

Deficiency 1 in the proof can perhaps be fixed (I believe the assertion
is probably valid but I can't prove it). Deficiency 3 can possibly be
overcome by a completely new argument (I doubt it). Deficiency 2 is fatal.
I do not know that the algorithm is incorrect but the proof definitely is.


You can send the cheque to

Dr J. M. Robson,
Department of Computer Science,
Australian National University,
GPO Box 4,
Canberra, ACT 2601,
Australia.
Newsgroups: comp.theory