ACM '71最新文献

{"title":"CONSIM(Conflict Simulator): Risk, cost and benefit in political simulations","authors":"J. Clema, J. Kirkham","doi":"10.1145/800184.810488","DOIUrl":"https://doi.org/10.1145/800184.810488","url":null,"abstract":"The development and use of CONSIM (Conflict Simulator), a computer program designed to heurististically simulate decision making, is described. A typical example is used to evaluate and analyze the methodology of CONSIM. The simulation model is designed for two political opponents, each possessing any finite number of alternatives. The model is constructed utilizing techniques frequently employed in game theory. Probabilities are assigned, using a Bayesian Approach, to sets of alternatives available to the United States and China. Incorporated into the model is the capability of varying the probabilities as the Vietnam Conflict evolves and the re-evaluation of risks, costs, and benefits occurs. CONSIM is easy to use and applicable wherever probabilities may be assigned to each alternative in a mutually exclusive and exhaustive set of alternatives in a dynamic situation.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165812","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}

{"title":"Algorithms for nonlinear problems which use discrete approximations to derivatives","authors":"J. Dennis","doi":"10.1145/800184.810514","DOIUrl":"https://doi.org/10.1145/800184.810514","url":null,"abstract":"The most desirable algorithms for nonlinear programming problems call for obtaining the gradient of the objective and the Jacobian of the constraint function. The analytic form is often impossible and almost always impractical to obtain. The usual expedient is to use difference quotients to approximate the partial derivatives. This paper is concerned with the theoretical and practical ramifications of such modifications to basic algorithms. Among the methods surveyed are steepest descent, Stewart's modification of the Davidon-Fletcher-Powell method, the Levenberg-Marquardt method, Newton's method, and the nonlinear reduced gradient method. Numerical results are included in the presentation.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125997255","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}

{"title":"The test language dilemma","authors":"F. Liguori","doi":"10.1145/800184.810509","DOIUrl":"https://doi.org/10.1145/800184.810509","url":null,"abstract":"Accompanying the spreading popularity of Automatic Test Equipment (ATE), there has been a proliferation of test languages. These languages attempt to bridge the communications gap between the hardware (test equipment) oriented engineer, who must devise the procedure for testing a Unit Under Test (UUT), and the ATE system which generally is controlled by a computer-like control system. As various test languages evolved from machine-orientation through assembly languages, translators and compilers, each ATE manufacturer developed his own standards for his “ideal” language. Most have pursued the development of an ATE language and associated processor under the following delusions:\u0000 The perfect test programming language will provide an easy bridge between engineer and computer, and\u0000 Having built this bridge, all of the problems plaguing test program production will vanish.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"85 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127425778","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}

{"title":"Applications programming in a Health Sciences Computing center","authors":"A. Boraas","doi":"10.1145/800184.810528","DOIUrl":"https://doi.org/10.1145/800184.810528","url":null,"abstract":"Establishing an applications programming staff, as an integral part of a division of Health Computer Sciences within a health sciences community, requires a balance of technical personnel, computer system configurations, and specialized professional health science expertise. The reasons for establishing and maintaining such a staff are as varied as the demands of the health sciences community. The fluctuations of grant awards and contracts, health care delivery analyses, goals, and research personnel continually test the stability of a functional computer science-health sciences applications programming staff. The methods and procedures by which the Division of Health Computer Sciences at the University of Minnesota has, and is, asymptotically approaching a robust balance as a functioning applications programming staff are briefly presented in this paper.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129496291","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}

{"title":"Can present methods for library and information retrieval service survive? (Panel)","authors":"J. Belzer","doi":"10.1145/800184.810525","DOIUrl":"https://doi.org/10.1145/800184.810525","url":null,"abstract":"When the need of the research people for keeping in touch with current and ongoing research in their field started to become acute new methods of librarianship were indicated. Progress of all research and their results are being reported at conferences in proceedings, in professional journals and in special reports. Because of the large volume of these materials, locating specific items of interest within this great bulk, to a scientist conducting research is of the essence. In depth indexing of these materials become the panacea to satisfy this new requirement. The need for currentness, the large volumes of materials, and the in depth identification of content suggested automatic processes which resulted in the development of several specialized information retrieval centers, each specializing in the literature of a discipline or a profession.\u0000 Basically, most of the centers followed a somewhat similar approach. A policy for acquisition of materials would be adopted based on needs and the center's available resources. These materials would be received at the centers, a document number would be assigned to each paper and passed on to indexers. The indexers would read each document and assign index terms to them, identifying information content. In some instances, where abstracts are not available, they would create them. A search file would consist of document numbers and their respective index terms stored in a machine readable form. An alphabetic list of all the terms used for indexing the literature in the given corpus would consititute a dictionary of index terms. A search request would be converted into a search strategy consisting of a logical combination of terms taken from the dictionary, using AND, OR, and NOT logic. The method of indexing by terms and coordinating their concepts at search time using Boolean logic is known as coordinate indexing. An output of a search request would consist of a set of document numbers or accession numbers which met the search strategy requirement. Abstracts relating to the accession numbers would constitute the bibliography which the originator of the search request receives. He then examines them and finds that many are not relevant to his need nor to his biblio- graphic request. The non relevant references are referred to as false drops. In addition to the false drops, he finds that some are only peripherally relevant and it is his decision as to which documents he wishes to pursue further or read in full.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872268","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}

{"title":"A version of Beale's method avoiding the free-variables","authors":"A. S. Gonçalves","doi":"10.1145/800184.810512","DOIUrl":"https://doi.org/10.1145/800184.810512","url":null,"abstract":"Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of “free-variables” is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115777656","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}

{"title":"A refutation of Carlson's Conjecture, or UMASS re-moulded","authors":"C. Foster","doi":"10.1145/800184.810492","DOIUrl":"https://doi.org/10.1145/800184.810492","url":null,"abstract":"It is shown first that Carlson's Conjecture, in both the strong and weak form, is false and that (@@@@j)(D<subscript>j</subscript>@@@@U<subscript>j</subscript> @@). Second, we show that S(-@@@@)>S(@@@@) for any positive @@ and @@. Finally, we discuss some changes to a time-sharing system (UMASS) that one of the members of the design team would make today on the basis of three years experience teaching and using the system.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125408054","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}

{"title":"A flow oriented computer system simulation language","authors":"W. Franta","doi":"10.1145/800184.810526","DOIUrl":"https://doi.org/10.1145/800184.810526","url":null,"abstract":"This paper describes a language expressly designed for the simulation of operating system software. A carefully selected portion of the modeling machinery has been incorporated into the language so that the user need only be concerned with the operating system logic in constructing the modeling program. The modeling statements, as input to the assembly portion of the package result in the generation of a series of tables and pseudo code segments which are acted upon interpretatively during the simulation phase. A general description of system features together with a sample model program are presented in the body of the paper. The system described is written mainly in Fortran in a highly modular fashion so that certain extensions and/or changes to the language are easily implemented. The foundation for the effort is simply that simulation of proposed equipment configurations and/or operating system logic can and should be done prior to the installation and/or coding of the actual hardware software complex. Existing simulation languages are not always convenient to the task. Special languages which are natural and convenient to use in describing operating systems can make the prospect of simulation more attractive and useful.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124426673","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}

{"title":"Computational aspects on the use of cutting planes in global optimization","authors":"P. B. Zwart","doi":"10.1145/800184.810515","DOIUrl":"https://doi.org/10.1145/800184.810515","url":null,"abstract":"Minimization of a nonconvex objective function subject to linear inequality constraints can involve many local minima. Cutting plane methods for solving such problems have been proposed in the literature. This paper reports computational experience indicating that cutting methods do poorly on problems with dimension as low as ten. A geometric analysis of the conditions involved in cutting a polyhedron shows that:\u0000 1)The effect of a fixed depth cut decreases rapidly as dimension is increased, and\u0000 2)The approximation of a polyhedron by the cone formed by faces coincident to a given extreme point, becomes rapidly worse as dimension is increased.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121839422","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}

{"title":"Applications of computer simulation and related techniques to patient scheduling and medical administration","authors":"D. Garfinkel","doi":"10.1145/800184.810531","DOIUrl":"https://doi.org/10.1145/800184.810531","url":null,"abstract":"Possible applications of simulation and operations research to problems of optimal use of certain medical resources are analyzed. The problems considered include scheduling of the out-patient clinic, the private doctor's office practice, and work-up of hospital in-patients. In all of these situations traditional assumptions regarding the relative value of the doctor's and patients time have lost validity. The efficient use of space within a hospital, the minimization of travel time by members of a geographically fragmented activity, and optimization of transportation facilities are considered. A possible simulation and optimization of group practice is described. The need for interaction between clinicians and simulationists, and for joint training of personnel, is stressed.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130266202","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}