No abstract available.

The computer science department at Macalester College recently implemented a new undergraduate course sequence in computational science. This was done to better meet the course work needs of students in the physical and natural sciences as well as introduce into our curriculum an important and growing area of application. One of the unexpected benefits of our new program has been the creation of academic links between our department, mathematics, and the other sciences. In this paper we describe the role of computational science as an interdisciplinary bridge between computer science and other academic disciplines.

No abstract available.

This paper describes a software engineering experiment designed to confirm results from an earlier project which measured fault detection rates in user requirements documents (URD). The experiment described in this paper involves the creation of a standardized URD with a known number of injected faults of specific type. Nine independent inspection teams were given this URD with instructions to locate as many faults as possible using the N-fold requirements inspection technique developed by the authors. Results obtained from this experiment confirm earlier conclusions about the low rate of fault detection in requirements documents using formal inspections and the advantages to be gained using the N-fold inspection method. The experiment also provides new results concerning variability in inspection team performance and the relative difficulty of locating different classes of URD faults.

article Free Access Share on Problems with and proposals for service courses in computer science Authors: J. D. Parker Boston College Boston CollegeView Profile , G. M. Schneider Macalester College Macalester CollegeView Profile Authors Info & Claims ACM SIGCSE BulletinVolume 19Issue 1Feb. 1987 pp 423–427https://doi.org/10.1145/31726.31799Online:01 February 1987Publication History 1citation207DownloadsMetricsTotal Citations1Total Downloads207Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

This paper describes the development of an analytic model for performance studies of distributed computer networks. The model factors each node of a network into processing and channel components and models each separately using M/D/r and M/M/l queues. The model also includes a correction factor to account for the nonexponential nature of the input to the channel component. Results produced by the model are compared with results previously reported in the literature to estimate the magnitude of improvement which can be expected.

The rapid growth of large, heterogeneous, resource-sharing computer networks has created a serious problem in the sharing of information between incompatible systems. These incompatibilities can be categorized as either physical or logical in nature. Physical incompatibilities are problems caused by the way that the individual binary digits, regardless of what information they represent, are generated or stored internally. This would include character, word, and record size differences, blocking factors, and parity checking. Logical incompatibilities are differences in the way the meaning of information itself is represented. This could include internal code set, numeric data type representation, text compression, the addition or deletion of fields, resequencing and specially assigned bit patterns. This paper describes the initial work on a processor for supporting the real-time translation and transmission of data streams between nodes of a computer network. The processor, which will address itself to all the problem areas mentioned above, will contain as its primary component a Data Specification and Conversion Language (DSCL) for 1) specifying the physical and logical structure of the data streams at the sending and receiving sites and 2) describing and implementing the translation processes required for conversion of the source stream into the desired target stream. DSCL is implemented in the framework of a very high-level, special-purpose language with a wide range of automatic (i.e. transparent) services performed on behalf of a user. The execution of the resulting DSCL program by the DSCL processor will actually effect the transmission and translation of a specified data stream between network nodes.