Proceedings of the 16th annual Southeast regional conference最新文献

{"title":"A hardware hashing mechanism","authors":"Jeffrey W. Smith","doi":"10.1145/503643.503685","DOIUrl":"https://doi.org/10.1145/503643.503685","url":null,"abstract":"LEXASH (LEXical hASHer) is the realization in hardware of a polynomial hashing method. It is being used in a microcomputer-based system for accessing an English entry data base (lexicon), an application for which it is specifically design and particularly suitable. This approach is described, its performance calculated, and a design indicated that will perform the necessary algorithm in TTL hardware.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115489529","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":"Techniques for the development of a multi-objective optimization model","authors":"J. E. Giles, G. A. Hoff","doi":"10.1145/503643.503659","DOIUrl":"https://doi.org/10.1145/503643.503659","url":null,"abstract":"Techniques for the development of a large mathematical model for the TVA-operated reservoir system are described. The major goal of the model is to provide a planning tool based on optimization methodology for the operation and modification of the reservoir system. Such a model introduces these questions: What are adequate representations of the system and the system objectives? What is the proper optimization methodology? What programming techniques can aid in model development?","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116866712","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":"Design and implementation of RAQUEL II: a relational query language","authors":"Beverly A. Dutton, K. Kinsley","doi":"10.1145/503643.503714","DOIUrl":"https://doi.org/10.1145/503643.503714","url":null,"abstract":"This paper describes RAQUEL II, a query language to be used within a relational data base management system. The RAQUEL II language is a modification of RAQUEL (Relational Algebraic Query Language) [7,8], a language which is easy to learn and to use. Some features of RAQUEL have been omitted, some modified, and others extended. The intent has been to define a minimal set of commands which are still powerful enough to provide ease of creation, modification, and manipulation of data. All RAQUEL II features are desirable for the user. In passing, we note that several features are also important for certain noteworthy implementation objectives. The RAQUEL II system is currently being implemented at Florida Technological University on an IBM 370 within an OS environment.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123713650","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":"An algorithm for efficiently generating the design matrix and the associated covarience matrix in linear models","authors":"L. Murray, F. M. Speed","doi":"10.1145/503643.503689","DOIUrl":"https://doi.org/10.1145/503643.503689","url":null,"abstract":"is used in the analysis of linear models for estimation, components of variance, and tests of hypothesis is an nxq matrix of zeroes and ones, k q= ~ (ni+l)-i , k being the number of factors, i=l n. being the number of levels of the ith factor, z and R=2k-l. In such situations, the design matrix incorporates information about main effects and their interactions. For example, in a 2x3, factorial experiment, k=2, nl=2 , n2=3 , R=2K-I=3, and","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115562358","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":"Development of a computer information academic program for AACSB accreditation","authors":"J. Willhardt","doi":"10.1145/503643.503717","DOIUrl":"https://doi.org/10.1145/503643.503717","url":null,"abstract":"One of the major goals of a computer information program in Colleges and/or Schools of Business Administration is to prepare students to obtain job entry positions in the computer field. Currently, programmers and systems analysts are the two foremost positions for training. An integral part of this training includes developing in the student the ability to adapt to change, to be creative, to be innovative, and to progress in the field into management positions.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115991146","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":"Data structures for storing image data in a geographic data base","authors":"John J. Crowe","doi":"10.1145/503643.503652","DOIUrl":"https://doi.org/10.1145/503643.503652","url":null,"abstract":"A myriad of contemporary studies on geographically based image data. Such data include contour maps, LANDSAT data and aerial photographs. The amount of data generated by these sources is enormous. Therefore substantial savings can be realized by optimizing storage structures for this data.This paper examines types of geographically based image data and proposes storage structures for the data. Factors included in selecting appropriate structures are density of positive-valued pixels in the image and range of values a pixel may possess.The paper further discusses the applications of those structures in a geographic image database.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122580075","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 role of data abstractions in practical programming","authors":"D. Chand","doi":"10.1145/503643.503661","DOIUrl":"https://doi.org/10.1145/503643.503661","url":null,"abstract":"his paper unveils the mystery of data abstraction facilities that are being implemented in languages, such as CLU and ALPHARD. The goal is to demonstrate how the emerging ideas on abstract data types can be used in practical programming. The author motivates the need and advantages of data abstraction facilities and illustrates how to develop conventions to simulate the basic concepts of data abstractions within the framework of existing languages.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130351176","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 computerized health and nutrition assessment for school children","authors":"G. Pitts, M. W. Davis, B. Bateman","doi":"10.1145/503643.503687","DOIUrl":"https://doi.org/10.1145/503643.503687","url":null,"abstract":"A comprehensive school health and nutrition program requires an interdisciplinary (team) approach to the delivery of services. To achieve this, a management system requiring participation of project components (mental, physical, educational, and nutritional) was implemented. The project required a comprehensive effort to assess the student's health status. The decisions were basically limited to set levels or values less than normal. This was accomplished by comparison of data collected with the charts shown in Tables 1 and 2 (all comparison charts are not shown in this paper). It is the intent of this health record to place emphasis on areas of weakness for individual students as well as strong areas.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124397804","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 generated color patterns from mathematical functions","authors":"E. P. Miles","doi":"10.1145/503643.503657","DOIUrl":"https://doi.org/10.1145/503643.503657","url":null,"abstract":"In 1954 the author purchased a tablecloth at the International Congress of Mathematicians~ Amsterdam, which used the distribution of the Gaussian primes to develop a two-color block design. This design created by the Dutch Mathematician Balth Van der Pol inspired the author to examine other applications of mathematics to the generation of color patterns. The following year he presented a paper on \"Functional Design or Colorful Mathematics\" to the Alabama Academy of Science describing various ways in which mathematical functions could produce multi-color block designs. Several hand-created designs using the various methods were displayed. The method used involved the assignment of two coordinates to each block formed in a square grid. A centrally located \"origin\" square would be given coordinates (0,0), whereas coordinates (x,y) would be associated with the block x units to the right and y units above the coordinate square, etc. Working with integer valued functions of integers x and y and using a convenient modular arithmetic, one of the integers 0,1,2,...,n-l, where n is the modulus, could be determined for each square in the array. By associating a different color with each of those n integers a block color diagram could be formed for a wide variety of functions, but the computations and the hand coloring became rather tedious for designs with a large number of blocks and a large modulus. Recently, the author acquired access to an Intecolor 8001 intelligent terminal which can function independently or on line to our CDC CYBER systems to produce color patterns of the above type electronically. With aid of student programmers, software has been developed to reproduce color patterns originally done by hand, and to handle much more complex functions where hand computations and coloring would be impractical. As an illustrations of a simple function of the type discussed whose design is familiar to all, we cite:","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128754356","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 VSAM PL/I interface","authors":"Brian S. Ramsey, R. Cannon","doi":"10.1145/503643.503703","DOIUrl":"https://doi.org/10.1145/503643.503703","url":null,"abstract":"The IBM Language Reference Manual for the PL/I Optimizing Compiler states that an interface for using Virtual Storage Access Method (VSAM) data sets exists. It places no restrictions on what can be done other than to say that VSAM data sets should be treated just as Indexed Sequential Access Method (ISAM) data sets. At least that is how it is supposed to work. In working with VSAM clusters and related components, however, the PL/I interface did not function as expected. A brief background on how this problem was discovered and a description of the error will be presented. In addition, the description of a new interface and its advantages and disadvantages will be presented. The system on which the development was performed is an IBM S/370-]68 running under MVS release 3.7E. Release 3.0 of the PL/I Optimizing Compiler was the subject of the work. Brian S. Ramsey is currently a cadet in the Air Force ROTC program. Approximately one year ago, he attempted to revise the cadet administration programs. At that time, the programs were designed to run with ISAM data sets, ISAM providing keyed access to the cadet records. In addition to the primary data set, two other ISAM data sets were used as inverted files to maintain secondary keys. The Virtual Storage Access Method allows the representation of an indexed sequential file, thus providing keyed and sequential access on the primary key, together with the capability to define secondary keys and to access records on those keys. By using VSAM rather than ISAM, the primary data set and the two data sets used for secondary access could be merged into a single VSAM data set. In this manner, maintenance of the directories for secondary access, until then the responsibility of the application program, would be transferred to the access method. In order to effect the transfer it was necessary to create a VSAM base cluster and two alternate indexes. After designing the initial specifications, the VSAM cluster was built and loaded. The alternate indexes were then built and related to the base cluster. The next step was to design programs to test the feasibility of using VSAM. It was during this phase that the bug was discovered. The program to test the Alternate Indexes opened the file for direct access using the following declare statement: DCL VS FILE DIRECT KEYED UPDATE ENV(VSAM); The file could not be opened. The reason given was that the Alternate Index was an organization incapable of direct keyed access. No reason could be found in the manuals for this type of error, so a small assembler language program was written to determine whether direct keyed access through an alternate index could be achieved. Using identically coded Access Control Blocks (ACBs),the program opened, used keyed access to read a record, and closed both the base cluster and one alternate index. No error occurred during this test. This experiment would seem to indicate that the PL/I interface has difficulty recognizing alternate indexes.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130039522","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}