ppxscal/embedding_network huggingface dataset:
APL as a tool for multivariate statistics
Authors: Norman Thomson
Venue: ACM SIGAPL APL Quote Quad (1983)

This paper describes ways in which the combination of APL and graphics terminals can provide powerful means both of understanding and executing data analyses, and thereby lead to rapid discovery of structures and interconnections in multivariate data which numerical tabulation alone does not always reveal. The aims are to exploit the exceptional expository powers of APL (including APL2) to describe and differentiate between techniques currently used in multivariate analysis, and also to demonstrate how functions developed for exposition can be immediately applied in exploratory data analysis.
Asympototes of a differential equation of ion recombination
Authors: William M. Wagner, H. Richard wood
Venue: Proceedings of the ACM annual conference (1973)

The following system is a model of the recombination into netural molecules of ions of two different moleules. All parameters positive. y1 &equil; -(my2+Cy4)y1 Positive Methane y3 &equil; -(cy2 + wy4)y3 Positive Water y2 + (&Wmacr;+my1+cy3)y2 + &Mmarc;y4 Negative Methane y4 &equil; -(&Mmarc; + Cy1 + wy3)y4 + &Wmarc;y2 Negative Water y1 + y3 &equil; y2 + y4 (Conservation of charge) The asymptotic behavior of this system is seen by decomposing the solution uniquely into its projections into the (y1, y3) and (Y2' Y4) planes. In the (Y2, Y4 ) plane, a rotation through the angle &fgr; &equil; Tan-1 (&Wmacr;/&Mmacr;) defines a new set of axis, (u, v). The projections of the points (m, C) and (c, w) onto the u-axis define scalars UM and UW; U is defined to be min(UM, UW). In the case UM #UW' the asymptotes of y2 and y4 are cos&fgr;/(Ut) and sin&fgr;/(Ut). The quantity (M + W)/(AUt) is the asymptote of y1 if UM < UW and that of y3 if UM > UW; the asympote of the other is J/tz where z &equil; max (UM, UW)/U and where J depends upon the intial conditions. The subcase UM &equil; UW and stability have been examined.
A bound on the multiplication efficiency of iteration
Authors: H. T. Kung
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

For a convergent sequence {xi} generated by xi+1 &equil; @@@@(xi,x1,...,xi&minus;d+1), define the multiplication efficiency measure E to be p&frac1M;, where p is the order of convergence, and M is the number of multiplications or divisions (except by 2) needed to compute @@@@. Then, if @@@@ is any multivariate rational function, E &le; 2. Since E &equil; 2 for the sequence {xi} generated by xi+1 &equil; &frac12;(xi +&fracax; i)with the limit @@@@a, the bound on E is sharp.
An interactive simulation facility for the evaluation of shared-resource architectures (Parallel ARchitecture SIMulator - PARSIM)
Authors: John A. Board,  Jr., Peter N. Marinos
Venue: Proceedings of the 20th Design Automation Conference (1983)

A general-purpose, interactive simulation facility for modeling computational systems is described. The simulation facility is especially suited for evaluating the performance of parallel computational structures on workloads exhibiting arbitrary degrees of parallelism. Two different simulators are provided, one that operates at the processor level only, ignoring explicit system connectivity; and one that allows a detailed specification of system architecture and connectivity. Supplementing the simulators are: (a) a workload generator for synthesizing workloads exhibiting any desired degree of parallelism, and (b) a resource specification system that allows easy description of the capabilities and parameters of various resources in a system. Several graphical utility programs are provided to aid in interpretation of simulation results. The system has been implemented in the programming language 'C' on a Data General MV/8000 computer operating under the Data General Advanced Operating System; the system should port easily to other virtual architecture machines with a 'C' compiler.
Computer Aided Design in D. P. W.
Authors: J. Kirk Robertson
Venue: Proceedings of the 12th Design Automation Conference (1975)

The Department of Public Works in the Canadian Federal Government has initiated a 5 year Computer Aided Design Development program to co-ordinate computer oriented design programs and packages now existing within the Department; in particular the program is developing and will implement suitable systems for man/machine interaction, and information storage and control within the design process. These systems will direct themselves to both graphic and alphanumeric communication for both our in-house design teams and our consultants who in practice do the far larger part of the Department's design work.
A document retrieval system for man-machine interaction
Authors: G. Salton
Venue: Proceedings of the 1964 19th ACM national conference (1964)

An automatic document retrieval system, programmed for the IBM 7094, is described. The system is designed to process English texts and search requests, and uses statistical, syntactic and semantic procedures for the analysis of information and the identification of relevant items. The operations are planned around a central supervisor, which in turn calls on the various subroutines, as desired. This organization makes it possible to alter both the processing sequences and the matching criteria between stored information and search requests, thus producing a variable amount of information in response to a given search request. The system therefore lends itself to interaction with the user by enabling the latter continuously to change his search requirements. Furthermore, the various analytical procedures may be evaluated by comparing the retrieval results obtained under different processing conditions.
Focus of the ICCP
Authors: Roland D. Spaniol
Venue: Proceedings of the ACM '82 conference (1982)

The ICCP is sharpening its focus on the goal of professionalism through certification. In May, the Directors set several activities in motion that are based upon agreement of principle. Each activity encourages the cooperation of all the professional associations and moves the information systems industry toward professionalism. Current board members will be joined by members elected by and from current certificate holders. This action is based on the principle that there is now an adequate number of certificate holders to accept the responsibility to at least share in their professional certification program.
On computing the minima of quadratic forms (Preliminary Report)
Authors: Andrew Chi-Chih Yao
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The following problem was recently raised by C. William Gear [1]: Let F(x1,x2,...,xn) &equil; &Sgr;i&le;j a'ijxixj + &Sgr;i bixi +c be a quadratic form in n variables. We wish to compute the point x&rarr;(0) &equil; (x1(0),...,xn(0)), at which F achieves its minimum, by a series of adaptive functional evaluations. It is clear that, by evaluating F(x&rarr;) at 1/2(n+1)(n+2)+1 points, we can determine the coefficients a'ij,bi,c and thereby find the point x&rarr;(0). Gear's question is, &ldquo;How many evaluations are necessary?&rdquo; In this paper, we shall prove that O(n2) evaluations are necessary in the worst case for any such algorithm.
A multi-user data flow architecture
Authors: F. J. Burkowski
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper discusses the design of a prototype data flow machine that has memory management hardware in each memory block. This facility allows loading and deleting code that is produced by independent compilations. The first sections of the paper deal with the general architecture of the machine and the format specifications for the instruction cells, logical addresses, and switch packets. The paper concludes with a discussion of the mapping hardware used in the memory blocks. The results of a simulation study for this subsystem are also presented.
A correlated distribution simulation model for capital budgeting
Authors: Charles L. Crabtree, Lyman C. Dennis,  II
Venue: Proceedings of the third conference on Applications of simulation (1969)

A simulation model for the analysis of capital projects is presented. A mechanism included in the model for approximating dependencies between variables is described and the effects of the mechanism's operation are analyzed and documented.
Variance reduction: Basic transformations
Authors: Barry L. Nelson, Bruce W. Schmeiser
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A stochastic computer simulation model is a description of a system of interrelated random variables. Realizations of the system can be used to estimate parameters of interest. Variance reduction techniques (VRTs) transform simulation models into similar models that permit more precise estimation of the parameters. The basic types of transformations are defined and a simple example is given.
Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra
Authors: Steve Winker, L. Wos
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The thrust of this paper is: first, to answer certain previously unanswered questions in the field of Ternary Boolean algebra; second, to describe the method, utilizing an automated theorem-proving program as an invaluable aid, by which these answers were obtained; and third, to informally give the characteristics of those problems to which the method can be successfully applied. The approach under study begins with known facts in the form of axioms and lemmas of the field being investigated, finds by means of certain specified inference rules new facts, and continues to reason from the expanding set of facts until the problem at hand is solved or the procedure is interrupted. The solution often takes the form of a finite model or of a counterexample to the underlying conjecture. The model and/or counterexample is generated with the aid of an already existing automated theorem-proving procedure and without any recourse to any additional programming.
Interpretive execution of real-time control applications
Authors: Mary S. Adix, Henrik A. Schutz
Venue: ACM SIGPLAN Notices (1976)

Interpretive execution has often been regarded as too slow for real-time control applications. Assembly language implementations, however, may exhaust available memory long before running out of machine cycles. For such applications, interpretation of a virtual machine language (VML) is attractive if it yields substantial memory savings at a tolerable cost in execution time. This paper discusses the design of a VML and interpreter which have been used to implement a real-time control application. Performance is evaluated relative to an assembly language version of the same problem. The assembly language version executed 4.8 times faster than the interpretive version, but required 31% more memory. Space compaction is achieved by making basic operations in the application area primatives of the VML. The interpreter simulates a computer whose machine language is the VML. In addition to conserving memory, this approach can facilitate the implementation of a high-level programming language on a variety of minicomputers.
Ada_education: =Design_concepts "+" Ada_constructs
Authors: Putnam P. Texel
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

It is the purpose of this article to bring to light a vital issue that needs more attention and that will have major impact on the future of this new language - Ada education - and to propose a specific approach intended to maximize the probability of obtaining Ada programmers (and minimize the probability of obtaining programmers who code in Ada).
CP/M graph-plus: CP/M with graphic resources
Authors: Carlos Eduardo Mendes de Azevedo, Luiz Antonio Belletti Rodrigues
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

Everytime we want to use graphic resources in our microcomputers under the CP/M operating system, we always have a serious trouble: CP/M doesn't support any graphic routines inside it. Usually, two options are available to solve this problem.
Selection procedures based on proportion parameters
Authors: Paul D. Amer
Venue: Proceedings of the 12th conference on Winter simulation (1980)

The data analysis component of a simulation study comparing a set of alternatives should include a confidence statement regarding the accuracy of the selection results. The usefulness of statistical ranking and selection procedures in providing such confidence statements in simulation experiments has become increasingly clear. Five general selection goals are described. Procedures are given when the alternatives are compared on the basis of proportion parameters. Statistical derivations and tables underlying these procedures are not included, but instead are appropriately referenced.
A positive approach to personnel relations
Authors: L. Allan Wright
Venue: Proceedings of the tenth annual SIGCPR conference (1972)

A personal position paper is not research - with a bow to my colleagues on the program who are researchers - but is rather a contribution based on experience (good and bad), study, and hopefully thoughtful contemplation. Personnel relations is a general term used here as synonymous with Personnel, Employee Relations, Manpower, Human Resources, and the host of other expressions in the field. If anything is excluded, it probably is the term Industrial or Labor Relations which seems to be used in the industry more frequently when all or part of the work force is unionized.
File format for data exchange between graphic data bases
Authors: Arthur G. Gross
Venue: Proceedings of the 15th Design Automation Conference (1978)

A number of interactive graphics systems have been developed for cartographic applications. These systems have different capabilities and features, and little or no general provision has been made for transferring data base content between different systems or installations. A data base interchange file format has been designed for the Computer Assisted Mapping and Records Activities System, CAMRAS, sponsored by the American Public Works Association. The Association is evaluating the format for promulgation as a standard. A description of the interchange file format is given.
The method of surrogate delays: Simultaneous resource possession in analytic models of computer systems
Authors: Patricia A. Jacobson, Edward D. Lazowska
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

This paper presents a new approach to modelling the simultaneous or overlapped possession of resources in queueing networks. The key concept is that of iteration between two models, each of which includes an explicit representation of one of the simultaneously held resources and a delay server (an infinite server, with service time but no queueing) acting as a surrogate for queueing delay due to congestion at the other simultaneously held resource. Because of this, we refer to our approximation technique as the &ldquo;method of surrogate delays&rdquo;.
The role of certification in fostering professional development in the field of computing
Authors: J. R. Sopka
Venue: Proceedings of the ACM '81 conference (1981)

The Institute for the Certification of Computer Professionals (ICCP) currently offers programs for two certificates, the Certificate in Data Processing (CDP) and the Certificate in Computer Programming (CCP). Other programs are under development by the Institute. All these programs are designed to foster development of a computing profession within which high standards of knowledge, performance and conduct are maintained. Testing and certification provide an effective means of recognizing those individuals who have attained a level of excellence in their knowledge and experience in a field. Achievement of a current certificate provides these individuals with an incentive for the continuing education and professional growth necessary in an area experiencing the rapid development of the field of computing. Preparation for certification may be more flexibly organized than the preparation required for traditional academic degrees. These factors combine to make the programs of the ICCP a potentially important influence in the continuing professional education of many working in the applied areas of the field of computing.
Algorithm implementation on specific microprogrammed structure
Authors: D. Dromard, F. Dromard
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

We currently see many works which have been done in the microprogramming field, to facilitate and to improve algorithm implementations on existing microprogrammable structures. Very few of them were executed with a top down approach, though it seems to be an attractive possibility to implement algorithms on dedicated structures. In addition, the top down approach becomes now realistic with the advent of very large scale integration, and offers fruitful perspectives. In our paper, we describe a method using automata representations, permitting an efficient algorithm implementation on specific microprogrammed structures. An example is described to illustrate the method possibilities altogether.
A new method for improving communications between user groups and systems specialists and its impact on systems development efforts
Authors: Shirley E. Coverdale
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

The user/analyst (u/a) interface is a critical variable in determining the successful development of computer based information systems (CBIS) efforts. A historical communications gap at the u/a interface continues to impact most CBIS definition efforts despite attempts to solve the problem. Solutions to date have emphasized either organizational or technical dimensions of the problem. Solutions which would enhance the effectiveness of this interaction must adequately consider the analytical and linguistic dimensions of the problem as well as its organizational and technical aspects. This paper examines the nature of u/a interaction, evaluates conventional solutions in light of the initial discussion, and offers for the reader's consideration, an alternative method for establishing an effective u/a interface.
Finding small simple cycle separators for 2-connected planar graphs.
Authors: Gary L. Miller
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 4@@@@n which separates the interior vertices A from the exterior vertices B such that neither A nor B contains more than 2/3n vertices. The method also gives a linear time algorithm for finding the simple cycle. In general, if the maximum face size is d then we exhibit a cycle C as above of size at most 2@@@@2d&bull;n.
User documentation: Types and preparation methods
Authors: Jack Thompson, Susan G. Howell
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

If user documentation is defined as &ldquo;the means by which information about a computer system is conveyed&rdquo; then individual personal contact with users is undoubtedly the most effective documentation procedure. Unfortunately, it is not the cheapest, the most efficient, nor the most reliable method of communicating information. Written documentation is generally less expensive and more efficient and reliable. As a result, written documentation is the primary method of communication with users at most university computer centers. However, to be effective, written documentation must be based on ideas acquired through personal contact. The types of documents produced and the methods used in their preparation should be determined by the needs of the user community.
Multiprocessor Architectures For Concurrent Programs
Authors: Per Brinch Hansen
Venue: Proceedings of the 1978 annual conference (1978)

This paper proposes a hierarchical multiprocessor architecture for real-time programs written in a concurrent programming language. The use of processes and monitors leads to a multiprocessor system in which each processor has a local store dedicated to a single process. The processors share a common store that contains the monitors. To avoid congestion in the common store the processes and monitors are partitioned into subsystems that share a hierarchy of common stores. The main goal is to develop a synthesis of an abstract language and a computer architecture that match in an obvious way.
Program function test definition using a three-value simulator
Authors: W. Jean Sherman
Venue: Proceedings of the 12th Design Automation Conference (1975)

A method of defining software functional tests is presented. This method uses program documentation, logic networks and a three-value simulator. The program function is extracted from the external specifications which are provided by the development programmer. Observable user and program actions are noted in the documentation and translated to a logic network. The network information and preliminary user actions are input to a three-value simulator. The simulator output is then translated into test cases and examined for completeness. This method of test defining provides &ldquo;document testing&rdquo; as well as function testing of the program. Problems associated with the method are discussed as well as recommendations for enhancements.
Main memory for user microprogram residence - an analysis
Authors: Richard T. Thomas
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

Microprogrammed computer organizations are divided into three categories to analyze methods of allowing dynamic user microprogramming. Main memory is considered for user microprogram residence in a multiprogramming environment, and conclusions are drawn regarding such a scheme.
Digital simulation for control system design
Authors: R. D. Brennan
Venue: Proceedings of the SHARE design automation project (1966)

Simulation of dynamic systems by use of analog computers is well established as a practical tool of the control engineer. With the advent of fast digital computers, it has become not only feasible but attractive to perform many such investigations using digital simulation. As an example, a study of a simple control system is presented to illustrate the ease and flexibility of this technique in design. Digital simulation permits the engineer who has no specialized training in computer programming or operation to readily utilize simulation in both the design and analysis aspects of his work. It has proven a fast, effective, and economical tool for general investigations of continuous, dynamic systems and is of particular interest to the practicing control engineer.
Crossfertilization Of DBMS Research With Other Disciplines Of Computer Science (Panel Discussion)
Authors: Bharat Bhargava, Stephen R. Kimbleton, Barbara H. Liskov, Jack Minker, J. D. Ullman
Venue: Proceedings of the 1978 annual conference (1978)

The DBMS research is moving towards formalization of its problems and solutions. The DBMS researcher can learn and use the techniques that have been developed in formalizing the concepts in Operating systems, Artificial Intelligence, Adaptive systems and Pattern Recognition, and Programming Languages. The panel members are currently involved in research oriented towards cross fertilization of DBMS and various disciplines of computer science. The panel will try to identify commonality of problems, approach and solutions. We hope the discussion will stimulate research in the database area that can fully exploit what we have learned elsewhere.