article

Free access

The minimization of spatially-multiplexed character sets

Author:

James F. GimpelAuthors Info & Claims

Communications of the ACM, Volume 17, Issue 6

Pages 315 - 318

https://doi.org/10.1145/355616.361019

Published: 01 June 1974 Publication History

PDF eReader

Abstract

The paper describes a technique for compacting character sets in a digital computer while retaining fast access to individual bits. It considers the problem of minimizing the storage needed to contain such tables. Reduction techniques are developed, and the problem is shown to reduce to a covering problem.

References

[1]

Bartee, T.C. Computer design of multiple-output logical networks. IRE Trans. EC-10, 2 (Mar. 1961), 21-30.

Crossref

Google Scholar

[2]

Dewar, R.B. SPITBOL. SNOBOL4 Document S4D23, Illinois Inst. of Tech., Chicago, Feb. 1971.

Google Scholar

[3]

Gimpel, J.F. A reduction technique for prime implicant tables. IEEE Trans. EC-14, 4 (Aug. 1965), 535-541.

Google Scholar

[4]

Gimpel, J.F. SITBOL--A SNOBOL4 for the PDP-10. SNOBOL4 Document $4D30, Bell Lab., Holmdel, N. J., June 1, 1973.

Google Scholar

[5]

Gimpel; J.F. A design for SNOBOL4 for the PDP-10. SNOBOL4 Document S4D29b, Bell Lab., Holmdel, N.J., May 1973.

Google Scholar

[6]

Griswold, RE. The Macro Implementation of SNOBOL4. Freeman, San Francisco, 1972.

Digital Library

Google Scholar

Cited By

View all

Zhou LChen JDas AMin HYu LZhao MZou J(2022)Serving deep learning models with deduplication from relational databasesProceedings of the VLDB Endowment10.14778/3547305.354732515:10(2230-2243)Online publication date: 7-Sep-2022
https://dl.acm.org/doi/10.14778/3547305.3547325
Huang HShang FZhang J(2012)Approximation Algorithms for Minimizing the Number of Roles and Administrative Assignments in RBACProceedings of the 2012 IEEE 36th Annual Computer Software and Applications Conference Workshops10.1109/COMPSACW.2012.81(427-432)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1109/COMPSACW.2012.81
Frank MBasin DBuhmann JNing PSyverson PJha S(2008)A class of probabilistic models for role engineeringProceedings of the 15th ACM conference on Computer and communications security10.1145/1455770.1455809(299-310)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1455770.1455809
Show More Cited By

Index Terms

The minimization of spatially-multiplexed character sets
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Parsers
    2. General programming languages
      1. Language features
        Data types and structures
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Parsing

Recommendations

RE2C: a more versatile scanner generator

It is usually claimed that lexical analysis routines are still coded by hand, despite the widespread availability of scanner generators, for efficiency reasons. While efficiency is a consideration, there exist freely available scanner generators such as ...
Towards a cascade of morpho-syntactic tools for arabic natural language processing
CICLing'10: Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing

This paper presents a cascade of morpho-syntactic tools to deal with Arabic natural language processing. It begins with the description of a large coverage formalization of the Arabic lexicon. The built electronic dictionary, named "El-DicAr", which ...
Policy-based scanning with QoS support for seamless handovers in wireless networks

Supporting seamless handovers between different wireless networks is a challenging issue. One of the most important aspects of a seamless handover is finding a target network and point of attachment (PoA). This is achieved by performing a so-called ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 17, Issue 6

June 1974

86 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/355616

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1974

Published in CACM Volume 17, Issue 6

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
306
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)6

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhou LChen JDas AMin HYu LZhao MZou J(2022)Serving deep learning models with deduplication from relational databasesProceedings of the VLDB Endowment10.14778/3547305.354732515:10(2230-2243)Online publication date: 7-Sep-2022
https://dl.acm.org/doi/10.14778/3547305.3547325
Huang HShang FZhang J(2012)Approximation Algorithms for Minimizing the Number of Roles and Administrative Assignments in RBACProceedings of the 2012 IEEE 36th Annual Computer Software and Applications Conference Workshops10.1109/COMPSACW.2012.81(427-432)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1109/COMPSACW.2012.81
Frank MBasin DBuhmann JNing PSyverson PJha S(2008)A class of probabilistic models for role engineeringProceedings of the 15th ACM conference on Computer and communications security10.1145/1455770.1455809(299-310)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1455770.1455809
Markopoulou AE. Anagnostou M(1998)Optimal grouping of components in a distributed systemComputer Communications10.1016/S0140-3664(98)00170-421:16(1452-1461)Online publication date: 1-Oct-1998
https://dl.acm.org/doi/10.1016/S0140-3664%2898%2900170-4
Lubiw A(1991)A weighted min-max relation for intervalsJournal of Combinatorial Theory, Series B10.1016/0095-8956(91)90073-S53:2(151-172)Online publication date: Nov-1991
https://doi.org/10.1016/0095-8956(91)90073-S
Lubiw A(1990)The boolean basis problem and how to cover some polygons by rectanglesSIAM Journal on Discrete Mathematics10.1137/04030103:1(98-115)Online publication date: 2-Jan-1990
https://dl.acm.org/doi/10.1137/0403010
Gligor VMaier D(1982)Finding Augmented-Set BasesSIAM Journal on Computing10.1137/021105111:3(602-609)Online publication date: 1-Aug-1982
https://dl.acm.org/doi/10.1137/0211051
Lee JGriswold R(1981)SNOBOL SessionHistory of Programming Languages10.1016/B978-0-12-745040-7.50018-1(601-660)Online publication date: 1981
https://doi.org/10.1016/B978-0-12-745040-7.50018-1
Griswold R(1978)A history of the SNOBOL programming languagesACM SIGPLAN Notices10.1145/960118.80839313:8(275-308)Online publication date: 1-Aug-1978
https://dl.acm.org/doi/10.1145/960118.808393
Griswold R(1978)A history of the SNOBOL programming languagesHistory of programming languages10.1145/800025.1198417(601-645)Online publication date: 1-Jun-1978
https://dl.acm.org/doi/10.1145/800025.1198417
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

RE2C: a more versatile scanner generator

Towards a cascade of morpho-syntactic tools for arabic natural language processing

Policy-based scanning with QoS support for seamless handovers in wireless networks

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations