ppxscal/embedding_network huggingface dataset:
SCALPEL: Prototype for a computer assisted finite language for data screening
Authors: Harold Kay, Charles J. Mundt, Barbara S. Van Yserloo, Alfred A. Rimm
Venue: Proceedings of the 1971 26th annual conference (1971)

No one has yet been able to devise a computerized method for using a natural language to analyze large data files. As a result scientists and physicians have been limited to using record forms and questionnaires for their information collection. On large studies where computer assistance is required the researcher may lose the opportunity to communicate directly with his own data. Many times he is forced to communicate with a computer programmer/analyst, who then operates on his data. We feel that a finite language based on a questionnaire format is an excellent means of allowing the researcher to interrogate his own computerized data. We have created SCALPEL as a prototype language system for multiple statistical inquiries for the non-computer oriented medical scientist; particularily the epidemiologist. The data used to demonstrate this finite language is from a national study of obese persons.
Postscript
Authors: Harold Joseph Highland
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

There are times when those who have attended a symposium as well as those who purchase the Proceedings afterwards, wish to communicate directly with the author or authors of a specific paper or even a session chairman. Therefore, for your convenience we have included the following list of names and addresses.
Small computer-based system for the analysis of respiration response to atmosphere pollution
Authors: C. L. Partain, C. P. Merilan, P. A. Ansbacher
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

An on-line LINC-8 computer system has been used to study the effects of atmospheric ammonia pollution on the respiratory system of New Zealand White rabbits and Holstein calves utilizing autocovariance and Fourier analysis procedure. Power spectral density and autocovariance profile plots revealed that increased respiration amplitude and decreased respiration frequency resulted in both species from exposure to ammonia levels between 50 and 100 parts per million.
Commercial network security&mdash;does anyone care?
Authors: Edmund L. Burke
Venue: Proceedings of the eighth symposium on Data communications (1983)

Since World War II, the US government has had a comprehensive way to deal with communication security. Under pressure from commercial interests, the government moved in the 70's to make some communication security technology available in the form of the Data Encryption Standard. DES has been available for some time, yet there is little interest in the marketplace. The lack of interest could stem from unawareness or unconcern with security or from the feeling that data security is not the weak point in the system. This session will investigate the techniques and vulnerabilities of commercial network security. Panel members will present their experiences with developmental and product activities aimed at providing security in a business environment. The panel will try to stimulate discussion on why there has been no market and what technical characteristics that market should have.
On logic comparison
Authors: Leonard Berman
Venue: Proceedings of the 18th Design Automation Conference (1981)

This report deals with the problem of discovering the differences between two implementations of the same partially specified function. It describes a heuristic approach to the boolean equivalence problem which yields information important for understanding structural differences. It also contains a formalization for the notion of &ldquo;structural difference&rdquo; and presents an algorithm for approximating this difference.
Polynominal time reducibility
Authors: Richard E. Ladner
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Several of the results that appear in [4] are stated to be true of polynominal time reducibility (&le;p) but are not proved explicitly. We shall prove several of these results with the hope of shedding some light on the &ldquo;determinism vs. nondeterminism&rdquo; problem. The ideas behind these proofs already exist in [4] but appear here in a different setting. We shall spend most of our time on two theorems: (i) If &fgr; <p &Bgr; then there exists an &Agr; such that &fgr; <p &Agr; <p &Bgr; and (ii) there exist &Agr; and &Bgr; neither of which is polynominal time computable but such that if C &le;p &Agr; and C &le;p &Bgr; then C is polynominal time computable. We show how the techniques used in the proofs of these theorems may be extended to prove other results.
Proving real-time properties of programs with temporal logic
Authors: Arthur Bernstein, Paul K. Harter,  Jr.
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

Wirth [Wi77] categorized programs into three classes. The most difficult type of program to understand and write is a real-time program. Much work has been done in the formal verification of sequential programs, but much remains to be done for concurrent and real-time programs. The critical nature of typical real-time applications makes the validity problem for real-time programs particularly important. Owicki and Lamport [OL80] present a relatively new method for verifying concurrent programs using temporal logic. This paper presents an extension of their work to the area of real-time programs. A model and proof system are presented and their use demonstrated using examples from the literature.
A Decision Support model: Simulating a production oriented processing system
Authors: R. Naylor, B. Zirger
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

Revenue Canada - Taxation has developed a Decision Support System (DSS) which allows taxation centre managers to evaluate the effects of various planning strategies for processing tax returns. To plan effectively, there is a need to find an optimal balance between the efficient utilization of resources by the processing activities and the provision of a service that meets taxpayer expectations. With the use of this Decision Support System, managers are able to evaluate the trade-offs between policies on staffing, inventory control and production to allow them to choose a plan that would best meet their overall objectives. The framework of the DSS is such that it may be used to plan for any production oriented processing system.
Some Open Problems In Cryptography
Authors: C. Leung
Venue: Proceedings of the 1978 annual conference (1978)

In the past, cryptography has been mainly concerned with the problem of private communication between two parties. A number of ciphers exist which solve this problem more or less satisfactorily. One common factor behind these ciphers is the use of certain secret keys. With the advent of commercial data networks, there is a need for many pairs of users to communicate in privacy. The classical method of distributing secret keys (over a secure channel) to each user pair becomes very expensive and alternative means have to be explored. This paper describes a method which does not require prior exchange of secret keys for private communication over a public network. The cryptanalytic complexity of breaking this system is related to the complexity of solving a certain zero-one integer programming problem.
Heterogeneous computer architecture
Authors: James E. Thornton
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper reviews computer architecture as it has progressed from the stand-alone computer to the computer system to computer networks. The degree of success of an architecture can be measured by the number of different implementations made of it. An architecture is ultimately limiting in some way, thereby spawning specialized units, called algorithm boxes, or special-purpose computers. The author takes the view that this is a beneficial trend, but one that needs architectural guidance. An architecture is valuable if designers can build, and programmers can use, the resulting system. The paper reviews current trends that might be described as the development of computer architecture by &ldquo;default&rdquo;. The particular case of local computer networks is discussed.
Session M4: Women in the workplace
Authors: Virginia C. Walker, Mary Charles Blakebrough, Caroline M. Eastman
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This session, organized by the Association for Women in Computing, seeks to provide a forum for discussion of the ever-changing environment facing today s woman in the computer industry. Each panelist, an experienced computer professional, will discuss private industry, academia, or government, in terms of the decision points in her own career. She will discuss topics such as initial educational requirements, work experience, career development activities, other issues relating to advancement, and the more general demands of the workplace as they have changed since she entered the workforce. She will then relate these factors to the entry-level computer professional, noting where shifts in emphasis have occurred. After the presentations, the panelists will discuss the similarities and differences in their various spheres.
Fault diagnosis of bit-slice processor
Authors: Young Gil Park, Jung Wan Cho
Venue: ACM SIGARCH Computer Architecture News (1983)

This paper proposes a microdiagnostic procedure for efficient fault diagnosis of bit-slice processors that are formed by an array of identical bit-slice processors. A test generation procedure for testing the entire array simultaneously instead of testing single slice, one after another, is presented, which is based on the high functional fault model and restricted multiple slice fault assumption within an array. Fault detection and fault location procedures using the generated test sequence are also presented. Using these procedures, a test microprogram and diagnostic system for the bit-sliced processor constructed by the array of four Am 2901 bit-slices are developed.
Analytic solution of an integrated performance model of a computer communication network with window flow control
Authors: Alexander Thomasian, Paul Bay
Venue: ACM SIGCOMM Computer Communication Review (1984)

A method for analyzing the performance of computer communication networks using queueing network models (QNM's) is presented in this paper. The user/computer sites are interconnected by a wide-area network with an end-to-end window flow-control mechanism. The QNM for the system including the communication subnet and the host computers is intractable because of blocking due to window flow control and memory constraints at computer systems, even under otherwise analytically favorable assumptions. The approximate solution method, which is based on iteration and decomposition, combines several recently developed computationally inexpensive algorithms to compute user response times, taking into account the delay in the communication network and the processing time at computer systems. We also introduce a fast non-iterative procedure to analyze QNM's with external arrivals and with population size constraints, such that blocked customers are queued. The effect of the choice of window sizes and minimum link/bifurcated routing on system performance is investigated.
Optimal implementation of conjunctive queries in relational data bases
Authors: Ashok K. Chandra, Philip M. Merlin
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

We define the class of conjunctive queries in relational data bases, and the generalized join operator on relations. The generalized join plays an important part in answering conjunctive queries, and it can be implemented using matrix multiplication. It is shown that while answering conjunctive queries is NP complete (general queries are PSPACE complete), one can find an implementation that is within a constant of optimal. The main lemma used to show this is that each conjunctive query has a unique minimal equivalent query (much like minimal finite automata).
Handling visual media preparation for Ohio state's computer center workshops
Authors: Gail Peters
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

At The Ohio State University, approximately 20 general-purpose workshops are provided each quarter to service the needs of our user community. We have found it useful to organize the teaching materials for these workshops by standardizing the overhead transparencies that are used by our instructors. We have found that as a direct benefit of this team approach, we can maintain consistent organization in teaching our workshops; our instructors are certain to cover the important aspects of each topic; they are better able to assess the time that will be required to cover each topic and they are less likely to be side-tracked from their subject matter. It has become much easier to prepare and rotate the teaching assignments among our instructors by this method, and the instructors find that they can prepare for a workshop on shorter notice (should an emergency arise) if they've taught this workshop in the past. Three years ago, while each instructor prepared his or her own temporary overhead transparencies on clear acetate sheets with water soluble pens, we began the process of learning to pool our ideas, determine what concepts were consistent and relevant&mdash;and prepare permanent, standardized sets of overhead transparencies for many of our workshops. We have developed a filing system for maintaining our overhead transparency sets, and make periodic modifications to these sets. Our transparency supplies consist of such simple materials as transparency film, water-based and permanent transparency pens, chartpak and zip-a-tone&mdash;all the way to the more sophisticated Kroy lettering machine, the electrostatic Versatec plotter and the newest addition&mdash;SAS/GRAPH. As the computer literacy rate has risen among our user community, the need for more technical and specialized instruction has also risen. By standardizing our workshop teaching materials, we have been able to free up more of the instructors' time and allow them to apply their research efforts toward new areas of computer literacy, while keeping pace with the needs and special interests of our user community. The paper that I propose will discuss the basic considerations that are necessary to produce clear, visible, and attractive overhead transparencies. Basic topics will include: simple DOs and DON'Ts of transparency making, examples of good and poor transparency style; suggestions for redesigning overhead transparencies for better comprehension and visibility, and current visual media preparation at The Ohio State University.
Learning mathematics with recursive computer programs
Authors: Howard A. Peelle
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Recursion is a powerful idea*&mdash;with correspondingly powerful implications for learning and teaching mathematics. Computer scientists have previously pointed out that the use of recursion often permits more lucid and concise descriptions of algorithms [1]; mathematicians know that recursion is a fundamental concept upon which entire systems of mathematics can be built [11]; and, the theory of recursive functions is now developing into an area of mathematics whose importance has been compared with that of geometry and algebra [3]. The purposes of this paper are to illuminate the fundamentals of recursion; to illustrate several recursive computer programs which provide perspicuous representations of certain mathematical procedures; and to invite students and teachers of mathematics to reach greater understandings by trying them.
Flight test analysis of missile control systems
Authors: Mark Domaszewicz
Venue: Proceedings of the 14th Design Automation Conference (1977)

Generalized missile flight test analysis is discussed, emphasizing postflight techniques utilizing control system and airframe models driven by telemetry signals. Examples illustrate the quantitative aspects.
The bivariate beta distribution: Comparison of Monte Carlo generators and evaluation of parameter estimates
Authors: James H. Macomber, Buddy L. Myers
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

The bivariate and multivariate beta distributions may provide appropriate stochastic models for a number of processes, particularly those involving random proportions. Researchers may therefore find it necessary to estimate the parameters of such distributions or generate Monte Carlo samples with known parameter values. Two possible generating techniques for beta bivariates are presented and compared in this paper. Estimating equations for the three parameters of the bivariate beta distribution are presented. These use the method of moments, the only tractable estimating technique, and an analysis of their properties is also presented. This paper focuses on the bivariate beta distribution, but a user of a higher-dimensioned beta model will be able to make use of the discussion herein to provide assistance in determining many of the properties of such a model.
Trends in certification and professionalism
Authors: Fred H. Harris
Venue: Proceedings of the 1979 annual conference (1979)

This presentation will focus on trends which are affecting certification and professionalism among computing personnel. Such trends, both from within the industry and from without, will be discussed with emphasis on the still pending choice between voluntary certification and mandatory licensing. The enhancement of certification programs accelerated in the seventies with the establishment of ICCP and the associated support of the major computer societies. Proposals for licensing data processing personnel have emerged in the meantime but have not yet received sufficient endorsement from computing personnel to be seriously considered by legislators. Reasons typically given for such lack of support include the dynamic state of knowledge in our field on the one hand and, on the other, the lack of appreciation for exactly who should be licensed and for what specific purposes. Indeed, when licensing was first suggested, many took the position that it was premature for these reasons. More narrow proposals for licensing now have emerged which may be more supportable, and several trends are evident which will accelerate possible considerations. Pertinent ones include accelerating developments in software engineering (including the specification, design, techniques for implementation, and maintenance of systems) which better assure system quality and correctness; increased public awareness of computer-related incidents which impact public health and safety; increased attention within the courts and among other professional groups to malpractice in our field; and increased efforts toward strengthening privacy legislation and laws which deal with computer-related white collar crimes. Offsetting these, of course, is a general trend away from regulation of occupational groups. Each of these will be reviewed in detail and placed in perspective.
Parameter-passing mechanisms and nondeterminism
Authors: M. C.B. Hennessy, E. A. Ashcroft
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

The problem of defining an adequate semantics for recursive definitions which allow various types of parameter-passing mechanisms has generated a considerable amount of interest in the literature. (See [B1], [M4], [R3], [V2]) Consider for example the well-known recursive definition F <X, Y> <&equil; IF X&equil;0 THEN 0 ELSE F<X&minus;1,F<X, Y>>. Interpreted as a fixpoint equation over the flat cpo of non-negative integers it has as its least solution f(x, y) = 0 if x&equil;m for any non-negative integer m &equil; @@@@ otherwise (&ldquo;@@@@&rdquo; means undefined) This also happens to coincide with the computed function if a call-by-name (or outside-in) evaluation mechanism is used. However if a call-by-value (or inside-out) evaluation mechanism is used the computed function is fv (x, y) &equil; 0 if x&equil;0 &equil; @@@@ otherwise In [Vl] the conclusion is drawn that the call-by-value evaluation mechanism is incorrect and should not be considered.
Computers and the law (An experimental undergraduate course)
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

At the challenge of some good students, the Information Sciences Department at Taylor University decided to offer an overview course on computers and their legal implications for computer science majors and others interested in such a perspective. A two hour selected topic course was offered in the spring of 1980 to computer science majors, but open to any students who have taken at least one computer science course and had performed well in it. This paper reviews the content, successes and failures of this experimental course, with a view to assisting others who may wish to consider such an offering in the future.
A minimal duplex connection capability in the top three layers of the OSI reference model
Authors: M. F. Dolan
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

A minimal duplex connection capability is described as the ability to open, close, abort, and transfer data through a duplex connection between two application processes. The goal of this paper is to describe a minimal duplex connection capability for the top three layers of the Open Systems Interconnection (OSI) Reference Model that will be appropriate for use by very small Open Systems such as home computers. Such a connection capability would allow these small systems to interconnect with machines of arbitrary size. The approach taken is to use only the parameters on service primitives that are absolutely required to accomplish this connection service. The protocol and services necessary to accomplish such a minimal connection are described for the application, presentation, and session layers of the OSI Reference Model. The existing draft proposals for services and protocol for the session layer provide a basis for this duplex connection service. A minor modification to the session draft proposals is suggested. The services for the presentation and application layer are defined in terms of the tentative service primitives being considered in the international standards efforts. The transparent initial context defined for the presentation layer is used to minimize the work of that layer. The benefits of this minimal duplex connection capability are then discussed from the point of view of very small Open Systems.
The application software engineering tool
Authors: Nitta P. Dooner, Janice R. Lourie
Venue: Proceedings of the 12th Design Automation Conference (1975)

The Programming Process - A Traditional View Programs have traditionally been viewed as the end result of the programming process, that is, code. Although the act of programming has been variously described as analysis, design, coding, etc., the terms program has had a single meaning-as a set of machine executable statements. This focus on code has impacted the goal of the activities within each phase of the software development life cycle and the documents produced within each phase. The dominating characteristic of a coded program is that, since it must execute on a computer, it is a procedure, or a set of steps or events. The requirement eventually to construct a procedure is such a dominating consideration in the mind of the programmer that the mental activity (and the flowcharts that document it) that takes place during the system design, program design and implementation specification phases of the life cycle also takes on a procedural flavor. Because of the view that coding is where the action is, the intent is always to invent and refine a procedural solution. All forces are summoned during the life cycle to move a procedurally organized solution toward its embodiment in code.