ACM-SE 14Pub Date : 1976-04-22DOI: 10.1145/503561.503598
William L. Flack
{"title":"An application of hash codes for disk file access, using multiple buckets","authors":"William L. Flack","doi":"10.1145/503561.503598","DOIUrl":"https://doi.org/10.1145/503561.503598","url":null,"abstract":"Hash code methods are widely used for retrieval of information from tables in memory and from direct access storage devices. A key is input to an algorithm which calculates the memory location or the disk address wanted. This paper explains hash code methods for direct disk access by way of a particular application example.The application includes the use of multiple buckets, where each bucket is a separate disk file. Synonym overflow is handled by trying to place a record only once in each bucket (file), and finally placing the record in an overflow bucket (file) if no place could be found in the primary files.The main goal of this design was to utilize 90-95% of the allocated disk space before the average access time became significantly degraded. This is in contrast with the usual requirement for hash code disk access in a single large file that there be about 20% excess space over the amount actually needed.The application was first implemented on an IBM 1130 and was originally conceived to overcome limitations on the size of a single physical file on that machine. It is now running on a Hewlett Packard 3000. The file capacity is 18,000 optometric clinic patient records.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"14 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":"122926390","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.503604
John Colotta
{"title":"A simulation study of boll weevil population dynamics","authors":"John Colotta","doi":"10.1145/503561.503604","DOIUrl":"https://doi.org/10.1145/503561.503604","url":null,"abstract":"A boll weevil population model is needed for interfacing with available cotton crop models for studying insect pest management decisions and economic thresholds. Most models of boll weevil population dynamics do not allow for biological and/or statistical variation, which increases the error when such models are used on a day-to-day basis. This paper discusses an algorithm that considers important insect population factors in more detail. First, the concept of a developmental unit (DU=time required for 50% of a particular growth stage to develop) is incorporated to account for temperature variations. A normal approximation of developmental times is used, and an error analysis for possible error sources in the numerical procedure. The next step is the development of a simplified relationship for estimating the dynamics of boll weevil feeding and egg-laying. Equations based on temperature and available diet are derived to calculate the fecundity in the field. A sensitivity analysis comparing the model output to observed data shows the feasibility of continuing in this area of research.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"22 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":"133349835","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.503578
S. F. Butler, Robert G. Schlee
{"title":"The importance of forcing and tree search in Qubic","authors":"S. F. Butler, Robert G. Schlee","doi":"10.1145/503561.503578","DOIUrl":"https://doi.org/10.1145/503561.503578","url":null,"abstract":"Qubic, also called three dimensional Tic-Tac-Toe, provides a good environment for developing and testing different concepts of heuristic programming and game theory. Because Qubic is a simple game one can minimize the task of learning the rules of the game as one must do in Chess or another more complex game; however, one should realize that Qubic is not a trivial game. It is not known if the person who moves first can win every game (has a win strategy) or tie every game (has a draw strategy). Citrenbaum [in 1] claims that a draw strategy exists for the game while Gammill [1] claims that a win strategy exists. The current knowledge about Qubic supports both sides. This paper proposes a solution to the game by combining the two procedures of forcing and tree search into a single strategy.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"15 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":"132240297","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.503616
K. Reilly
{"title":"Aspects and implementation of a memory model","authors":"K. Reilly","doi":"10.1145/503561.503616","DOIUrl":"https://doi.org/10.1145/503561.503616","url":null,"abstract":"A number of proposals have been made concerning the modeling of memory systems, human and artificial. A recent model primarily designed to model human memory is the HAM system (see Anderson, J. and G. Bower. Human Associative Memory. Washington, D.C.: Winston & Sons, 1973). Anderson and Bower's book provides background on associative memory, outlines \"theoretical HAM,\" overviews an initial implementation of the theoretical model, and applies the model to make both quantitative and qualitative predictions.This paper first briefly overviews the HAM system, its uses and implementation history. An abbreviated tour of some of the processing that is done in our implementation of a slight variant of the original HAM system is provided. A data structuring view of the program is given in a series of figures, and the heart of one of the central algorithms is sketched. The final section of the paper is addressed to other selected aspects of the program and its qualitative uses in behavioral research.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"1 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133112198","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.503585
A. F. Borthick
{"title":"Effective service for remote computing users","authors":"A. F. Borthick","doi":"10.1145/503561.503585","DOIUrl":"https://doi.org/10.1145/503561.503585","url":null,"abstract":"In recent years, a growing number of computing users have experienced the effects of the replacement of their local computing facilities with remote computing facilities. Unfortunately, remote computing may imply remoteness not only in the sense of distance but also in the senses of accessibility, control, compatibility, and responsiveness. The providers of computing service at the central site may be oblivious to these issues, but if remote users view any of these aspects of the service as unsatisfactory, effective service is thereby undermined.This paper addresses problems which arise as the result of the installation of remote computing service for users who had heretofore had access to local service. It is written from the point of view of management at the central site providing remote computing service in the hope that recognition of the problems of providing such service will be a step in the direction of solving them.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"29 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":"133358483","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.503617
H. J. Jeffrey
{"title":"A new type of information retrieval system","authors":"H. J. Jeffrey","doi":"10.1145/503561.503617","DOIUrl":"https://doi.org/10.1145/503561.503617","url":null,"abstract":"In the period 1964-1968, Peter G. Ossorio [10,11,12] developed and tested, on a pilot study basis, a new approach to the problem of automatic document retrieval. Ossorio's studies were entirely successful, as pilot studies, and show the feasibility of using his approach to produce a new kind of retrieval system.These retrieval systems do not operate by word matching. The basic approach is to simulate the judgement of competent human judges of the conceptual content of each document, and the request. This judgement is then used to retrieve those documents with conceptual content most similar to that of the request.Each document is processed only at the time it is added to the data base, in time linear in the number of words in the document that the system recognizes. The retrieval request is in ordinary English. Time for retrieval is linear in the number of documents on file. Documents are retrieved in order of similarity of conceptual content to that of the request. The system works, in certain respects, better on full text documents, providing better descriptions of document content, and more detailed cross-indexing.The new type of system shows a number of interesting features. Among these are:(1) Much better performance than systems using the old techniques;(2) Faithful representation of the judgement of the person(s) whose judgement is being simulated, thus providing the possibility of individualized retrieval systems;(3) Ability to explain to a user why it retrieved certain documents, and not others. With this information, the user can alter his request, or instruct the system to judge things differently;(4) Automatic recognition of requests the system cannot properly handle;(5) Sub-documentary indexing reflecting heterogeneity of material. As is often the case with a new paradigm, Ossorio's work raises at least as many questions as it answers. This paper presents the new approach, and the results of some first explorations in the new field.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"65 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":"115023680","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.503610
John S. George
{"title":"GPL: a graphics application language","authors":"John S. George","doi":"10.1145/503561.503610","DOIUrl":"https://doi.org/10.1145/503561.503610","url":null,"abstract":"GPL, a graphics applications programming language is proposed. Features of the language are discussed; data types, operators and operation philosophy of a graphics language modeling the typical design process are outlined.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"16 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":"115337435","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.503566
Joseph K. Speetjens
{"title":"Intermediate language for minicomputer cross-compilation","authors":"Joseph K. Speetjens","doi":"10.1145/503561.503566","DOIUrl":"https://doi.org/10.1145/503561.503566","url":null,"abstract":"With the increasing use of minicomputers, the concept of cross-compilation (source program translated by one machine which in turn outputs object code for another machine) has become popular. This paper examines the use of an intermediate language, a concept long considered for full scale machines, as a tool to reduce duplication of effort and encourage communication between cross-compiler writers. This paper examines past attempts for intermediate languages, reviews the special requirements that minicomputers may have, and makes suggestions for a universal minicomputer oriented language.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"38 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":"114453572","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.503568
T. K. Mitchell
{"title":"Simplified time-sharing command language (interface)","authors":"T. K. Mitchell","doi":"10.1145/503561.503568","DOIUrl":"https://doi.org/10.1145/503561.503568","url":null,"abstract":"One of the problems with time-sharing is the long list of commands that must be known and used effectively to take a program from source statements to a load module that would run. To alleviate this problem, my project was to write an interface for the student to use when dealing with the time-sharing system. In accomplishing this, my program uses compiler techniques for processing the interface commands with immediate execution. The commands that the interface handle and expand were specified in BNF and a SLR(K) analyzer was used to create the tables fr the semantic analysis in the interface program. As the commands are recognized each production is a further step in the processing of these shortened commands. The runtime support was altered to include a section of code that enabled the interface to overlay all programs it requires. This was done to save space and enable the immediate execution of the instructions.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"117 3 Suppl 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":"122096666","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.503565
Peter J. Robinson
{"title":"Modular (somewhat structured) programming in standard BASIC","authors":"Peter J. Robinson","doi":"10.1145/503561.503565","DOIUrl":"https://doi.org/10.1145/503561.503565","url":null,"abstract":"A brief report on some programming conventions and practices which help to tame the normally unruly transfers of control within BASIC programs. In the author's programs all GOTO's and GOSUB's transfer to REM lines beginning with one asterisk for a GOTO and two or three asterisks for a GOSUB.In addition, common subroutines which are used by more than one program are stored on disk separately and APPended as needed. A variable naming convention associates certain variables with particular subroutines, giving a degree of block structure.","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":"128279891","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号
