This is being written on the day after the close of ACM 71 as I return to Europe for continuation of an interrupted vacation. Therefore, these remarks are going to be short, and they will not, of course, do justice to the results …
Walter M. Carlson
Page 571
The ACM Curriculum Committee on Computer Education for Management has been carrying out a study on “Curriculum Development in Management Information Systems Education in Colleges and Universities” under a grant from the National …
Daniel Teichroew
Pages 573-588
An efficient bit table technique for dynamic storage allocation of 2
n-word blocks, which requires a minimized amount of memory for bookkeeping purposes, is described. The technique has been tested in an implementation of the
6 …
Sadahiro Isoda, Eiichi Goto, Izumi Kimura
Pages 589-592
A new file structure for attribute based retrieval is proposed in this paper. It allows queries involving arbitrary Boolean functions of the attribute-value pairs to be processed without taking intersections of lists. The structure …
Eugene Wong, T. C. Chiang
Pages 593-597
In this note we consider the relationship between best approximations and best one-sided approximations for three different measures of goodness of fit. For these measures simple relationships exist between best approximations …
David L. Phillips
Pages 598-600
In the numerical solution of ordinary differential equations, certain implicit linear multistep formulas, i.e. formulas of type ∑
kj=0 &agr;jx
n+j -
h ∑
kj=0 &bgr;jx
n+j = 0, (1) with
&bgr;k> ≠ 0, have long been favored because they exhibit
h …
W. Liniger
Pages 600-601
A binary search is effective only when the list searched is ordered. It is efficient only when the list is dense—i.e. when records are in contiguous locations. It is easy to show that the maximum number of looks for a search
L …
Ivan Flores, George Madpis
Pages 602-603
C.J. Cheney [2] implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory containing a copy of a list, can determine whether particular …
Robert R. Fenichel
Pages 603-604
It is hard to recruit ACM members when there is no demonstrable relationship between membership and employment. Employers who recruit actuaries and accountants often specify the recognition applicants must have won from the relevant …
Page 609
