ACM '71最新文献

{"title":"Symbolic and algebraic manipulation for solving differential equations","authors":"P. J. Ossenbruggen, Andrew K. C. Wong, T. Au","doi":"10.1145/800184.810538","DOIUrl":"https://doi.org/10.1145/800184.810538","url":null,"abstract":"Two symbolic and algebraic manipulation programs written in LISP 1.5 are presented for the solution of differential equations. The program LORDE is based on an exact method for solving higher order linear differential equations with constant coefficients and linear boundary conditions. The program TRIALSOLUTIONS is based on a variational technique for testing and evaluating assumed trial solutions of linear elliptical partial differential equations with variable coefficients. The formula pattern recognition and formula manipulation techniques are discussed, and examples are presented to illustrate the problem solving capabilities of these programs.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"12 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":"132795122","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":"Interactive linkage synthesis on a small computer","authors":"R. Kaufman, W. G. Maurer","doi":"10.1145/800184.810508","DOIUrl":"https://doi.org/10.1145/800184.810508","url":null,"abstract":"An interactive computer program for the kinematic synthesis of motion or function generating linkages is described. The system has been implemented on an 8K IBM 1130 with a storage tube display and a custom-built “globe” graphical input device. The desired performance of the mechanism at four or five prescribed finitely separated positions is specified to the computer, as is the geometry of the fixed and moving bodies. Graphical input devices, or a keyboard, or cards can be used for this purpose. Interactive graphics capability allows input, modification, and display of a complex moving body and fixed frame. Burmester circlepoint-centerpoint curves or Burmester point pairs are displayed for the specified motion, together with a number of other options such as relative poles of rotation. A dynamic cursor which traverses the circlepoint-centerpoint curves allows selection of input and output links of either a four-bar linkage, a slider-crank mechanism, or a turning-block mechanism capable of satisfying the prescribed input criteria. A flashing display aids in selection of circlepoint-centerpoint pairs by indicating the type of linkage that would result from choice of the link being displayed at that instant Grashof's criteria are used to determine whether such a choice would result in a drag link, double rocker, or crank rocker mechanism. Similar criteria have been developed for the slider and turning block equivalents of these mechanisms. The selected linkage can then be animated on the display screen. Continous display of its transmission angle is optional. Examples are given of the practical use of the program.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"14 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":"134276108","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":"Computer science contributions to learning and teaching (Panel)","authors":"Karl L. Zinn","doi":"10.1145/800184.810524","DOIUrl":"https://doi.org/10.1145/800184.810524","url":null,"abstract":"At the ACM Annual Conference in 1970 the Special Interest Group on Computer Uses in Education (SIGCUE) organized two sessions on computers in the instructional process. Recommendations for action by computer professionals were formulated and printed in the October issue of the SIGCUE Bulletin on Computer Uses in Education (v4, No. 5, pp. 26-33). Consistent with program planning for ACM 70 and 71, SIGCUE has organized a session for this year which in part should answer some of the questions raised last year. The Bulletin should again be a vehicle for supplementary statements and reporting of outcomes after the Conference.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"259 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":"133122533","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":"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}