From jagota@next2.msci.memst.edu Sun Apr 9 02:22:03 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Sun, 9 Apr 95 02:22:00 -0500; AA05297 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Sun, 9 Apr 95 02:21:58 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa05095; 9 Apr 95 2:37:45 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa05093; 9 Apr 95 2:21:17 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa01395; 9 Apr 95 2:21:09 EDT Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa16229; 8 Apr 95 14:11:43 EDT Received: from [141.225.11.11] by EDRC.CMU.EDU id aa14869; 8 Apr 95 14:10:42 EDT Received: by next2 id AA06512 (5.65c/IDA-1.4.4 for Connectionists@cs.cmu.edu); Sat, 8 Apr 1995 13:09:02 -0500 Date: Sat, 8 Apr 1995 13:09:02 -0500 From: Arun Jagota Message-Id: <199504081809.AA06512@next2> To: Connectionists@cs.cmu.edu Subject: HKP excercises Dear Connectionists: The text "Introduction to the Theory of Neural Computation" by Hertz, Krogh, and Palmer does not come with excercises, so I have compiled some of my own, in connection with a neural nets course I am teaching this term (for the second time from HKP). Professor Palmer, who I discussed this with, liked the idea of making this list available on Connectionists. If you would like this compilation of "classroom tested" excercises and some computer projects, please send me electronic mail at jagota@next2.msci.memst.edu List is available only by e-mail at present so I can keep track of responses. Currently it is a little biased, reflecting my background and interests. To correct this bias and to expand the list, I invite submissions of new material (via e-mail to me). Submissions should pertain to the material as covered in HKP. The list is especially lacking excercises on Chapters SEVEN (Recurrent Networks), EIGHT (Unsupervised Hebbian Learning), and NINE (Unsupervised Competitive Learning). Submissions in LaTeX would be especially convenient for me. The final list, including all "accepted" submissions, will be forwarded also to Professor Palmer, who has indicated he might evolve it into a possibly larger list. All submissions I decide to include will be acknowledged. Arun Jagota Math Sciences, University of Memphis From edelman@wisdom.weizmann.ac.il Sun Apr 9 18:30:55 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Sun, 9 Apr 95 18:30:53 -0500; AA25203 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Sun, 9 Apr 95 18:30:51 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa06018; 9 Apr 95 18:38:50 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa06016; 9 Apr 95 18:31:19 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa01890; 9 Apr 95 18:30:29 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa24229; 9 Apr 95 9:33:29 EDT Received: from narkis.wisdom.weizmann.ac.il by CS.CMU.EDU id aa22684; 9 Apr 95 9:33:20 EDT Received: from lachesis.wisdom.weizmann.ac.il (lachesis.wisdom.weizmann.ac.il [132.76.80.188]) by narkis.wisdom.weizmann.ac.il (8.6.5/mail.byaddr) with ESMTP id QAA01742; Sun, 9 Apr 1995 16:31:33 +0300 From: Edelman Shimon Received: (edelman@localhost) by lachesis.wisdom.weizmann.ac.il (8.6.9/8.6.5) id NAA07037; Sun, 9 Apr 1995 13:31:34 GMT Date: Sun, 9 Apr 1995 13:31:34 GMT Message-Id: <199504091331.NAA07037@lachesis.wisdom.weizmann.ac.il> To: connectionists@cs.cmu.edu Cc: sharon@wisdom.weizmann.ac.il Subject: TR available: representation by similarity to prototypes FTP-host: eris.wisdom.weizmann.ac.il (132.76.80.53) FTP-filename: /pub/cs-tr-95-11.ps.Z 30 pages, with 23 figures; about 7 MB uncompressed, 1.4 MB compressed ---------------------------------------------------------------------- On Similarity to Prototypes in 3D Object Representation Sharon Duvdevani-Bar and Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science A representational scheme under which the ranking between represented dissimilarities is isomorphic to the ranking between the corresponding shape dissimilarities can support perfect shape classification, because it preserves the clustering of shapes according to the natural kinds prevailing in the external world. We discuss the computational requirements of rank-preserving representation, and examine its plausibility within a prototype-based framework of shape vision. ---------------------------------------------------------------------- -Shimon Shimon Edelman, Applied Math & CS, Weizmann Institute http://www.wisdom.weizmann.ac.il/~edelman/shimon.html Cyber Rights Now: Accept No Compromise From peg@cs.rochester.edu Mon Apr 10 20:43:35 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Mon, 10 Apr 95 20:43:33 -0500; AA19101 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Mon, 10 Apr 95 20:43:31 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07248; 10 Apr 95 18:49:32 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07246; 10 Apr 95 18:28:49 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa02800; 10 Apr 95 18:28:33 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa04275; 10 Apr 95 10:26:05 EDT Received: from cayuga.cs.rochester.edu by CS.CMU.EDU id aa01065; 10 Apr 95 9:22:40 EDT Received: from artery.cs.rochester.edu (artery.cs.rochester.edu [192.5.53.113]) by cayuga.cs.rochester.edu (8.6.9/G) with ESMTP id IAA11900 for ; Mon, 10 Apr 1995 08:44:17 -0400 Received: (from peg@localhost) by artery.cs.rochester.edu (8.6.9/G) id IAA27809 for connectionists@cs.cmu.edu; Mon, 10 Apr 1995 08:44:14 -0400 Date: Mon, 10 Apr 1995 08:44:14 -0400 From: peg@cs.rochester.edu Message-Id: <199504101244.IAA27809@artery.cs.rochester.edu> To: connectionists@cs.cmu.edu Subject: Ballard et al., "Deictic Codes ... Embodiment of Cognition" Title: Deictic Codes for the Embodiment of Cognition Authors: Dana H. Ballard, Mary M. Hayhoe, and Polly K. Pook ftp.cs.rochester.edu, directory pub/papers/ai http://www.cs.rochester.edu/trs/ai-trs.html filename: 95.NRLTR1.Deictic_codes_for_the_embodiment_of_cognition.ps.gz To describe phenomena that occur at different time scales, computational models of the brain necessarily must incorporate different levels of abstraction. We argue that at time scales of approximately one-third of a second, orienting movements of the body play a crucial role in cognition and form a useful computational level, termed the embodiment level. At this level, the constraints of the body determine the nature of cognitive operations, since the natural sequentiality of body movements can be matched to the natural computational economies of sequential decision systems. The way this is done is through a system of implicit reference termed deictic, whereby pointing movements are used to bind objects in the world to cognitive programs. We show how deictic bindings enable the solution of natural tasks and argue that one of the central features of cognition, working memory, can be related to moment-by-moment dispositions of body features such as eye movements and hand movements. From jagota@next2.msci.memst.edu Mon Apr 10 20:43:38 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Mon, 10 Apr 95 20:43:36 -0500; AA19107 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Mon, 10 Apr 95 20:43:33 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07276; 10 Apr 95 18:57:20 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07250; 10 Apr 95 18:29:43 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa02806; 10 Apr 95 18:29:17 EDT Received: from RI.CMU.EDU by B.GP.CS.CMU.EDU id aa07075; 10 Apr 95 12:49:19 EDT Received: from next2.msci.memphis.edu by RI.CMU.EDU id aa17455; 10 Apr 95 12:48:48 EDT Received: by next2 id AA16003 (5.65c/IDA-1.4.4 for connectionists@cs.cmu.edu); Mon, 10 Apr 1995 11:47:10 -0500 Date: Mon, 10 Apr 1995 11:47:10 -0500 From: Arun Jagota Message-Id: <199504101647.AA16003@next2> To: connectionists@cs.cmu.edu Subject: HKP followup Dear Connectionists: My apologies for a followup post on Connectionists; however I think it useful. So far I have received about 140 requests for HKP exercises. (I anticipated a large response and gave my email address where I don't receive mail from anywhere else.) I am glad this effort is of interest to so many people, and thank all who responded or will. However, I have received only one set of contributions so far. If you have potentially usable HKP-type questions sitting somewhere in your directories, especially on chapters 6 to 9, please do consider sending them to me. I am willing to sift through them, and clean them up if necessary. (Only in English, however, please.) I will send the HKP list to all who requested some time next week (Apr 16-21). Regards, Arun Jagota Math Sciences, University of Memphis From pja@barbarian.endicott.ibm.com Tue Apr 11 04:07:46 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 04:07:42 -0500; AA04545 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Tue, 11 Apr 95 04:07:40 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id ab07276; 10 Apr 95 18:58:38 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id ab07250; 10 Apr 95 18:29:59 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa02810; 10 Apr 95 18:29:33 EDT Received: from MAILBOX.SRV.CS.CMU.EDU by B.GP.CS.CMU.EDU id aa08040; 10 Apr 95 14:32:55 EDT Received: by MAILBOX.SRV.CS.CMU.EDU id aa16295; 10 Apr 95 14:30:37 EDT Received: from inetgw.lfs.loral.com by MAILBOX.SRV.CS.CMU.EDU id aa16248; 10 Apr 95 14:11:19 EDT Received: from barbarian.endicott.ibm.com by inetgw.fsc.ibm.com (AIX 3.2/UCB 5.64/4.03) id AA70932; Mon, 10 Apr 1995 13:09:06 -0400 Received: by barbarian.endicott.ibm.com (AIX 3.2/UCB 5.64/4.03) id AA12914; Mon, 10 Apr 1995 13:04:26 -0400 Date: Mon, 10 Apr 1995 13:04:26 -0400 From: "Peter J. Angeline" Message-Id: <9504101704.AA12914@barbarian.endicott.ibm.com> To: EP-List@magenta.me.fau.edu, Genetic-Programming@cs.stanford.edu, TIERRA@life.slhs.udel.edu, alife@cognet.ucla.edu, colt@cs.uiuc.edu, connectionists@MAILBOX.SRV.CS.CMU.EDU, evolutionary-computing@mailbase.ac.uk, ga-molecule-approval@interval.com, gann-list@cs.iastate.edu Subject: Student Travel Assistance to ICGA Reply-To: pja@lfs.loral.com There is a limited amount of money set aside for student travel assistance to this year's ICGA. Below is the relevant information. I encourage everyone to look at the ICGA95 homepage at URL: http://www.aic.nrl.navy.mil:80/galist/icga95/ for additional details. I've included some information below. -pete +----------------------------------------------------------------------------+ | Peter J. Angeline, PhD | | | Advanced Technologies Dept. | | | Loral Federal Systems | | | State Route 17C | I have nothing to say, | | Mail Drop 0210 | and I am saying it. | | Owego, NY 13827-3994 | | | Voice: (607)751-4109 | - John Cage | | Fax: (607)751-6025 | | | Email: pja@lfs.loral.com | | +----------------------------------------------------------------------------+ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Travel Assistance Information ----------------------------- The Naval Center for Applied Research in Artificial Intelligence at the Naval Research Laboratory and the ICGA-95 conference committee has provided a limited amount of funds for student travel assistance to ICGA-95. Travel assistance will be granted to those students demonstrating a need and will be limited to partial compensation for travel expenses to the conference site. No other expenses will be considered. Important Information --------------------- To Receive Travel Assistance: o Make a formal request for travel assistance funds to the conference financial chair. Contact information is below. Email is the preferred method of applying for funds. o Have your advisor forward a letter (email or fax) to the conference financial chair verifying your current status as a student and certifying that sufficient travel funds are not available. Please have them include their email address for verification. o Both of these must be sent by May 22, 1995. o Notification of travel assistance will be sent by 5/29/95. o Once you receive notification of a travel assistance award, send confirmation to the financial chair that you will attend the conference. Confirmation must be received no later than 6/8/95. Unconfirmed travel grants may be reallocated to other applicants! o Register for the conference as soon as possible! Registering for the conference early will increase your chances of receiving funds. Summary of Important Dates -------------------------- April 5, 1995: Notifications mailed to authors. May 22, 1995: Request for assistance and advisor letter sent to financial chair. May 29, 1995: Notification of travel grants sent to applicants. June 11, 1995: Last day for early registration. June 12, 1995: Confirmation of attendance must be sent to financial chair. July 15-20, 1995: Conference Dates. FAQs ---- Q: My company won't cover my airfare. Can I apply for travel assistance? o Funds are limited to assisting only students. Q: When will I receive my travel assistance grant? o Funds will be distributed at the conference registration desk during conference check-in. Q: How much money will I get? o Funds will be allocated based on need and distance traveled to the conference site (Pittsburgh, PA USA) NOT ON COST OF TRANSPORTATION. You should make your travel plans early so you can get the best deal. Travel grants WILL NOT cover the full cost of the travel expenses so that as many students as possible can receive assistance. Q: If I request travel assistance after the deadline, will I still have a chance of receiving funds? o There is a chance but it depends on how many people who met the deadline don't use their travel grants. You will be limited how much assistance they were offered. It pays to complete your request early! Q: Can I ask for a waiver of registration fees? o No. Assistance is only for travel costs. ICGA-95 student registration fees are among the lowest for a conference of this size. In a sense, all student registration is already being subsidized by the conference. Watch this space for additional information and updates! If you have any questions, please feel free to contact the financial chair: Peter J. Angeline Voice: (607)751-4109 Fax: (607)751-6025 Email: pja@lfs.loral.com From akaho@etl.go.jp Tue Apr 11 04:07:47 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 04:07:44 -0500; AA04547 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Tue, 11 Apr 95 04:07:42 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa07520; 10 Apr 95 23:12:11 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa07518; 10 Apr 95 23:05:24 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa02973; 10 Apr 95 23:05:09 EDT Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa16030; 10 Apr 95 23:03:19 EDT Received: from etlpost.etl.go.jp by EDRC.CMU.EDU id aa23426; 10 Apr 95 23:02:04 EDT Received: from etlpom.etl.go.jp by etlpost.etl.go.jp (8.6.9+2.4W/2.7W) id MAA20666; Tue, 11 Apr 1995 12:01:56 +0900 Return-Path: Received: by etlpom.etl.go.jp (4.1/6.4J.6-ETLpom.MASTER) id AA10333; Tue, 11 Apr 95 12:01:56 JST Received: by etlsu12.etl.go.jp (5.0/6.4J.6-ETL.SLAVE) id AA12519; Tue, 11 Apr 1995 12:01:08 +0900 Message-Id: <9504110301.AA12519@etlsu12.etl.go.jp> To: connectionists@CS.CMU.EDU Subject: TR available on "Mixture model for image understanding and the EM algorithm" Reply-To: akaho@etl.go.jp Organization: Electrotechnical Laboratory Date: Tue, 11 Apr 1995 12:01:08 +0900 From: Shotaro Akaho/=?ISO-2022-JP?B?GyRAQFZKZj48QkBPOhsoSg==?= Content-Length: 1230 The following technical report is available via anonymous ftp. FTP-host: etlport.etl.go.jp FTP-filename: /pub/akaho/ETL-TR-95-13E.ps.Z "Mixture model for image understanding and the EM algorithm" Shotaro Akaho Abstract: We present a mixture model that can be applied to the recognition of multiple objects in an image plane. The model consists of any shape of submodules. Each submodule is a probability density function of data points with scale and shift parameters, and the modules are combined with weight probabilities. We present the EM (Expectation-Maximization) algorithm to estimate those parameters. We also modify the algorithm in the case that data points are restricted in an attention window. ----------------------------------------------------------------- To retrieve from etlport.etl.go.jp: unix> ftp etlport.etl.go.jp Name (etlport.etl.go.jp:akaho): anonymous Password: (use your email addrss) ftp> cd pub/akaho ftp> binary ftp> get ETL-TR-95-13E.ps.Z unix> uncompress ETL-TR-95-13E.ps.Z unix> lpr ETL-TR-95-13E.ps.Z -- Shotaro AKAHO (akaho@etl.go.jp) Electrotechnical Laboratory (ETL) Information Science Division, Mathematical Informatics Section 1-1-4 Umezono, Tsukuba-shi, Ibaraki, 305 Japan From Sabine.Hau-Pale@cert.fr Tue Apr 11 11:02:53 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 11:02:30 -0500; AA09164 Received: from bilby.cs.uwa.oz.au by lucy.cs.wisc.edu; Tue, 11 Apr 95 11:02:14 -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 TAA15926; Tue, 11 Apr 1995 19:26:57 +0800 Message-Id: <199504111126.TAA15926@cs.uwa.oz.au> From: Sabine.Hau-Pale@cert.fr (Sabine.Hau-Pale) To: reinforce@cs.uwa.edu.au Subject: Implementation of the Q-learning ? Date: Tue, 11 Apr 1995 11:07:23 +0200 Hello ! I work on Q-learning algorithms, and I would like to experiment it. Could someone send some C or C++ codes of such implementations ? It would be of great Help for me. Thank you in advance, Sabine Hau-Pale. From schlimme@eecs.wsu.edu Tue Apr 11 11:27:54 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 11:27:51 -0500; AA09548 Received: from bilby.cs.uwa.oz.au by lucy.cs.wisc.edu; Tue, 11 Apr 95 11:27:41 -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 TAA15904; Tue, 11 Apr 1995 19:25:45 +0800 Message-Id: <199504111125.TAA15904@cs.uwa.oz.au> From: schlimme@eecs.wsu.edu (Jeffrey C. Schlimmer) To: reinforce@cs.uwa.edu.au Subject: Machine Learning Conference Preliminary Announcement Date: Sat, 8 Apr 1995 00:37:16 -0700 PRELIMINARY ANNOUNCEMENT Twelfth International Conference on Machine Learning Granlibakken Resort, Tahoe City, California, U.S.A. July 9-12, 1995 Early Registration Deadline is MAY 26, 1995. Housing Reservation Deadline is JUNE 8, 1995. The Twelfth International Conference on Machine Learning (ML-95) will be held at the Granlibakken Resort in Tahoe City, California during July 9-12, 1995, with informal workshops and tutorials on July 9. The conference will include presentations of refereed papers and three invited talks. This preliminary announcement, which omits the final technical program, is being provided so that travel arrangements can be made as early as possible. An updated announcement, including the technical program, will be distributed sometime in late April. CONFERENCE HIGHLIGHTS Invited Lectures by: - David Heckerman, Microsoft Research, "Machine Learning and Uncertainty in AI". - Bruce Croft, UMass, Amherst, "Machine Learning and Information Retrieval". - Dean Pomerleau, CMU, "Machine Learning for Autonomous Driving and Collision Warning". 68 Papers Accepted to ML-95 Two Tutorials Five Workshops Student Discount on Registration FOR FURTHER INFORMATION Please consult the conference's World-Wide Web pages in http://www.eecs.wsu.edu/~schlimme/ml95.html or send email to ml95@cs.ucdavis.edu . #| Jeffrey C. Schlimmer, Asst. Prof., School of EE & CS, Washington State University, Pullman, WA 99164-2752, (509) 335-2399, (509) 335-3818 FAX http://www.eecs.wsu.edu/~schlimme/ |# From BairdLC%DFCS%USAFA@dfssmail.usafa.af.mil Tue Apr 11 11:33:44 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 11:33:41 -0500; AA09646 Received: from bilby.cs.uwa.oz.au by lucy.cs.wisc.edu; Tue, 11 Apr 95 11:33:38 -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 TAA15876; Tue, 11 Apr 1995 19:23:56 +0800 Message-Id: <199504111123.TAA15876@cs.uwa.oz.au> From: BairdLC%DFCS%USAFA@dfssmail.usafa.af.mil To: reinforce@cs.uwa.oz.au Subject: re:"Advantage" Learning Date: Fri, 7 Apr 95 09:57:42 MDT There are several relevant papers in Postscript on my homepage: http://kirk.usafa.af.mil/~baird You might want to looks at the NIPS-94 paper, the Machine Learning 95 paper, and the Advantage Updating tech report. I can answer questions by e-mail or phone (719-472-3590). Leemon Baird ----------------------[Reply - Original Message]---------------------- Sent by:Robert Elliott Smith Hi, Could some one send me some good references on something called "advantage learning", a reinforcement learning technique that claims to be much faster than Q-learning? Thanks in advance, RES ------------------------------------------- Robert Elliott Smith Department of Engineering Science and Mechanics Room 210 Hardaway Hall The University of Alabama Box 870278 Tuscaloosa, Alabama 35487 <> rob@comec4.mh.ua.edu <> (205) 348-1618 <> (205) 348-7240 <> http://hamton.eng.ua.edu/college/home/mh/faculty/rsmith/Web/smith.html ------------------------------------------- ===================================================================== From C.Campbell@bristol.ac.uk Tue Apr 11 22:31:16 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 22:31:14 -0500; AA17972 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Tue, 11 Apr 95 22:31:12 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa08818; 11 Apr 95 19:31:01 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa08816; 11 Apr 95 19:13:57 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa04307; 11 Apr 95 19:13:34 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa22272; 11 Apr 95 7:22:56 EDT Received: from [137.222.10.41] by CS.CMU.EDU id aa07499; 11 Apr 95 7:21:12 EDT Received: from zeus.bris.ac.uk by dira.bris.ac.uk with SMTP (PP); Tue, 11 Apr 1995 12:20:23 +0100 Received: by zeus.bris.ac.uk (931110.SGI/930416.SGI) for @bris.ac.uk:Connectionists@CS.CMU.EDU id AA11426; Tue, 11 Apr 95 12:20:20 +0100 From: I C G Campbell Message-Id: <9504111120.AA11426@zeus.bris.ac.uk> Subject: Fifth Irish Neural Networks Conference To: Connectionists@cs.cmu.edu Date: Tue, 11 Apr 1995 12:20:20 +0100 (BST) X-Mailer: ELM [version 2.4 PL21] Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Content-Length: 4714 Please forward ... FIFTH IRISH NEURAL NETWORK CONFERENCE St. Patricks's College, Maynooth, Ireland September 11-13, 1995 ***FINAL CALL FOR PAPERS*** Papers are solicited for the Fifth Irish Neural Network Conference. They can be in any area of theoretical or applied neural computing including, for example: Learning algorithms Cognitive modelling Neurobiology Natural language processing Vision Signal processing Time series analysis Hardware implementations Selected papers from the conference proceedings will be published in the journal Neural Computing and Applications (Springer International). The conference is the fifth in a series previously held at Queen's University, Belfast and University College, Dublin. An extended abstract of not more than 500 words should be sent to: Dr. John Keating, Re: Neural Networks Conference, Dept. of Computer Science St. Patricks's College, Maynooth, Co. Kildare, IRELAND e-mail: JNKEATING@VAX1.MAY.IE NOTE: If submitting by postal mail please make sure to include your e-mail address. The deadline for receipt of abstracts is 1st May 1995. Authors will be contacted regarding acceptance by 1st June, 1995. Full papers will be required by 31st August 1995. ================================================================== FIFTH IRISH NEURAL NETWORKS CONFERENCE REGISTRATION FORM Name: __________________________________________________ Address: __________________________________________________ __________________________________________________ __________________________________________________ __________________________________________________ e-mail: ______________________ fax: ______________________ REGISTRATION FEE Before August 1, 1995 After Fee enclosed IR#50 IR#60 IR#________ The registration fee covers the cost of the conference proceedings and the session coffee breaks. METHOD OF PAYMENT Payment should be in Irish Pounds in the form of a cheque or banker's draft made payable to INNC'95. =================================================================== FIFTH IRISH NEURAL NETWORKS CONFERENCE ACCOMMODATION FORM Accomodation and meals are available on campus. The rooms are organised into apartments of 6 bedrooms. Each apartment has a bathroom, shower, and a fully equipped dining room/kitchen. The room rate is IR#12 per night (excl. breakfast, breakfast is IR#3 for continental and IR#4 for Full Irish). Name: ___________________________________________________ Address: ___________________________________________________ ___________________________________________________ ___________________________________________________ __________________________________________________ e-mail: ______________________ fax: ______________________ Arrival date: ______________________ Departure date: ______________________ No. of nights: ________ Please fill out a separate copy of the accommodation form for each individual requiring accommodation. If you have any queries, contact John Keating at JNKEATING@VAX1.MAY.IE The second day of the conference (Tuesday 12th September) is a half-day and includes an excursion to Newgrange and Dublin during the afternoon. The cost of this excursion is IR#10. I will be going on the excursion on Tues. afternoon yes/no (please delete as appropriate). ================================================================== Return fees with completed registration/ accommodation forms to: Dr John Keating, Re: Neural Networks Conference, Dept. of Computer Science, St. Patrick's College, Maynooth, Co. Kildare, IRELAND Unfortunately, we cannot accept registration or accommodation bookings by e-mail. =================================================================== Fifth Irish Neural Networks Conference - Paper format The format for accepted submissions will be as follows: LENGTH: 8 pages maximum. PAPER size: European A4 MARGINS: 2cms all round PAGE LAYOUT: Title, author(s), affiliation and e-mail address should be centred on the first page. No running heads or page numbers should be included. TEXT: Should be 10pt and preferably Times Roman. From tony@hebb.psych.mcgill.ca Tue Apr 11 22:31:23 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 22:31:19 -0500; AA17978 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Tue, 11 Apr 95 22:31:14 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id ab08828; 11 Apr 95 19:39:21 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa08822; 11 Apr 95 19:15:39 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa04322; 11 Apr 95 19:15:08 EDT Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id ab26281; 11 Apr 95 12:56:46 EDT Received: from [132.206.106.9] by EDRC.CMU.EDU id aa26242; 11 Apr 95 12:54:52 EDT Received: (from tony@localhost) by hebb.psych.mcgill.ca (8.6.9/8.6.6) id NAA24573; Tue, 11 Apr 1995 13:04:49 -0400 Date: Tue, 11 Apr 1995 13:00:48 -0400 (EDT) From: Tony Marley Subject: Postdoctoral Positions with A. A. J. Marley, Department of Psychology, McGill University To: connectionists@cs.cmu.edu Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII (I apologize if you receive mutiple copies of this announcement. I have mailed it to several different, but overlapping, lists) POSSIBLE POSTDOCTORAL POSITIONS WITH PROFESSOR A. A. J. MARLEY Department of Psychology, McGill University I have funds available for one, possibly two, postdoctoral fellows to begin working with me as soon as mutually arrangeable, in the first instance for 12 months, with the strong possibility of extension for a second 12 months. I am seeking candidates especially in two areas: 1. Mathematical, Simulation, and Experimental Work In Absolute Identification, Categorization, and Comparative Judgment. Recently I and my colleagues have developed and tested "neural" and random walk models in the above areas. We plan to continue this work, and would especially like to further develop the mathematical aspects of the models, and to discover "critical" tests of our basic ideas. A further possible position exists to work with myself and Yves Lacouture, who is at Universite Laval. This latter position is especially suited to a (unilingual or multilingual) French speaker. 2. Characterization Theorems and Stochastic Models in the Mathematical Social Sciences This is an interdisciplinary project involving mathematicians, statisticians, and social scientists. We are developing results concerning theories of aggregation, characterization of choice models, entropy approaches in the mathematical social sciences, etc. For each of these positions a strong background in mathematics (mathematical modeling) and/or computer science (computer moodeling) is extremely important. If you are interested, please send me a vitae, statement of research interests, and three letters of reference (preferably all by email or by fax - number below). Tony Marley A. A. J. (Tony) Marley Department of Psychology McGill University 1205 Avenue Dr. Penfield Montreal Quebec H3Y 2L2 CANADA email: tony@hebb.psych.mcgill.ca tel: (514) 398-6102 fax: (514) 398-4896 From ghosh@pine.ece.utexas.edu Tue Apr 11 22:31:24 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Tue, 11 Apr 95 22:31:21 -0500; AA17983 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Tue, 11 Apr 95 22:31:19 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id ac08828; 11 Apr 95 19:40:49 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id ab08822; 11 Apr 95 19:15:41 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa04327; 11 Apr 95 19:15:28 EDT Received: from RI.CMU.EDU by B.GP.CS.CMU.EDU id aa01087; 11 Apr 95 17:33:46 EDT Received: from pine.ece.utexas.edu by RI.CMU.EDU id aa02765; 11 Apr 95 17:32:56 EDT Received: from hermes.ece.utexas.edu (hermes.ece.utexas.edu [128.83.52.77]) by pine.ece.utexas.edu (8.6.9/8.6.5) with SMTP id QAA24900; Tue, 11 Apr 1995 16:31:31 -0500 Date: Tue, 11 Apr 1995 16:31:31 -0500 From: Joydeep Ghosh Message-Id: <199504112131.QAA24900@pine.ece.utexas.edu> To: Connectionists@cs.cmu.edu Subject: Papers on Ridge Polynomial Networks and on Generalization Cc: ghosh@pine.ece.utexas.edu =========================== Paper announcement ======================== The following two papers are available via anonymous ftp: FTP-host: www.lans.ece.utexas.edu (128.83.52.78) filenames: /pub/papers/rpn_paper.ps.Z and /pub/papers/struc_adapt_jann94.ps.Z More conveniently, they can be retrieved from the HOME PAGE of the LAB. FOR ARTIFICIAL NEURAL SYSTEMS (LANS) at Univ. of Texas, Austin: http://www.lans.ece.utexas.edu where, under "selected publications", the abstracts of more than 40 papers can be viewed and the corresponding .ps.Z files can be downloaded. ===================================================================== RIDGE POLYNOMIAL NETWORKS (to appear, IEEE Trans. Neural Networks) Yoan Shin and Joydeep Ghosh This paper presents a polynomial connectionist network called RIDGE POLYNOMIAL NETWORK (RPN) that can uniformly approximate any continuous function on a compact set in multi-dimensional input space $Re^{d}$, with arbitrary degree of accuracy. This network provides a more efficient and regular architecture compared to ord inary higher-order feedforward networks while maintaining their fast learning property. The ridge polynomial network is a generalization of the pi-sigma network and u ses a special form of ridge polynomials. It is shown that any multivariate polynomial can be repre sented in this form, and realized by an RPN. Approximation capability of the RPNs is shown by this representation theorem an d the Weier- strass polynomial approximation theorem. The RPN provides a na- tural mechanism for incremental network growth. Simulation results on a surface fitting problem, the classification of high-dim ensional data and the realization of a multivariate po- lynomial function are given to highligh t the capability of the network. In particular, a constructive learning algorithm developed for the network is shown to yield smooth generalization and steady learning. ===================================================================== STRUCTURAL ADAPTATION AND GENERALIZATION IN SUPERVISED FEED-FORWARD NETWORKS (Jl. of Artificial Neural Networks, 1(4), 1994, pp. 431-458.) Joydeep Ghosh and Kagan Tumer This work explores diverse techniques for improving the generali- zation ability of supervised feed-forward neural networks via structural adaptation, and introduces a new network structure with sparse connectivity. Pruning methods which start from a large network and proceed in trimming it until a satisfactory solution is reached, are studied first. Then, construction methods, which build a network from a simple initial configura- tion, are presented. A survey of related results from the discip- lines of function approximation theory, nonparametric statistical inference and estimation theory leads to methods for principled architecture selection and estimation of prediction error. A network based on sparse connectivity is proposed as an alterna- tive approach to adaptive networks. The generalization ability of this network is improved by partly decoupling the outputs. We perform numerical simulations and provide comparative results for both classification and regression problems to show the generali- zation abilities of the sparse network. ===========================repeat FTP info ======================== FTP-host: www.lans.ece.utexas.edu (128.83.52.78) filenames: /pub/papers/rpn_paper.ps.Z and /pub/papers/struc_adapt_jann94.ps.Z ************* SORRY, NO HARD COPIES *********** From mpadgett@eng.auburn.edu Wed Apr 12 05:52:10 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Wed, 12 Apr 95 05:52:08 -0500; AA05676 Received: from bilby.cs.uwa.oz.au by lucy.cs.wisc.edu; Wed, 12 Apr 95 05:51:55 -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 PAA25307; Wed, 12 Apr 1995 15:16:20 +0800 Message-Id: <199504120716.PAA25307@cs.uwa.oz.au> From: Mary Lou Padgett To: reinforce@cs.uwa.oz.au Cc: scsmlp@eng.auburn.edu Subject: Tutorial articles Date: Tue, 11 Apr 1995 13:41:06 -0500 Hi! I am looking for tutorial articles on Neural Networks: Reinforcement Learning Theory and Applications to Industrial Electronics If anyone is interested in writing a tutorial article on this topic, please let me know. If you know people who should be invited to do this, I would also appreciate hearing! THANKS! Mary Lou Padgett Auburn University 1165 Owens Road Auburn, AL 36830 mpadgett@eng.auburn.edu P: 334 821 2472 F: 334 821 3488 From heckerma@microsoft.com Wed Apr 12 12:58:19 1995 Received: from cs.wisc.edu by sea.cs.wisc.edu; Wed, 12 Apr 95 12:58:17 -0500; AA11274 Received: from TELNET-1.SRV.CS.CMU.EDU by cs.wisc.edu; Wed, 12 Apr 95 12:58:14 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa09182; 12 Apr 95 1:14:51 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa09180; 12 Apr 95 1:08:22 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa00938; 12 Apr 95 1:08:11 EDT Received: by B.GP.CS.CMU.EDU id ah02804; 11 Apr 95 21:39:01 EDT Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id ab02775; 11 Apr 95 21:34:04 EDT Received: by EDRC.CMU.EDU id au00364; 11 Apr 95 21:08:08 EDT Received: from netmail2.microsoft.com by EDRC.CMU.EDU id aa00319; 11 Apr 95 21:00:07 EDT Received: by netmail2.microsoft.com (5.65/25-eef) id AA08979; Tue, 11 Apr 95 17:01:09 -0700 Message-Id: <9504120001.AA08979@netmail2.microsoft.com> Received: by netmail2 using fxenixd 1.0 Tue, 11 Apr 95 17:01:09 PDT X-Msmail-Message-Id: F8DDBDD8 X-Msmail-Conversation-Id: F8DDBDD8 From: David Heckerman To: Connectionists@cs.cmu.edu Date: Tue, 11 Apr 95 11:51:48 TZ Subject: Bayesian networks A Bayesian network (a.k.a. belief network) is a graphical, modular representation of a joint probability distribution over a set of variables. A Bayesian network is often easy to build directly from domain or expert knowledge and also can be learned from data, making it an excellent representation language in which to combine domain knowledge and data. The march issue of CACM contains a tutorial on the representation as well as three articles on applications. Also, I've written a tutorial on learning Bayesian networks containing many pointers to the literature. The tutorial (in part) will appear in the forthcoming collection "Advances in Knowledge Discovery and Data Mining" edited by U. Fayyad, G. Piatesky-Shapiro, P. Smyth, and R. Uthurusamy. It can be obtained via anonymous ftp at research.microsoft.com://pub/tech-reports/winter94-95/tr-95-06.ps or via my home page http://www.research.microsoft.com/research/dtg/heckerma/heckerma.html. David From patrick@magi.ncsl.nist.gov Wed Apr 12 12:58:20 1995 Received: from cs.wisc.edu by sea.cs.wisc.edu; Wed, 12 Apr 95 12:58:11 -0500; AA11269 Received: from TELNET-1.SRV.CS.CMU.EDU by cs.wisc.edu; Wed, 12 Apr 95 12:58:09 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa08828; 11 Apr 95 19:37:59 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa08820; 11 Apr 95 19:14:49 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa04316; 11 Apr 95 19:14:38 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id ae24560; 11 Apr 95 10:57:48 EDT Received: from MAGI.NCSL.NIST.GOV by CS.CMU.EDU id aa08727; 11 Apr 95 10:36:08 EDT Received: from ickaos.ncsl.nist.gov by magi.ncsl.nist.gov (4.1/NIST) id AA01488; Tue, 11 Apr 95 10:35:30 EDT Date: Tue, 11 Apr 95 10:35:30 EDT From: Patrick Grother Organization: National Institute of Standards and Technology, Gaithersburg, MD Message-Id: <9504111435.AA01488@magi.ncsl.nist.gov> To: connectionists@cs.cmu.edu Subject: New Very Large NIST OCR Database +--------------------------+ | NIST Special Database 19 | +--------------------------+ Handprinted Forms and Characters Database Special Database 19 contains NIST's entire corpus of training materials for handprinted doucument and character recognition. It publishes Handprinted Sample Forms from 3600 writers, 810000 character images isolated from their forms, ground truth classifications for those images, reference forms for further data collection, and software utilities for image management and handling. It supersedes Special Databases 3 and 7. + "Final" accumulation of NIST's handprinted sample data + Full page HSF forms from 3600 writers + Separate digit, upper and lower case, and free text fields + over 800000 images with hand checked classifications + Binary images Scanned at 11.8 dots per mm ( 300 dpi ) + Updated CCITT IV Compression Source Code + Database management utilities + The images of Special Database 19 form a superset of the images of two previous releases: Special Databases 3 and 7 which are now discontinued. The database is NIST's largest and probably final release of images intended for handprint document processing and OCR research. The full page images are the default input to the "NIST FORM-BASED HANDPRINT RECOGNITION SYSTEM", a public domain release of end to end page recognition software. Special Database 19 is available as a 5.25 inch CD-ROM in the ISO-9660 format. For sales contact: Standard Reference Data National Institute of Standards and Technology Building 221, Room A323 Gaithersburg, MD 20899 Voice: (301) 975-2208 FAX: (301) 926-0416 email: srdata@enh.nist.gov For technical details contact: Patrick Grother Visual Image Processing Group National Institute of Standards and Technology Building 225, Room A216 Gaithersburg, Maryland 20899 Voice: (301) 975-4157 FAX: (301) 840-1357 email: patrick@magi.ncsl.nist.gov From HMSKERK@rulfsw.fsw.LeidenUniv.nl Thu Apr 13 04:37:49 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Thu, 13 Apr 95 04:37:46 -0500; AA00592 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Thu, 13 Apr 95 04:37:43 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa09976; 12 Apr 95 15:24:01 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa09974; 12 Apr 95 15:10:13 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa01700; 12 Apr 95 15:09:26 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id ac12699; 12 Apr 95 11:09:32 EDT Received: from RULFSW.fsw.LeidenUniv.nl by CS.CMU.EDU id aa05215; 12 Apr 95 11:07:54 EDT Received: from rulfsw.LeidenUniv.nl by rulfsw.LeidenUniv.nl (PMDF V4.3-7 #2497) id <01HP9C37KJ8YB7JDXY@rulfsw.LeidenUniv.nl>; Wed, 12 Apr 1995 17:07:31 MET Date: Wed, 12 Apr 1995 17:07:31 +0100 (MET) From: Jan Heemskerk Subject: Neural hardware overview To: Connectionists@cs.cmu.edu Message-Id: <01HP9C37KJ90B7JDXY@rulfsw.LeidenUniv.nl> X-Envelope-To: Connectionists@cs.cmu.edu X-Vms-To: IN%"Connectionists@cs.cmu.edu" Mime-Version: 1.0 Content-Transfer-Encoding: 7BIT A preliminary version of the paper "Overview of neural hardware" is now available by anonymous ftp from our ftp-site: ftp.mrc-apu.cam.ac.uk directory name pub/nn/murre filename: neurhard.ps (23 pages) This is a draft version based on Chapter 3 in: Heemskerk, J.N.H. (1995). Neurocomputers for Brain-Style Processing. Design, Implementation and Application. PhD thesis, Unit of Experimental and Theoretical Psycholo- gy Leiden University, The Netherlands. ABSTRACT Neural hardware has undergone rapid development during the last few years. This paper presents an overview of neural hardware projects within industries and academia. It describes digital, analog, and hybrid neurochips and accelerator boards as well as large-scale neurocomputers built from general purpose processors and communication elements. Special attention is given to multiprocessor projects that focus on scalability, flexibility, and adaptivity of the design and thus seem suitable for brain-style (cognitive) processing. The sources used for this overview are taken from journal papers, conference proceedings, data sheets, and ftp-sites and present an up-to-date overview of current state- of-the-art neural hardware implementations. From john@dcs.rhbnc.ac.uk Thu Apr 13 04:37:51 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Thu, 13 Apr 95 04:37:49 -0500; AA00598 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Thu, 13 Apr 95 04:37:46 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa09984; 12 Apr 95 15:33:53 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa09979; 12 Apr 95 15:12:23 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa01718; 12 Apr 95 15:11:36 EDT Received: from EDRC.CMU.EDU by B.GP.CS.CMU.EDU id aa14116; 12 Apr 95 12:24:10 EDT Received: from platon.cs.rhbnc.ac.uk by EDRC.CMU.EDU id aa03259; 12 Apr 95 12:22:04 EDT Received: from localhost (localhost [127.0.0.1]) by platon.cs.rhbnc.ac.uk (8.6.9/8.6.9) with SMTP id RAA18977 ; Wed, 12 Apr 1995 17:20:56 +0100 From: John Shawe-Taylor Message-Id: <199504121620.RAA18977@platon.cs.rhbnc.ac.uk> X-Authentication-Warning: platon.cs.rhbnc.ac.uk: Host localhost didn't use HELO protocol To: colt@cs.uiuc.edu, Connectionists@cs.cmu.edu, neuron-request@cattell.psych.upenn.edu Subject: MSc in Computational Intelligence Date: Wed, 12 Apr 95 17:20:56 +0100 X-Mts: smtp MSc in COMPUTATIONAL INTELLIGENCE at the Computer Science Department Royal Holloway, University of London We offer a new twelve-month MSc in Computational Intelligence covering a wide range of subjects: Neural Computing Inference Systems Probabilistic Reasoning Constraint Networks Simulated Annealing Neurochips and VLSI Equational Reasoning Computer Vision Concurrent Programming Object-Oriented Programming Connectionist Expert Systems Computational Learning Theory Royal Holloway is one of the largest colleges of the University of London and is located on a beautiful wooded campus. For further information email: cims@dcs.rhbnc.ac.uk or write to: Course Director, MSc in Computational Intelligence Computer Science Department Royal Holloway, University of London EGHAM, Surrey, TW20 0EX Tel: +44 (0)1784 333421 Fax: +44 (0)1784 443420 From mcasey@euclid.ucsd.edu Thu Apr 13 22:53:59 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Thu, 13 Apr 95 22:53:56 -0500; AA13813 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Thu, 13 Apr 95 22:53:51 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa11560; 13 Apr 95 13:39:02 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa11558; 13 Apr 95 13:14:24 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa03473; 13 Apr 95 13:14:18 EDT Received: from RI.CMU.EDU by B.GP.CS.CMU.EDU id aa12901; 13 Apr 95 8:24:47 EDT Received: from mailbox1.ucsd.edu by RI.CMU.EDU id aa09861; 13 Apr 95 8:19:07 EDT Received: from euclid (euclid.ucsd.edu [132.239.145.52]) by UCSD.EDU (8.6.10/8.6.9) with SMTP id FAA04946 for ; Thu, 13 Apr 1995 05:18:57 -0700 Received: by euclid (4.1/UCSDPSEUDO.2) id AA18138 for connectionists@cs.cmu.edu; Thu, 13 Apr 95 05:14:03 PDT From: Mike Casey Message-Id: <9504131214.AA18138@euclid> Subject: TRs on Dynamical Systems and RNNs Available To: connectionists@cs.cmu.edu Date: Thu, 13 Apr 1995 05:14:03 -0700 (PDT) X-Mailer: ELM [version 2.4 PL24] Content-Type: text Content-Length: 3278 WWW: http://math.ucsd.edu/~mcasey/papers.html -------------------------------------------------------- The following technical reports are now available through the Institute for Neural Computation: -------------------------------------------------------- How Discrete-Time Recurrent Neural Networks Work [41 pages] Technical Report Series No. INC-9503, April, 1995 Mike Casey Department of Mathematics UC, San Diego This paper has been submitted for publication in Neural Computation. ABSTRACT: Deterministic finite state automata (DFA) can be robustly modeled using many discrete-time recurrent neural network (RNN) models. We examine the extent to which perfect knowledge of the computation to be performed constrains possible phase space dynamics during computation. We show that if a collection of mappings is initialized to near constant maps, then some map must undergo a bifurcation at some point as the system evolves if it is to model a DFA with certain properties. We also show how to effectively predict phase space dynamics in a such system which models a DFA, and thereby allow one to understand computation dynamics in spite of the possible existence of unnecessary complexity in phase space dynamics. We also discuss how this understanding can be used to improve training methods for RNNs modeling DFA and provide a theoretical background for understanding DFA extraction techniques. Furthermore, we address issues in using the cognitive science approach to understanding systems that produce a behavior that is of interest but not a result of explicit system design, e.g. when an optimization algorithm has been used to produce the system or when the system is not man-made. -------------------------------------------------------- Relaxing The Symmetric Weight Condition for Convergent Dynamics in Discrete-Time Recurrent Networks [14 pages] Technical Report Series No. INC-9504, April, 1995 Mike Casey Department of Mathematics UC, San Diego ABSTRACT: Hopfield and others have shown that for a fairly broad class of neural network models there exist Lyapunov functions (which insure that the dynamics of the network will remain tame), so long as the coupling matrix is assumed to be symmetric. It is shown that this condition may be replaced by a more easily satisfied condition. I will then present a few other results which further restrict the complexity of the parameter space of some neural network models. ------------- Comments on either or both are welcomed. Available electronically via the World Wide Web at: http://math.ucsd.edu/~mcasey/papers.html Please send hardcopy requests to the author or: Institute for Neural Computation Tel: (619) 534-7880 University of California, San Diego Fax: (619) 534-2014 9500 Gilman Drive DEPT 0523 La Jolla, CA 92093-0523 Email: mbateman@ucsd.edu Mike Casey Department of Mathematics 0112 UC, San Diego La Jolla, CA 92093 email: mcasey@ucsd.edu After April 20th, 1995, please send correspondence to: Mike Casey Volen Center Brandeis University Waltham, MA 02254 From josh@faline.bellcore.com Thu Apr 13 22:54:02 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Thu, 13 Apr 95 22:54:00 -0500; AA13819 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Thu, 13 Apr 95 22:53:56 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa11669; 13 Apr 95 15:41:24 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa11667; 13 Apr 95 15:30:40 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa03565; 13 Apr 95 15:30:25 EDT Received: from RI.CMU.EDU by B.GP.CS.CMU.EDU id aa19834; 13 Apr 95 15:28:48 EDT Received: from faline.bellcore.com by RI.CMU.EDU id aa11635; 13 Apr 95 15:27:43 EDT Received: (from josh@localhost) by faline.bellcore.com (8.6.9/8.6.10) id PAA03544 for connectionists@cs.cmu.edu; Thu, 13 Apr 1995 15:27:17 -0400 Date: Thu, 13 Apr 1995 15:27:17 -0400 From: Joshua Alspector Message-Id: <199504131927.PAA03544@faline.bellcore.com> To: connectionists@cs.cmu.edu Subject: neural nets in telecom workshop International Workshop on Applications of Neural Networks to Telecommunications (IWANNT*95) Stockholm, Sweden May 22-24, 1995 Organizing Committee General Chair: Josh Alspector, Bellcore Program Chair: Rod Goodman, Caltech Publications Chair: Timothy X Brown, Bellcore Treasurer: Anthony Jayakumar, Bellcore Publicity: Atul Chhabra, NYNEX Lee Giles, NEC Research Institute Local Arrangements: Miklos Boda, Ellemtel Bengt Asker, Ericsson Program Committee: Harald Brandt, Ellemtel Tzi-Dar Chiueh, National Taiwan U Francoise Fogelman, SLIGOS Tony Reeder, British Telecom Larry Jackel, AT&T Bell Laboratories Thomas John, Southwestern Bell Adam Kowalczyk, Telecom Australia S Y Kung, Princeton University Tadashi Sone, NTT INNS Liaison: Bernard Widrow, Stanford University IEEE Liaison: Steve Weinstein, NEC Conference Administrator: Betty Greer, IWANNT*95 Bellcore, MRE 2P-295 445 South Street Morristown, NJ 07960, USA voice: (201)829-4993 fax: (201)829-5888 bg1@faline.bellcore.com Dear Colleague: You are invited to an international workshop on applications of neural networks and other intelligent systems to problems in telecommunica- tions and information networking. This is the second workshop in a series that began in Princeton, New Jersey on October, 18-20 1993. Topics include: Network Management Congestion Control Adaptive Equalization Speech Recognition Language ID/Translation Information Filtering Dynamic Routing Software Engineering Fraud Detection Financial and Market Prediction Fault Identification and Prediction Character Recognition Adaptive Control Data Compression This conference will take place at a time of the year when the beauti- ful city of Stockholm is at its best. The conference will take place in the facilities of the Royal Swedish Academy of Engineering Sciences, right in the middle of Stockholm. There will be several hotels in dif- ferent categories to choose from in the neighborhood. One evening, there will be a boat tour in the famous archipelago which will include dinner. We enclose an advance program for the workshop as well as informa- tion for registration and hotels. There will be a hard cover proceed- ings available at the workshop. There is further information on the IWANNT home page at: ftp://ftp.bellcore.com/pub/iwannt/iwannt.html I hope to see you at the workshop. Sincerely, Josh Alspector, General Chair -------------------------------------------------------------------------- -------------------------------------------------------------------------- Preliminary Program Monday, May 22, 1995: 7:00 Registration and Coffee Session 1: 8:30 J. Alspector, Welcome 8:45 Invited Speaker: Bernt Ericson, VP Ericsson Research and Technology 9:30 C. Cortes, L. D. Jackel, W-P Chiang, Predicting Failures of Telecommunication Paths: Limits on Learning Machine Accuracy Imposed by Data Quality 10:00 Break 10:30 C. S. Hood, C. Ji, An Intelligent Monitoring Hierarchy for Network Management 11:00 A. Holst, A.Lansner, A Higher Order Bayesian Neural Network for Classification and Diagnosis 11:30 T. Sone, A Strong Combination of Neural Networks and Deep Reasoning in Fault Diagnosis 12:00 J. Connor, L. Brothers, J. Alspector, Neural Network Detection of Fraudulent Calling Card Patterns 12:30 Lunch Session 2: 13:30 D. S. Reay, Non-Linear Channel Equalisation Using Associative Memory Neural Networks 14:00 A. Jayakumar, J. Alspector, Experimental Analog Neural Network Based Decision Feedback Equalizer for Digital Mobile Radio 14:30 M. Junius, O. Kennemann, Intelligent Techniques for the GSM Handover Process 15:00 Break 15:30 P. Campbell, H. Ferr, A. Kowalczyk, C. Leckie, P. Sember, Neural Networks in Real Time Decision Making 16:00 P. Chardaire, A. Kapsalis, J. W. Mann, V. J. Rayward-Smith, G. D. Smith, Applications of Genetic Algorithms in Telecommunications 16:30 S. Bengio, F. Fessant, D. Collobert, A Connectionist System for Medium-Term Horizon Time Series Prediction Tuesday, May 23, 1995: 8:00 Coffee and Registration Session 3: 8:30 Invited Speaker: Martin Hyndman, Derwent Information, Neural Network Patenting 9:00 B. de Vries, C. W. Che, R. Crane, J. Flanagan, Q. Lin, J. Pearson, Neural Network Speech Enhancement for Noise Robust Speech Recognition 9:30 Break 10:00 E. Barnard, R. Cole, M. Fanty, P. Vermeulen, Real-World Speech Recognition with Neural Networks 10:30 A. K. Chhabra, V. Misra, Experiments with Statistical Connectionist Methods and Hidden Markov Models for Recognition of Text in Telephone Company Drawings 11:00 R. A. Bustos, T. D. Gedeon, Learning Synonyms and Related Concepts in Document Collections 11:30 N. Karunanithi, J. Alspector, A Feature-Based Neural Network Movie Selection Approach 12:00 H. Brandt, ATM Basics Tutorial 12:30 Lunch: Tuesday PM 13:30 Poster Session: A. Arts-Rodrguez, F. Gonzlez-Serrano, A Figueiras-Vidal, L. Weruaga-Prieto, Compensation of Bandpass Nonlinearities by Look-Up-Tables and CMAC P. Barson, N. Davey, S. Field, R. Frank, D. S. W. Tansley, Dynamic Competitive Learning Applied to the Clone Detection Problem R. Battiti, A. Sartori, G. Tecchiolli, P. Tonella, A. Zorat, Neural Compression: An Integrated Application to EEG Signals E. Bayro-Corrochano, R. Espinoza-Soliz, Neural Network Based Approach for External Telephone Network Management M. Berger, Fast Channel Assignment in Cellular Radio Systems M. J. Bradley, P. Mars, Analysis of Recurrent Neural Networks as Digital Communication Channel Equalizer T. Brown, A Technique for Mapping Optimization Solutions into Hardware M. Collobert, D. Collobert, A Neural System to Detect Faulty Components on Complex Boards in Digital Switches F. Comellas, J. Ozn, Graph Coloring Algorithms for Assignment Problems in Radio Networks M. Dixon, M. Bellgard, G. R. Cole, A Neural Network Algorithm to Solve the Routing Problem in Communication Networks A. P. Engelbrecht, I. Cloete, Dimensioning of Telephone Networks Using a Neural Network as Traffic Distribution Approximator A. D. Estrella, E. Casilari, A. Jurado, F. Sandoval, ATM Traffic Neural Control: Multiservice Call Admission and Policing Function S. Fredrickson, L. Tarassenko, Text-Independent Speaker Recognition Using Radial Basis Functions N. Kasabov, Hybrid Environments for Building Comprehensive AI and the Task of Speech Recognition K. Kohara, Selective Presentation Learning for Forecasting by Neural Networks H. C. Lau, K. Y. Szeto, K. Y. M. Wong, D. Y. Yeung, A Hybrid Expert System for Error Message Classification F. Mekuria, T. Fjllbrant, Neural Networks for Efficient Adaptive Vector Quantization of Signals A. F. Nejad, T. D. Gedeon, Analyser Neural Networks:An Empirical Study in Revealing Regularities of Complex Systems A. Varma, R. Antonucci, A Neural-Network Controller for Scheduling Packet Transmissions in a Crossbar Switch M. B. Zaremba, K.-Q. Liao, G. Chan, M. Gaudreau, Link Bandwidth Allocation in Multiservice Networks Using Neural Technology 16:30 Boat Tour and Dinner Wednesday, May 24, 1995: 8:00 Coffee and Registration Session 4: 8:30 Invited Speaker: Per Roland, Karolinska Institute, The Real Neural Network 9:30 S. Field, N. Davey, R. Frank, A Complexity Analysis of Telecommunications Software Using Neural Nets 10:00 Break 10:30 T-D Chiueh, L-K Bu, Theory and Implementation of an Analog Network that Solves the Shortest Path Problem 11:00 E. Nordstrm, J. Carlstrm, A Reinforcement Learning Scheme for Adaptive Link Allocation in ATM Networks 12:00 W. K. F. Lor, K. Y. M. Wong, Decentralized Neural Dynamic Routing in Circuit-Switched Networks 12:30 Lunch Session 5: 13:30 A. Garcia-Lopera, A. Ariza Quintana, F. Sandoval Hernandez, Modular Neural Control of Buffered Banyan Networks 14:00 A. Murgu, Adaptive Flow Control in Multistage Communications Networks Based on a Sliding Window Learning Algorithm 14:30 T. Brown, A Technique for Classifying Network States 15:00 Break 15:30 R. M. Goodman, B. E. Ambrose, Learning Telephone Network Trunk Reservation Congestion Control Using Neural Networks 16:00 A. Farag, M. Boda, H. Brandt, T. Henk, T. Trn, J. Br, Virtual Lookahead - a New Approach to Train Neural Nets for Solving On-Line Decision Problems 16:30 O. Gallmo, L. Asplund, Reinforcement Learning by Construction of Hypothetical Targets 17:00 Adjourn ------------------------------------------------------------------------ ------------------------------------------------------------------------ Site The conference will be held at the IVA or Royal Swedish Academy of Engineering Sciences. The location is a mixture of old and new. The conference will take place in modern facilties built in 1983, while the lunches are held in a beautiful dining room from the turn of the century. IVA is situated at Grev Turegatan 14 (Count Ture's street) which is very central. Close by is Sturegallerian, a fine shopping center, located in a number of buildings from the early 20th century. A few hundred meters walk will take you to Nybroviken, where you may take a ferry to the big outdoor museum Skansen. The same distance in the other direction will bring you to Hamngatan and Sergels torg, right in the middle of the shopping district. How to Get There >From the Arlanda airport, the best plan is to take the airport bus to Stockholm City. It takes approximately 45 minutes. From there, take a taxi to the hotel or conference center. From Sergel Plaza and Strand, IVA is walking distance. If you use the subway you should get off at the Ostermalm station and use the Grev Turegatan exit. Hotels To reserve a hotel at the conference rate call between 8:00am and 4:00pm Stockholm (European) time: Annika Lindqvist e-mail: lme.lmehotel@memo.ericsson.se tel: +46 8 6813590 fax: +46 8 6813585 The following hotels have been recommended although others are available. Prices are in Swed- ish Kroners (Single/Double) including VAT: Hotel Sergel Plaza: Brunkebergstorg 9, tel +46 8 226600 (825/825) Located close to conference. Strand/SAS Hotel: Nybrokajen 9, tel +46 8 6787800 (925/925) Located close to conference. Hotel Attache: Cedergrenvagen 16, tel +46 8 181185 (585/585) Approximately 10 minutes by The Underground. Good Morning South: Vastertorpsvagen 131, tel +46 8 180140 (495/495) Approximately 15 minutes by The Underground. Hotel Malmen: Gotgatan 49-51, tel +46 8 226080 (655/655) Located south of city in nice area. Underground station in building. Sharing a Room Because of costs, some may want to share a room. To be part of the Room Share List, send e-mail to timxb@bellcore.com with your name, preferred way to be contacted, and preferences (male/female, non-smoker, etc.). Once you make arrangements, contact timxb again, so that you can be removed from the list. ----------------------------------------------------------------------------- --------------------Registration Form--------------------------------------- International Workshop on Applications of Neural Networks to Telecommunications (IWANNT*95) Stockholm, Sweden May 22-24, 1995 Name: Institution: Mailing Address: Telephone: Fax: E-mail: Make check ($400; $500 after May 1, 1995; $200 students) out to IWANNT*95. Please make sure your name is on the check. Registration includes breaks, a boat tour of the Stockholm archipelago, and proceedings available at the conference. Mail to: Betty Greer, IWANNT*95 Bellcore, MRE 2P-295 445 South Street Morristown, NJ 07960, USA Voice: (201) 829-4993 Fax: (201) 829-5888 Email: bg1@faline.bellcore.com From willicki@cs.aston.ac.uk Fri Apr 14 11:14:34 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Fri, 14 Apr 95 11:14:28 -0500; AA01368 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Fri, 14 Apr 95 11:14:24 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa11802; 13 Apr 95 18:20:49 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa11800; 13 Apr 95 18:12:08 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa03697; 13 Apr 95 18:11:26 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa21334; 13 Apr 95 16:56:43 EDT Received: from [134.151.79.46] by CS.CMU.EDU id aa19090; 13 Apr 95 16:54:42 EDT Received: from email.aston.ac.uk by hermes.aston.ac.uk with SMTP (PP); Thu, 13 Apr 1995 21:52:56 +0100 Received: from axon by email.aston.ac.uk with SMTP (PP) id <00379-0@email.aston.ac.uk>; Thu, 13 Apr 1995 21:47:33 +0100 Message-Id: <21963.9504131710@sun.aston.ac.uk> To: akaho@etl.go.jp From: Chris Williams Cc: connectionists@cs.cmu.edu Subject: Re: TR available on "Mixture model for image understanding and the EM algorithm" Date: Thu, 13 Apr 1995 18:10:46 +0100 Sender: willicki@helios.aston.ac.uk Content-Length: 0 Re: the paper "Mixture model for image understanding and the EM algorithm" recently announced by Shotaro Akaho. I believe the idea of using a mixture model parameterized by scale and translation parameters is very similar to the "constrained mixture models" we have been using for character recognition for some years. Basically, the idea is to create a template out of a number of Gaussians; in the character recognition case the Gaussians will be spaced out along the stroke; each one is like a spray-can ink generator. This template can be scaled or translated by applying the transformation to each of the Gaussian centres. In fact our model went further than this in that it allowed deformable templates, so that the Gaussians could be moved away from their "home locations" in the object-based frame, at a cost. We also allowed a full 2x2 affine transformation plus translation rather than just translation and scaling, and used a "noise model" to reject outlier/noise data points. We used a method based on the EM algorithm for fitting these templates to data. For the non-deformable case there is (as Akaho points out) a direct EM algorithm. This is mentioned in Appendix B of my thesis. The fitting algorithm converged to the desired solution (i.e. one which looks correct -- this is the advantage of working in 2d :-)) in around 99% of the cases when only a single character was present. We have run some experiments with two templates and two objects and found that we only got convergence to the desired solution if the starting point was rather close to it. I should also comment that Eric Mjolsness and his colleagues have been doing some similar work, although they have used an explicit match- matrix to encode the correspondence between datapoints and model points; the mixture model can be obtained by integrating out one of the row and column constraints. [ref: eg. Chien-Ping Lu and Eric Mjolsness, NIPS 6, 985-992; also NIPS 7 (forthcoming), and earlier work back to a TR YALEU-DCS-TR-854 in 1990] Our Refs: [early paper] @incollection (hinton-williams-revow-92, author = "Hinton, G. ~E. and Williams, C. ~K. ~I. and Revow, M. ~D.", title = "Adaptive elastic models for hand-printed character recognition", editor = "J. E. Moody and S. J. Hanson and R. P. Lippmann", booktitle= "Advances in Neural Information Processing Systems 4", year = "1992", publisher= "Morgan Kauffmann", place = "San Mateo CA." ) [up to date work] * a paper submitted to IEEE Transactions on Pattern Analysis and Machine Intelligence in 1994: pami.ps.Z (36 pages, 0.3 Mb) * my PhD thesis: thesis.ps.Z (95 pages, 0.6 Mb) both available from the Toronto ftp server unix> ftp ftp.cs.toronto.edu (or 128.100.3.6, or 128.100.1.105) (log in as "anonymous", e-mail address as password) ftp> binary ftp> cd pub/ckiw ftp> get thesis.ps.Z ftp> get pami.ps.Z ftp> quit Regards Chris Williams c.k.i.williams@aston.ac.uk Department of Computer Science and Applied Maths Aston University Birmingham B4 7ET England tel: +44 121 359 3621 x 4382 fax: +44 121 333 6215 From terry@salk.edu Fri Apr 14 14:10:36 1995 Received: from lucy.cs.wisc.edu by sea.cs.wisc.edu; Fri, 14 Apr 95 14:10:34 -0500; AA03770 Received: from TELNET-1.SRV.CS.CMU.EDU by lucy.cs.wisc.edu; Fri, 14 Apr 95 14:10:32 -0500 Received: from TELNET-1.SRV.CS.CMU.EDU by telnet-1.srv.cs.CMU.EDU id aa11866; 13 Apr 95 19:50:59 EDT Received: from DST.BOLTZ.CS.CMU.EDU by TELNET-1.SRV.CS.CMU.EDU id aa11864; 13 Apr 95 19:42:17 EDT Received: from DST.BOLTZ.CS.CMU.EDU by DST.BOLTZ.CS.CMU.EDU id aa03826; 13 Apr 95 19:42:05 EDT Received: from CS.CMU.EDU by B.GP.CS.CMU.EDU id aa23045; 13 Apr 95 19:07:16 EDT Received: from helmholtz.salk.edu by CS.CMU.EDU id aa20464; 13 Apr 95 19:06:22 EDT Received: by salk.edu (4.1/SMI-4.1) id AA13731; Thu, 13 Apr 95 16:06:11 PDT Date: Thu, 13 Apr 95 16:06:11 PDT From: Terry Sejnowski Message-Id: <9504132306.AA13731@salk.edu> To: Connectionists@cs.cmu.edu Subject: Neural Comp 7:3 - Abstracts on WWW Cc: terry@salk.edu Neural Computation Abstracts are now available on WWW: URL: http://www-mitpress.mit.edu/ ----- NEURAL COMPUTATION may 1995 Volume 7 Number 3 Review: Models of orientation and ocular dominance columns in the visual cortex: A critical comparison E. Erwin, K. Obermayer and K. Schulten Letters: How precise is neuronal synchronization? Peter K=F6nig, Andreas K. Engel, Pieter R. Roelfsema and Wolf Singer Quantitative analysis of electronic structure and membrane properties of NMDA activated lamprey spinal neurons C. R. Murphey, L. E. Moore and J. T. Buchanan Reduced representation by neural networks with restricted receptive fields Marco Idiart, Barry Berk and L. F. Abbott Stochastic single neurons Toru Ohira and Jack D. Cowan Memory recall by quasi-fixed-point attractors in oscillator neural networks Tomoki Fukai and Masatoshi Shiino Learning population codes by minimizing description length Richard S. Zemel and Geoffrey Hinton Competition and multiple cause models Peter Dayan and Richard S. Zemel Bayesian self-organization driven by prior probability distributions Alan L. Yuille, Stelios M. Smirnakas and Lei Xu Adaptive voting rules for k-NN classifiers R. Rovatti, R. Tagazzoni, Zs. M. Kov=E0cs and R. Guerrieri Regularisation in the selection of radial basis function centres Mark J. L. Orr Bootstrapping confidence intervals for clinical input variable effects in a network trained to identify the presence of acute myocardial infarction William G. Baxt and Halbert White ----- SUBSCRIPTIONS - 1995 - VOLUME 7 - BIMONTHLY (6 issues) ______ $40 Student and Retired ______ $68 Individual ______ $180 Institution Add $22 for postage and handling outside USA (+7% GST for Canada). (Back issues from Volumes 1-5 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) MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142. Tel: (617) 253-2889 FAX: (617) 258-6779 e-mail: hiscox@mitvma.mit.edu -----