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

{"title":"System performance effected by additional memory","authors":"P. K. Chiu, Steven Lau","doi":"10.1145/503643.503672","DOIUrl":"https://doi.org/10.1145/503643.503672","url":null,"abstract":"The University of Mississippi instal~ ed a DEC-1077. This system contains dual central processing units (CPU), version KI-10, with 192K words of core memory in 1973. At installation time, we had two (2) RJE stations and 40 TTY's; the workload was about 60% saturation. Our computer users seemed to be happy. With increa~ ing enrollment on the campus, workload also raised 15-20% yearly. Two RJE and 40 TTY's were added to this system. Consequently, we reached our saturation for CPU cycles. We are looking for some hardware or software to improve our throughput and response time.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"39 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":"134282474","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 simple multi-tasking operating system for a microcomputer","authors":"Alan B. Mimms","doi":"10.1145/503643.503644","DOIUrl":"https://doi.org/10.1145/503643.503644","url":null,"abstract":"R~cent microprocessor and microcomputer cost decreases have led to a greater system complexity in small system hardware, which has led in turn to a rise in the complexity of the software for such systems. The change is being felt not only in system software (such as compilers and assemblers) but also in user-generated applications software (such as, inevitably, games). In answer to the demand for a more complex system executive and monitor, this system, fondly dubbed \"OZ\" <for Operating system for Z80), ms being developed.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"57 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":"134318104","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":"Restructuring of APL functions","authors":"A. Arroyo","doi":"10.1145/503643.503660","DOIUrl":"https://doi.org/10.1145/503643.503660","url":null,"abstract":"The philosophy and style that has come to be known as \"structured programmlng\" emphasizes great concern with the manner in which a program is organized [1]. It implies that some program constructions are more effective than others, even though both might yield identical results. In many software applications, human efficiency (which might be related to such things as the ability to read, alter and understand programs) is more important than computer efficiency (which includes less memory space and/or execution time).In APL, branching is generally used within a defined function to direct the execution of commands. It is denoted by the symbol → followed by an expression E: →E. Since the value of E, the expression to the right of the branch arrow, may be scalar or vector, the form the branch command takes is a function of the ability of the programmer. A suitable standard form for the branch command is desirable and feasible.For the purposes of this discussion, the \"branch to specified line number or execute next line\": form of the branch command is selected as the standard form. It is entirely feasible to perform branch standardization automatically and still preserve the meaning of the original function. This paper describes such an approach.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"2016 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":"134446698","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":"Linear approximation by interpretive testing","authors":"Barry Barlow","doi":"10.1145/503643.503676","DOIUrl":"https://doi.org/10.1145/503643.503676","url":null,"abstract":"This paper deals with a model designed to fit a curve to data subject to error. In approximating functions, the criterion of goodness of fit is to some degree arbitrary as there are several criterion which may be used. By letting f(~) denote the true functional value at xL, y(~) denote the approximating functional value at x6, and d~ denote (f(x~)-y(~)) in all cases, it is possible to list a few of these criterion as follows: a)Criterion i suggests making~.od ~ a minimum, where n is i less than the number of data points given. This is attractive because of its s~mplicity but is of little use in that it leads to ambiguous results. b)Criterion 2 suggests making~[d~ a minimum. This has some usage but can~ -allow one erroneous value to overly influence the evaluation of the summation value. c)The Mini-Max or Cnebychev criterion suggests that a boundary (d) be placed on the error (~) and one should strive to keep the error within the upper and lower limits of the boundaries. The approach used by this model is known as the Least-Squares criterion. The concept of linear approximation in the Least-Squares approach states that the best approximation in this sense is one where the A~'s are determined such that the sum of the squared difference of the true and approximating functions is made a minimum, where A~ are the coefficients of the approximating function It can also be stated~[f(x~-y(~)]~a minimum. As the title o~'this~=°'--paper implies, this model only deals with approximations of linear curves by Least Squares, ie. functions of the form: f(x)~A,@~(x) where n is the degree of the polynomial, AK is the coeffieient of the term K, and ~(x) is the argument of A~. For example, in the function y(x)=Ao+A,x+ A~x z , the following holds true: ¢o(X):],~,(x)=x, $ ¢~(x):x ~. The A~'s will be approximated by deriving a set of simultaneous equations using the following formula and then solving the.matrix: The equations given by this method are termed the Least-Squares equations. The ~} or aggregate notation is used for both discrete and continuous models. Depending upon the approximating function, one would substitute the i for a model having discrete data, and ~ for a model having continuous data. Deriving the LeastSquares normal equations for f(x)=Ao+Aox gives the following:","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"43 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":"134310045","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 prototype for an advanced command language","authors":"T. A. Akin, Georgia Tech, P. B. Flinn, Danielle Forsyth","doi":"10.1145/503643.503666","DOIUrl":"https://doi.org/10.1145/503643.503666","url":null,"abstract":"The traditional view of command languages seems to be that, although they are the user's principal interface to an interactive computing environment, they serve merely as a medium for the invocation of other programs and, as such, do not deserve the same level of attention given to programming languages. It seems an axiom that command languages are destined to be opaque, irregular and awkward to use. It is our feeling, however, that because of their central involvement in the use of a computer system, command languages should be powerful, concise and regular; in short, aids to the user in his interaction with the system rather than obstacles to be overcome.In this paper we discuss a prototype for an advanced command language designed to facilitate the use of the computer as a tool by incorporating features that we have found useful in day-to-day experience: uniform invocation of system commands, user programs and command files; easy interconnection of programs, encouraging reusable, functional modules; variables and control structures; and dynamic command line facilities.Many of the concepts found herein are adapted from existing systems, notably the Multics [1] and UNIX [2] operating systems, while the underlying philosophy of computers and programs as tools is inspired by the book Software Tools, by Brian W. Kernighan and P. J. Plauger [3].","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":"115723070","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 mini-computer based interactive signal analysis system","authors":"August J. Ryberg","doi":"10.1145/503643.503701","DOIUrl":"https://doi.org/10.1145/503643.503701","url":null,"abstract":"The software structure of an Interactive Signal Analysis System (ISAS) is described in the following sections. The ISAS is embedded in a mini-computer based real-time machinery monitoring network and operates asynchronously with the software performing the monitoring functions. A brief description of the hardware configuration and operational modes for both the monitoring network and the ISAS is presented in the following section. Section III contains an overview of the ISAS requirements and a discussion of the design methodology and choice of programming language. The ISAS software is described in terms of its architecture and file structure, its operating system and network interfaces and the operator-ISAS interaction. In addition, core sizing, timing considerations and error handling are summarized. A discussion regarding the adaptation of ISAS to a stand-alone system is presented in the final section.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"45 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":"114544242","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 micro-debugger for Eclipse computers","authors":"Daniel Martin","doi":"10.1145/503643.503645","DOIUrl":"https://doi.org/10.1145/503643.503645","url":null,"abstract":"A micro-debugger for a Data General Eclipse S/200 computer is described. The Eclipse computer is a microprogrammable device with 56 bits/control word. No software for the WCS option is provided by the manufacturer. Since many microprograms contain errors which announce themselves only by causing the system to crash, and since the microprogrammer can access registers which are invisible to AL programmers, it is difficult to locate errors in microprograms. The micro-debugger is a set of ALGOL, Assembly Language and microcode routines which can ease the task of testing microprograms. It is a major modification of the MSU microassembler which allows setting of micro-breakpoints, display of all registers which are available to the microprogrammer, and interactive modification of these registers and core memory locations. It can be used with the standard symbolic debugger supplied by Data General to provide a powerful tool for checking and testing microprograms.","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":"116549562","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 computer code for fitting exponential decay curves with \"small\" relative error","authors":"J. Pleasant","doi":"10.1145/503643.503688","DOIUrl":"https://doi.org/10.1145/503643.503688","url":null,"abstract":"A p r a c t l c a l p rocedure f o r d e t e r m i n i n g v a l u e s f o r t l , . . . , t n . 1 i n the p l e c e w l s e e x p o n e n t l a l app rox ima t ion (2) i s to draw a graph o f y = F ( t ) on s e m i l o g a r i t h m i c graph paper . S ince the graph s t of an exponentlal functlon y ce on such a scale is s s t ra ight l ine , the problem of f i t t i n g a p l e c e w l s e e x p o n e n t i a l f u n c t i o n to y = F(t) i s e s s e n t l s l l y the same v i s u a l l y as t h a t o f f i t t i n g a p l e c e w i s e l l n e a r f u n c t i o n on a l l n e s ~ s c a l e . We choose p o i n t s Po(O, F(o)) , P l ( t l , F ( t l ) ) . . . . , Pn(tn, F(tn)) on t h e curve y = F ( t ) so t h a t the segments","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"13 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":"121288619","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":"Romanization of Hebrew to English","authors":"M. L. Davis","doi":"10.1145/503643.503710","DOIUrl":"https://doi.org/10.1145/503643.503710","url":null,"abstract":"A master's thesis is presently underway to automate the romanization of pointed Hebrew to English. This task is basically broken down into two major computer programs. The first computer program deals with the input of pointed Hebrew from a user. The second program deals with the actual romanization of Hebrew to English. It should be noted that at this time only the first program is nearing completion. The second program is still in the initial planning stages.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"24 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":"124519453","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":"Towards the physical representation of a data base compatible with multiple user views","authors":"Michael H. Geldner","doi":"10.1145/503643.503712","DOIUrl":"https://doi.org/10.1145/503643.503712","url":null,"abstract":"A DBMS user view consists of a Data Definition Language (DDL) which defines the data model and a Data Manipulation Language (DML) which defines the access scheme for that data model. To permit different user views to share a common data base, it is necessary to establish a single physical representation for the data base. The physical representation must be compatible with the data model of each logical view involved. This can be accomplished by mapping the DDL commands of each logical view into a set of Model Definition Primitive (MDP) commands which describe the physical representation of that logical view. The MDP descriptions of each physical representation can then be merged into one MDP description. The existence of Model Definition primitives has already been established (Dl); therefore, the purpose of this paper is twofold:1. Describe a DDL compiler for each view whose MDP output can be easily merged.2. Define the rules under which a merging program operates.In this paper we do not discuss the effects of the above merging concept on implementation of any DML.","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"21 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":"116221127","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}