ppxscal/embedding_network huggingface dataset:
The basis of a computer system for modern algebra
Authors: John J. Cannon
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

So-called general purpose systems for algebraic computation such as ALTRAN, MACSYMA, SAC, SCRATCHPAD and REDUCE are almost exclusively concerned with what is usually known as &ldquo;classical algebra&rdquo;, that is, rings of real or complex polynomials and rings of real or complex functions. These systems have been designed to compute with elements in a fixed algebraic structure (usually the ring of real functions). Typical of the facilities provided are: the arithmetic operations of the ring, the calculation of polynomial gcd's, the location of the zeros of a polynomial; and some operations from calculus: differentiation, integration, the calculation of limits, and the analytic solution of certain classes of differential equations. For brevity, we shall refer to these systems as CA systems.
Controlling window protocols for time-constrained communication in a multiple access environment
Authors: James F. Kurose, Mischa Schwartz, Yechiam Yemini
Venue: Proceedings of the eighth symposium on Data communications (1983)

For many time-constrained communication applications, such as packetized voice, a critical performance measure is the percentage of messages which are transmitted within a given amount of time after their arrival at a sending station. We examine the use of a group random access protocol based on time windows for achieving time-constrained communication in a multiple access environment. First, we formulate a policy for controlling protocol operation in order to minimize the percentage of messages with waiting times greater than some given bound. A semi-Markov decision model is then developed for protocol operation and three of the four optimal control elements of this policy are then determined. Although the semi-Markov decision model can also be used to obtain performance results, the procedure is too computationally expensive to be of practical use. Thus, an alternate performance model based on a centralized queueing system with impatient customers is developed. Protocol performance under the optimal elements of the control policy shows significant improvements over cases in which the protocol is not controlled in this manner. Simulation results are also presented to corroborate the analytic results.
Primitive recursive program transformation
Authors: R. S. Boyer, J. S. Moore, R. E. Shostak
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

We describe how to transform certain flowchart programs into equivalent explicit primitive recursive programs. The input/output correctness conditions for the transformed programs are more amenable to proof than the verification conditions for the corresponding flowchart programs. In particular, the transformed correctness conditions can often be verified automatically by the theorem prover developed by Boyer and Moore [1].
Design automation and queueing networks: An interactive system for the evaluation of computer queueing models
Authors: K. M. Chandy, T. W. Keller, J. C. Browne
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Design automation techniques have been successfully used in wiring board layouts, circuit design analysis, and other areas. Simulation techniques have been used by system analysts to evaluate complex computer systems. In the early stages of a computer system design a designer will find an interactive package, which gives him real-time solutions for queueing models of complex computer systems, extremely useful. In the first few passes at a design, detailed simulation studies are too expensive and too slow. A conversational package which evaluates arbitrary configurations and gives approximate results is preferable to a slow, expensive, though accurate simulation. This paper is concerned with the real-time analysis of complex queueing network models which have been extensively used in computer systems analysis. In this paper we present the theory, algorithms and some programs for a system which departs radically from previous attempts at computer design aids for queueing network analysis in two ways: firstly the design automation system proposed here will give both algebraic and numerical answers to queries put forward by the analyst. For instance, the analyst may want to find out an algebraic expression for the throughput of a network as a function of several parameters. Or the analyst may want the output in the form of a graph of throughput as a function of a parameter. The system discussed in this paper will satisfy both types of requests. Secondly, the system allows the analyst to evaluate arbitrary networks constructed from a set of specified &ldquo;building blocks.&rdquo; The &ldquo;building blocks&rdquo; are quite general&mdash;they include queues with devices (servers), branches, joins, and so on. The analyst is allowed to use as many building blocks as he pleases, and he can interconnect these building blocks in any pattern he chooses. Thus the system is moderately flexible and allows the analyst greater freedom in choosing the models best suited for his system.
A conversational graphic aid for operating system error searching and teaching
Authors: Nguyen Thanh Thi
Venue: Proceedings of the workshop on virtual computer systems (1973)

With the advent of the 3rd generation of computers, operating systems have become gigantic and, therefore, very complex. With these systems, elaborate software helps users in all areas: simulation, software conception, data bases etc... This is not, however, true when we consider the area of operating systems. Indeed there are very few tools for debugging, correcting, maintaining operating systems, not to speak of teaching aids for students learning their basic operation principles.
Living taxonomies in the corporate world: The need for multinested data models
Authors: Egon E. Loebner, Steven D. Gadol
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

The complexity of information processing, disseminating and controlling is very high within a sizable corporation. Database design, targeted to carry out these functions, is constantly improving. Nevertheless, nonprogrammers have trouble accessing most databases. Layers of EDP personnel, as well as unresponsive and cumbersome systems, are an obstacle to effective database use.In this paper, we describe an exploratory investigation of databases based on REL ENGLISH [1]. In our system, data structures and access language were designed to map closely the corporate structure and its terminology. Our test vehicle was a portion of Hewlett-Packard's internal information network, the corporate Order Processing System. We have identified about a dozen job related perspectives belonging to geographically dispersed and functionally stratified end-users within various entities of the HP organization. A multinested data model is an intertwined hierarchy: the join of separate hierarchies with different lexicons but shared data events. For our test, we have selected two major intersecting multinested user views: sales and manufacturing. Our design accommodates users with differing perspectives of this model.The system data structures were constructed using the REL ENGLISH primitives. The Condensed Order Records (COR) base spanned a multinested hierarchy four levels deep for the Sales Organization taxonomy and five levels deep for the Manufactured Products taxomony. The design permits the user to query the COR base about the data model itself. He can, of course, also obtain the standard statistical views of the data.Corporate taxonomies are dynamically changing structures. The database model needs to reflect this change. In most cases, the user wants to manipulate data at three levels in his own job taxonomy and at all levels in the other taxonomies. The multinested data model is needed in order to permit the user to view the data from the same perspective that he views his job in the corporate organization.
A method of large-scale software development
Authors: M. Hozumi, Y. Sekine, H. Ejima
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Large-scale software requires a consistent development philosophy in all phases, from design through coding to maintenance. This paper describes the closed control tree structure concept which we used to achieve this consistency while developing AIM/RDB, a large relational data base system.
What Employers Look For In Hiring Computer Science Graduates (Panel Discussion)
Authors: Ken Rothmuller
Venue: Proceedings of the 1978 annual conference (1978)

Hewlett-Packard hires computer science undergraduates into summer and co-op programs and graduates (BS, MS, and PhD) into full time positions. Up until 1966, Hewlett-Packard developed only electronic, medical, and analytic instrumentation. With the introduction of the minicomputer (HP 2116) in 1967, a table-top calculator (HP 9800) in 1968, the hand-held calculator (HP-35), and a business computer (HP 3000) in 1972 we have had a dramatic increase in our computer/calculator business. Very soon, over half of Hewlett-Packard's revenues were derived from these products. More recently, the introduction of small, low-cost microprocessors has caused a need for software expertise in the instrumentation areas as well. There is literally no area of the company that is not involved with some form of computer related activity. Depending on a CS graduate's background and interest, all of these areas are in need of computer science majors. Hewlett-Packard is composed of six &ldquo;groups&rdquo; loosely organized by market area. Within each group, the dominant operational unit is the division. Each division is responsible for one or more product lines and is completely self-contained, including an R D function, a marketing department, and a manufacturing organization. I will concentrate on the needs of the R D Lab, but there are also many opportunities in the other functional area for computer science graduates. Positions outside of the R D lab demand various levels of technical expertise, along with proficiency in the functional area (marketing or manufacturing) and communication skills. In addition, our field sales force is technically oriented and provides opportunities for graduates interested in direct customer interaction and after sales support.
Assertional checking and symbolic execution: An effective combination for debugging
Authors: J. Mack Adams, James Armstrong, Melissa Smartt
Venue: Proceedings of the 1979 annual conference (1979)

Software reliability will be no less a challenge in the 80's than in the previous decade but the basic research of the 70's can be applied to develop software tools to meet this challenge. In this paper one such application is described, namely the development of a debugging package based on two very active areas of research in the late 60's and throughout the 70's: research on proving assertions about programs [7,9,10,14,17] and on symbolic execution [3,11,12,13]. Combining these two areas appears to have been very fruitful in producing an approach to debugging of great promise. The development of the debugging package for a version of Pascal is described and some applications of the package are discussed. Some possibilities for future developments are also given.
A cutting plane algorithm for the fixed charge problem
Authors: Hamdy A. Taha
Venue: Proceedings of the ACM annual conference (1973)

An algorithm is devised for solving the fixed charge problem with linear constraints. The algorithm employs especially constructed cuts to locate the global optimum point. Computational results are included.
Hartley Transform in Compression of Medical Ultrasonic Images
Authors: Ignacy Duleba
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper the Hartley transform has been used for both compression and filtering of medical ultrasonic images. The Hartley transform shares some features of the Fourier transform and, the most important, there exists a computationally effective butterfly algorithm of the transform. Compression relies on filtering out higher harmonics of the forward Hartley transform and saving the result rather as the image than the coefficients of the transform. In this case the images' size is reduced 16 times without significant loss of valuable medical information.
Videodisc-supported computer instruction
Authors: Richard A. Pollak
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The Special Projects Division of the Minnesota Educational Computing Consortium began to develop a model course using videodisc-supported computer instruction in August of 1979. The Project is entitled &ldquo;Personal Computers and the Home Videodisc Player: Solving Instructional Delivery Problems created by Declining Enrollments.&rdquo;(1) The Project's purpose it to demonstrate that low-cost personal computers and home videodisc players can be programmed to deliver complete courses to students.
Design considerations for the VLSI processor of X-TREE
Authors: David A. Patterson, E. Scott Fehr, Carlo H. Séquin
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

X-NODE is a single-chip VLSI processor to be realized in the mid 1980's and to be used as a building block for a tree-structured multiprocessor system (X-TREE). Three major trends influence the design of this processor: the continuing evolution of VLSI technology, the requirements for parallelism and communication in a multiprocessor system, and the need for better support of software and high level language constructs. The influence of these trends on the processor architecture are discussed and the current state of the design of X-NODE is outlined. X-NODE will introduce several new features exploiting the full potential of VLSI technology. The processor and hierarchical memory of multiple device types will be combined on a single chip to provide a powerful processor. With basically a memory-to-memory architecture, an on-chip caching scheme provides the performance of a register based architecture. This on-chip memory hierarchy contains program and data, as well as microcode. The instruction set of any processor can thus be dynamically changed and tailored to the specific problem being executed. It is planned to support high level language constructs directly in hardware through mechanisms such as bounds checking.
Complex search and second-order response surface analysis
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper describes a two-phase approach to systems optimization via computer simulation experimentation. In the first phase, Box's Complex Search is employed to search from some initial set of simulation trials X1..., XK to an estimated optimum solution X*. Then a second-order response surface is fitted to these K points, or to some subset thereof, and analyzed through classical optimization procedures to gain yet another estimate X**. If y(X*) and y(X**) are sufficiently close, and X* and X** are close together, then the superior solution can be chosen. If either y(X*) is not close to y(X**), or X* is not close to X**, additional simulation trials in the neighborhood of X* and X** should be conducted to seek improved solutions.
The lambda calculus and its relation to programming languages
Authors: Arthur Evans,  Jr.
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

An approach to the formal specification of the semantics of the programming language PAL is presented. A subset of the language is exhibited which is equivalent to Church's &lgr; -calculus, and the semantics of that subset is specified by transformation rules from it to the &lgr; -calculus. The semantics of the basic operators of the language (such as &ldquo;?rdquo;) is defined by axiomatization. The remainder of the language is specified by exhibiting an interpretor for it, the interpretor being expressed in the subset. The approach is tutorial in nature, concentrating on explaining the methods rather than on giving the details. No knowledge of the &lgr; -calculus is assumed.
Execution time (and memory) optimization in microprograms
Authors: M. Tabandeh, C. V. Ramamoorthy
Venue: Supplement to the conference record of the 7th annual workshop on Microprogramming (1974)

Availability of dynamically writable control memories for microprogramming motivates researchers in the design of appropriate languages. Certain processors allow simultaneous activation of several microoperations. Exploitation of parallelism existing in a source program therefore becomes a necessity in the implementation of some compilers. In this paper, the improvements on the execution time of programs by a near optimal compiler are given. Then an algorithm is suggested for obtaining the optimal object microcode. It is then applied to an example.
Image enhancement based on fuzzy logic
Authors: YoungSik Choi, R. Krishnapuram
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We propose a fuzzy rule-based approach to image enhancement to address its seemingly conflicting goals: (a) removing impulse noise, (b) smoothing out nonimpulse noise, and (c) enhancing edges or certain other salient features. Three different filters for each task are derived using the weighted least mean squared method. Criteria for selecting each filter are defined. The criteria are based on the local context as well as the particular situation. They constitute the antecedent clauses of the fuzzy rules, and the corresponding filters constitute the consequent clauses of the fuzzy rules. The overall result of the fuzzy rule-based system is computed as the combination of the results of the individual filters, where each result contributes to the degree that the corresponding antecedent clause is satisfied. This approach gives us a powerful and flexible image enhancement paradigm. Experimental results are presented.
The second generation motis mixed-mode simulator
Authors: C. F. Chen, C-Y Lo, H. N. Nham, Prasad Subramaniam
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes the second generation MOTIS mixed-mode simulator. In particular, it extends the current modeling capabilities to include resistors, floating capacitors, and bidirectional transmission gates. It employs a relaxation algorithm with local time-step control for timing simulation, and a switch level approach for unit delay simulation. It provides logic and timing verification for general MOS circuits in a mixed-mode environment. The new simulator is being used for production chips, and it is more accurate, flexible, and efficient than the existing MOTIS mixed-mode simulator.
Microcode compaction via microblock definition
Authors: M. Mezzalama, P. Prinetto, G. Filippi
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

The paper describes a microprogram compaction technique based on a microoperation and microistruction modelling, applicable to different types of target machine. The model describes microoperation semantics by relating them to microcodes used in microinstruction fields, without any explicit description of machine timing. Evaluation of the proposed technique is given in terms of efficiency of the automatically generated microcode.
An on-line symbolic mathematics system using hand-printed two-dimensional notation
Authors: Frederick W. Blackwell, Robert H. Anderson
Venue: Proceedings of the 1969 24th national conference (1969)

This paper describes a system that is being developed at The RAND Corporation for the on-line manipulation of symbolic mathematical expressions. The primary input consists of the user's expressions hand-printed on a RAND tablet in ordinary two-dimensional mathematical notation. The system recognizes the characters and interprets the whole expression from the spatial relationships present in accordance with a previously input syntax. The user at the console directs symbolic transformations upon his input expressions by instructing the computer to selectively attempt to apply various rules of mathematics; these rules have been previously entered into the system in the same manner as the expressions. A transformed expression resulting from the application of a rule or group of rules is displayed on the IBM 2250 graphic console. An experimental version of the system is in operation at the present time.
Aerospace applications
Authors: K. E. Dominiak, R. J. Ireland, Betty J. Lanstra, K. Mitome, S. Tsuhara, S. Seki, K. Isoda, Alvin F. Andrus, Paul D. Flanagan, Judith B. Currier, Kenneth E. Willis, John E. Sherman
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Quotes from the abstracts. Aircraft track generation and transmission of data to remote sites on real time is discussed in the first paper...The use of this management tool in planning request for proposals is developed in the second paper...Manufacturing use of simulation in Tokyo is illustrated in a new simulator that simultaneously simulates the material flows in the process and the control systems' behavior in the third paper...A probabilistic event store computer simulation of interactions between missile and aircraft is used as text material in the third paper...The Knoxville, Tennessee terminal is used as a testbed for the analysis and design of automated safety separations functions for air traffic control in the last paper in the session.
A refutation of Carlson's Conjecture, or UMASS re-moulded
Authors: Caxton C. Foster
Venue: Proceedings of the 1971 26th annual conference (1971)

It is shown first that Carlson's Conjecture, in both the strong and weak form, is false and that (@@@@j)(Dj@@@@Uj @@). Second, we show that S(-@@@@)>S(@@@@) for any positive @@ and @@. Finally, we discuss some changes to a time-sharing system (UMASS) that one of the members of the design team would make today on the basis of three years experience teaching and using the system.
A multi-project decision process simulation of defense contractor behavior (II)
Authors: Daniel L. Blakley, Kalman J. Cohen, Arie Y. Lewin, Richard C. Morey
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper describes the design and initial validation of a computerized decision process model simulating the operating environment, behavior and performance of defense contractors. The conceptual foundations of this research are presented in Cohen, Lewin and Morey (1979). The model employs feedback adaption and search mechanisms to simulate the internal decision making structure of defense contractors at the project, corporate and DOD levels. The objective of this research is to develop a capability to model the impact of various contract incentive schemes on the performance of DOD contractors.
Bibliographic implication of computer documentation
Authors: Diana Patterson
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

Bibliography is the study of books: how they are made and their physical characteristics. Bibliographers have begun to make some important contributions to the history of ideas, especially with the advent of computerized library information systems. Computer manuals thus far have not been a subject of bibliographic interest and have not been considered worth preserving, even by their authors. Because of the variableness of computer manuals they present special problems to bibliographers, problems which will be intensified by on-line documentation. As computers become the most important communications medium in society the history of ideas will necessarily include the history of computing through its documentation.