ACM Home Page
Please provide us with feedback. Feedback
Suggestions for a method of analyzing binary images using Langlet's parity logic
Full text PdfPdf (618 KB)
Source International Conference on APL archive
Proceedings of the 2001 conference on APL: an arrays odyssey table of contents
New Haven, Connecticut
Pages: 115 - 124  
Year of Publication: 2001
ISBN:1-58113-419-3
Also published in ...
Author
Stuart Smith  University of Massachusetts Lowell, Lowell, MA
Sponsors
: NY Special Interest Group for the APL Programming Language (the NYC area APL chapter of ACM)
SIGAPL: ACM Special Interest Group on APL Programming Language
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 11,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/570407.570420
What is a DOI?

ABSTRACT

This paper describes an extension to the system of parity logic operations developed by Gerard Langlet and subsequently elaborated by Michael Zaus. Two operations, A and B, are introduced which can be used both to analyze and to synthesize arbitrary patterns of l's and O's in square Boolean matrices. The A and B operations are, like most of the operations in Langlet's system, completely reversible (i.e., the input to A or B can be exactly reconstructed its output). The B operation is shown to be connected with Langlet's Helical and Cognitive transforms. Manipulations of binary images are used to illustrate the properties of A and B, but no claim made that they have real-world applications at this time. The A and B algorithms, their supporting operations, and the programming examples are in Q'Nial; however, they can be easily translated APL, J, or other may programming language.