An algorithm for generating symmetric solutions of the modified no-three-in-line problem for the square boards of even size is presented. The correctness of the algorithm for arbitrarily large square boards is established. A computer program in PL/I was written and executed on the UNIVAC 1108 computer to generate the solutions for some boards of even size.
{"title":"Symmetric solutions of the modified no-three-in-line problem for even boards","authors":"J. Navlakha","doi":"10.1145/503506.503520","DOIUrl":"https://doi.org/10.1145/503506.503520","url":null,"abstract":"An algorithm for generating symmetric solutions of the modified no-three-in-line problem for the square boards of even size is presented. The correctness of the algorithm for arbitrarily large square boards is established. A computer program in PL/I was written and executed on the UNIVAC 1108 computer to generate the solutions for some boards of even size.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"2 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120913370","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}
This paper outlines the salient features of a computer-based undergraduate student information system. The system is being designed and implemented by this author in partial fulfillment of the requirements for a Master of Science degree in Computer Science from the University of Southern Mississippi (USM). The major thrust of this paper is the description of the proposed system's capabilities rather than an eludication of the various design strategies and theory.
{"title":"A computer-based information system to aid in undergraduate advisement and curriculum development","authors":"Stuart H. Greenberg","doi":"10.1145/503506.503541","DOIUrl":"https://doi.org/10.1145/503506.503541","url":null,"abstract":"This paper outlines the salient features of a computer-based undergraduate student information system. The system is being designed and implemented by this author in partial fulfillment of the requirements for a Master of Science degree in Computer Science from the University of Southern Mississippi (USM). The major thrust of this paper is the description of the proposed system's capabilities rather than an eludication of the various design strategies and theory.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115257376","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}
One of the most challenging areas for the application of Operations Research (OR) methodology has been that of vehicle scheduling and/or routing. In fact, no uniformly acceptable approach has yet been developed for these problems. Despitethis, OR techniques have been applied to many vehicle routing and scheduling problems, ranging from waste collection and street sweepers to oil tankers. Of particular importance in this work will be the application of OR approaches to the scheduling/routing of school buses.
{"title":"A computerized method for routing and scheduling school buses","authors":"Nora Mae Kelly","doi":"10.1145/503506.503546","DOIUrl":"https://doi.org/10.1145/503506.503546","url":null,"abstract":"One of the most challenging areas for the application of Operations Research (OR) methodology has been that of vehicle scheduling and/or routing. In fact, no uniformly acceptable approach has yet been developed for these problems. Despitethis, OR techniques have been applied to many vehicle routing and scheduling problems, ranging from waste collection and street sweepers to oil tankers. Of particular importance in this work will be the application of OR approaches to the scheduling/routing of school buses.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132697074","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}
Most computer text editors are oriented around a line of raw text as entered. When moving text, a more natural unit is the sentence. APLATS is a locally-written text editor which uses the sentence as the basic unit of text. [i] APLATS ends a sentence with (condition (a)) a "?" or "." followed by a blank, a format delimiter (single character), or a carriage return (as typed). A format delimiter which forces the start of a new line of text (condition (b)) also forces a sentence end. The definition of a sentence end used by APLATS sometimes produces "excess" sentence divisions. At other times it fails to produce sentence divisions where they are normally expected. Linguistic methodology was applied in an attempt to determine if the algorithm for finding sentence ends could be improved. Now, condition (b) will only rarely produce an "incorrect" sentence boundary. Also, consider the type of case where it will: a sentence breaks in the middle at the end of a line; a long quotation set off from the main body of the text, for example, separates it from the rest of the sentence (or perhaps the quotation ends the sentence). Handling of the long quotation as composed of one or more independent "sentences" is probably preferred for editing, anyway. Thus, condition (b) presents no major problems. It is condition (a) which produces many "unexpected"--and perhaps inconvenient--sentence breaks. In (1)-(4), for example, APLATS forces "excess" sentence ends at the points indicated by a "#". Further, it fails to produce sentence breaks in (5)-(6) at the points indicated by a "+". Sentence breaks would normally be expected at these locations. (Each of the sentences (1)-(13) is assumed to be extracted from a larger, unspecified context.)
{"title":"Optimizing an algorithm for finding sentence ends: applying linguistic methodology","authors":"D. W. Coleman","doi":"10.1145/503506.503533","DOIUrl":"https://doi.org/10.1145/503506.503533","url":null,"abstract":"Most computer text editors are oriented around a line of raw text as entered. When moving text, a more natural unit is the sentence. APLATS is a locally-written text editor which uses the sentence as the basic unit of text. [i] APLATS ends a sentence with (condition (a)) a \"?\" or \".\" followed by a blank, a format delimiter (single character), or a carriage return (as typed). A format delimiter which forces the start of a new line of text (condition (b)) also forces a sentence end. The definition of a sentence end used by APLATS sometimes produces \"excess\" sentence divisions. At other times it fails to produce sentence divisions where they are normally expected. Linguistic methodology was applied in an attempt to determine if the algorithm for finding sentence ends could be improved. Now, condition (b) will only rarely produce an \"incorrect\" sentence boundary. Also, consider the type of case where it will: a sentence breaks in the middle at the end of a line; a long quotation set off from the main body of the text, for example, separates it from the rest of the sentence (or perhaps the quotation ends the sentence). Handling of the long quotation as composed of one or more independent \"sentences\" is probably preferred for editing, anyway. Thus, condition (b) presents no major problems. It is condition (a) which produces many \"unexpected\"--and perhaps inconvenient--sentence breaks. In (1)-(4), for example, APLATS forces \"excess\" sentence ends at the points indicated by a \"#\". Further, it fails to produce sentence breaks in (5)-(6) at the points indicated by a \"+\". Sentence breaks would normally be expected at these locations. (Each of the sentences (1)-(13) is assumed to be extracted from a larger, unspecified context.)","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132099746","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}
In this paper we describe a set of tools we have devised to aid in the development and maintenance of PASCAL programs. PASCAL has been chosen as a target language since it is gaining increasing interest as a language for use on mini- and microcomputers.
{"title":"Pascal program development aids","authors":"C. Hughes, C. Pfleeger","doi":"10.1145/503506.503514","DOIUrl":"https://doi.org/10.1145/503506.503514","url":null,"abstract":"In this paper we describe a set of tools we have devised to aid in the development and maintenance of PASCAL programs. PASCAL has been chosen as a target language since it is gaining increasing interest as a language for use on mini- and microcomputers.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128795677","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}
Page replacement algorithms are one of the most important aspects of memory management schemes. This paper presents the page replacement algorithms of the following systems: PRIME 400, DEC VAX-11/780, DEC TOPS-10, IBM OS/370 MVS, and IBM VM/370. Illustrations are provided for all systems.
{"title":"The page replacement algorithms for PRIME 400, DEC VAX-11/780, DEC TOPS-10, IBM OS/370 MVS, IBM VM/370","authors":"C. J. McCall","doi":"10.1145/503506.503519","DOIUrl":"https://doi.org/10.1145/503506.503519","url":null,"abstract":"Page replacement algorithms are one of the most important aspects of memory management schemes. This paper presents the page replacement algorithms of the following systems: PRIME 400, DEC VAX-11/780, DEC TOPS-10, IBM OS/370 MVS, and IBM VM/370. Illustrations are provided for all systems.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132943747","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}
The placement of files among computer system storage devices can have a significant impact on system performance. Here we present a method to represent multiple copies of read-write files that accounts for the overhead involved in updates. We then present a solution technique for the file assignment problem for the case of read-write files without multiple copies. The technique analyzes the system as a network of queues and assigns files to devices by integer programming. The resultant file assignment is optimal with respect to CPU throughput.
{"title":"Toward a multiple copy file assignment model for files in a computer system","authors":"L. G. Jones, D. Foster","doi":"10.1145/503506.503515","DOIUrl":"https://doi.org/10.1145/503506.503515","url":null,"abstract":"The placement of files among computer system storage devices can have a significant impact on system performance. Here we present a method to represent multiple copies of read-write files that accounts for the overhead involved in updates. We then present a solution technique for the file assignment problem for the case of read-write files without multiple copies. The technique analyzes the system as a network of queues and assigns files to devices by integer programming. The resultant file assignment is optimal with respect to CPU throughput.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114198854","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}
The problem of testing hypotheses in 2xm contingency tables with small cell sizes is discussed. An exact technique suggested by Freeman and Halton is recalled and a computer program for performing the calculations is presented.
{"title":"Exact tests of significance in 2xM contingency tables","authors":"A. Cantor","doi":"10.1145/503506.503509","DOIUrl":"https://doi.org/10.1145/503506.503509","url":null,"abstract":"The problem of testing hypotheses in 2xm contingency tables with small cell sizes is discussed. An exact technique suggested by Freeman and Halton is recalled and a computer program for performing the calculations is presented.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114216845","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}
The security kernel is a disciplined approach to the organization and isolation of security-related functions. To guarantee completeness of the security kernel and enhance the possibility of formal verification, the design is based upon a mathematical representation of a secure system. The mathematical model most often used as the basis for kernel design is examined. A basic set of kernel functions is presented and issues relevant to kernel architectures are discussed.
{"title":"The security kernel approach to secure operating systems","authors":"Bruce Chittenden, Paul J. Higgins","doi":"10.1145/503506.503532","DOIUrl":"https://doi.org/10.1145/503506.503532","url":null,"abstract":"The security kernel is a disciplined approach to the organization and isolation of security-related functions. To guarantee completeness of the security kernel and enhance the possibility of formal verification, the design is based upon a mathematical representation of a secure system. The mathematical model most often used as the basis for kernel design is examined. A basic set of kernel functions is presented and issues relevant to kernel architectures are discussed.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115863174","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}
Data gathering in an attempt to gain knowledge about a particular phenomenon is a key element in the work of scientists and engineers. It is a first step in the mathematical modeling or simulation of any real-world system under study. A researcher can choose to model his system with empirical data or with a theoretical probability distribution which best describes his observed data. The latter method is usually preferable.
{"title":"A FORTRAN based computer program to perform goodness of fit testing of empirical data to theoretical probability distributions","authors":"Sue D. Guthrie","doi":"10.1145/503506.503542","DOIUrl":"https://doi.org/10.1145/503506.503542","url":null,"abstract":"Data gathering in an attempt to gain knowledge about a particular phenomenon is a key element in the work of scientists and engineers. It is a first step in the mathematical modeling or simulation of any real-world system under study. A researcher can choose to model his system with empirical data or with a theoretical probability distribution which best describes his observed data. The latter method is usually preferable.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131663889","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：