An algorithm is devised for solving the fixed charge problem with linear constraints. The algorithm employs especially constructed cuts to locate the global optimum point. Computational results are included.
{"title":"A cutting plane algorithm for the fixed charge problem","authors":"H. Taha","doi":"10.1145/800192.805672","DOIUrl":"https://doi.org/10.1145/800192.805672","url":null,"abstract":"An algorithm is devised for solving the fixed charge problem with linear constraints. The algorithm employs especially constructed cuts to locate the global optimum point. Computational results are included.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"3 1","pages":"12-15"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81691844","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}
L* is a high-level language for defining and manipulating data structures and data bases. Its formalism derives from the concepts of sets and relations on sets. Unlike some recent proposals L* is a complete language in itself containing procedural facilities and does not therefore rely on being embedded in some host. Preliminary studies have shown it to be well suited to its field of application.
{"title":"The L* data language","authors":"J. Gray, J. Tomlinson","doi":"10.1145/800192.805699","DOIUrl":"https://doi.org/10.1145/800192.805699","url":null,"abstract":"L* is a high-level language for defining and manipulating data structures and data bases. Its formalism derives from the concepts of sets and relations on sets. Unlike some recent proposals L* is a complete language in itself containing procedural facilities and does not therefore rely on being embedded in some host. Preliminary studies have shown it to be well suited to its field of application.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"20 1","pages":"167-173"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81751851","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}
Modularity, in our view,1 deals with how to structure programs so that specified purposes are more easily attained. Our current work deals with three purposes—modifiability, reliability, and efficiency—and seeks to identify what structural properties, tools, and language features facilitate the attainment of these purposes. Our approach is to study the structure of three actual programs to see how their structure makes the programs more or less modifiable, reliable, and efficient. The first program is a 1,000 statement PL/I program written in top-down style with levels of abstraction. The second is a large circuit analysis program (AEDCAP). The third is a general purpose package for processing list structured data in a fashion that permits changing details of the data structure representation without revising high level algorithms operating on the data. The case study results will be used to assess the potential utility of possible programming tools and language features. 2
{"title":"Tools for modular programming: Finding out what's needed","authors":"J. Goodenough","doi":"10.1145/800192.805763","DOIUrl":"https://doi.org/10.1145/800192.805763","url":null,"abstract":"Modularity, in our view,1 deals with how to structure programs so that specified purposes are more easily attained. Our current work deals with three purposes—modifiability, reliability, and efficiency—and seeks to identify what structural properties, tools, and language features facilitate the attainment of these purposes. Our approach is to study the structure of three actual programs to see how their structure makes the programs more or less modifiable, reliable, and efficient. The first program is a 1,000 statement PL/I program written in top-down style with levels of abstraction. The second is a large circuit analysis program (AEDCAP). The third is a general purpose package for processing list structured data in a fashion that permits changing details of the data structure representation without revising high level algorithms operating on the data. The case study results will be used to assess the potential utility of possible programming tools and language features. 2","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"60 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91396947","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 Computer Braille Project in the Atlanta Public School System, funded under Title VI of the Elementary and Secondary Education Act (ESEA) was designed to develop a program to alleviate the problem of limited reading materials by providing braille materials for the visually impaired via the computer. The discrepancy between the amount, kind and availability of reading materials for sighted and blind students is one of the major weaknesses in the overall education program for visually impaired pupils. One of the chief goals for using an automated system such as Atlanta's is the total elimination of the need to know braille by those persons within the system who must prepare the input. One of the chief problems is the rather vigorous standards set forth by the rules of Standard English Braille including the unique formatting of braille publications.
{"title":"Computer Braille in the Atlanta School System","authors":"Mary P. Boyles","doi":"10.1145/800192.805745","DOIUrl":"https://doi.org/10.1145/800192.805745","url":null,"abstract":"The Computer Braille Project in the Atlanta Public School System, funded under Title VI of the Elementary and Secondary Education Act (ESEA) was designed to develop a program to alleviate the problem of limited reading materials by providing braille materials for the visually impaired via the computer. The discrepancy between the amount, kind and availability of reading materials for sighted and blind students is one of the major weaknesses in the overall education program for visually impaired pupils.\u0000 One of the chief goals for using an automated system such as Atlanta's is the total elimination of the need to know braille by those persons within the system who must prepare the input. One of the chief problems is the rather vigorous standards set forth by the rules of Standard English Braille including the unique formatting of braille publications.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"58 1","pages":"404"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88499454","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}
Coast Community College District is a publicly-supported community college district located in Orange County, California. It is comprised of two colleges: Orange Coast College and Golden West College. In addition, Coast Community College District owns and operates KOCE-TV, Channel 50, Orange County's only color public service educational television station. Currently employing coordinated instructional systems in courses in a number of disciplines, Coast has been a pioneer in the development of auto-tutorial modes of instruction. Auto-tutorial permeates such diverse areas as biology, typewriting, physical sciences, and English. Coast has kept abreast of the rather dramatic growth of the computer industry during the past 15 years. As a result, students enrolled in computer-related occupational programs are trained on the latest generation of computer systems. This training allows the student to enter the labor market with knowledge, skills and confidence so necessary for success in today's working environment.
{"title":"Computers in communications and education at Coast Community College District","authors":"B. Luskin, Monty W. Ruth","doi":"10.1145/800192.805732","DOIUrl":"https://doi.org/10.1145/800192.805732","url":null,"abstract":"Coast Community College District is a publicly-supported community college district located in Orange County, California. It is comprised of two colleges: Orange Coast College and Golden West College. In addition, Coast Community College District owns and operates KOCE-TV, Channel 50, Orange County's only color public service educational television station. Currently employing coordinated instructional systems in courses in a number of disciplines, Coast has been a pioneer in the development of auto-tutorial modes of instruction. Auto-tutorial permeates such diverse areas as biology, typewriting, physical sciences, and English.\u0000 Coast has kept abreast of the rather dramatic growth of the computer industry during the past 15 years. As a result, students enrolled in computer-related occupational programs are trained on the latest generation of computer systems. This training allows the student to enter the labor market with knowledge, skills and confidence so necessary for success in today's working environment.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"10 1","pages":"350-352"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88610116","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}
So many problems exist in implementing large Health Information Systems that a short position paper as this would hardly be able to list them all in the allotted space—let alone discuss them. Consequently, I would like to address just three significant fundamental problems. These three, I believe, are largely responsible for the delays in implementing large systems and possibly explain the fact that there are no successful comprehensive Health Information Systems working today.
{"title":"Problems facing large Health Information Systems","authors":"L. S. Davis","doi":"10.1145/800192.805668","DOIUrl":"https://doi.org/10.1145/800192.805668","url":null,"abstract":"So many problems exist in implementing large Health Information Systems that a short position paper as this would hardly be able to list them all in the allotted space—let alone discuss them. Consequently, I would like to address just three significant fundamental problems. These three, I believe, are largely responsible for the delays in implementing large systems and possibly explain the fact that there are no successful comprehensive Health Information Systems working today.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"42 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91333136","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}
We discuss in this paper three major problems related to the allocation of memory resources in paging systems. These are the problems of deciding how best to distribute program code and data into pages (pagination), of deciding which pages residing in main memory should next be removed (replacement), and of deciding how many pages of each of several competing programs should be permitted in main memory (allotment). We do not provide definitive solutions to these problems, as indeed no one has as yet. Instead, we suggest novel approaches to the problems, based primarily on their interrelationships, and describe specific techniques to illustrate our ideas. Our main contention is that a joint consideration of these problems is feasible and more realistic and would lead ultimately to practical and more efficient solutions.
{"title":"Memory allocation in paging systems","authors":"A. Lew","doi":"10.1145/800192.805710","DOIUrl":"https://doi.org/10.1145/800192.805710","url":null,"abstract":"We discuss in this paper three major problems related to the allocation of memory resources in paging systems. These are the problems of deciding how best to distribute program code and data into pages (pagination), of deciding which pages residing in main memory should next be removed (replacement), and of deciding how many pages of each of several competing programs should be permitted in main memory (allotment).\u0000 We do not provide definitive solutions to these problems, as indeed no one has as yet. Instead, we suggest novel approaches to the problems, based primarily on their interrelationships, and describe specific techniques to illustrate our ideas. Our main contention is that a joint consideration of these problems is feasible and more realistic and would lead ultimately to practical and more efficient solutions.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"PP 1","pages":"232-235"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84337760","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}
At present, projected rates indicate the solid waste generated in the United States will approach more than 300,000,000 tons/year before the end of this decade. Through consideration of this information and as a result of increasing concern on the part of ecologically minded individuals, there has been a conserted effort to develop computerized systems to obtain an efficient economic solution for the handling and distribution of this refuse. It might prove of benefit, at this point, to define the terms “solid waste” and “solid waste system” themselves. Waste is defined as anything that anybody throws away. Solid waste is any waste in solid or semi-solid form.[1] A solid waste system may be defined as that collection of men, equipment, and facilities whose purpose is to collect, transport, and dispose of the solid waste generated. The total system is itself made up of three smaller systems or subsystems. These subsystems include the collection system, whereby the solid waste is removed directly from the generating points; the disposal system by which the solid waste collected will be recycled or disposed; and finally, the transport system which serves to move the solid waste from collection points to the various disposal facilities throughout the system. This paper is concerned with the application of computer, technology to the planning, management, and optimization of the transport and disposal subsystems.
{"title":"Computerized optimization and planning in solid waste management","authors":"R. Keller","doi":"10.1145/800192.805750","DOIUrl":"https://doi.org/10.1145/800192.805750","url":null,"abstract":"At present, projected rates indicate the solid waste generated in the United States will approach more than 300,000,000 tons/year before the end of this decade. Through consideration of this information and as a result of increasing concern on the part of ecologically minded individuals, there has been a conserted effort to develop computerized systems to obtain an efficient economic solution for the handling and distribution of this refuse. It might prove of benefit, at this point, to define the terms “solid waste” and “solid waste system” themselves. Waste is defined as anything that anybody throws away. Solid waste is any waste in solid or semi-solid form.[1] A solid waste system may be defined as that collection of men, equipment, and facilities whose purpose is to collect, transport, and dispose of the solid waste generated. The total system is itself made up of three smaller systems or subsystems. These subsystems include the collection system, whereby the solid waste is removed directly from the generating points; the disposal system by which the solid waste collected will be recycled or disposed; and finally, the transport system which serves to move the solid waste from collection points to the various disposal facilities throughout the system. This paper is concerned with the application of computer, technology to the planning, management, and optimization of the transport and disposal subsystems.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"7 1","pages":"424-427"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79179477","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 syntax of the DO-WHILE is revised so as to distinguish the semantics of logical control of iteration from those of site of test within the scope of the DO. The corresponding control graph (flowchart subdiagram) is shown to be a combination of previously used alternative forms. An indentation scheme is proposed in which the indentation rules are identical for both iterative and conditional statements. Furthermore the rules as given are identical for any programming language, whether it is a lower level language which requires hand coded book-keeping statements or some ideal language in which all loop control is provided for in the syntactic forms. The minimal sufficient set of program control structures is augmented with forms for the convenience of human program writers and readers. These forms all share common indentation rules corresponding to those used for the DO-WHILE and IF-THEN-ELSE. Last a form is provided for handling error conditions, POSIT-QUIT-ADMIT in which multiple QUITs are permitted. The indentation rules are compatible with the preceding rules.
{"title":"On program control structure","authors":"P. M. Neely","doi":"10.1145/800192.805692","DOIUrl":"https://doi.org/10.1145/800192.805692","url":null,"abstract":"The syntax of the DO-WHILE is revised so as to distinguish the semantics of logical control of iteration from those of site of test within the scope of the DO. The corresponding control graph (flowchart subdiagram) is shown to be a combination of previously used alternative forms. An indentation scheme is proposed in which the indentation rules are identical for both iterative and conditional statements. Furthermore the rules as given are identical for any programming language, whether it is a lower level language which requires hand coded book-keeping statements or some ideal language in which all loop control is provided for in the syntactic forms.\u0000 The minimal sufficient set of program control structures is augmented with forms for the convenience of human program writers and readers. These forms all share common indentation rules corresponding to those used for the DO-WHILE and IF-THEN-ELSE. Last a form is provided for handling error conditions, POSIT-QUIT-ADMIT in which multiple QUITs are permitted. The indentation rules are compatible with the preceding rules.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"20 1","pages":"119-125"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77667268","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}
A tool, called LOCALIZER, which improves the locality of programs for multiprogrammed virtual-memory computer systems, is described. The method of critical working sets, which is the basis of the tool, is presented. This method is especially suitable for those systems where primary memory is managed according to the working set strategy. The various modules of the tool are briefly described after a discussion of the general restructuring procedure. (This research was supported in part by the Advanced Research Projects Agency, under Contract No. DACH15 70C 0274.)
{"title":"A tool for automatic program restructuring","authors":"D. Ferrari","doi":"10.1145/800192.805709","DOIUrl":"https://doi.org/10.1145/800192.805709","url":null,"abstract":"A tool, called LOCALIZER, which improves the locality of programs for multiprogrammed virtual-memory computer systems, is described. The method of critical working sets, which is the basis of the tool, is presented. This method is especially suitable for those systems where primary memory is managed according to the working set strategy. The various modules of the tool are briefly described after a discussion of the general restructuring procedure.\u0000 (This research was supported in part by the Advanced Research Projects Agency, under Contract No. DACH15 70C 0274.)","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"14 1","pages":"228-231"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77675773","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
扫码关注我们
求助内容：
应助结果提醒方式：