INDEX OF INVITED PARTICIPANTS
U.S. GOVERNMENT PRINTING OFFICE: 1966 O—205-502
Footnotes:[1]For review articles see:Lillie (13),Franck (6).[2]The operation of this machine is described in substantially greater detail in J. J. Spilker, Jr., D. D. Luby, R. D. Lawhorn, “Adaptive Binary Waveform Detection,” Philco Western Development Laboratories, Communication Sciences Department, TR #75, December 1963.[3]F. M. Glaser, “Signal Detection by Adaptive Filters,”IRE Trans. Information Theory, pp. 87-90; April 1961.[4]P. W. Cooper, “The Hypersphere in Pattern Recognition,”Information and Control, pp. 324-346; December 1962.[5]Observed from Oscillogram[6]Computed[7]Observed from Oscillogram[8]Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.[9]Random cartesian product.[10]Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.[11]Harman, W. W., “Principles of the Statistical Theory of Communication,” New York, New York:McGraw-Hill, 1963.[12]Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.[13]Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.[14]Halmos, P. R., “Measure Theory,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1950.[15]Kelley, J. L., “General Topology,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1955.[16]Feinstein uses his axioms only in finite space X;i.e., card(X) < K₀.[17]Feinstein, A., “Foundations of Information Theory,” New York, New York: McGraw-Hill, 1958.[18]If I is infinite, certain precautions have to be exercised.[19]This “if” is the catch that makes all methods of metrization of a space of dimensionality higher than one impractical, except the method of successive projections upon unit spheres centered at the center of gravity. The method of using that nilpotent projection operator is described in the companion paper(see footnotepage 65).[20]Only non-cyclic irreducible (wrt direct product) denumerable group components of the old denumerable space will remain.[21]Random cartesian product.[22]This paper, submitted after the Symposium, represents a more detailed presentation of some of the issues raised in the discussion sessions at the Symposium and hence, constitutes a worthwhile addition to the Proceedings.
Footnotes:
[1]For review articles see:Lillie (13),Franck (6).
[1]For review articles see:Lillie (13),Franck (6).
[2]The operation of this machine is described in substantially greater detail in J. J. Spilker, Jr., D. D. Luby, R. D. Lawhorn, “Adaptive Binary Waveform Detection,” Philco Western Development Laboratories, Communication Sciences Department, TR #75, December 1963.
[2]The operation of this machine is described in substantially greater detail in J. J. Spilker, Jr., D. D. Luby, R. D. Lawhorn, “Adaptive Binary Waveform Detection,” Philco Western Development Laboratories, Communication Sciences Department, TR #75, December 1963.
[3]F. M. Glaser, “Signal Detection by Adaptive Filters,”IRE Trans. Information Theory, pp. 87-90; April 1961.
[3]F. M. Glaser, “Signal Detection by Adaptive Filters,”IRE Trans. Information Theory, pp. 87-90; April 1961.
[4]P. W. Cooper, “The Hypersphere in Pattern Recognition,”Information and Control, pp. 324-346; December 1962.
[4]P. W. Cooper, “The Hypersphere in Pattern Recognition,”Information and Control, pp. 324-346; December 1962.
[5]Observed from Oscillogram
[5]Observed from Oscillogram
[6]Computed
[6]Computed
[7]Observed from Oscillogram
[7]Observed from Oscillogram
[8]Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.
[8]Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.
[9]Random cartesian product.
[9]Random cartesian product.
[10]Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.
[10]Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.
[11]Harman, W. W., “Principles of the Statistical Theory of Communication,” New York, New York:McGraw-Hill, 1963.
[11]Harman, W. W., “Principles of the Statistical Theory of Communication,” New York, New York:McGraw-Hill, 1963.
[12]Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.
[12]Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.
[13]Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.
[13]Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.
[14]Halmos, P. R., “Measure Theory,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1950.
[14]Halmos, P. R., “Measure Theory,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1950.
[15]Kelley, J. L., “General Topology,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1955.
[15]Kelley, J. L., “General Topology,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1955.
[16]Feinstein uses his axioms only in finite space X;i.e., card(X) < K₀.
[16]Feinstein uses his axioms only in finite space X;i.e., card(X) < K₀.
[17]Feinstein, A., “Foundations of Information Theory,” New York, New York: McGraw-Hill, 1958.
[17]Feinstein, A., “Foundations of Information Theory,” New York, New York: McGraw-Hill, 1958.
[18]If I is infinite, certain precautions have to be exercised.
[18]If I is infinite, certain precautions have to be exercised.
[19]This “if” is the catch that makes all methods of metrization of a space of dimensionality higher than one impractical, except the method of successive projections upon unit spheres centered at the center of gravity. The method of using that nilpotent projection operator is described in the companion paper(see footnotepage 65).
[19]This “if” is the catch that makes all methods of metrization of a space of dimensionality higher than one impractical, except the method of successive projections upon unit spheres centered at the center of gravity. The method of using that nilpotent projection operator is described in the companion paper(see footnotepage 65).
[20]Only non-cyclic irreducible (wrt direct product) denumerable group components of the old denumerable space will remain.
[20]Only non-cyclic irreducible (wrt direct product) denumerable group components of the old denumerable space will remain.
[21]Random cartesian product.
[21]Random cartesian product.
[22]This paper, submitted after the Symposium, represents a more detailed presentation of some of the issues raised in the discussion sessions at the Symposium and hence, constitutes a worthwhile addition to the Proceedings.
[22]This paper, submitted after the Symposium, represents a more detailed presentation of some of the issues raised in the discussion sessions at the Symposium and hence, constitutes a worthwhile addition to the Proceedings.
Transcriber’s Notes:The illustrations have been moved so that they do not break up paragraphs and so that they are next to the text they illustrate.Typographical and punctuation errors have been silently corrected.A heavy bar on top of a letter indicates a vector, e.g.Mmeans “the vector M”.
Transcriber’s Notes:
The illustrations have been moved so that they do not break up paragraphs and so that they are next to the text they illustrate.
Typographical and punctuation errors have been silently corrected.
A heavy bar on top of a letter indicates a vector, e.g.Mmeans “the vector M”.