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

{"title":"General purpose problem solving using simulated human judgement","authors":"C. J. Linn","doi":"10.1145/503643.503699","DOIUrl":"https://doi.org/10.1145/503643.503699","url":null,"abstract":"This paper presents an alternative or possible addition to techniques used in general purpose problem solvers. A technique described by Jeffrey and Ossorio to simulate human judgment is applied to general problem solving. Human judgments on the degree to which objects are important to processes, (solution methods,) are factor analyzed and formed into a judgment space of orthogonal vectors. This space is consulted to choose a solution method based on the attributes of the available objects. The result is a system which decides \"how\" to solve a problem in much the same way a person would.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"236 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":"129056734","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":"Link implementation techniques","authors":"R. M. Long","doi":"10.1145/503643.503711","DOIUrl":"https://doi.org/10.1145/503643.503711","url":null,"abstract":"The physical representation of DBMS data models involves representing logical relationships via connections between data value occurrences. The collection of connections between two sets of data values is said to specify a link. In [D2] three distinct forms of link have been show to exist, each capturing distinct physical characteristics. The purpose of this paper is to extend the concept of a link so as to permit specification of various physical storage schemes. This extension thus enables a more precise definition of the physical representation of data models.","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":"128990600","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 general purpose CPU simulator","authors":"Dave Curbow","doi":"10.1145/503643.503715","DOIUrl":"https://doi.org/10.1145/503643.503715","url":null,"abstract":"The Computer Science department here at USM has two 8080 based machines and two Texas Instruments 960 minicomputers in addition to our XEROX Sigma-9. Our mass storage medium for the mini and micro systems is cassette. Because of the limits of this medium, and the inability for more than one person at a time to use one of these machines, software development has been very slow.One way to speed up this process would be to do all our work on the Sigma-9. That is keep all files on its disc, and use cross-assemblers and cross-compilers to generate object code and test the code on simulators. Thus the small systems would only be needed for final checkout.A cross-assembler and simulator for the 8080 systems were obtained and work begun. The more these programs were used, the more inadequate they seemed. This paper documents the design and implementation of a new simulator.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"105 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":"133531858","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":"Simulations applications in industry","authors":"Stephen S. McDowell","doi":"10.1145/503643.503716","DOIUrl":"https://doi.org/10.1145/503643.503716","url":null,"abstract":"This paper shows the steps involved in developing a simulation model of industry. The General Purpose Simulation System (GPSS) has been selected to show an example of an industry simulation and how the simulation can help management in decision making problems. The paper furthermore is trying to show the effectiveness of GPSS as a simulation language. It is my hope that simulation can someday be economical enough for all business to use as a practical tool for decision making.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"36 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":"131828725","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 modulated drawing in graphics design","authors":"Charles M. Williams","doi":"10.1145/503643.503698","DOIUrl":"https://doi.org/10.1145/503643.503698","url":null,"abstract":"A hardware-software process is described which automatically creates computer modulated drawings from an artists' own work. The artist prepares a line drawing at his leisure, in his customary environment using standard art supplies. The result is then rapidly and automatically digitized into a computer graphic database which mathematically describes the geometry of the various lines which compose it. These mathematical descriptions are then dynamically perturbed to yield a drawing which is rendered in a completely different style and yet retains the general holistic form of the original. The type and degree of modulation is specified by parameters.The value of the system to a graphic artist is that it allows him to use a computer to generate complex variations of drawings which would be exceedingly difficult to prepare by hand. In essence he is being provided with the facilities of a computer 'darkroom' with which he can create new images from old ones. The computer is involved in its appropriate domain of tedium, and the artist retains his dominance in creativity. Moreover, the output medium for his efforts is not limited to a paper alone, but may be extended to materials capable of being worked by numerically controlled tools - he thus may see his creations cut into plastic, woven into fabric, burned into wood or hammered into metal. The process thereby helps to extend the power of computer graphics into the field of graphics design and broadens its region of applicability in commercial art, printing, and textile design.","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":"129355505","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":"Network television scheduling simulator model","authors":"Ian Scheffler","doi":"10.1145/503643.503700","DOIUrl":"https://doi.org/10.1145/503643.503700","url":null,"abstract":"Every year in the early spring the 3 television networks announce their fall prime time schedules for the coming year. Pilot previews are shown to the major advertising agencies. The agents estimate the share of the viewing audience that each program will command. It is from these estimated \"shares\" that negotiations for the sale of advertising time are launched between the agents and the network representatives. The relative worth of a schedule depends upon its interaction with the schedules of the other two networks. Millions of dollars stand to be gained or lost depending upon the success or failure of the proposed schedule. Because the schedules are formulated independently, without knowledge of the other networks' future schedules, the network executives who devise the schedules must take thousands of interacting factors into account when they place even one program into a particular time slot. The human mind has so far been the only analytic tool employed to any extent. The mind is capable of some remarkable decisions as evidenced by the notable past success of certain individual network program planners. That this success is transitory is demonstrated by the constantly changing titles (and company affiliation) of the network executives. What is needed, for the sake of the network and for the sake of the network executives, is a computer program that can be used as a tool to consistently determine the most profitable schedule possible. I propose to build a model simulating the battle between the three networks over prime time network viewing audience. This model will arrange a given number of possible television shows into the schedule which maximizes profit for a given network.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"76 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":"116020674","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":"Generation of random numbers using shape preserving quadratic splines","authors":"D. McAllister, J. Roulier, M. Evans","doi":"10.1145/503643.503691","DOIUrl":"https://doi.org/10.1145/503643.503691","url":null,"abstract":"Let F be an arbitrary continuous cumulative distribution function of a single variable specified by a finite set of points. A (smooth) increasing quadratic spline is constructed which interpolates the data points and preserves the convexity of the data [2]. The spline is compared with Akima's piecewise cubic approximation [1] for several common distributions F.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"30 3 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":"127056282","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 flow architecture","authors":"Elizabeth Winey","doi":"10.1145/503643.503667","DOIUrl":"https://doi.org/10.1145/503643.503667","url":null,"abstract":"The data-flow form of program representation has developed from the search for a model of computation which can effectively express parallelism. Data-flow architecture is data driven which means that the sequencing of instruction execution depends totally on the availability of the operands required by that instruction. Unrelated instructions can be executed concurrently without interference. Data-flow processing has several advantages over the conventional processor design. The complexity of processor-memory connection can be i greatly reduced. In the yon Neumann machine, signal processing demands a complex system of semaphores. Since the objective of signal processing is to attain very high throughput and the amount of data to be dealt with is relatively small at any one instant, data-flow is a natural way to implement such processing because it allows asynchronous execution of instructions and greatly reduces the artificial complexity introduced when asynchronous instruction execution has 2 to be \"simulated\" on a synchronous machine. Data-flow is also applicable to higher level language problems. Where the von Neumann machine must view data as sequential, data-flow may exploit the parallelism inherent in such application problems as aircraft collision avoidance 3 • 4 or image processlng where large amounts of data need to be processed and there is a limited degree of coupling of data points. The most primitive data-flow machine is well suited to problems which require little or no seauenee control, such as decision making or looping. In such problems, throughput for one execution of a set or block of instructions would probably approximate that of the von Neumann machine, but throughput for multiple executions of the same block of instructions with different data elements would be greatly increased. The motivation for developing a data driven system is based on more that that of increase in processing speed. It will obviously be faster than some forms of processing, but not faster than all; that is, there are systems which are designed to handle particular problems 5 and these would perform the task for which they are designed faster and more efficiently. However, data-flow systems offer flexibility that these systems cannot. Modifications and extentions of application are easily handled in data-flow since the system is not dependent on the structure of the data or on the structure demanded by any one application. In order to express the data dependencies within a program, a method of graphic representation has been developed in which nodes are used to represent instructions while paths or arcs specify the flow of control and data. A data-flow language must reflect this network. The flow of the network must be reflected in the language. The flow of information from node to node along the arcs of the graph must be indicated by any data-flow language. The graph model discussed in this paper was developed by Dennis and Misunas at M. I.T. An acycl","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"14 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":"131254198","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":"SARA: an experiment in natural language processing with event-type knowledge representation","authors":"Mark Armstrong, C. A. Perkins, Glenn Smith","doi":"10.1145/503643.503675","DOIUrl":"https://doi.org/10.1145/503643.503675","url":null,"abstract":"Recent development in natural language processing have shown that the inclusion of world knowledge in a processing system will inhance the understanding capabilities of the computer. This paper describes a system, called SARA, that implements some of the recent techniques used to organize the computers view of the world. An ability to understand events is demonstrated by generating a paraphrase of a short input story. The systems limitations are discussed as a function of the unsolved problems in designing a universal scheme for an adaquate knowledge representation.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"148 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133322969","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 design of a BASIC language calculator computer","authors":"Hal Pitts","doi":"10.1145/503643.503705","DOIUrl":"https://doi.org/10.1145/503643.503705","url":null,"abstract":"This paper describes a calculator type computer on which algorithms can be programmed in a subset of Dartmouth BASIC. The computer hardware consists of a scientific calculator chip where all arithmetic and math functions are performed and a microprocessor which controls BASIC statement interpretation and input/output functions. Input to the computer is by means of a calculator type keyboard which contains letters, numbers, BASIC keywords, math functions, special symbols, and control keys. Output is through an alphanumeric LED array which is controlled by the microprocessor or manually, to pause after every line of output. An audio cassette tape mass storage device is provided for the storage of programs and data.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"34 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":"129669618","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}