HDTenEightyP/NetNews huggingface dataset:
From: mdsouza@eng.clemson.edu (Melroy Dsouza)
Subject: thesis
Keywords: graphics, plantfloor, feedback, hypercard
Reply-To: mdsouza@eng.clemson.edu
Organization: College of Engineering, Clemson Univ.
Date: Wed, 27 Jan 1993 18:25:56 GMT

I am currently doing my masters thesis in the area of graphical representation of information to operators on the plantfloor so as to give cognitive feedback to users of the status of a process or system. I intend prototyping the interface using hypercard. If any of you out there have any suggestions regarding this area, they would be most welcome. post replies to:

mdsouza@eng.clemson.edu

Melroy
From: toin@blade.stack.urc.tue.nl (Toin Bloo)
Newsgroups: comp.human-factors
Subject: Re: Ways of recording screen sequences without using a videocamera.
Date: 22 Jan 93 15:05:10 GMT
Organization: MCGV Stack, Eindhoven University of Technology, the Netherlands.
X-Newsreader: TIN [version 1.1 PL6]

Nicola Spielmann (spielman@sapwdf.UUCP) wrote:
: 
: problem: we are not satisfied with the quality of videotapes taken by a
: videocamera from the computermonitor.
: There are to be ways to bypass the camera by sending the signal of the
: computer (UNIX HP  X-Terminals) directly to the videorecorder.

I thought this wouldn't be possible because:
   1) The speed (ferquency) of moving the electron-beam of a computermonitor
      is (much) higher then the speed of video (or television).
   2) There are far many dots on a computermonitor then there are on video.
   3) There are more lines vertically too.

On MS-DOS boxes it's perhaps possible if you use a CGA compatible screen
with a reprogrammed CRTC (the hardware controller) for use with the frequency
of your video system (differing between Europe/America/Japan...)


-- 
Toin Bloo                                 The Young Scientists Eindhoven
+31 40 622681 (home)                      Frederiklaan 163  5616 NE  Eindhoven
toin@stack.urc.tue.nl                     The Netherlands, Europe
                                          (toin%storc@dutentb.et.tudelft.nl)
Newsgroups: comp.human-factors
From: zakon@hicup.mitre.org (Robert H Zakon)
Subject: Re: RSI - NeXT
Reply-To: zakon@hicup.mitre.org
Organization: The MITRE Corporation
Date: Thu, 21 Jan 1993 17:47:47 GMT

Supposedly NeXT will be implementing Apple's ADB (Desktop Bus) for keyboards
and mice.  This means that you will be able to use Apple's new ergo-keyboard
which provides a wrist-pad and the keyboard can be split in the middle up to
a 30 degree angle.  Currently, they are being sued because of the design, but
still plan on having it out in a few months.  I have no idea as to what kind
of NeXT upgrade will be needed.

Robert H Zakon, rzakon@mitre.org

Newsgroups: comp.human-factors
From: lkoch@dale.hssc.ksc.nasa.gov
Subject: Re: Ways of recording screen sequences without using a videocamera.
Organization: NASA
Date: Mon, 25 Jan 1993 14:22:44 GMT

This concept is currently under investigation on our project as well.  We are  
trying to capture the screen images off of a DEC 5000/240 system to aid in  
generating the user's manuals,etc.  

I took down the Folsom Research reference.  Any additional information on  
vendors or suggestions would be appreciated.

------------------------------------------------
Linda M. Koch
NASA,  DL-DSD-24  Real-Time Software Section
Kennedy Space Center, Fla.  32899
Internet <lkoch@troy.hssc.ksc.nasa.gov> (NeXT Mail Preferred)
Newsgroups: comp.human-factors
From: Daniel Schwabe <schwabe@inf.puc-rio.br>
Subject: Sound in IC interfaces?
X-Useragent: Nuntius v1.1.1d17
X-Xxmessage-Id: <A78971EFC9011802@mac-dan.inf.puc-rio.br>
Organization: Departamento de Informatica    PUC-Rio
Date: Mon, 25 Jan 1993 12:32:14 GMT
X-Xxdate: Mon, 25 Jan 93 13:31:11 GMT
X-Posted-From: mac-dan.inf.puc-rio.br
NNTP-Posting-Host: sol.ctr.columbia.edu

Can anybody point me to the literature on the use of SOUND in
Human/Computer interfaces?
Thanks,

Daniel Schwabe                  Dept. de Informatica, PUC-Rio
Tel: +55-21-529 9544/274 4449   R. M. de S. Vicente, 225
Fax: +55-21-511 5645            Rio de Janeiro, RJ 22453-900, Brasil
Newsgroups: comp.human-factors
From: dmitchell@trc.amoco.com (Donald H. Mitchell)
Subject: HCI journals, newsletters, and societies
Originator: zdhm06@scholar
Organization: Amoco Production Company, Tulsa Research
Date: Thu, 28 Jan 1993 19:26:15 GMT


I apologize if there is a faq with this info. I didn't see one.

Where can I find a list of journals, newsletters, and societies that
deal with HCI and particularly usability?  I already know that SIGCHI
exists and holds an annual meeting: I don't know the quality of its
publication (and $52 is a lot to pay to find out).

Thank you
-- 
Don Mitchell			dmitchell@trc.amoco.com
Amoco Production Company	(918) 660-4270
Tulsa Research Center
P.O. Box 3385, Tulsa, OK 74102
Xref: sparky comp.human-factors:3017 comp.cog-eng:374
Newsgroups: comp.human-factors,comp.cog-eng
Subject: Re: Multi-user usability testing (repost)
From: mef@cerc.wvu.wvnet.edu (Michael E. Fotta)
Date: Thu, 21 Jan 1993 16:41:37 GMT
Followup-To: comp.cog-eng
Organization: Concurrent Engineering Research Center
Summary: I also need to set up procedures to do multi-user usability. I amin the "conceptualizing and info. gathering stage right now.


I am also trying to understand how to best test for "groupware" usability.
AT this time I am trying to do a number of things including; 1) reviewing
gware/CSCW literature for relevant info. ( any specific suggestions? I already 
have the Grudin article). 2) forming a high-level quasi-functional taxonomy 
of functions gware covers 3) trying to understand just what people do in
groups (just got some interesting books on "group communications, esp. "small
groups"). My idea here is to build a strawman functional model and to get ides
for methodologies for the usability procedures. Two methods which already
crop up are "Ethnographic (3 papers in CSCW'92 on this)" and "interaction
Process Analysis" (there is a book by the same name by Robert F. Bales, 1950).
I also believe John Tang has done some work in Interactive (or interaction?)
ethnography - I mislaid my papers on this!
4) since our work is mostly aimed at what engineers do in product development
I am also trying to understand (and construct some "model") of waht engineers
do in groups - an interesting Ph.D. dissertation by Crispin Hales (1987) i
is useful "Analysis of an Engineering Design Process in an Industrial Context",
Cambridge, and 5) somewhat related to 3, but showing my own bais I would like
to include information on cognitive functions in these models (work by Olsen
and Olsen may be helpful).

Any suggestions, names of others working in this area would be helpful. I will
try to call David Rowley later today - but I'm in West Virginia and (I believe)
he's on the West Coast!  As a parting shot I'd like to leave for any comments
my current "high-level taxonomy of groupware". Thes functions/areas seem to
cover the areas which groupware/CSCW CURRENTLY addresses. The last two may
actually be sub-functions/areas under the top six. What do you think?

Proposed Gware High-Level Taxonomy
1) Email Managment and Enhancement
2) Workflow Managment = Coordination
3) Collaborative Writing = Documentation Creation and Managment
4) Group Decision Support
5) Computer Conferencing 
6) Shared Corporate Repository  
7) ? Intellegent Agents ?
8) ? Generate Knowledge Associations/ Networks?

Mike Fotta, Concurrent Engineering Research Ceneter (CERC), West Virginia
University. mef@cerc.wvu.wvnet.edu, (304) 293-7535 x156.

ANy help would be greatly appreciated - I am only supposed to be doing this 
with 40% of my work time!
Xref: sparky comp.theory:2920 comp.lang.prolog:2438 comp.lang.functional:1550
From: pugh@cs.umd.edu (Bill Pugh)
Newsgroups: comp.theory
Subject: Re: Adding Constraints to Automate Programming
Date: 28 Jan 93 22:27:48 GMT
Distribution: comp
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742

In article <BAZET.93Jan27195118@chailly.ensmp.fr> bazet@chailly.ensmp.fr (Philippe BAZET) writes:
>Let us consider a circular list. It can be defined by an ML-like data
>type such as
>
>	list 'a = nil | cons of 'a * list 'a ;
>
>and the assertion:
>
>	The last element for the list is the first one.
>
>Does anyone know of programming systems in which such assertions can be
>expressed formally and used at either run-time or compile-time? 

Check out the paper "Graph Types" by Nils Klarlund and Michael Schwartzback
in the 93 POPL conference.

	Bill Pugh
	Dept. of Computer Science
	Univ. of Maryland, College Park
	pugh@cs.umd.edu
From: dezan@enstb.enst-bretagne.fr (Catherine Dezan)
Newsgroups: comp.theory
Subject: looking for an algorithm...
Keywords: convex polyhedral domain
Date: 26 Jan 93 11:09:51 GMT
Reply-To: dezan@enstb.enst-bretagne.fr
Organization: Ecole Nationale Superieure des Telecommunications de Bretagne, Brest  FRANCE

I am looking for an algorithm which can separate n convex polyhedral domains
(each one from others) with a minimal number of hyperplans.
Does such an algorithm exist?
What about its complexity?

Thank you very much in advance for any information.

Catherine Dezan.

email : dezan@enstb.enst-bretagne.fr
Newsgroups: comp.theory
From: martin@sec.dom.uab.edu (Martin K. Jones)
Subject: Re: looking for Milner's \pi-calculus too
Reply-To: martin@sec.dom.uab.edu (Martin K. Jones)
Organization: University of Alabama at Birmingham
Date: Thu, 28 Jan 1993 21:58:59 GMT


In article <1993Jan28.145311.8460@jarvis.csri.toronto.edu>, blaak@csri.toronto.edu (Raymond Blaak) writes:
|>Failing electronic media, does anyone know about such books available in
|>North America? The references in CACM look like internal reports, and I have
|>no idea how available they are.
|>
There are a couple of papers (actually a paper in two parts) that appeared in
a very recent issue of Information and Computation. Sorry I don't recall the
specifics.


				Martin K. Jones
	   			University of Alabama at Birmingham
	   			MARTIN@ARU.DOM.UAB.EDU

Newsgroups: comp.theory,sci.crypt,rec.puzzles
From: jgn@homebrew.bellcore.com (Joseph G. Niederberger)
Subject: Re: Generating a Random Permutation
Reply-To: jgn@homebrew.UUCP (Joseph G. Niederberger)
Organization: Bellcore, Morristown, NJ
Date: Thu, 28 Jan 93 21:43:25 GMT

In article <C1FpMw.4Ip@ccu.umanitoba.ca> sbloch@silver.cs.umanitoba.ca (Stephen Bloch) writes:
>sumner@math.scarolina.edu (David Sumner) writes:
>>> In an earlier post I wrote that an easy way to generate a
>>> random permutation of the integers 1-n was:
>>> >      ++++++++++++++
>>> >  Initialize  A[n] as the array [1, 2, 3, 4,..., n]
>>> >        for i=1 to n
>>> >        z = random(n)
>>> >        t = a[i]
>>> >        a[i] = a[z]
>>> >        a[z] = t
>>> >        next i
>>> >    ++++++++++++++
>>> There is a typo in this. The line 'z = random(n)' should
>>> be 'z = random(i)'
>
>and "Thomas W. Strong, Jr." <strong+@CMU.EDU> replies:
>>I have to agree with the algorithm as originally presented.  What it
>>effectively does is it takes each item and puts it in a random position.
>><stuff deleted>

>No, the original algorithm is incorrect (for the simple combinatorial
>reason several people have posted).  

This is counterintuitive to a degree that it reminds me of the famous
"Monte Hall" flap of a couple years back.  There must be some way to
make money from this... ;^)

Joe N.

Newsgroups: comp.theory
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: looking for an algorithm...
Keywords: convex polyhedral domain
Organization: Smith College, Northampton, MA, US
Date: Tue, 26 Jan 1993 18:27:40 GMT

In article <279@enstb.enst-bretagne.fr> dezan@enstb.enst-bretagne.fr writes:
>I am looking for an algorithm which can separate n convex polyhedral domains
>(each one from others) with a minimal number of hyperplans.
>Does such an algorithm exist?
>What about its complexity?

Most variations are NP-complete:

@article{m-cps-88
, author =      "N. Megiddo"
, title =       "On the complexity of polyhedral separability"
, journal =     "Discrete Comput. Geom."
, volume =      3
, year =        1988
, pages =       "325--337"
}
From: gustedt@math.TU-Berlin.DE (Jens Gustedt)
Newsgroups: comp.theory
Subject: Re: FOCS '93
Date: 29 Jan 93 01:19:36 GMT
Reply-To: gustedt@math.tu-berlin.de
Organization: FB3, TU-Berlin, Germany.
NNTP-Posting-Host: motzen.math.tu-berlin.de
In-reply-to: hinrichs@math.uni-muenster.de's message of 28 Jan 1993 13:10:42 GMT


In article <1k8m0iINN1229@obelix.uni-muenster.de> hinrichs@math.uni-muenster.de (Klaus H. Hinrichs) writes:
Path: mailgzrz.TU-Berlin.DE!cs.tu-berlin.de!math.fu-berlin.de!ira.uka.de!Germany.EU.net!uni-muenster.de!boole!hinrichs
   From: hinrichs@math.uni-muenster.de (Klaus H. Hinrichs)
   Newsgroups: comp.theory
   Date: 28 Jan 1993 13:10:42 GMT
   Organization: Westf. Wilh.-Universitaet Muenster, Germany.
   Lines: 7
   Distribution: world
   Reply-To: hinrichs@math.uni-muenster.de
   NNTP-Posting-Host: boole.uni-muenster.de

   Does anyone have any information about when and where FOCS '93 will take place?
   Has there already been a call for papers?

   Klaus H. Hinrichs
   e-mail: hinrichs@math.uni-muenster.de


The CFP can be found in sys.theorynt



--





===================================================================
 Jens Gustedt, TU Berlin, Sekr. MA 6-1, W-1000 Berlin 12, Germany
-------------------------------------------------------------------
 Tel    +49 +30 314-23598   |     email gustedt@math.TU-Berlin.DE
 Fax               -21110   |
===================================================================
                supported by the Graduiertenkolleg 
                ALGORITHMISCHE DISKRETE MATHEMATIK
===================================================================
Newsgroups: comp.theory
From: fischer-michael@cs.yale.edu (Michael Fischer)
Subject: Re: solution or information needed
Reply-To: fischer-michael@cs.yale.edu (Michael Fischer)
Organization: Yale University Computer Science Dept., New Haven, CT 06520-2158
X-Newsreader: TIN [version 1.1az (for az) PL8]
Distribution: usa
Date: Thu, 21 Jan 1993 15:30:28 GMT

Steve Morris (srm@matrix.com) wrote:

: >   Does anybody have the solutions to the exercises in the classic
: >computer theory book?  "Introduction to automata theory, languages, and
: >computation" by Hopcroft and Ullman in 1979.  If you have any, please
: >post your reply or send it to me by e-mail.  Thank you.

: I'm in a situation where some answers would be very helpful. 

You need understanding, not answers.  One of the main themes of
classical language and automata theory is to classify the power of
various grammar and machine models.  A beautiful theory has developed
that gives elegant characterizations of the capabilities and
limitations of these devices.  To see why {ww | w E {0,1}*} is not
regular, for example, you need to know about the pumping lemma for
regular sets and other techniques for proving non-regularity.  To see
why it is not accepted by a pushdown store machine, it is useful to
know about the connections between pushdown store machines and
context-free languages and to know about the pumping lemma for
context-free languages.  To see why it can be accepted by a Turing
machine, you need an understanding of the kinds of things Turing
machines can do and how they can do them.  If you read and understand
the Hopcroft and Ullman book, you won't need somebody else to furnish
solutions to the exercises for you.
==================================================
| Michael Fischer <fischer-michael@cs.yale.edu>  |
==================================================
Newsgroups: comp.theory
From: bazet@chailly.ensmp.fr (Philippe BAZET)
Subject: Adding Constraints to Automate Programming
Organization: /home/users/bazet/.organization
Distribution: comp
Date: 27 Jan 93 19:51:18

Hi net,


Let us consider a circular list. It can be defined by an ML-like data
type such as

	list 'a = nil | cons of 'a * list 'a ;

and the assertion:

	The last element for the list is the first one.

Does anyone know of programming systems in which such assertions can be
expressed formally and used at either run-time or compile-time?  I know
of Ait Kaci's LIFE which is mainly restricted to local structure
constraints.  

Thanks in advance,
Philippe Bazet.
e-mail: bazet@cri.ensmp.fr





Xref: sparky comp.theory:2936 sci.math:18810
From: clin@eng.umd.edu (Charles Lin)
Newsgroups: comp.theory,sci.math
Subject: Natural language newsgroup
Date: 28 Jan 1993 08:00:47 GMT
Organization: College of Engineering, Maryversity von Uniland, College Park
Distribution: world
NNTP-Posting-Host: transform.eng.umd.edu
Originator: clin@transform.eng.umd.edu


   For those of you who have multiple interests and would like to see
the formation of a natural language newsgroup, please send me e-mail.
This newsgroup will discuss computer-related issues in natural language
(like English, etc.) for example, translation, or understanding, etc.

    My e-mail address is clin@eng.umd.edu

--
Charles Lin
clin@eng.umd.edu
Xref: sparky comp.theory:2921 comp.lang.prolog:2439 comp.lang.functional:1551 sfnet.tiede.tietotekniikka.tohtorix:35
From: batra@boulder.Colorado.EDU (sajeev batra)
Subject: ftp sites for CA code for the Mac
Organization: University of Colorado, Boulder
Date: 27 Jan 93 04:37:48 GMT

Hi,

I'm looking for CA code for the Macintosh.  I need code for
the Macintosh 'cause I'm introducing CA to 8th grade kids.
And Mac's are all the school has.

The code should be easy to use.  Anybody know of anything???

Thank You,
Sajeev Batra
From: pollack@dendrite.cis.ohio-state.edu (Jordan B Pollack)
Newsgroups: comp.theory.cell-automata,sci.fractals
Subject: Re: fractal inversion & perpetual motion
Date: 22 Jan 1993 11:52:48 -0500
Organization: Ohio State Computer Science
Distribution: inet
Reply-To: pollack@cis.ohio-state.edu
NNTP-Posting-Host: dendrite.cis.ohio-state.edu
In-reply-to: hurd@math.gatech.EDU's message of Fri, 22 Jan 1993 03:47:02 GMT

Lyman Hurd and I have many shared friends who have the greatest
respect for him as a mathematician.  It is with no disrespect intended
that I state, before I plunk down $50 to Hurd Enterprises, I'd like
verification FROM A THIRD PARTY without any financial interest in
Iterated Systems, that the example programs are not missing certain
critical pieces of information which are reserved as further "Trade
Secrets."  I haven't read the US patent either, but suspect it is not
a full disclosure.

Personally, I have never seen any fractal inversion method work
WITHOUT A HUMAN IN THE LOOP.  Even Yuval Fisher's clear tutorial and
free code only show the results reconstructed, which for all I know
the compression could have been hand tuned.

Sorry to be a skeptic, but the process often looks like the perpetual
motion machine: no matter how you build it, its still missing one
piece, equivalent to the energy source. (One gets sensitive to this
being in AI, where the image of a midget inside a fantastic
chess-playing robot lingers on.)

Has anybody bought the book, entered the programs and gotten some
interesting compression results? I mean Stacker 3.0 is only
$100 is really works!





-- 
Jordan Pollack                            Assistant Professor
CIS Dept/OSU                              Laboratory for AI Research
2036 Neil Ave                             Email: pollack@cis.ohio-state.edu
Columbus, OH 43210                        Phone: (614)292-4890 (then * to fax)
Newsgroups: comp.theory.cell-automata
From: demaris@austin.ibm.com (Dave Demaris)
Subject: cellular automata with different rules at each site 
Originator: demaris@chip1.austin.ibm.com
Date: Thu, 21 Jan 1993 23:19:11 GMT
Reply-To: ...@cs.utexas.edu:ibmchs!auschs!aspencer.austin.ibm.com!aspencer
Organization: IBM Advanced Workstation Division


These are called inhomogeneous cellular automata; one article which draws
rules randomly from the set (XOR,AND) for each is Vichniac et al is in 
J. Statistical Physics 45:875-883, 1986. 
(Sorry, don't have the title handy). There are indeed similarities with
random boolean automata in that the network can be modulated through
the various phase regimes (fixed point, limit cycle etc.) by varying the
rule mix just as in random boolean automata.
From: ma690188@mbcr.bcm.tmc.edu (R. Mark Adams)
Newsgroups: comp.theory.cell-automata
Subject: Cellular Automata for Diffusion
Followup-To: comp.theory.cell-automata
Date: 27 Jan 1993 00:33:17 GMT
Organization: Baylor College of Medicine, Houston, Tx
Distribution: world
NNTP-Posting-Host: mbcr.bcm.tmc.edu
Summary: Algorithm wanted
Keywords: diffusion, cellular automata

Please forgive me if this is a FAQ-

I am looking for an algorithm for a cellular automata which
implements diffusion.  I would like to simulate morphogen flows
in simulated tissue culture populations, and thus would like the 
algorithm to be as fast as possible.

If anyone has a pointer to such information, I would appreciate it!

Thanks

+-<rMark>------------------------+----------------------------------+---------+
|                                | ma690188@mbir.bcm.tmc.edu        |  |||||  |
| R. Mark Adams, N5YYY           |                                  |   - <|  |
| Department of Cell Biology     |"It is a small world,             |    v |  |
| Baylor College of Medicine     | But I wouldn't want to paint it" |   \_/   |
+--------------------------------+----------------------------------+---------+


Newsgroups: comp.theory.cell-automata
From: hurd@math.gatech.EDU (Lyman Hurd)
Subject: fractal book
Organization: The Internet
Distribution: inet
Date: Fri, 22 Jan 1993 03:47:02 GMT

I am pleased to announce the arrival of the book:

Fractal Image Compression
by Michael Barnsley and Lyman Hurd.

hardbound 244 pages, 16 color plates


A sequel to Fractals Everywhere, Fractal Image Compression describes the
mathematics underlying the Fractal Transform an image compression method
discovered by Michael Barnsley and developed at Iterated Systems.  Topics
include:

  * Iterated Function Systems

  * Local IFS and the Black and White Fractal Transform

  * The Grayscale Fractal Transform

  * Information Theory

  * Huffman codes

  * Arithmetic Codes

  * JPEG Image Compression

Example programs in C are interspersed throughout the text.

Copies of the book are available direct from one of the authors.  Send
check (payable to Lyman Hurd or Hurd Enterprises) for $49.95 US (this
includes shipping) to:

   Hurd Enterprises
   P.O. Box 888575
   Atlanta, GA 30356

Residents of GA please add sales tax.
Newsgroups: comp.theory.cell-automata
From: mac@sfc.keio.ac.jp (Masanao Takeyama)
Subject: L-Systems
Organization: Keio University Shonan Fujisawa Campus.
Distribution: comp
Date: Fri, 22 Jan 1993 01:24:51 GMT

I recently started to read books on L-systems. However I wonder how
this relate to cellular automata. If you consider multi-dimensional
L-systems, they seem exactly same as cellular automata. 
I would appreciate if somebody could explain the relationship between
them. 

Thank you.
--
                                               
 Masanao Takeyama
 Department of Geography
 University of California, Santa Barbara
 masanao@geog.geog.ucsb.edu

 Department of Economics
 Keio University
 mac@sfc.keio.ac.jp
                        
Newsgroups: comp.theory.cell-automata,sci.fractals