ppxscal/embedding_network huggingface dataset:
Cadfiss test system computation and data flow integrated subsystem tests
Authors: W. I. Adams, P. R. Federico
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Project Mercury was the first space program to create a real time computer-centered, worldwide satellite tracking and communications network. This network is a complex of remote sites or stations having a direct, on-demand access to the Goddard Space Flight Center (GSFC) computers via various transmission linkages: teletype, submarine cable, land lines, etc. Distance between a given site and these computers ranges from less than one thousand miles on the one hand to worldwide proportions on the other. With such an extensive network, a quick and accurate method to determine network capability to provide mission support had to be developed. Such a method had to provide for the quick identification and isolation of any malfunction anywhere in the network. In addition, a -and-ldquo;test standard-and-rdquo; applicable to all sites was needed regardless of their individual equipment configuration. Thus, a status of -and-ldquo;Good-and-rdquo; at the Canary Islands had to be identical with a status of -and-ldquo;Good-and-rdquo; at Woomera, Australia. Another factor to be considered was the tendency of electronic equipment to drift off calibration after being peaked for support of a mission. This tendency required that the peaking and the means of status determination of the equipment for support of a mission had to be performed reasonably close to llftoff. To fulfill these requirements, CADFIST, a computer-controlled, automated, network test was designed. It is a real time tracking network status check which simultaneously tests the major subsystem at each of the world-wide sites for their ability and readiness to support manned missions. CADFIST is an abbreviation for Computation and Data Flow Integrated Subsystem Test. The system, made up of individual tests under control of a master program, is designed to provide a qualitative measure of how well certain logical subsets of the over all network are functioning. Without CADFISS testing, this network verification would have to be accomplished by a personor persons centrally located making visual and voice checks.
Distributed microprogram architecture
Authors: Gideon Frieder
Venue: Proceedings of the 1976 annual conference (1976)

The advent of dynamic microprogramming, and the extensive usage of interpretation which resulted from it, enables us to re-evaluate our motions of current systems in the sense that it is not necessary to assume fixed control functions and fixed instruction sets. This, coupled with the new technologies, will in my mind bring forth the following type of developments: 1. Distributed loci of control, each of a nature which will be dynamically adaptable to the task at hand, controlling a hierarchy of storages. 2. Multiple central processors, with dynamically selectable instruction sets, adopting to the task at hand. The instruction will be defined by microcode, although I do not foresee free user microcoding. Rather, I foresee a rich repertoire of sets of instructions, carefully prepared and evaluated by the vendor to fit the tasks for which the machine is marketed. 3. A dramatic change in operating system design, motivated by the need to support different virtual machines and simplified by the fact that new technologies, in my mind, will bring forth a phenomenon which I call &ldquo;zero time I/O&rdquo;. By this I mean to denote a situation in which the requested information item is almost always in memory, the word almost being interpreted in the same statistical sense that cache supported system has the data in the cache when it is requested. I belive that one can include in the instruction set special instructions which will enable proper hierarchical staging and pre-paging. These instructions will be produced by the compilers following a global flow analysis and will use a considerable amount of residual control and control storage locations to accumulate both static and dynamic data, to be used in pre-paging.
On applications of generalized splines and generalized inverses in regularization and projection methods
Authors: M. Z. Nashed
Venue: Proceedings of the ACM annual conference (1973)

A brief exposition on generalized splines is given. Generalized splines form a spectrum of functions S&agr; (that depend on a parameter 0<&agr;<@@@@) which minimize a penalty-type functional (depending on &agr;) associated with a variety of regularization and stabilization methods. Interpolating splines and least-squares splines are obtained as limiting cases of a generalized spline (as &agr;&rarr;0 and &agr;&rarr@@@@ respectively). Least-squares solutions (of minimal norm) of operator equations are considered in terms of generalized inverses of linear operators. Approximate minimization (of functionals that arise in these settings) using spline functions is indicated. Projection and least-squares methods (on subspaces of splines for example) are used to approximate least-squares solutions of minimal norm of linear operator equations.
Program testing techniques using simulated execution
Authors: Leon J. Osterweil, Lloyd D. Fosdick
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

Simulation is proving to be a valuable technique in testing computer programs. By simulating different aspects of a program's execution and structure it is possible to detect errors and sometimes demonstrate the absence of certain errors in the program. This presentation will explore three popular testing methodologies which employ simulation techniques. Each methodology is based upon a different type of simulation of the program. The differences in error detection capability resulting from these different choices of simulated execution will be examined. Finally a method for using the best characteristics of each technique in a general validation system will be presented.
Is natural language an unnatural query language?
Authors: Christine A. Montgomery
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The complex system of form/meaning correlations comprising a natural language presents a considerable challenge for automated interpretation. In order to deal with such complexity, attempts at automated interpretation of natural language queries have typically concentrated on limited subsets of natural language. However, such subsets are inevitably ill-defined in some way, adding another class of interpretive problems to the well-known ones of syntactic ambiguity and ungrammatical strings. While the other problems are practically resolvable in some sense, the ability of an automated system to resolve the many syntactic ambiguities of natural language is a function of the interpretive power of the linguistic model upon which the system is based. Although previous models have lacked the interpretive power to deal with natural language, a novel approach integrating the treatment of form and meaning may provide an effective basis for handling natural language as an instrument of communication in automated systems.
A computer model of rainfall runoff from a system of multiple watersheds
Authors: Ruh-Ming Li, Brent E. Spronk, Daryl B. Simons
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Due to increasing interest in water resource planning, many computer models have been developed to simulate rainfall-runoff relationships. A useful model for predicting this response from watershed and river systems should meet the following criteria: (1) Spatial resolution should be flexible. Management plans and activities are often limited to small watersheds, however, many watersheds are large and often encompass complete river basins or sub-basins. Consequently, the spatial resolution should accommodate both small watersheds and complete river systems. (2) Methodology should be widely applicable. Although model parameters may be area specific, the model should provide a general cause-effect relationship between management practice and watershed response. (3) Sensitivity to management activities should be included in model development. It must be possible to represent management activities and simulate the resulting system response. A computer model to simulate rainfall-runoff response from large watersheds was developed. In this model, a large watershed is divided into response units consisting of analytical infiltration and water routing routines. Each geometrical component of the large watershed is represented as an &ldquo;open book&rdquo; or Wooding plane watershed. Hydrographs simulated by each of these units is combined by a numerical kinematic wave channel routing program to form the total basin response. Channel routing combined with spatially locating each response unit and timing the entry of hydrographs from response units to the channel constitute the linkage program. Only the basic physical processes of interception, infiltration, and water routing involved in the rainfall-runoff relationship are considered.
Enhancing simulation analyses of health care delivery policies using SDLTM database capabilities
Authors: Charles R. Standridge, Susan R. Marshall
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper discusses the effect of the use of SDLTM database management capabilities on the modeling and analysis procedures employed in studying two health care delivery systems: the use of capitation reimbursement in the Iowa Medicaid drug program and the availability of primary care in Indiana. Emphasis is placed on the construction and organization of databases from data produced by running simulation models. This data can then be used to compute measures of performance independently of the running of models. Furthermore, the decomposition of a large, complex model into a set of smaller, less complex component models is discussed. In addition, the assessment of alternatives and the iterative definition and computation of performance measures are described.
The Dynamic Incremental Compiler of APL\3000
Authors: Ronald L. Johnston
Venue: ACM SIGAPL APL Quote Quad (1979)

Most APL implementations to date have been interpretive because of the dynamic nature of the language. APL\3000 employs a Dynamic Incremental Compiler to allow all the flexibility of change afforded by interpretation, but giving the added bonus of faster execution for programs run more than once. APL\3000 compiles code on a statement-by-statement basis as needed, saving the code and reusing it where possible. A statement is recompiled only when made necessary by changes in syntax or changes in variable bindings. The compiler produces optimized code by employing the Abrams techniques of Drag-along and Beating.
Optimal parallel algorithms for string matching
Authors: Zvi Galil*
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are allowed simultaneous reads and writes [only simultaneous reads]. The only type of simultaneous writes allowed is a simultaneous AND: several processors may write O simultaneously into the same memory cell. Let t be the time bound of the computer. We design below families of parallel algorithms that solve the string matching problem with inputs of size n (n is the sum of lengths of the pattern and the text) and have the following performance in terms of p, t and n: 1. For WRAM: pt &equil; O(n) for for p &le; n/log n. 2. For PRAM: pt &equil; O(n) for P &le; n/log2n. 3. For WRAM: t &equil; constant for p &equil; nl+&egr; and any &egr; > O. 4. For WRAM: t &equil; O(log n/log log n) for p &equil; n. Similar families are also obtained for the problem of finding all initial palindromes of a given string.
Functional level simulation at Raytheon
Authors: Dan Nash, Keith Russell, Paul Silverman, Mary Thiel
Venue: Proceedings of the 17th Design Automation Conference (1980)

Raytheon has enhanced its gate level simulation system (GRASS) to include a functional level simulation capability. This paper describes the features of the Functional Description Language (FDL), implementation features, recent results, and future plans for the system.
Symbolic mathematical computation in a Ph.D. computer science program
Authors: B. F. Caviness, G. E. Collins
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

This paper describes a graduate course curriculum, currently being taught, in the area of symbolic mathematical computation. The subject area is described and is then followed by a description of the courses. A bibliography for each course is also given. The relationship of the symbolic mathematical computation curriculum to an overall Computer Science curriculum is discussed. Ph.D. theses which have been written are listed and some topics for future research are outlined. The paper ends with a summary of the strengths and weakensses of the curriculum.
Hardware configuration selection through discretizing a continuous variable solution
Authors: Robert A. Wagner, Kishor S. Trivedi
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

This paper extends a previous model for computer system configuration planning developed by the authors. The problem is to optimally select the CPU speed, the device capacities, and file assignments so as to maximize throughput subject to a fixed cost constraint. We advocate solving this essentially discrete problem in continuous variables followed by an appropriate discretization. The discretization error thus committed is analyzed in detail.
Inferring cognitive focus from students' programs
Authors: Jean B. Rogers
Venue: ACM SIGCSE Bulletin (1984)

Programs written by students in an introductory Computer Science course were analyzed and patterns abstracted from them. These patterns include style of modularization, choice of constructs, choice of vocabulary, and style of communication through user-interaction and documentation. Individual characteristics of the students, such as their focus on detail or on aggregate conceptual units, their manner of organizing knowledge, and their perception of the purpose of computer programs was compared with the patterns in the students' programs, with tentative relationships being identified.
Rounding error in evaluating continued fraction expansions
Authors: William B. Jones, W. J. Thron
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

It is well known that continued fraction expansions provide a useful means for representing and computing values of functions. Expansions for many functions of mathematical analysis and physics are contained in the literature [1, 7, 9, 10]. Other expansions can be developed from a Taylor series (convergent or asymptotic) by efficient non-linear sequence algorithms [4, 5]. In addition to questions of convergence and speed of convergence of an infinite continued fraction
Effective machine descriptors for Ada
Authors: Judy M. Bishop
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

With the impetus provided by the U.S. Department of Defense's support for Ada, serious attention must once again be given to the design of computer architecture for the efficient execution of structured high level languages. Descriptors are one of the more theoretically popular features in a structured machine, yet in practice they do not come up to expectations. This paper examines the deficiencies of current descriptor implementations, and goes on to propose a new approach to descriptors. The design takes into account the relative usage of scalar and structured data in structured programs, and pays due attention to the efficient representation of descriptors as well as to packing, the question of uninitialised values and the contribution which the compiler makes to range and index checking.
A distributed file system
Authors: C. V. Ravi
Venue: Proceedings of the 1975 annual conference (1975)

The design of a file system for a multiprocessor interactive computer system is described. The architecture of the computer system is such that direct access to a resource allocated to a process is not allowed to any other process. Thus, sharing of files can only be done by transmission of copies. The file system is functionally distributed so that different functions run on different processors and some functions are implemented in firmware. Also, there are no global file directories. The construction of a one process file system that is extensible and very modular is detailed, and facilities for file sharing among processes are then presented.
Polymorphic grouping for image segmentation
Authors: C. Fuchs, W. Forstner
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

The paper describes a new approach to image segmentation. It accepts the inherent deficiencies occuring when extracting low-level features and when dealing with the complexity of real scenes. Image segmentation therefore is understood as deriving a rich symbolic description useful for tasks such as stereo or object recognition in outdoor scenes. The approach is based on a polymorphic scheme for simultaneously extracting points, lines and segments in a topologically consistent manner, together with their mutual relations derived from the feature adjacency graph (FAG) thereby performing several grouping steps which gradually use more and more specific domain knowledge to achieve an optimal image description. The heart of the approach is (1) a detailed analysis of the FAG and (2) a robust estimation for validating the found geometric hypotheses. The analysis of the FAG, derived from the exoskeleton of the features, allows to detect inconsistencies of the extracted features with the ideal image model, a cell-complex. The FAG is used for finding hypotheses about incidence relations and geometric hypotheses, such as collinearity or parallelity, also between non-neighbored points and lines. The M-type robust estimation is used for simultaneously eliminating wrong hypotheses on geometric relationships. It uses a new argument for the weighting function.
Correctness in access control
Authors: Gerald J. Popek
Venue: Proceedings of the ACM annual conference (1973)

A number of approaches have been developed to modularize parts of multiuser computer systems so that access to each part can be controlled. The devices of rings and capabilities are two examples. However, today's systems are notably incomplete and subject to defeat by determined and clever users. A point of view is presented here which allows proving that a logical design of an access control system is correct relative to a designer-specified set of criteria. Implementation questions are also discussed.
The impact of certain parameter estimation errors in queueing network models
Authors: Karen D. Gordon, Lawrence W. Dowdy
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

The effect that parameter estimation errors have on performance in closed product form queueing networks is investigated. In particular, the effects of errors in the relative utilization estimates of the servers are analyzed. It is shown that in single class load independent networks, the resulting errors in throughput and utilizations are of approximately the same percentage as the errors in the relative utilization estimates. This result does not hold in networks with load dependent servers or multiple customer classes. The percentage errors in mean queue length depend upon the degree of multiprogramming in the network. Errors in mean queue lengths can become unbounded as the degree of multiprogramming becomes unbounded. Implications of these results to computer system modeling are discussed.
Optimization of large sequential data files
Authors: Burton E. Squires
Venue: Proceedings of the 1977 annual conference (1977)

The need for inexpensive data storage continues to grow and tape reels are usually used. For large data aggregations with even a few retrieval applications, it may not be as economical to store full reels as to split the data into smaller sized files. It is assumed that the data aggregation consists of a set of items, stored sequentially as several files on similar physical media. Query requests are made randomly, so that each item is equally likely to be requested. A solution is developed for the average access time into sequential files whose access function is directly related to the position of the query elements in the file. An application is described and illustrated. This shows the relationship between the size of the files, the number of items in a batched retrieval operation, and the cost factors.
Update: Cooperation amoung computer organization (Panel Discussion)
Authors: David Kniefel, Karen Duncan, Don Holznagel, Elizabeth Little
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The number of Professional Organizations concerned with various aspects of computing in education seems to be growing as fast as the number of hardware and software vendors. This session will focus on several computer professional organizations, their goals and objectives, as well as possible avenues of cooperation among these groups. A report on the National Educational Computer Consortium being formed will also be given. Professional Organizations that will be represented by panel members include; SIGCUE, SIGUCC, AEDS, ADCIS, CONDUIT, HEN, and EDUCOM.
The use of Entity Diagrams in data base systems implementation
Authors: David Vincent
Venue: Proceedings of the 1977 annual conference (1977)

This position paper proposes the use of &ldquo;Entity Diagrams&rdquo; as a pivotal mechanism for abstracting the use of data by an organization and then selectively implementing data base systems developed using the abstraction as a normative force. The entity diagram is not dependent on either a particular DBMS or on organization subunits, thus making it particularly useful for raising the level of computer system design in a changing environment.
Exact nonparametrics in APL
Authors: Bernd Streitberg, Joachim Röhmel
Venue: Proceedings of the international conference on APL (1984)

The authors present a new algorithm for the exact distribution of many nonparametric tests. The algorithm is based on a recursion formula that relates the distribution of where K1,...,Kn are iid Bernoulli [1/2] and a1,...,an are fixed p-vectors, to the distribution of Tn-1. The core idea is to realize this recursion by shifts of the p - dimensional distribution of Tn-1 in the computer main storage, which can be implemented efficiently in APL. We believe, that the method has achieved a breakthrough in the practical application of Fisher-Pitman permutation tests, but it can also be used routinely in the computation of many other tests by applying an initial transformation to the original data. A noteworthy example is the Wilcoxon test with arbitrary ties in the data, whose exact distribution can easily be computed for Nample;100. In order to allow the direct use of these results, a complete list of the necessary APL programmes is included in the text.