TL;DR: Property of systems that enable them to be tested with a fixed constant number of tests independent of p, the number of cells in the system are considered, referred to as C-testable.
Abstract: It has been shown that the number of tests required to detect all faults in a one-dimensional unilateral combinational iterative array consisting of p cells will, in general, be proportional to p. In this paper we consider properties of such systems that enable them to be tested with a fixed constant number of tests independent of p, the number of cells in the system. Such systems are referred to as C-testable. Necessary and sufficient conditions on the basic cell state table are derived for an iterative system to be C-testable. It is shown that an arbitrary N-state cell table can be augmented by the addition of, at most, one row and less than [log2 N]2 columns (for N ≥ 2) so as to be C-testable.
TL;DR: In this paper, a table construction that folds into a compact carrying case and makes provision for seats in the form of benches which conveniently attach to the table construction when in extended form and compactly store in the table constructions when in folded condition is presented.
Abstract: Presented is a table construction that folds into a compact carrying case and which makes provision for seats in the form of benches which conveniently attach to the table construction when in extended form and which compactly store in the table construction when in folded condition.
TL;DR: A food composition table covering as many as 63 nutrients for 3,600 food items has been compiled and stored in a computer data bank as mentioned in this paper, which is available for use by others.
Abstract: A food composition table covering as many as 63 nutrients for 3,600 food items has been compiled and stored in a computer data bank. The system is available for use by others.
TL;DR: A leg assembly for a table top such as a game board or the like comprising a leg adapted to be received in frictional engagement by a receiving member in the underside of the table top and a cap adapted to frictionally engage the end of the leg to serve as a floor-engaging base thereof is described in this paper.
Abstract: A leg assembly for a table top such as a game board or the like comprising a leg adapted to be received in frictional engagement by a receiving member in the underside of the table top and a cap adapted to frictionally engage the end of the leg to serve as a floor-engaging base thereof and also adapted to be received in fractional engagement by the member in the underside of the table top to serve as a support for the table top in the absence of the leg.
TL;DR: A study of how the security of data may be compromised using VM/370 as the base system to be better able to evaluate different types of hardware and software system architectures with regard to their ability to provide security.
Abstract: Our concern is the ability of the computing system to ensure that data under its control is accessed only in accordance with the explicit intention of the owner of the data, as expressed in the directory or access control table of the system.We intend to use VM/370 as the base system for a study of how the security of data may be compromised. Our goal for this study is to be better able to evaluate different types of hardware and software system architectures with regard to their ability to provide security.
Abstract: A caveat must be extended to the potential reader. The book is introduced as intended for the "non-specialist reader," but one suspects the author underestimates his own considerable erudition in this field, for he assumes much knowledge on the reader's part, for example, a comfortable familiarity with the work of Laplace and Leontief. The book is truly a review and synthesis and by no means an introduction.
TL;DR: According to Information Theory, the information content of a table of numbers does not depend upon how difficult it was to obtain the entries in the table, but only upon whether or not the authors know how to reconstruct the entire table or any parts of it.
Abstract: According to Information Theory, [Cf Leon Brillouin, Science and Information Theory, Acacemic Press, N. Y. 1956, pp. 292-3], the information content of a table of numbers does not depend upon how difficult it was to obtain the entries in the table, but only upon whether or not we know how, or how precisely we know how, to reconstruct the entire table or any parts of it. Consequently, from present Information Theory, since we "know in advance" how a table of since is constructed, such a table contains absolutely no information. For a person who does not "know in advance" how to construct a table of sines, however, the table would indeed contain "Information." This ambiguity apparently contradicts the basic statement [Leon Brillouin, op. cit., page 10] that "Information is an absolute quantity which has the same numerical value for any observer," a contradiction which remains even when we accept Brillouins next statement that "The human value of the information, on the other hand, would necessarily be a relative quantity, and would have different values for different observers, according to the possibility of their understanding it and using it later."
TL;DR: A computer program develops a pattern for each patient by representing the results of a series of chemistry tests in terms of deviation from normal, and possible diagnoses are selected by comparing this pattern to a table of disease-associated patterns.
TL;DR: It is argued that there is a place both for the multi-rule and the single-rule (or action set) convention in decision table usage.
Abstract: This paper comments upon recently published work on decision table translation using methods similar to the rule-mask technique. The applicability of these methods under various possible conventions on overall table meaning is discussed, and it is argued that there is a place both for the multi-rule and the single-rule (or action set) convention in decision table usage.
TL;DR: A load-and-go resident assembler using approximately 2500 words in a 16-b computer is described, and assembles sufficiently fast so that there is little incentive to keep programs in object form.
Abstract: A load-and-go resident assembler using approximately 2500 words in a 16-b computer is described. It was designed for writing system programs, and assembles sufficiently fast so that there is little incentive to keep programs in object form. The assembler is table driven and can be adapted to various computers relatively easily.
TL;DR: The internal record format of RIQS employs a variety of data structures to accommodate rapid on‐line search and effective update capability and includes a record scatter table for all data, with associated item pointers and scatter table pointers, and with chaining for record updates.
Abstract: Remote Information Query System, (RIQS), is an information storage and retrieval system designed to handle both textual and quantitative information. It operates in an on-line and batch mode for searching, and has been used extensively at Northwestern for both bibliographic and data management applications. The batch version also provides for file creation and update, data verification, and indexing. Acceptable data types include alphanumeric, numeric, and dates. Numeric items can be expressed in any consistent set of units. The internal record format of RIQS employs a variety of data structures to accommodate rapid on-line search and effective update capability. These structures include a record scatter table for all data, with associated item pointers and scatter table pointers, and with chaining for record updates. On-line search and the record structure are illustrated. Performance statistics show costs for several file creation and file search runs.
TL;DR: A more realistic bound for the average number of comparisons needed to match an incoming identifier by table look-up, when the table is still growing, is derived in this article, where a table lookup algorithm is presented.
Abstract: A more realistic bound for the average number of comparisons needed to match an incoming identifier by table look-up, when the table is still growing, is derived.
TL;DR: The report is the result of a committee effort and includes a significant number of compounds from Dr. Birger Drake's personal files.
Abstract: This report is truly the result of a committee effort. The editor would like to express his sincere appreciation for the efforts of the very many members of ASTM Committee E-18, too numerous to list separately who, over the several years of preparation for this publication, have given freely of their time. A significant number of the compounds reported on have been given to us from the personal files of Dr. Birger Drake of the Swedish Institute for Food Preservation Research. In particular, he would like to extend special thanks to Mr. Harry McDaniel of the Proctor and Gamble Company for his extensive help in the keypunching of this information. Prof. John Powers of the University of Georgia was particularly helpful in assisting in the writing of the introduction.