ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503629
J. Peck
{"title":"An IBM 370 BC mode simulator for a first course in operating systems","authors":"J. Peck","doi":"10.1145/503561.503629","DOIUrl":"https://doi.org/10.1145/503561.503629","url":null,"abstract":"An IBM 370 basic control mode simulator was developed as an outgrowth of student projects in an operating systems course over several semesters. The programming was performed in Assembler language to enhance performance and allow for online symbolic access to simulated hardware components.The design of the simulator along with the organization of a typical instruction interpretation subroutine is described. A simple program execution using the IBM TSO facility is included to illustrate the manner in which students interact with the system. Finally the design for a typical operating system undertaken as a team project is presented.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127784127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503599
B. Hodges
{"title":"Software technology: present and future","authors":"B. Hodges","doi":"10.1145/503561.503599","DOIUrl":"https://doi.org/10.1145/503561.503599","url":null,"abstract":"This paper provides an examination of current software techniques and practices. Special attention is given to established methods for software production and management of software development activities. Present software development tools and their relationships to the development process are presented. In addition, other basic software technology areas for future research and development are discussed. These areas include: specialized language applications, generalized support software system, automated code verification/validation techniques and high order language computer.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"30 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116769745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503635
C. Zaiontz
{"title":"Circular automata","authors":"C. Zaiontz","doi":"10.1145/503561.503635","DOIUrl":"https://doi.org/10.1145/503561.503635","url":null,"abstract":"We define a finite-state machine called a circular automata (CA) which processes information in a queue; we show that any function computed (or any language recognized) by such a machine is computable (recognizable) by a Turing machine and vice versa. Space and time bounds are given for the needed simulations. Furthermore, the class of languages recognized by (non-) deterministic linear bounded automata is equal to the class of languages recognized by (non-) deterministic CA which don't expand the length of the contents of the queue. Whether every language recognized by such a non-expanding CA is recognized by a deterministic one is equivalent to the famous LBA problem.CA can be viewed as generalizations of ordinary finite automata and as a Shepherdson-Sturgis single register machine programming language. An interesting model of a non-expanding CA is that of a finite-state machine which process tapes in the form of a loop. This appears to be a very natural way to process magnetic tape which circles back on itself.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121142815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503634
J. Patel
{"title":"Synthesis of combinational circuits using Galois field arithmetic","authors":"J. Patel","doi":"10.1145/503561.503634","DOIUrl":"https://doi.org/10.1145/503561.503634","url":null,"abstract":"A Fourier-like transform for combinational switching functions of n-input m-output (n≥m) is presented.The transform utilizes Galois fields of 2n and 2m elements.Operations between these fields are defined suitably to retain generality. Application of this transform to swithing function results in a polynomial expansion which leads to a direct realization of the function.Logic circuits so realized are composed of complex modules that perform arithmetic operations in Galois fields and are suitable for fabrication by LSI technology.In general, such logic circuits assume 2n different levels.The complexity of the circuits grows faster than n2.2n.This high degree of complexity is due to rather inefficient utilization of modules.The complexity of the circuits so synthesized is reduced by repeated use of the modules.Such use is facilitated by an arithmetic-unit like structure with some dynamic storage capability.Coefficients of various terms in the expansion are stored in the storage.These coefficients are made available at proper time in a sequential manner during generation of the polynomial.The delay through such circuits is inherently large.Considerable reduction in the delay can be achieved by adding little hardware.External capability to change contents of the storage makes such circuits universal in nature. Universal logic blocks so constructed require 2n+3 pins to realize any multi-output function of n variables (n≥m).Application and development of the transform require computation in Galois fields.A brief discussion of mathematical nature and properties of such fields is included to make a self-contained presentation.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125485545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503632
B. Carroll, G. R. Kane
{"title":"A graduate/undergraduate computer graphics course and laboratory","authors":"B. Carroll, G. R. Kane","doi":"10.1145/503561.503632","DOIUrl":"https://doi.org/10.1145/503561.503632","url":null,"abstract":"This paper contains a syllabus and a description of a graduate/undergraduate level course in computer graphics offered by the Electrical Engineering Department at Auburn University. The course is designed to acquaint the student with the fundamental hardware and software components of real-time computer graphics systems. Topics covered include characteristics and features of hardware components, general-purpose graphics software, display files, two and three-dimensional transformations, clipping and windowing, perspective, hidden-line elimination and shading. Interactive graphics and a survey of applications will also be included.Classroom lectures and presentations are supplemented by laboratory demonstrations and student projects. Laboratory facilities will be described in the paper. Available equipment includes a DEC GT42 Graphics System, Tektronix 4012, 4013, and 4014 Graphics Terminals, and a Tektronix 4631 Hardcopy Unit. All of the above units are supported by a DEC PDP 11/40 under the RSTS/E System. A graphics utility package common to both the refreshed and stored graphics terminals is being developed.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122361677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503621
B. D. Carter, W. Miller, J. C. Harris
{"title":"Computer assisted land use planning for a state park","authors":"B. D. Carter, W. Miller, J. C. Harris","doi":"10.1145/503561.503621","DOIUrl":"https://doi.org/10.1145/503561.503621","url":null,"abstract":"This paper describes a project presently underway utilizing remotely sensed data and computer assisted procedures for the location and planning of a new state park. Data was collected on an initial study area of 128,620 acres from which several possible park sites were outlined. After a site was selected, similar procedures were used to outline possible locations for various elements within the park. An iterative design procedure will be used to develop an optimum final design for the park. Included is a detailed discussion of the CAGUP (computer assisted land use planning) package developed to support the planning procedure.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503631
J. Stewart
{"title":"Instructional experience with an XPL-implemented operating system model","authors":"J. Stewart","doi":"10.1145/503561.503631","DOIUrl":"https://doi.org/10.1145/503561.503631","url":null,"abstract":"An operating system model, programmed in assembly language and executed under a Sigma 9 simulator, has been employed for some time at the University of Southern Mississippi in an undergraduate operating systems course. Due to student inexperience and the inherent difficulties of writing and debugging assembly language, models developed in this way had to be group efforts, and either never worked or did not achieve any degree of sophistication. XPL, which was already being used in USM compiler courses, seemed a natural way to improve this situation, but presented several difficulties: 1) code generated by the XPL compiler required runtime support which in turn could depend on the \"real\" operating system (CP-V); and, 2) linkages for internal (XPL) procedures and external (assembly language) procedures had to be used to effect interrupt, trap and supervisor call control transitions. A special runtime package which flagged certain \"support\" calls as errors and provided the privileged instructions solved these problems.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116953497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503638
T. Ting, F. Sias, Eric Campbell
{"title":"On data error control problems in medical information systems","authors":"T. Ting, F. Sias, Eric Campbell","doi":"10.1145/503561.503638","DOIUrl":"https://doi.org/10.1145/503561.503638","url":null,"abstract":"The problem of data error control is one of the significant issues in the design of medical information systems which are used for supporting medical decision making. High degree of accuracy of information is necessary when human health problems are involved.A literature survey was conducted and an examination of several existing computerized medical information systems was made. The results indicate that many systems now in use have not adequately designed to implement fully the data error control techniques now available for minimizing the data errors. The situation may be improved by carefully introducing these techniques into the information processing procedures. It also suggests that further research should be undertaken in order to develop better suited data error detecting and correcting techniques for medical information systems.A systematic analysis was made to identify the sources and the causes of the data errors in medical information processing procedures both in mannual as well as in automated systems. Data errors are classified and are discussed along with the logical data flow in a typical medical information processing model. The characteristics of the data items involved, the data structures, the nature of the data errors, and the possible data error control methods are disscussed.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127639125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503607
Peter J. Robinson
{"title":"Case simulation language: an example of local development of a problem oriented language","authors":"Peter J. Robinson","doi":"10.1145/503561.503607","DOIUrl":"https://doi.org/10.1145/503561.503607","url":null,"abstract":"Case Simulation Language or CSL is a programming language which facilitates the production of simulated medical cases for training students at the University of Alabama Medical Center in Birmingham. CSL was developed in two months by one programmer and is executed interpretively by a small program (occupying less than 20,000 bytes) on a Hewlett-Packard 2000 Time Share System. The language features a curious assemblage of old techniques such as fixed fields in each line of source code and numeric labels, juxtaposed to relatively new concepts such as case statements.Modular programming is encouraged by the enforced division of the program into sections. Each section can be reached by a go to line (> line) or a call line (> < line) but once a section is called, new sections must also be called (up to 10 deep) since the attempted execution of a go to line causes an immediate return.An unusual feature of CSL is that the user has many opportunities during a simulation to affect the flow of control by entering a numeric label. (These are presented on the terminal as numbered sections, e.g. 111 Aggravating Factors, 112 Alleviation, etc.) The interpreter then resumes execution of the CSL program at the new section exactly as if an internal go to line naming that section had been executed.The interpreter has built in features which provide help for a user who has gotten \"lost\". For instance, whenever the user is prompted for a section number, the user can enter a \"9\" instead, and the terminal will respond with a list of sections which could reasonably be selected.In all, CSL provides 16 basically different operations or line types including provisions for terminal and file I/O, logical branching, and primitive string variables.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503573
Harvey Duhon
{"title":"A generalized logout and recovery system for small CODASYL databases","authors":"Harvey Duhon","doi":"10.1145/503561.503573","DOIUrl":"https://doi.org/10.1145/503561.503573","url":null,"abstract":"This paper describes an effective replacement for journaling to tape while updating a small CODASYL database, particularly in an online application.The journaling of before and after images of modified pages of the database is replaced with the logging of after images of modified records to a direct access file. To enable recreation of the database environment during recovery, all current database keys are logged with the record.Recovery of the database after system failure is accomplished by restoring the latest backup and reapplying all after images as recorded on the logout file.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127197787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
