HDTenEightyP/NetNews huggingface dataset:
From: gcm@world.std.com (Gretchen C Macdowall)
Subject: Re: Photoshop??
Organization: The World Public Access UNIX, Brookline, MA
Date: Mon, 21 Dec 1992 11:15:11 GMT

slambert@willamette.edu (Sean Lambert) writes:



>I was just wondering if anyone knows how to save a file (such as a color
>frame taken from a video input) in a MacPaint format...there seems to be
>a Save As selection, however, it is not highlighted under "normal"
   
Under Mode you have to convert it to a Bitmap image first. If Bitmap is
not an option at first then choose Greyscale. Then do Bitmap after that.
Diffusion dither works the best most of the time. Then when you go to save
it, the MacPaint option should be available.
From: tlilley@csugrad.cs.vt.edu (Tripp Lilley)
Newsgroups: comp.multimedia
Subject: Re: Full motion capture and encodeing in mpeg format
Date: 29 Dec 92 20:24:03 GMT
Organization: The MultiMedia Lab at Virginia Tech, Blacksburg, VA


  The VideoSpigot for dos/windows should be on our doorstep a week from 
yesterday (at least, that's what the mail-order house tells us.)  currently,
it ships with Video for Windows, which leads me to believe (duh.) that the
card and its associated software will be writing to AVI... as for doing 
anything MPEG with that, I'm not sure... If the VSpigot for MAC is any
indication, the bugger should pump the video into the system in real-time...
(the card, apparently, does a level of compression on the fly)...

I'll be posting more about the Video Spigot, Video for Windows, and Quicktime
for Windows, and how well (or un-well) they all interact sometime soon(ish) :>

- t.

-- 
 USES disclaim;                                                      |^^\/^^| 2
 Tripp Lilley   -- tlilley@csugrad.cs.vt.edu                         | |\/| |
 The MultiMedia Lab of the Colleges of Architecture and Engineering  |_|  |_|
 Virginia Polytechnic Institute and State University         (silly ASCII logo)
From: bartusek@iscsvax.uni.edu
Newsgroups: comp.multimedia
Subject: PHILLIPS CDI Information?
Date: 22 Dec 92 10:11:47 -0600
Organization: University of Northern Iowa

Is anyone working with Phillips CDI & their authoring system, that just came
out for consumer use in October?  I am curious about the use of full screen/
full motion video on CDI. I'd like to know if it is available or when it will
be available with full motion video?  And I'd like some information on the
user-friendly ability of the system.  Thanks!

Marc A. Bartusek
University of Northern Iowa
--------------------------------------------------------------------------------
From: 00gwmichelin@leo.bsuvc.bsu.edu
Newsgroups: comp.multimedia
Subject: Re: Internet Multimedia Archive Info Wanted
Date: 30 Dec 92 22:40:42 GMT
Organization: Ball State University, Muncie, In - Univ. Computing Svc's

In article <1992Dec29.173326.7281@advtech.uswest.com>, kdlin@advtech.uswest.com (David Lin) writes:
> Happy holidays.
> 
> I'm doing a preliminary survey on the archive sites of Internet/USENET. 
> I'll really appreciate it if anyone can point me to where those sites
> are located. Basically, I'm looking for multimedia resources archives
> such as images, quicktime movies, sounds, text, MPEG, JPEG, DVI movies,
> etc. Any multimedia related items will work too.
> 
> Please send e-mail to me at: kdlin@advtech.uswest.com.
ALSO, PLEASE POST. THANKS
> 
> Thanks in advance.
> 
> David
> 
> -- 
>  K. David Lin, Ph.D.              | IEEE Member, NRA Member, HAM Operator
>  Communication Services Research  | U S WEST Life Safety Team
>  U S WEST Advanced Technologies   | Defend your life in STEREO - Beretta & SIG 
>  E-mail: kdlin@advtech.uswest.com | Disclaimer: Only personal opinions
Newsgroups: comp.multimedia
From: ralanis@neumann.uwaterloo.ca (Ramon Alanis)
Subject: Looking for Proceedings...
Keywords: multimedia, digital, audio, video
Organization: University of Waterloo
Date: Wed, 30 Dec 1992 20:11:51 GMT

I am looking for:

Network and Operating System Support for Digital Audio and Video
Third International Workshop
Proceedings

Can somebody give me some information on where and how to get this material?

Any information would be welcome.

Please answer by mail...


Ramon Alanis                                         University of Waterloo
ralanis@neumann.uwaterloo.ca                  Deparment of Computer Science
Newsgroups: comp.ai.neural-nets
From: ralph@wixer.cactus.org (Ralph Cherubini)
Subject: Metaphor machine
Organization: Real/Time Communications
Date: Thu, 31 Dec 92 00:49:00 GMT


                                Metaphor machine

The metaphor machine
a new invention based on the symmetrical structure of opposites
take all the pairs
and you will see that the whole world lies in between
the metaphor machine
makes blurriness a virtue
feels for tendencies through the space of sense and thought
tells you your mother is neither soft nor hard
but so-much-of-this and also that
speaks to the blind of probable causes
of roundishness around one hundred meters
and a row of parallel perpendiculars which tends towards fence
the decision is yours
the metaphor machine never excludes
merely waltzes around and around
and even ice is only
relatively
cold.




-- 
ralph@wixer.cactus.org
cactus.org!wixer!ralph
Organization: University of Illinois at Chicago
Date: Wednesday, 30 Dec 1992 04:34:40 CST
From: <U16244@uicvm.uic.edu>
Newsgroups: comp.ai.neural-nets,rec.games.chess
Subject: Chess program info??

  I'm getting the hankering to start back on one of my old projects, my
chess program.  However, I plan to steer clear of the current trend of
search-a-trillion-nodes-a-second, and instead use lots of knowledge and
search a very sparse tree.  To implement this, I plan to use several
neural networks to select canidate moves at every branch of the tree.
The search will be breadth-first.  Instead of searching 1 ply, 2 ply,
3 ply, etc, etc.. The tree will be kept, reordered, and extended until
time considerations set in.  Moves that are discovered to be bad will be
cut from the tree.  I estimate that on a fast machine, 30 seconds will
probably only produce a tree of about 250 nodes; however this tree would
be deep and knowledgeable.  I would be interested to see this play a
current program.

  My point in this post is to see what work similar to this has been
done.  I don't want to reinvent the wheel, or do exactly the same thing
someone else has done and failed.

  Much thanks.

--djh
Newsgroups: comp.ai.neural-nets
From: tapas@pooh.engr.mun.ca (Tapas Banerjee)
Subject: HELP - Continous Hopfield Connection
Summary: Problem with connection wts in hopfield networks.
Keywords: Hopfield, Connection Matrix
Organization: Memorial University of Newfoundland
Date: Sat, 2 Jan 1993 04:35:09 GMT

 Dear Netters,

    Happy new year to all !!

    I am having some problem with Hopfield auto-associative networks.

    When I look into binary hopfield with inputs 1,0 - I find that to implement
 that, the connection between neurons has to switch from excitatory to 
 inhibitory depending on the output. Precisely, the interaction from Neuron j
 to Neuron i is Tij * (2Xj-1) i.e. with a Tij of say 1, the interaction is
 excitatory with Neuron j output Xij of 1 - but it becomes inhibitory when
 Neuron j output is 0.

   Does this remain same with continous hopfield ? i.e. does one have to switch
 between excitation and inhibition depending on neuron outputs ??

   Is there some way out with which one can implement binary hopfield with 1,0
 i/p's so that one doesn't have to switch between excitation and inhibition ??

   Any help or pointers will be greatly appreciated.

   Thanking in advance,

   - TAPAS BANERJEE

     (tapas@pooh.engr.mun.ca)
From: archieri@enstb.enst-bretagne.fr (archieri)
Newsgroups: comp.ai.neural-nets
Subject: DARWIN II : Request for information
Date: 31 Dec 92 16:54:57 GMT
Distribution: comp
Organization: ENSTBR, Brest, France


 I am interested in getting information on DARWIN II, an 
automata built by G. M. Edelman and G. Reeke Jr. which
is supposed to be conform to neuronal darwinism principles.

 Any information (references, e-mail adresses, or ftp sites)
would be appreciated.

B. Archieri
--
_______________________________________________________________________________
Benoit Archieri                         e-mail: archieri@enstb.enst-bretagne.fr
LIASC                                                  
ENSTBr BP 832                                          tel:    (33) 98.00.14.33
29285 Brest CEDEX France                               fax:    (33) 98.00.12.82
Newsgroups: comp.ai.neural-nets
From: adamg@spectrum.cs.unsw.oz.au (AP Glowka)
Subject: Looking for Recurrent BP / BP Through Time source code
Reply-To: adamg@spectrum.cs.unsw.oz.au (AP Glowka)
Organization: Uni of NSW, Sydney
Date: Wed, 30 Dec 1992 06:00:08 GMT

If anyone out there knows of any Recurr. BP source code,
please let me know. Any sort of an example whic shows
how the training function is implemented would really
make my day.

cheers
adam

adamg@spectrum.cs.unsw.oz.au
Newsgroups: comp.ai.neural-nets
From: john@cs.uow.edu.au (John Fulcher)
Subject: Journal call for papers - ANN Standards
Organization: Dept of Computer Science, Wollongong University, Australia
Date: Mon, 4 Jan 1993 03:54:07 GMT

CALL FOR PAPERS - ANN STANDARDS

COMPUTER STANDARDS & INTERFACES

For some time now, there has been a need to consolidate and
formalise the efforts of researchers in the Artificial Neural
Network field. The publishers of this North-Holland journal
have deemed it appropriate to devote a forthcoming special
issue of Computer Standards & Interfaces to ANN standards,
under the guest editorship of John Fulcher, University of
Wollongong, Australia.

We already have the cooperation of the IEEE/NCC Standards
Committee, but are also interested in submissions regarding
less formal, de facto "standards". This could range from
established, "standard" techniques in various application
areas (vision, robotics, speech, VLSI etc.), or ANN techniques
generally (such as the backpropagation algorithm & its
[numerous] variants, say). Accordingly, survey or review
articles would be particularly welcome.

If you are interested in submitting a paper for consideration,
you will need to send three copies (in either hard copy or
electronic form) by March 31st, 1993 to:

John Fulcher,
Department of Computer Science,
University of Wollongong,
Northfields Avenue,
Wollongong NSW 2522,
Australia.

fax: +61 42 213262
email: john@cs.uow.edu.au.oz
From: prechelt@i41s14.ira.uka.de (Lutz Prechelt)
Newsgroups: comp.ai.neural-nets
Subject: changes to "FAQ in comp.ai.neural-nets" -- monthly posting
Supersedes: <nn.changes.posting_722920689@i41s14.ira.uka.de>
Followup-To: comp.ai.neural-nets
Date: 28 Dec 1992 03:16:56 GMT
Organization: University of Karlsruhe, Germany
Expires: 1 Feb 1993 03:18:07 GMT
Reply-To: prechelt@ira.uka.de (Lutz Prechelt)
NNTP-Posting-Host: i41s18.ira.uka.de
Keywords: modifications, new, additions, deletions
Originator: prechelt@i41s18

*** nn.oldbody	Sat Nov 28 04:18:11 1992
--- nn.body	Mon Nov 30 15:02:30 1992
***************
*** 1,5 ****
  
  Archive-name: neural-net-faq
! Last-modified: 92/11/13
  
  (FAQ means "Frequently Asked Questions")
--- 1,5 ----
  
  Archive-name: neural-net-faq
! Last-modified: 92/11/30
  
  (FAQ means "Frequently Asked Questions")
***************
*** 875,878 ****
--- 875,898 ----
  Freq:    published quarterly
  Eds:     G. Fox, H. Herrmann and K. Kaneko
+ -----
+ Title:   Machine Learning
+ Publish: Kluwer Academic Publishers
+ Address: Kluwer Academic Publishers
+          P.O. Box 358
+          Accord Station
+          Hingham, MA 02018-0358 USA
+ Freq.:	 Monthly (8 issues per year; increasing to 12 in 1993)
+ Cost/Yr: Individual $140 (1992); Member of AAAI or CSCSI $88
+ Remark:	 Description: Machine Learning is an international forum for 
+          research on computational approaches to learning.  The journal
+ 	 publishes articles reporting substantive research results on a
+          wide range of learning methods applied to a variety of task
+          domains.  The ideal paper will make a theoretical contribution
+          supported by a computer implementation.
+          The journal has published many key papers in learning theory,
+          reinforcement learning, and decision tree methods.  Recently
+          it has published a special issue on connectionist approaches
+          to symbolic reasoning.  The journal regularly publishes
+          issues devoted to genetic algorithms as well.
  
  
***************
*** 1596,1599 ****
--- 1616,1620 ----
  Osamu Saito <saito@nttica.ntt.jp>
  Ted Stockwell <ted@aps1.spa.umn.edu>
+ Thomas G. Dietterich <tgd@research.cs.orst.edu>
  Thomas.Vogel@cl.cam.ac.uk
  Ulrich Wendl <uli@unido.informatik.uni-dortmund.de>
-- 
Lutz Prechelt   (email: prechelt@ira.uka.de)            | Whenever you 
Institut fuer Programmstrukturen und Datenorganisation  | complicate things,
Universitaet Karlsruhe;  D-7500 Karlsruhe 1;  Germany   | they get
(Voice: ++49/721/608-4317, FAX: ++49/721/694092)        | less simple.
Newsgroups: comp.ai.neural-nets
From: irakliot@longs.LANCE.ColoState.Edu (Leo J. Irakliotis)
Subject: ART rotationally invariant ?
Date: Thu, 31 Dec 1992 08:20:38 GMT
Reply-To: irakliot@lance.colostate.edu
Organization: Engineering Network Services, Colorado State University


While an ART(2) type NN can classify a vector X under the same class
with the vector aX, a:real number, I was wondering if there is any
work done on turning an ART network to be rotationally invariant,
ie to classify vectors X and aX+T where T=[t t t ... t] under the
same class.

Any suggestion welcome.

Best wishes for a happy (and productive) new year,

-- 
Leo J Irakliotis                 irakliot@eva.lance.colostate.edu
-----------------------------------------------------------------
Electrical Engineering                      l.irakliotis@ieee.org
Colorado State U
(303) 491-2021                              Optical Computing Lab
Newsgroups: comp.ai.neural-nets,sci.image.processing
From: jameel@cs.tulane.edu (Akhtar Jameel)
Subject: Handwritten Characters Database.
Organization: Computer Science Dept., Tulane Univ., New Orleans, LA
Nntp-Posting-Host-[nntpd-21211]: babylon
Date: Sun, 27 Dec 1992 19:27:54 GMT


Anybody knows about a ftp site for a handwritten character database ?
Please let me know. Thank you.


Happy Holidays.
jameel@rex.cs.tulane.edu

ps: i already have information on the NIST and CEDAR packages on sale.
Newsgroups: comp.ai.neural-nets,comp.ai,aus.computers
From: sci240s@monu6.cc.monash.edu.au (Wey Jing HO)
Subject: Neural Network development system available for use. Free.
Followup-To: poster
Organization: Monash University, Melb., Australia.
Distribution: melb
Date: Fri, 1 Jan 1993 17:04:28 GMT

We have in our department the HNC Balboa (i860 based co-processor) for
neural nets simulation and development. C libraries are available for 
the system as well as ExploreNet 3000 which is a Windows 3.x based development
and simulation software. Many popular NN paradigms are supported. User-
specific applications can be produced using the C libraries (Microsoft
C). The board has 16MB of memory and has been installed in a 486-33 PC
running MS-DOS 5.0 and Windows 3.1. This setup cost the department approx.
A$25,000.00.

The above system is available for use to any interested individuals or
organisations as long as you agree to the conditions below (not finalised
but should not change too much and they are negotiable):

1) The system will be used on-site only (that is in the location and
   room allocated by the Physics Department  of Monash University)
   and at any time as long as there is a staff/research person on site;

2) After using the system, the person/organisation must be willing to
   give adequate feedback on the system abilities (verbal and simple
   written report) as well as showing a staff/research member of the
   department on using the system;

3) The Physics Dept. will have right to use (use only!) any application
   produced for the system;

4) The Dept. will have right to terminate all priviledges to use the above
   system to anyone upon adequate notice (possibly 2 months??); and

5) Any conditions stated above may be re-confirmed or negotiated before
   hand. The above facilties will be provided free of charge with the 
   understanding that training to a staff/research member of the department
   will be given in return.

Anyone interested, please contact myself at:
	Wey J Ho
	Dept of Physics
	Monash University 
        Wellington Road
        Clayton
	VIC

	Tel: (03) 565 3615
	Fax: (03) 565 3637
	Email: sci240s@monu6.cc.monash.edu.au

-- 
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
>Wey Jing Ho    Tel: 61-3-573-2567   E-mail : sci240s@monu6.cc.monash.edu.au<
>Physics Dept., Monash University ( Caulfield Campus ), Melbourne, AUSTRALIA<
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Newsgroups: comp.ai.neural-nets
From: phi@cs.uwa.oz.au (Philip HINGSTON)
Subject: Kohonen nets with other than rectangular output arrays
Organization: Dept. Computer Science, University of Western Australia.
Date: Mon, 21 Dec 1992 07:56:14 GMT

Hi, I guess the subject line says it. I have found some things
discussing the choice between 1-d, 2-d, 3-d etc arrays of output
neurons. What about other neighbourhood graphs? e.g. toroidal, trees etc
Does anyone know of any references? Thanks, phi

Newsgroups: comp.ai.neural-nets
From: u8013536@cc.nctu.edu.tw ()
Subject: Re: Looking for Recurrent BP / BP Through Time source code
Organization: National Chiao Tung University
X-Newsreader: TIN [version 1.1 PL6]
Date: Wed, 30 Dec 1992 07:20:43 GMT

AP Glowka (adamg@spectrum.cs.unsw.oz.au) wrote:
: If anyone out there knows of any Recurr. BP source code,
: please let me know. Any sort of an example whic shows
: how the training function is implemented would really
: make my day.
: 
: cheers
: adam
: 
: adamg@spectrum.cs.unsw.oz.au
---------------------------------------------------------------

 Me, too. And thanks in advance!

		liao
		u8013536@cc.nctu.edu.tw

Newsgroups: comp.ai.neural-nets
From: skubi@prl.dec.com (Marcin Skubiszewski)
Subject: Oops, was: Announcement: A hardware implementation of the Boltzmann machine
Organization: Digital Equipment Corporation - Paris Research Laboratory
Date: Mon, 28 Dec 1992 13:28:32 GMT

I made a mistake in my posting concerning the Boltzmann machine implementation
(the line "Subject: send SKU3.ps" was wrong). If you sent a request and you did
not get a reply, please send a new request, according to the following
corrected annoncement. I am sorry for the inconvenience.

						Marcin.



The subject line says it all. For details, get a copy of the article "An Exact
Hardware Implementation of the Boltzmann Machine". The article appeared in the
Fourth IEEE Symposium on Parallel Distributed Processing. To get a postscript
copy of it, send mail containing the following lines in the header:

To: doc-server@prl.dec.com
Subject: send SKU3


				Abstract

We present a faithful hardware implementation of the Boltzmann machine. The
prototype performs 505 megasynapses (million of additions and multiplications)
per second, using 16-bit fixed-point weights. It can emulate fully connected
instances of the Boltzmann machine containing up to 1438 variables.
Newsgroups: comp.ai.neural-nets
From: egan@blkbox (Doug Egan)
Subject: ALN anonymous FTP???
Organization: CVR
Date: Sun, 27 Dec 1992 21:21:50 GMT
Summary: Has the UofAlberta site restricted anonymous FTP?
Keywords: ALN FTP NN

      Has the U of Alberta restricted anonymous FTP site access??

      I tried 129.128.4.241 (menaik.cs.ualberta.ca)...


-- 
Doug Egan    CompuVision Research                                         
Internet:    egan@blkbox.com                                              
Friendswood, Texas                                                        
--------------------------------------------------------------------------  
Newsgroups: comp.ai.neural-nets
From: stevep@ims.com (Steve Poulsen)
Subject: Re: Togai Infralogic -- Address Requested
Reply-To: stevep@ims.com
Organization: Integrated Measurement Systems, Inc.
Date: Mon, 28 Dec 1992 20:18:54 GMT

In article <1992Dec28.004403.6187@worldbank.org>, sthomas@nimbus.worldbank.org (Sidney F. Thomas) writes:
|> Subject line says it all.  Grateful if some netter could give me
|> a street address and contact for Togai Infralogic.

        Togai Infralogic, Inc.
	5 Vanderbilt
	Irvine, CA 92718
	(714) 975-8522
	FAX: (714) 975-8524

Source: EDN Magazine, July 6, 1992 "Special Tools and Chips Make Fuzzy
Logic Simple" page 74.

-Steve-

--
Steve Poulsen, Integrated Measurement Systems, Inc.  Beaverton, OR  USA
Voice: 503-626-7117   Fax: 503-644-6969   Fidonet: 1:105/31.6
INTERNET: stevep@ims.com   Compuserve: [70262,3115]
Newsgroups: comp.ai.neural-nets
From: dave@pipi.iis.u-tokyo.ac.jp (David Wuertele)
Subject: Question:  Has this been done?
Organization: Institute of Industrial Science, University of tokyo.
Distribution: comp
Date: Thu, 24 Dec 1992 07:04:30 GMT

I would like to try to apply an ANN to the evaluation of student language
tests.  The system would have a net for each question, and the question
i/o would be structured as follows:
				      +----+
        Correct Answer ----[string]-->|C   |
	Student's Answer --[string]-->|	O  |
				      |  M |
				      |   P|
				      +----+
	----    			 |
   +---- \  <--------------------------[int] Current Score
   |     /      		         |
   |    ----    			 V
   V    			     +------+
History of Scores --[array of int]-->| ANN  |--[int]--> Confidence
				     +------+

The ``Current Score'' represents the correlation between the student's
answer and the correct answer, and the ``Confidence'' value represents the
state of the learning curve.  I would like to use this confidence value to
modulate the test dynamically, feeding back in such a way that confidence
increases at the fastest rate possible.

That is, I want to use the ANN to control a learning curve, the student's
learning curve.

Has anybody seen such an application before?

Tia,
Dave
-----
David Wuertele, Yasuda Lab, Electronic Engineering, Institute of Industrial Science,
University of Tokyo.				dave@windsor.iis.u-tokyo.ac.jp
From: shf@access.digex.com (Stephen Foy)
Newsgroups: comp.ai.neural-nets
Subject: Re: Genesis
Date: 2 Jan 93 12:05:31 GMT
Organization: Express Access Online Communications, Greenbelt MD USA
NNTP-Posting-Host: access.digex.com

peter@canne.cs.umu.se (Peter Lundberg) writes:

>I ask you netters, is Genesis available via ftp from somewhere?

Try ftp.aic.nrl.navy.mil it's in the directory
/pub/galist/source-code/ga-source/genesis.tar.Z. 
Lots of other GA related material there too.


-- 
Steve 
shf@access.digex.com
From: slqqv@cc.usu.edu
Newsgroups: comp.ai.neural-nets
Subject: INFO WANTED
Date: 2 Jan 93 00:07:14 MDT
Organization: Utah State University


Can someone provide me the information whether the CMU-Tech Reports are 
available for ftp or not.If not how can one access them(i.e. address /e-mail
etc,whom to contact) .I am currently working on a Handwriting recognition
project using Time Delayed Neural Nets and am in search of some papers which
appeared in previous CMU-Tech Reports.

Also can someone provide me info on how to implement Recurrent Networks
(jordan,Elman type) using ASPIRIN .

Thanks in advance,

Shashi Shekhar
Dept. of Comp Sc.,
Utah State Univ,Logan 84321.