Within the last year
Within the past 3 years
1 - 9 of 9 articles
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 Science Foundation. This position paper provides a framework for...
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 obtained from our annual meeting in Chicago.
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 societies. I have not seen a requirement for ACM membership in...
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 and best one-sided approximations. In particular it is shown that a...
In the numerical solution of ordinary differential equations, certain implicit linear multistep formulas, i.e. formulas of type ∑ k j =0 ॅ j x n + j - h ∑ k j =0 ॆ j x n + j = 0, (1) with ॆ k > ≠ 0, have long been favored because they exhibit strong (fixed- h ) stability. Lately, it...
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 bit patterns within that memory are pointers to other list...
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 is given by 1. L = log 2 N +1, (1) where N is the number of records...
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 is highly dependent on the way in which the file is to be used...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.