Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

Responses from 1,613 former servicemen with Spanish surnames were examined to evaluate Spanish surname recognition as a means of identifying persons of Latin American birth or ancestry. Questionnaires were mailed to 5,019 servicemen who had: (1) been inductees or enlistees in the Army, Navy, or Marine Corps; (2) left active duty in the first 6…

The results of various computerized coding techniques used to identify persons of Spanish derivation were compared to questionnaire responses in which people identified themselves as Spanish. The coding techniques classified names as Spanish and non-Spanish using the following: census surnames; Morton surnames; "Broad" Spanish surnames; "Narrow"…

Continuing technological advances in computers and communications make possible the integration of data systems and the exchange of data among them on an expanding scale. However, the full effect of these advances cannot be realized unless the need for uniform understanding of the common information (data elements) and their expression in data…

The compilation of a dictionary for automatic translation from Russian to English is described in detail. Emphasis is placed on: (1) morphological and functional classifications of Russian words, (2) dictionary compilation, (3) the structure of signs, (4) automatic information-processing machines, (5) from the automatic dictionary to the automatic…