From marco@idsia.ch Mon Apr 15 07:47:09 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id HAA29527 for <ml@sea.cs.wisc.edu>; Mon, 15 Apr 1996 07:47:03 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id HAA16412 for <ml@cs.wisc.edu>; Mon, 15 Apr 1996 07:47:01 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa05859;
          15 Apr 96 4:03:24 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa05857;
          15 Apr 96 3:42:19 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa11370;
          15 Apr 96 3:41:23 EDT
Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa06005; 15 Apr 96 3:40:15 EDT
Received: from [192.132.252.1] by CS.CMU.EDU id aa22163; 15 Apr 96 3:39:28 EDT
Received: from zucca.idsia.ch by fava.idsia.ch (4.1/SMI-4.1)
	id AA07623; Mon, 15 Apr 96 09:39:15 +0200
Date: Mon, 15 Apr 96 09:39:15 +0200
From: Marco Wiering <marco@idsia.ch>
Message-Id: <9604150739.AA07623@fava.idsia.ch>
To: connectionists@cs.cmu.edu
Subject: Levin Search and EIRA


FTP-host: ftp.idsia.ch
FTP-file: /pub/marco/ml_levin_eira.ps.gz
or        /pub/juergen/ml_levin_eira.ps.gz


                Solving POMDPs with  Levin Search and EIRA

                Marco Wiering          Juergen Schmidhuber

                Machine Learning: 13th Intern. Conf., 1996
                9 pages, 86K compressed, 252K uncompressed
 
 Partially observable Markov decision problems (POMDPs) recently received 
 a lot of attention in the reinforcement learning community. No attention,
 however, has been paid to Levin's universal search through program space 
 (LS), which is theoretically optimal for a wide variety of search  prob-
 lems including  many POMDPs.  Experiments in this paper show that LS can 
 solve partially observable mazes (`POMs') involving many more states and 
 obstacles than those solved by various  previous authors.  We then note,
 however, that LS is not necessarily optimal  for learning problems where 
 experience with  previous problems  can be used to  speed up the search.
 For this reason,  we introduce an adaptive  extension of LS  (ALS) which 
 uses experience to increase  probabilities of instructions  occurring in 
 successful programs found by LS.  To deal with cases where  ALS does not
 lead to long-term performance improvement,  we use the  recent technique
 ``environment-independent reinforcement acceleration'' (EIRA) as a safe-
 ty belt (EIRA currently is the only known method that guarantees a life-
 long  history of reward  accelerations).   Additional experiments demon-
 strate: (a) ALS can dramatically reduce search time consumed by calls of 
 LS.   (b) Further significant speed-ups can be obtained by combining ALS 
 and EIRA.


 To obtain a copy, do one of these:
 netscape http://www.idsia.ch/~marco/publications.html
 netscape http://www.idsia.ch/~juergen/onlinepub.html

 Marco Wiering
 Juergen Schmidhuber                                               IDSIA


From marco@idsia.ch Mon Apr 15 08:08:35 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id IAA29707 for <ml@sea.cs.wisc.edu>; Mon, 15 Apr 1996 08:08:29 -0500
Received: from cs.uwa.oz.au (bilby.cs.uwa.oz.au [130.95.1.11]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id IAA16615 for <ml@cs.wisc.edu>; Mon, 15 Apr 1996 08:08:25 -0500
Received: from  (mafm@parma.cs.uwa.oz.au [130.95.1.7]) by cs.uwa.oz.au (8.6.8/8.5) with SMTP id RAA15531; Mon, 15 Apr 1996 17:46:12 +0800
Message-Id: <199604150946.RAA15531@cs.uwa.oz.au>
From: marco@idsia.ch (Marco Wiering)
To: reinforce@cs.uwa.oz.au
Subject: Levin Search and EIRA
Date: Mon, 15 Apr 96 09:38:33 +0200


FTP-host: ftp.idsia.ch
FTP-file: /pub/marco/ml_levin_eira.ps.gz
or        /pub/juergen/ml_levin_eira.ps.gz


                Solving POMDPs with  Levin Search and EIRA

                Marco Wiering          Juergen Schmidhuber

                Machine Learning: 13th Intern. Conf., 1996
                9 pages, 86K compressed, 252K uncompressed
 
 Partially observable Markov decision problems (POMDPs) recently received 
 a lot of attention in the reinforcement learning community. No attention,
 however, has been paid to Levin's universal search through program space 
 (LS), which is theoretically optimal for a wide variety of search  prob-
 lems including  many POMDPs.  Experiments in this paper show that LS can 
 solve partially observable mazes (`POMs') involving many more states and 
 obstacles than those solved by various  previous authors.  We then note,
 however, that LS is not necessarily optimal  for learning problems where 
 experience with  previous problems  can be used to  speed up the search.
 For this reason,  we introduce an adaptive  extension of LS  (ALS) which 
 uses experience to increase  probabilities of instructions  occurring in 
 successful programs found by LS.  To deal with cases where  ALS does not
 lead to long-term performance improvement,  we use the  recent technique
 ``environment-independent reinforcement acceleration'' (EIRA) as a safe-
 ty belt (EIRA currently is the only known method that guarantees a life-
 long  history of reward  accelerations).   Additional experiments demon-
 strate: (a) ALS can dramatically reduce search time consumed by calls of 
 LS.   (b) Further significant speed-ups can be obtained by combining ALS 
 and EIRA.


 To obtain a copy, do one of these:
 netscape http://www.idsia.ch/~marco/publications.html
 netscape http://www.idsia.ch/~juergen/onlinepub.html

 Marco Wiering
 Juergen Schmidhuber                                               IDSIA



From moody@chianti.cse.ogi.edu Tue Apr 16 04:52:08 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id EAA20329 for <ml@sea.cs.wisc.edu>; Tue, 16 Apr 1996 04:52:02 -0500
Received: from cs.uwa.oz.au (bilby.cs.uwa.oz.au [130.95.1.11]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id EAA07522 for <ml@cs.wisc.edu>; Tue, 16 Apr 1996 04:51:59 -0500
Received: from  (mafm@parma.cs.uwa.oz.au [130.95.1.7]) by cs.uwa.oz.au (8.6.8/8.5) with SMTP id OAA13871; Tue, 16 Apr 1996 14:02:05 +0800
Message-Id: <199604160602.OAA13871@cs.uwa.oz.au>
From: John Moody <moody@chianti.cse.ogi.edu>
To: Reinforce@cs.uwa.edu.au
Cc: moody@cs.uwa.oz.au
Subject: Final CFP: NNs in the Capital Markets, Deadline May 1 [connectionists]
Date: Mon, 15 Apr 96 19:44:11 -0700



                  -- Final Call for Papers --

                            NNCM-96

                 FOURTH INTERNATIONAL CONFERENCE

              NEURAL NETWORKS in the CAPITAL MARKETS


              Wednesday-Friday, November 20-22, 1996
        The Ritz-Carlton Hotel, Pasadena, California, U.S.A.
          Sponsored by Caltech and London Business School


Original contributions representing new and significant research,
development, and applications in the following areas of interest
are invited: Price forecasting for stocks, bonds, commodities, and
foreign exchange; asset allocation and risk management; volatility
analysis and pricing of derivatives; cointegration, correlation,
and multivariate data analysis; credit assessment and economic
forecasting; statistical methods, learning techniques, and hybrid
systems.

Authors should send 5 copies of a 1000-word summary clearly stating
their results to
   Dr. Y. Abu-Mostafa, Caltech 136-93, Pasadena, CA 91125, U.S.A.
All submissions must be received before May 1, 1996. There will be
a rigorous refereeing process to select the high-quality papers to
be presented at the conference.

Mailing List:
If you wish to be added to the mailing list of NNCM-96, please send
your postal address, e-mail address, and fax number to
  Dr. Y. Abu-Mostafa, Caltech 136-93, Pasadena, CA 91125, U.S.A.
          e-mail:  yaser@caltech.edu , fax (818) 795-0326

Home Page:      http://www.cs.caltech.edu/~learn/nncm.html

From reiner@isy.liu.se Tue Apr 16 05:48:57 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id FAA20804 for <ml@sea.cs.wisc.edu>; Tue, 16 Apr 1996 05:48:51 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id FAA07853 for <ml@cs.wisc.edu>; Tue, 16 Apr 1996 05:48:50 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07003;
          16 Apr 96 5:04:58 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07001;
          16 Apr 96 4:40:44 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa12671;
          16 Apr 96 4:40:15 EDT
Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa22838; 16 Apr 96 4:38:26 EDT
Received: from isy.liu.se by CS.CMU.EDU id aa02489; 16 Apr 96 4:38:14 EDT
Received: from einstein.isy.liu.se by isy.liu.se (5.65b/isy.minimaster-V1.0b2)
	id AA17231; Tue, 16 Apr 96 10:38:07 +0200
From: Reiner Lenz <reiner@isy.liu.se>
Received: (from reiner@localhost) by einstein.isy.liu.se (8.7.1/8.7) id KAA12946; Tue, 16 Apr 1996 10:38:07 +0200 (MET DST)
Date: Tue, 16 Apr 1996 10:38:07 +0200 (MET DST)
Message-Id: <199604160838.KAA12946@einstein.isy.liu.se>
To: connectionists@cs.cmu.edu
Subject: Invariance, group representations and orientation estimation


Problems involving the concept of invariance have received a lot of
attention and although the following papers are somewhat outside the
field of neural networks perhaps someone may find something intresting
in them. 

The main idea is that invariance is often closely related to groups
and there representations and that these in turn are closely related
to special transforms. The most important example is shift-invariance
which is related to the additive group which lead to the Fourier
transform. 

If you are interested you can find some of the reprints in

http://www.isy.liu.se/~reiner/proj_desc/section3_3.html

GROUPS: is an overview article

P2-invariance: Describes the application to permutation and projection
	invariance

Group Theoretical Transforms: uses the dihedral group

Lie-Matching: computes the orientation parameters from 3-D data and is
	an example of fast iterative matching algorithms based on the
	interplay between Lie-group and Lie-algebra.


As I said before: Not strictly NN but perhaps interesting to someone.

Best regards 

"Kleinphi macht auch Mist"

Reiner Lenz | Dept. EE.                 |
            | Linkoeping University	| email:	reiner@isy.liu.se
            | S-58183 Linkoeping/Sweden |




From stefano@kant.irmkant.rm.cnr.it Tue Apr 16 17:09:02 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id RAA04805 for <ml@sea.cs.wisc.edu>; Tue, 16 Apr 1996 17:08:39 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id RAA21041 for <ml@cs.wisc.edu>; Tue, 16 Apr 1996 17:08:35 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07501;
          16 Apr 96 15:51:21 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07499;
          16 Apr 96 15:35:24 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa12896;
          16 Apr 96 15:34:04 EDT
Received: from RI.CMU.EDU by B.GP.CS.CMU.EDU id aa00535; 16 Apr 96 13:51:34 EDT
Received: from kant.irmkant.rm.cnr.it by RI.CMU.EDU id aa29343;
          16 Apr 96 13:48:58 EDT
Received: by kant.irmkant.rm.cnr.it (AIX 3.2/UCB 5.64/4.03)
          id AA19378; Tue, 16 Apr 1996 12:05:48 GMT
Date: Tue, 16 Apr 1996 12:05:48 GMT
From: Stefano Nolfi <stefano@kant.irmkant.rm.cnr.it>
Message-Id: <9604161205.AA19378@kant.irmkant.rm.cnr.it>
To: alife@cognet.ucla.edu, connectionists@cs.cmu.edu, gann@cs.iastate.edu
Subject: Paper available on adaptive classification with autonomous robots


Paper available via WWW / FTP: 

Keywords: Active Perception, Adaptive Behaviors, Evolutionary Robotics, 
          Neural Networks, Genetic Algorithms.
------------------------------------------------------------------------------

  ADAPTATION AS A MORE POWERFUL TOOL THAN DECOMPOSITION AND INTEGRATION

                            Stefano Nolfi
                  Institute of Psychology, C.N.R., Rome.

Recently  a  new  way  of building control systems, known as behavior based 
robotics, has been proposed to overcome the difficulties of the traditional 
AI approach to robotics. Most of  the work done in  behavior-based robotics 
involves a decomposition  process (in which the behavior required is broken 
down into simpler  sub-components) and an integration process (in which the 
modules designed to produce the sub-behaviors are  put together).  In  this 
paper we  claim that  decomposition and integration should be the result of 
an adaptation process and not of the decision of an experimenter.To support 
this hypothesis we show how  in  the  case of a simple task in which a real 
autonomous robot is supposed  to  classify objects of different shapes,  by  
letting the entire behavior emerge through an evolutionary technique,a more 
simple and robust solution can be obtained than  by  trying to design a set 
of modules and to integrate them.


http://kant.irmkant.rm.cnr.it/public.html    
or
ftp-server: kant.irmkant.rm.cnr.it (150.146.7.5)
ftp-file  : /pub/econets/nolfi.recog.ps.Z

for the homepage of our research group with most of our publications
available online and pointers to ALIFE resources see: 
http://kant.irmkant.rm.cnr.it/gral.html

----------------------------------------------------------------------------
Stefano Nolfi 
Institute of Psychology, C.N.R.
Viale Marx, 15 - 00137 - Rome - Italy
voice:  0039-6-86090231
fax:    0039-6-824737 
e-mail: stefano@kant.irmkant.rm.cnr.it
www:    http://kant.irmkant.rm.cnr.it/nolfi.html
From jhf@playfair.Stanford.EDU Wed Apr 17 00:43:47 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id AAA14967 for <ml@sea.cs.wisc.edu>; Wed, 17 Apr 1996 00:43:37 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id AAA28300 for <ml@cs.wisc.edu>; Wed, 17 Apr 1996 00:31:52 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07915;
          16 Apr 96 20:17:42 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07913;
          16 Apr 96 20:06:37 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa13106;
          16 Apr 96 20:06:05 EDT
Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa05372; 16 Apr 96 19:41:22 EDT
Received: from Playfair.Stanford.EDU by CS.CMU.EDU id aa09701;
          16 Apr 96 19:39:31 EDT
Received: (from jhf@localhost) by playfair.Stanford.EDU (8.7.1/8.6.10) id QAA22041 for connectionists@cs.cmu.edu; Tue, 16 Apr 1996 16:37:49 -0700
Date: Tue, 16 Apr 1996 16:37:49 -0700
From: "Jerome H. Friedman" <jhf@playfair.Stanford.EDU>
Message-Id: <199604162337.QAA22041@playfair.Stanford.EDU>
To: connectionists@cs.cmu.edu
Subject: Paper available.




                     *** Paper Announcement ***


                  ON BIAS, VARIANCE, 0/1 - LOSS, AND
                     THE CURSE-OF-DIMENSIONALITY

                         Jerome H. Friedman
                         Stanford University
                     (jhf@playfair.stanford.edu)

                              ABSTRACT

The classification problem is considered in which an output variable
assumes discrete values with respective probabilities that depend upon the
simultaneous values of a set of input variables. At issue is how error in
the estimates of these probabilities affects classification error when the
estimates are used in a classification rule. These effects are seen to be
somewhat counter intuitive in both their strength and nature. In particular
the bias and variance components of the estimation error combine to
influence classification in a very different way than with squared error on
the probabilities themselves. Certain types of (very high) bias can be
canceled by low variance to produce accurate classification. This can
dramatically mitigate the effect of the bias associated with some simple
estimators like "naive" Bayes, and the bias induced by the curse-of-
dimensionality on nearest-neighbor procedures. This helps explain why such
simple methods are often competitive with and sometimes superior to more
sophisticated ones for classification, and why "bagging/aggregating"
classifiers can often improve accuracy. These results also suggest simple
modifications to these procedures that can (sometimes dramatically) further
improve their classification performance.

Available by ftp from:
"ftp://playfair.stanford.edu/pub/friedman/curse.ps.Z"


From smyth@galway.ICS.UCI.EDU Wed Apr 17 00:46:21 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id AAA15057 for <ml@sea.cs.wisc.edu>; Wed, 17 Apr 1996 00:45:43 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id AAA28298 for <ml@cs.wisc.edu>; Wed, 17 Apr 1996 00:31:50 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07851;
          16 Apr 96 19:19:30 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07847;
          16 Apr 96 19:06:47 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa13019;
          16 Apr 96 19:00:38 EDT
Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa02627; 16 Apr 96 16:20:46 EDT
Received: from paris.ics.uci.edu by CS.CMU.EDU id aa06475;
          16 Apr 96 14:17:25 EDT
Received: from galway.ics.uci.edu by paris.ics.uci.edu id aa05163;
          16 Apr 96 11:02 PDT
X-Mailer: exmh version 1.6 4/21/95
To: ml@ics.uci.edu, ai-stats@watstat.uwaterloo.ca, nl-kr@snyside.sunnyside.com,
        mlnet@swi.psy.uva.nl, news-announce-conferences@uunet.uu.net,
        Connectionists@cs.cmu.edu, uai@maillist.cs.orst.edu,
        bayes-news@stat.cmu.edu, nl-kr@cs.rpi.edu,
        cogpsy@neuro.psy.soton.ac.uk, colt@cs.uiuc.edu, ilpnet@ijs.si,
        kdd@gte.com, reinforce@cs.uwa.edu.au, comp-finance@teleport.com,
        sigart@vaxa.isi.edu
Subject: Final CFP for Sixth AI and Statistics Workshop 
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Date: Tue, 16 Apr 1996 11:02:06 -0700
From: Padhraic Smyth <smyth@galway.ICS.UCI.EDU>
Message-ID:  <9604161102.aa05163@paris.ics.uci.edu>

Apologies to those of you who receive this more than once,
The deadline for 4-page abstracts is July 1, electronic submissions
are encouraged.

 Padhraic Smyth
 AIStats97 General Chair



                           Final Call For Papers

                      SIXTH INTERNATIONAL WORKSHOP ON
                  ARTIFICIAL INTELLIGENCE AND STATISTICS

                            January 4-7, 1997
                         Ft. Lauderdale, Florida

                 http://www.stat.washington.edu/aistats97/

PURPOSE:
This is the sixth in a series of workshops which has brought together
researchers in Artificial Intelligence (AI) and in Statistics to discuss
problems of mutual interest. The exchange has broadened research in both fields
and has strongly encouraged interdisciplinary work. Papers on all aspects of
the interface between AI & Statistics are encouraged.

FORMAT:
To encourage interaction and a broad exchange of ideas, the presentations will
be limited to about 20 discussion papers in single session meetings over three
days (Jan. 5-7). Focussed poster sessions will provide the means for presenting
and discussing the remaining research papers. Papers for poster sessions will
be treated equally with papers for presentation in publications.

Attendance at the workshop will *not* be limited.

The three days of research presentations will be preceded by a day of tutorials
(Jan. 4).  These are intended to expose researchers in each field to the
methodology used in the other field.  The tutorial speakers are A. P. Dawid
(University College London), Michael Jordan (MIT), Tom Mitchell (Carnegie
Mellon), and Mike West (Duke University).


TOPICS OF INTEREST:

        - automated data analysis and knowledge representation for
          statistics
        - statistical strategy
        - metadata and design of statistical data bases
        - multivariate graphical models, belief networks
        - causality
        - cluster analysis and unsupervised learning
        - predictive modeling: classification and regression
        - interpretability in modeling
        - model uncertainty, multiple models
        - probability and search
        - knowledge discovery in databases
        - integrated man-machine modeling methods
        - statistical methods in AI approaches to 
          vision, robotics, pattern recognition, software agents,
          planning, information retrieval, natural language processing, etc.
        - AI methods applied to problems in statistics such as
          statistical advisory systems, experimental design,
          exploratory data analysis, causal modeling, etc.

This list is not intended to define an exclusive list of topics
of interest. Authors are encouraged to submit papers on any topic
which falls within the intersection of AI and Statistics.

SUBMISSION REQUIREMENTS:

Three copies of an extended abstract (up to 4 pages) should be sent to

  David Madigan, Program Chair
  6th International Workshop on AI and Statistics
  Department of Statistics, Box 354322
  University of Washington
  Seattle, WA 98195

or electronically (postscript or latex preferred) to

           aistats@stat.washington.edu

Submissions for will be considered if *postmarked* by June 30, 1996.
If the submission is electronic (e-mail), then it must be *received*
by midnight July 1, 1996.

Please indicate which topic(s) your abstract addresses and include
an electronic mail address for correspondence. Receipt of all
submissions will be confirmed via electronic mail. Acceptance
notices will be mailed by September 1, 1996. Preliminary papers (up
to 20 pages) must be returned by November 1, 1996. These preliminary
papers will be copied and distributed at the workshop.

PROGRAM COMMITTEE:
General Chair:    P. Smyth              UC Irvine and JPL
Program Chair:    D. Madigan            U. Washington

Members:

     Russell Almond, ETS, Princeton
     Wray Buntine, Thinkbank, Inc.
     Peter Cheeseman, NASA Ames
     Paul Cohen, University of Massachusetts
     Greg Cooper, University of Pittsburgh
     Bill DuMouchel, Columbia University
     Doug Fisher, Vanderbilt University
     Dan Geiger, Technion
     Clark Glymour, Carnegie-Mellon University
     David Hand, Open University, UK
     Steve Hanks, University of Washington
     Trevor Hastie, Stanford University
     David Haussler, UC Santa Cruz
     David Heckerman, Microsoft
     Paula Hietala, University of Tampere, Finland
     Geoff Hinton, University of Toronto
     Mike Jordan, MIT
     Hans Lenz, Free University of Berlin, Germany
     David Lewis, AT&T Bell Labs
     Andrew Moore, Carnegie-Mellon University
     Radford Neal, University of Toronto
     Jonathan Oliver, Monash University, Australia
     Steve Omohundro, NEC Research, Princeton
     Judea Pearl, UCLA
     Daryl Pregibon, AT&T Bell Labs
     Ross Shachter, Stanford University
     Glenn Shafer, Rutgers University
     Prakash Shenoy, University of Kansas
     David Spiegelhalter, MRC, Cambridge, UK
     Peter Spirtes, Carnegie-Mellon University

MORE INFORMATION:
For more information see the workshop's Web page:
   http://www.stat.washington.edu/aistats97/
or write David Madigan at aistats@stat.washington.edu for
inquiries concerning the technical program or Padhraic Smyth
at aistats@jpl.nasa.gov for other inquiries about the workshop.

Write to ai-stats-request@watstat.uwaterloo.ca to
subscribe to the AI and Statistics mailing list.
--------

From ajit@austin.ibm.com Wed Apr 17 18:04:48 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id SAA07534 for <ml@sea.cs.wisc.edu>; Wed, 17 Apr 1996 18:04:41 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id SAA15713 for <ml@cs.wisc.edu>; Wed, 17 Apr 1996 18:04:39 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa09314;
          17 Apr 96 15:36:52 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa09275;
          17 Apr 96 14:59:41 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa13919;
          17 Apr 96 14:58:35 EDT
Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa17041;
          17 Apr 96 12:40:16 EDT
Received: from [129.35.208.98] by EDRC.CMU.EDU id aa13429;
          17 Apr 96 12:39:07 EDT
Received: from ding.austin.ibm.com (ding.austin.ibm.com [129.35.221.140]) by netmail.austin.ibm.com (8.6.12/8.6.11) with SMTP id LAA101599 for <Connectionists@CS.CMU.EDU>; Wed, 17 Apr 1996 11:37:54 -0500
Received: by ding.austin.ibm.com (AIX 3.2/UCB 5.64/4.03-client-2.6)
          for Connectionists@CS.CMU.EDU at austin.ibm.com; id AA32765; Wed, 17 Apr 1996 11:37:52 -0500
Date: Wed, 17 Apr 1996 11:37:52 -0500
From: Dingankar <ajit@austin.ibm.com>
Message-Id: <9604171637.AA32765@ding.austin.ibm.com>
To: Connectionists@cs.cmu.edu
Subject: Neuroprose paper announcement
Reply-To: ajit@austin.ibm.com
Organization: IBM, Austin
Ftp-Host: archive.cis.ohio-state.edu
Ftp-Filename: /pub/neuroprose/dingankar.tensor-products2.ps.Z


**DO NOT FORWARD TO OTHER GROUPS**
Sorry, no hardcopies available.
4 pages.

	Greetings!

	The following invited paper will be presented at ISCAS in May
1996.  The compressed PostScript file is available in the Neuroprose
archive; the details (URL, bibtex entry and abstract) follow.

	Thanks,
	Ajit
------------------------------------------------------------------------------
URL:
ftp://archive.cis.ohio-state.edu/pub/neuroprose/dingankar.tensor-products2.ps.Z

BiBTeX entry:
@INPROCEEDINGS{atd:iscas-96,
	AUTHOR		="Dingankar, Ajit T. and Sandberg, Irwin W.",
	TITLE		="{Tensor Product Neural Networks and
		 Approximation of Dynamical Systems}",
	BOOKTITLE	="Proceedings of the International Symposium
		 on Circuits and Systems",
	YEAR		="1996",
	EDITOR		="",
	PAGES		="",
	ORGANIZATION	="",
	PUBLISHER	="",
	ADDRESS		="Atlanta, Georgia",
	MONTH		="May 13--15"
}

     Tensor Product Neural Networks and Approximation of Dynamical Systems
     ---------------------------------------------------------------------
				ABSTRACT
	We consider the problem of approximating any member of a large
class of input-output operators of nonlinear dynamical systems.  The
systems need not be shift invariant, and the system inputs need not be
continuous.  We introduce a family of ``tensor product'' dynamical
neural networks, and show that a certain continuity condition is
necessary and sufficient for the existence of arbitrarily good
approximations using this family.

From jlarsen@eivind.ei.dtu.dk Wed Apr 17 18:04:51 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id SAA07532 for <ml@sea.cs.wisc.edu>; Wed, 17 Apr 1996 18:04:39 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id SAA15711 for <ml@cs.wisc.edu>; Wed, 17 Apr 1996 18:04:37 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa09273;
          17 Apr 96 15:26:18 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa09271;
          17 Apr 96 14:58:30 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa13911;
          17 Apr 96 14:58:03 EDT
Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa13879; 17 Apr 96 8:28:38 EDT
Received: from eivind.ei.dtu.dk by EDRC.CMU.EDU id aa12334;
          17 Apr 96 8:27:48 EDT
Received: from jl.ei.dtu.dk by eivind.ei.dtu.dk with SMTP(1.38.193.4/16.2)
	for connectionists@cs.cmu.edu id AA02648; Wed, 17 Apr 1996 14:30:37 +0200
Received: by jl.ei.dtu.dk with Microsoft Mail
	id <01BB2C6A.058CF520@jl.ei.dtu.dk>; Wed, 17 Apr 1996 14:27:35 +-200
Message-Id: <01BB2C6A.058CF520@jl.ei.dtu.dk>
From: Jan Larsen <jlarsen@eivind.ei.dtu.dk>
To: "'connectionists@cs.cmu.edu'" <connectionists@cs.cmu.edu>
Subject: Ph.D. Course in Advanced Digital Signal Processing
Date: Wed, 17 Apr 1996 14:27:33 +-200
Encoding: 41 TEXT

********************    
*** ANNOUNCEMENT ***  
********************  

Ph.D. Course in Advanced Digital Signal Processing

Host: Section for Digital Signal Processing, Dept. of Mathematical Modelling,
      Technical University of Denmark.

Course responsible persons: 
      Assoc. Prof. Lars Kai Hansen, email: lkhansen@ei.dtu.dk
      Assoc. Prof. Steffen Duus Hansen, email: sdh@imm.dtu.dk
      Assis. Prof. Jan Larsen, email: jl@imm.dtu.dk
      Assoc. Prof. John Aasted Sorensen, email: jaas@imm.dtu.dk 

Course Highlight:
      * Design of neural networks.
      * Signal processing with neural networks.
      * Vector quantization with application to speech technology.
      * Adaptive signal processing, filter banks and wavelets.

Dates: Full time in weeks 25, 26 and 27, June and July 1996.

Registration: 
      Deadline: May 1, 1996.
      Department of Mathematical Modelling, Build. 321,
      Technical University of Denmark, DK-2800 Lyngby,
      Phone +45 45881433. Fax +45 45881397.
      Notification of acceptance: May 10, 1996.

Further info:
     Course Description: http://www.ei.dtu.dk/teaching/phd_AdvDigSignalProc.html
     DSP Section Homepage: http://www.ei.dtu.dk/dsphomepage.html
     

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!! Please forward this message to people who might be interested !!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!


-- Jan Larsen

From verleysen@dice.ucl.ac.be Thu Apr 18 15:28:58 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id PAA27917 for <ml@sea.cs.wisc.edu>; Thu, 18 Apr 1996 15:28:49 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id PAA04154 for <ml@cs.wisc.edu>; Thu, 18 Apr 1996 15:28:47 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa10593;
          18 Apr 96 14:16:27 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa10591;
          18 Apr 96 13:55:57 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa00359;
          18 Apr 96 13:55:31 EDT
Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa04903;
          18 Apr 96 12:59:57 EDT
Received: from ns1.dice.ucl.ac.be by EDRC.CMU.EDU id aa19510;
          18 Apr 96 12:58:15 EDT
Received: from [130.104.31.81] (Roger-Rabbit.dice.ucl.ac.be [130.104.31.81]) by ns1.dice.ucl.ac.be (8.7.4/13.12.95) with SMTP id QAA05395; Thu, 18 Apr 1996 16:16:19 +0200 (MET DST)
Message-Id: <199604181416.QAA05395@ns1.dice.ucl.ac.be>
X-Sender: verleyse@ns1.dice.ucl.ac.be
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 18 Apr 1996 16:21:32 +0100
To: NEURO1-L@UICVM.CC.UIC.EDU, neuron-request@CATTELL.psych.upenn.edu,
        Connectionists@cs.cmu.edu, enns-list@dcs.kcl.ac.uk, neur-sci@dl.ac.uk,
        comp-neuro@smaug.bbb.caltech.edu, frog-net@rana.usc.edu,
        echos@dmi.ens.fr, cogni-info@univ-lyon1.fr, neuropl@plearn.edu.pl
From: verleysen@dice.ucl.ac.be
Subject: Neural Processing Letters - new publisher

Dear colleagues,

The "Neural Processing Letters" journal is published each two months since
1994; its aim is to rapidly publish new ideas or new developments in the
field of artificial neural networks.  Today, we are happy to announce you
that Kluwer Academic Publishers will publish this journal from 1996, in
order to ensure its worldwide distribution.

More information will be soon available on a WWW server.  Nevertheless, in
the meantime,you will find enclosed some details from Kluwer (see below).
You can also contact Mike Casey for free sample copies of the journal, and
any details about the submission of papers:
        Mike Casey
        Kluwer academic publishers
        Spuiboulevard 50
        P.O. Box 17
        NL - 3300 AA Dordrecht
        The Netherlands
        Phone: + 31 78 6392219
        Fax: + 31 78 6392254
        E-mail: casey@wkap.nl

Thank you for your interest in this journal.

Michel Verleysen, co-editor.

-----------------------------------------------------------------------------
-----------------------------------------------------------------------------

Neural Processing Letters
-------------------------

Editor:
Michel Verleysen
Universite Catholique de Louvain, Belgium
Francois Blayo
EERIE, Lyon, France

Neural Processing Letters is an international journal
publishing research results and innovative ideas in all fields of
artificial neural networks. Prospective authors are encouraged to
submit letters concerning any aspect of the Artificial Neural Networks
field including, but not restricted to, theoretical developments,
biological models, new formal modes, learning, applications, software
and hardware developments, and prospective researches.
The journal promotes fast exchange of information in the community of
neural network researchers and users. The resurgence of interest in
the field of artificial neural networks since the beginning of the
1980s is coupled to tremendous research activity in specialized or
multidisciplinary groups. Research, however, is not possible without
good communication between people and the exchange of information,
especially in a field covering such different areas; fast
communication is also a key aspect, and this is the reason for
Neural Processing Letters.

Subscription Information:

Kluwer Academic Publishers, Boston

ISSN: 1370-4621
1996, Volumes 3-4 (6 issues)

Prices:

Institutional Price NLG:  357.00
Institutional Price USD:  217.00
Private Price NLG:  250.00
Private Price USD:  150.00


=============================================================================
                        SUBSCRIPTION ORDER FORM

Journal Title: Neural Processing Letters
1996, Volumes 3-4 (6 issues)
ISSN: 1370-4621  Institutional Rate: NLG:  357.00 USD:  217.00


Ref: KAPIS

( ) Payment enclosed to the amount of ___________________________
( ) Please send invoice
( ) Please charge my credit card account:

    Card no.: |_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|  Expiry date: ______________

    () Access       () American Express     () Mastercard
    () Diners Club  () Eurocard             () Visa

    Name of Card holder: ___________________________________________________

Delivery address:

Title       : ___________________________ Initials: _______________M/F______

First name  : ______________________ Surname: ______________________________

Organization: ______________________________________________________________

Department  : ______________________________________________________________

Address     : ______________________________________________________________

Postal Code : ___________________ City: ____________________________________

Country     : _____________________________Telephone: ______________________

Email       : ______________________________________________________________

Date        : _____________________ Signature: _____________________________

Our European VAT registration number is: |_|_|_|_|_|_|_|_|_|_|_|_|_|_|

To be sent to:
For customers in Mexico, USA, Canada and    Rest of the world:
Latin America:

Kluwer Academic Publishers                  Kluwer Academic Publishers Group
Order Department                            Journals Department
P.O. Box 358                                P.O. Box 322
Accord Station                              3300 AH Dordrecht
Hingham, MA 02018-0358                      The Netherlands
U.S.A.

Tel    : 617 871 6600                       Tel   : +31 78 6392392
Fax    : 617 871 6528                       Fax   : +31 78 6546474
Email  : kluwer@wkap.com                    Email : services@wkap.nl

Payment will be accepted in any convertible currency. Please check the rate
of exchange with your bank. Prices are subject to change without notice. All
prices are exclusive of Value Added Tax (VAT). Customers in the Netherlands
please add 6% VAT. Customers from other countries in the European Community:
* please fill in the VAT number of your institute/company in the appropriate
  space on the orderform: or
* please add 6% VAT to the total order amount (customers from the U.K. are
  not charged VAT).

=============================================================================






=====================================================
Michel Verleysen
Universite Catholique de Louvain
Microelectronics Laboratory
3, pl. du Levant
B-1348 Louvain-la-Neuve
Belgium

tel: +32 10 47 25 51
fax: + 32 10 47 86 67
E-mail: verleysen@dice.ucl.ac.be
WWW: http://www.dice.ucl.ac.be/~verleyse/MV.html
=====================================================



From terry@salk.edu Thu Apr 18 21:17:57 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id VAA02885 for <ml@sea.cs.wisc.edu>; Thu, 18 Apr 1996 21:17:41 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id VAA10151 for <ml@cs.wisc.edu>; Thu, 18 Apr 1996 21:17:39 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa10609;
          18 Apr 96 14:31:30 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa10607;
          18 Apr 96 14:21:02 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa00403;
          18 Apr 96 14:20:26 EDT
Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa05942; 18 Apr 96 14:13:23 EDT
Received: from helmholtz.salk.edu by CS.CMU.EDU id aa26328;
          18 Apr 96 14:11:58 EDT
Received: by salk.edu (4.1/SMI-4.1)
	id AA17272; Thu, 18 Apr 96 11:04:23 PDT
Date: Thu, 18 Apr 96 11:04:23 PDT
From: Terry Sejnowski <terry@salk.edu>
Message-Id: <9604181804.AA17272@salk.edu>
To: connectionists@cs.cmu.edu
Subject: NEURAL COMPUTATION 8:4
Cc: terry@salk.edu

Neural Computation -  Contents Volume 8, Number 4 - May 15, 1996

Article:

Stable encoding of large finite-state automata in recurrent
neural networks with signoid discriminants
        Christian W. Omlin and C. Lee Giles
Note:

Unicycling helps your French:  Spontaneous recovery of association
by learning unrelated tasks
        Inman Harvey and James V. Stone
Letters:

A theory of the visual motion coding in the primary visual cortex
        Zhaoping Li

Alignment of Coexisting Cortical Maps in a Motor Control Model
        James A. Reggia and Yinong Chen

Controlling the magnification factor of self-organizing feature maps
        H.-U. Bauer, R. Der and M. Herrmann

Semilinear Predictability Minimization Produces Well-Known Feature Detectors
        Jurgen Schmidhuber, Martin Eldracher and Bernhard Foltin

Learning with preknowledge:  Clustering with point and graph matching
distance measures
        Steven Gold, Anand Rangarajan and Eric Mjolsness

Analog versus discrete neural networks
        Bhaskar DasGupta and Georg Schnitger

On the relationship between generalization error, hypothesis
complexity, and sample complexity for radial basis functions
        Partha Niyogi and Federico Girosi

Using neural networks to model conditional multivariate densities
        Peter M. Williams

Pruning with replacement on limited resource allocation networks by F-projections
        Christophe Molina and Mahesan Niranjan

Engineering mulitversion neural-net systems
        D. Partridge and W. B. Yates

Effects of nonlinear synapses on the performance of multilayer neural networks
        G. Dundar, F-C. Hsu, and K. Rose

-----

ABSTRACTS - http://www-mitpress.mit.edu/jrnls-catalog/neural.html

SUBSCRIPTIONS - 1996 - VOLUME 8 - 8 ISSUES

______ $50     Student and Retired
______ $78     Individual
______ $220    Institution

Add $28 for postage and handling outside USA (+7% GST for Canada).

(Back issues from Volumes 1-7 are regularly available for $28 each
to institutions and $14 each for individuals
Add $5 for postage per issue outside USA (+7% GST for Canada)

mitpress-orders@mit.edu

MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142.
Tel: (617) 253-2889  FAX: (617) 258-6779

-----

From robert@fit.qut.edu.au Fri Apr 19 13:45:08 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id NAA17525 for <ml@sea.cs.wisc.edu>; Fri, 19 Apr 1996 13:45:00 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id NAA23284 for <ml@cs.wisc.edu>; Fri, 19 Apr 1996 13:44:58 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa11889;
          19 Apr 96 11:32:30 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa11887;
          19 Apr 96 11:14:20 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa01447;
          19 Apr 96 11:14:16 EDT
Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa16267; 19 Apr 96 3:55:35 EDT
Received: from ocean.fit.qut.edu.au by EDRC.CMU.EDU id aa22897;
          19 Apr 96 3:55:11 EDT
Received: (from robert@localhost) by ocean.fit.qut.edu.au (8.7.4/8.7.2) id RAA12544; Fri, 19 Apr 1996 17:26:17 +1000 (EST)
Date: Fri, 19 Apr 1996 17:26:17 +1000 (EST)
From: Robert Andrews <robert@fit.qut.edu.au>
To: connectionists@cs.cmu.edu
Subject: Rule Extraction Book
Message-ID: <Pine.HPP.3.91.960419172440.12325B-100000@ocean.fit.qut.edu.au>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

======================== NEW BOOK ANNOUNCEMENT ============================

                          RULES AND NETWORKS
                 Proceedings of the Rule Extraction
               From Trained Artificial Neural Networks
                            Workshop

            Society for the Study of Artificial Intelligence
        and the Simulation of Behavior Workshop Series, (AISB'96)
          University of Sussex, Brighton, UK. 2nd April, 1996

             Robert Andrews & Joachim Diederich (Editors)


=========================== ORDER FORM ===================================

        Name: _________________________________________________

        Address: ______________________________________________

                 ______________________________________________

                 ______________________________________________

                 ______________________________________________


        Number of Copies: __________  @ $22.00 (Australian) ___________

        Postage & Handling (A$4.00 in Aust, A$10.00 O'Seas) ___________

                                                    TOTAL   ___________


        Payment (in Australian Dollars)
        Cheque/Money Order made out to:
                QUT BookShop
                GPO Box 2434, Brisbane. 4001.
                Queensland, Australia.


        Credit Card: MasterCard / Visa / BankCard

        Number: _ _ _ _  _ _ _ _  _ _ _ _  _ _ _ _

        Expiry:    /     /


======================= TABLE OF CONTENTS ================================

Rules and Local Function Networks
Robert Andrews and Shlomo Geva                                                   

The Extraction of Sugeno Fuzzy Rules From Neural Networks
Adelmo L. Cechin, Ulrich Epperlein, 
Wolfgang Rosenstiel and Bernhard Koppenhoefer                                    

RULE_OUT Method: A New Approach For Knowledge 
Explicitation From Trained ANN
Loic Decloedt, Fernando Osorio and Bernard Amy                                   

Rule Initialisation by Neural Networks
Joachim Diederich, James M Hogan, 
Mostefa Golea and Santhi Muthiah

Explaining Results of Neural Networks by Contextual 
Importance and Utility
Kary Framling                                                                    

On the Complexity of Rule Extraction From Neural Networks 
and Network Querying 
Mostefa Golea                                                                    

Rule Extraction from Neural Networks
Peter Howes and Nigel Crook                                                      

Using Relevance Information in the Acquisition of Rules 
>From a Neural Network
Geraint Johnson, L Nealon and Roger O. Lindsay                                   

Initialization by Rule Induction Prior to Learning
Ralf Salomon                                                                     

DEDEC: A Methodology for Extracting Rules From 
Trained Artificial Neural Networks
Alan B. Tickle, Marian Orlowski and Joachim Diederich                            

An Algorithm for Extracting Propositions From Trained 
Neural Networks Using Mltilinear Functions
Hiroshi Tsukimoto and Chie Morita                                                

Automatic Acquisition of Symbolic Knowledge From 
Subsymbolic Neural Networks
Alfred Ultsch and Dieter Korus                                                   

Rule Extraction From Trained Neural Networks: Different 
Techniques for the Determination of Herbicides for the 
Plant Protection Advisory  System PRO_PLANT 
Ubbo Visser, Alan Tickle, Ross Hayward and Robert Andrews                        

From pelillo@dsi.unive.it Sat Apr 20 14:25:06 1996
Received: from lucy.cs.wisc.edu (lucy.cs.wisc.edu [128.105.2.11]) by sea.cs.wisc.edu (8.6.12/8.6.12) with ESMTP id OAA01223 for <ml@sea.cs.wisc.edu>; Sat, 20 Apr 1996 14:24:46 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU (TELNET-1.SRV.CS.CMU.EDU [128.2.254.108]) by lucy.cs.wisc.edu (8.6.12/8.6.12) with SMTP id WAA01366 for <ml@cs.wisc.edu>; Fri, 19 Apr 1996 22:40:58 -0500
Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa12157;
          19 Apr 96 16:17:56 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa12155;
          19 Apr 96 15:57:57 EDT
Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa01526;
          19 Apr 96 15:33:27 EDT
Received: from RI.CMU.EDU by B.GP.CS.CMU.EDU id aa21496; 19 Apr 96 11:41:16 EDT
Received: from oink.dsi.unive.it by RI.CMU.EDU id aa14176; 19 Apr 96 9:37:58 EDT
Organization: CDL Informatica - Universita' Venezia
Received: (from pelillo@localhost) by oink.dsi.unive.it (8.7.3/8.7.3) id PAA19019 for Connectionists@CS.CMU.EDU; Fri, 19 Apr 1996 15:09:33 +0200 (MET DST)
From: Marcello Pelillo <pelillo@dsi.unive.it>
Message-Id: <199604191309.PAA19019@oink.dsi.unive.it>
Subject: EMMCVPR'97 - Venice - Call for Papers
To: Connectionists@cs.cmu.edu
Date: Fri, 19 Apr 1996 15:09:32 +0200 (MET DST)
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit


                              CALL FOR PAPERS

                         International Workshop on

                       ENERGY MINIMIZATION METHODS IN
                  COMPUTER VISION AND PATTERN RECOGNITION

                      Venice, Italy, May 21-23, 1997


Energy minimization methods represent a fundamental methodology in computer
vision and pattern recognition, with roots in such diverse disciplines as
Physics, Psychology, and Statistics. Recent manifestations of the idea
include Markov random fields, relaxation labeling, various types of neural
networks, etc. These techniques are finding application in areas such as
early vision, graph matching, motion analysis, visual reconstruction, etc.
The aim of this workshop is to consolidate research efforts in this area,
and to provide a discussion forum for researchers and practitioners
interested in this important yet diverse subject.
The scientific program of the workshop will include the presentation of 
invited talks and contributed research papers. The workshop is sponsored by
the International Association for Pattern Recognition (IAPR) and
organized by the Department of Applied Mathematics and Computer Science of
the University of Venice "Ca' Foscari."


Topics

Papers covering (but not limited to) the following topics are solicited:

Theory: (e.g., Bayesian contextual methods, biology-inspired methods,
discrete optimization, information theory and statistics, learning 
and parameter estimation, Markov random fields, neural networks,
relaxation processes, statistical mechanics approaches, stochastic methods,
variational methods)

Methodology: (e.g., deformable models, early vision, matching, motion,
object recognition, shape, stereo, texture, visual organization)

Applications: (e.g., character and text recognition, face processing,
handwriting, medical imaging, remote sensing)


Program co-chairs

Marcello Pelillo, University of Venice, Italy
Edwin R. Hancock, University of York, UK


Program committee

Davi Geiger, New York University, USA
Anil K. Jain, Michigan State University, USA
Josef Kittler, University of Surrey, UK
Stan Z. Li, Nanyang Technological University, Singapore
Jean-Michel Morel, Universite' Paris Dauphine, France
Maria Petrou, University of Surrey, UK
Anand Rangarajan, Yale University, USA
Sergio Solimini, Polytechnic of Bari, Italy
Alan L. Yuille, Harvard University, USA
Josiane Zerubia, INRIA, France
Steven W. Zucker, McGill University, Canada


Invited speakers

Anil K. Jain, Michigan State University, USA
Josef Kittler, University of Surrey, UK
Alan L. Yuille, Harvard University, USA
Steven W. Zucker, McGill University, Canada


Venue

The workshop will be held at the University of Venice "Ca' Foscari."
The lecture theater will be in the historic center of  Venice, and
accommodation will be provided in nearby hotels.


Submission procedure

Prospective authors should submit four copies of their contribution(s)
by September 9, 1996 to:

     Marcello Pelillo (EMMCVPR'97)
     Dipartimento di Matematica Applicata e Informatica
     Universita' "Ca' Foscari" di Venezia
     Via Torino 155, 30173 Venezia Mestre, Italy
     E-mail: pelillo@dsi.unive.it

The manuscripts submitted should be no longer than 15 pages, and the 
cover page should contain: title, author's name, affiliation and address,
e-mail address, fax and telephone number, and an abstract no longer than 
200 words. In case of joint authorship, the first name will be used for 
correspondence unless otherwise requested.
All manuscripts will be reviewed by at least two members of the program
committee. Accepted papers will appear in the proceedings which are expected
to be published in the series Lecture Notes in Computer Science by
Springer-Verlag, and will be distributed to all participants at the workshop.
In order to get a high-quality book with a uniform and professional
appearance, prospective authors are strongly encouraged to use the
LaTeX style file available at the WWW site indicated below.


Important dates

Paper submission deadline: September 9, 1996
Notification of acceptance: December 1996
Camera-ready paper due: February 1997


Homepage

Information on the workshop is maintained at

        http://Dcpu1.cs.york.ac.uk:6666/~adjc/EMMCVPR97.html

This page will be updated continuously and will include information on
accepted papers and the final program.


Concomitant events

During the week following EMMCVPR'97, participants will have the opportunity
to attend the 3rd International Workshop on Visual Form (IWVF3) to be 
held  in Capri, May 28-30. For additional information please contact any of
the co-chairmen Carlo Arcelli (car@imagm.na.cnr.it), Luigi Cordella
(cordel@nadis.dis.unina.it), and Gabriella Sanniti di Baja
(gsdb@imagm.na.cnr.it), or see http://amalfi.dis.unina.it/IWF3/iwvf3cfp.html



