article

Free access

WSDM: Weighted sparse distributed memory prototype expressed in APL

Author:

Alvin J. SurkanAuthors Info & Claims

ACM SIGAPL APL Quote Quad, Volume 23, Issue 1

Pages 235 - 242

https://doi.org/10.1145/144052.144142

Published: 15 July 1992 Publication History

PDF eReader

Abstract

A functional style application of APL notation succinctly describes the architecture and principles of operation of one kind of connection-based computer. In the future it is expected that these machines will have thousands of processors and large arrays of dynamic connections. APL programs running on von Neumann computers now provide precise descriptions of connection-based machines which are convenient for exploring the potential of connection-based computation. Experience with radically new structures and different principles of operation for neural network problem solving can be obtained using virtual machines provided by software. Virtual machines are described by functions programmed on conventional computers.

Two adaptive variants of the sparse distributed memory or SDM (Kanerva [1991]) show improved efficiency. The demonstrated superiority of Kanerva's new pattern weighting idea can be obtained by improved coding of the input patterns. This coding is done by generally defined preprocessing of features of representative binary input patterns. Transformed input patterns select addresses which pack distributed memories more efficiently.

Coding is done by first computing customized weight vectors for each input pattern vector. Individual weighting of each pattern leads to more uniform utilization of the addresses and their corresponding memory connection weights. The derived pattern weights improve discrimination between pairs of similar inputs with few significant differences. This paper is to provide the APL community access to a concise symbolic description of Kanerva's weighted SDM machine. APL's rich set of computer modeling and exposition tools have the potential of markedly accelerating software and hardware development for array-base connectionist computing.

References

[1]

Kanerva, P., Sparse Distributed Memory (The Mrr Press, Cambridge, Massachusetts, 1989)

Digital Library

Google Scholar

[2]

Kanerva, P.,"Efficient Packing of Patterns in Sparse Distributed Memory by Selective Weighting of Input Bits" Artificial Neural Networks 1991, Volume I, pp. 279-284, Proceedings of ICANN-91, International Conference on Artificial Neural Networks - Espoo, Finland, June 24-28, 1991, editors: T. Kohonen, K. Makisara, O. Simula and J. Kangus. (Amsterdam: North Holland, 1991).

Google Scholar

[3]

Danforth, D., An Empirical Investigation of Sparse Distributed Memory Using Discrete Speech Recognition, in: Proceedings of International Neural -Network Conference, Pads, France, July 9-13, 1 (1990), pp. 183-186 (Kluwer Academic Publishers, Dordrecht, The Netherlands, 1990)

Google Scholar

[4]

Keeler, J., Capacity for Patterns and Sequences in Kanerva's SDM as Compared to Other Associative Memory Models, in: Anderson, D., (ed), Neural Information Processing Models (American Institute of Physics Press, New York, 1988)

Google Scholar

[5]

Prager, R. W., Clarke, T. J. W. and FaUside, F., The Modified Kanerva Model: Results for Real Time Word Recognition, in: IEEE First International Conference on Artificial Neural Networks, Savoy Place, London, 16-18 October 1989

Google Scholar

[6]

Sa~nen, J., Pohja, S., and Kaski, K., "Self- Organization with Kanerva's Sparse Distributed Memory" Artificial Neural Networks 1991, Volume I, pp. 284-289, ProceeAings of ICANN-91, International Conference on Artificial Neural Networks - Espoo, Finland, June 24-28, 1991, editors: T. Kohonen, K. Makisara, O. Simula and J. Kangus. (Amsterdam: North Holland, 1991).

Google Scholar

[7]

Surkan "Application of Neural Networks to Classification of Binary Prof'fles Derived from Individual Interviews" pp. 467-472 IEEE International Conference on Neural Networks July 24-27, 1988.

Google Scholar

[8]

Surkan "Fast Trainable Pattern Classification by a Modification of Kanerva's SDM" (with L. Di) In~ern~ti0nal Joint Conference on Neural Networks, Volume 1, July 18, 1989, pp. 342-350; IEEE TAB Neural Network Committee, San Diego.

Google Scholar

Cited By

View all

Anwar ADasgupta DFranklin S(1999)Using genetic algorithms for sparse distributed memory initializationProceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)10.1109/CEC.1999.782538(1043-1050)Online publication date: 1999
https://doi.org/10.1109/CEC.1999.782538

Index Terms

WSDM: Weighted sparse distributed memory prototype expressed in APL
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multicore architectures
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

WSDM: Weighted sparse distributed memory prototype expressed in APL
APL '92: Proceedings of the international conference on APL

A functional style application of APL notation succinctly describes the architecture and principles of operation of one kind of connection-based computer. In the future it is expected that these machines will have thousands of processors and large ...
FlexFS: a flexible flash file system for MLC NAND flash memory
USENIX'09: Proceedings of the 2009 conference on USENIX Annual technical conference

The multi-level cell (MLC) NAND flash memory technology enables multiple bits of information to be stored on a single cell, thus making it possible to increase the density of the memory without increasing the die size. For most MLC flash memories, each ...
FRASH: hierarchical file system for FRAM and flash
ICCSA'07: Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I

In this work, we develop novel file system, FRASH, for byte-addressable NVRAM (FRAM[1]) and NAND Flash device. Byte addressable NVRAM and NAND Flash is typified by the DRAM-like fast access latency and high storage density, respectively. Hierarchical ...

Comments

Information & Contributors

Information

Published In

ACM SIGAPL APL Quote Quad Volume 23, Issue 1

July 1992

309 pages

ISSN:0163-6006

DOI:10.1145/144052

Editor:
Lynne C. Shaw

Issue’s Table of Contents

APL '92: Proceedings of the international conference on APL
July 1992
326 pages
ISBN:0897914775
DOI:10.1145/144045
Editor:
Lynne C. Shaw

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 July 1992

Published in SIGAPL Volume 23, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
283
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)14

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Anwar ADasgupta DFranklin S(1999)Using genetic algorithms for sparse distributed memory initializationProceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)10.1109/CEC.1999.782538(1043-1050)Online publication date: 1999
https://doi.org/10.1109/CEC.1999.782538

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations