ppxscal/embedding_network huggingface dataset:
A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations
Authors: J. Smit
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Symbolic solutions of large sparse systems of linear equations, such as those encountered in several engineering disciplines (electrical engineering, biology, chemical engineering etc.) are often very lengthy, and received for this reason only occasional attention. This places the designer of a new and probably more successful symbolic solution method for the hard problem to find a representation which is suitable in the corresponding engineering areas, while still being neat and compact. It is believed that this problem has been solved to a great deal with the introduction of the new Factoring Recursive Minor Expansion algorithm with Memo, FDSLEM, presented in this paper. The FDSLEM algorithm has important properties which make the implementation of an algorithm which can generate the approximate solution of a perturbed system of equations relatively straight forward. The algorithms given can operate on arbitrary sparse matrices, but one obtains optimal profit of the properties of the algorithm if the matrices have a certain fundamental form, as is illustrated in the paper.
Simulation applications and specialized topics (Paper Session)
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Presentation of papers covering the whole scope of simulation theory and applications.
The problem of retrieval of information from a specialized data base
Authors: James Hoekstra
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

This paper will discuss a possible way of setting up, maintaining, and retrieving data from a user-created specialized data base. This information may also be of value in helping to determine whether a person or department is willing to commit the resources necessary to create such a system. The data base will be described first, then the creation of auxiliary files from the data base, and finally the retrieval process. The last portion of this paper will be devoted to a discussion of the resources needed to complete such a project.
Education and training: An auto-instructional text for IBM 1401 programming
Authors: W. S. Plette
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE IDEA of an auto-instructional text for teaching IBM 1401 programming was conceived by James A. Saxon, a psychologist with broad experience in the field of testing. The author of this paper was asked to review his efforts and the decision to collaborate in the preparation of such a text resulted from this review. Various auto-instructional methods of presentation were examined with these requirements in mind. The review was limited to auto-instructional methods since the author's own experience with standard textbooks and technical manuals excluded them from successfully meeting the stated goals.
Validation of a computer performance model of the exponential queuing network family
Authors: Thomas Giammo
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

Beginning in mid-1974, the Data Management Center of the Office of the Secretary of the Department of Health, Education, and Welfare undertook to validate an analytic model of computer performance in the context of a large multiprogrammed configuration operating under a variety of actual production workload conditions. A primary goal of this validation effort was to test the adequacy of the framework offered by the &ldquo;exponential queuing network&rdquo; model schema (as developed by Buzen, et al.) in representing &ldquo;real world&rdquo; situations with sufficient accuracy to be useful as a general tool in support of long range planning. The purpose of this paper is to report on the results of that validation effort.
A survey of extensions to APL
Authors: Karl Fritz Ruehr
Venue: ACM SIGAPL APL Quote Quad (1982)

A survey of proposed extensions to the APL language is made with emphasis placed on the motivations for various proposals, the differences between them and the consequences of their adoption. Some issues of a more general nature concerning the purpose, process and direction of language extension are also discussed. An extensive bibliography is provided with annotations concerning the nature, development and influence of various authors' works. Areas of extension encompassed by the survey include nested arrays, complex numbers, uniform application of functions, laminar extension, primitive functions, control structures, direct definition, operators, system functions and variables, name scope control and event trapping.
A simulation model of the MICRONET computer system during join processing
Authors: Joseph D. Brownsmith
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

The MICRONET computer system was specifically designed for processing distributed relational databases. This paper describes a simulation study of the queueing and resource utilization of this system during processing of a relational join operation. Problems associated with representing a computer network in a simulation model are presented. In our model, one set of simulation facilities can represent any node of interest in the network. The processing at each node involves competition for resources by the data bus and the join algorithm. This was represented by processes which were synchronized by Wait Event and Post Event primitives. An algorithm for interrupting a non-shareable resource (e.g. the cpu) was also developed. Results for various system loadings and database sizes are presented.
A system for network picture processing with interactive computer graphics
Authors: Hugo A. DiGiulio, Paul L. Tuan
Venue: Proceedings of the 1969 24th national conference (1969)

This paper concerns the use of interactive computer graphics for processing &ldquo;systems analysis&rdquo; network pictures. These pictures typically represent project scheduling networks, computer programming flow diagrams, job-resource simulation block diagrams, decision trees, flow in networks, etc., and are traditionally the planning tools for researchers and planners in the fields of operations research, industrial engineering, and computer science. The purpose of the interactive graphics system is to provide a convenient &ldquo;drawing board&rdquo; with which to generate, manipulate, decompose, partition, simplify, and dlsplay network pictures as means of achieving rapid convergence in man-machine experiments. This research is in connection with the Bio-technology Laboratory of the Department of Industrial Engineering at Stanford University. An ADAGE computer system (AGT/10) with an on-line graphics terminal is being used under the sponsorship of N.I.H. project NLM 00525-1.
MINUPROX - an advanced proximity correction technique for the IBM EL-2 electron beam tool
Authors: W. J. Guillaume, A. Kurylo
Venue: Proceedings of the 21st Design Automation Conference (1984)

MINUPROX - (Minimum Neighborhood Proximity Correction) is a novel approach to proximity correction used with the IBM EL-2 E-Beam direct exposure tool. Based on earlier work by M. Parikh, it differs from his approach primarily by only correcting those shapes that form the edge definition of the image. Reflecting experimental observations that the dose assignment to the edges of the image is much more critical than the assignment made to the interior, MINUPROX separates the edges from the interior of the image
Modeling and design description of hierarchical hardware/software systems
Authors: C. W. Rose, M. Albarran
Venue: Proceedings of the 12th Design Automation Conference (1975)

Two fairly recent trends, one technological and one philosophical, are influencing to an increasing degree the design of digital systems today. The plummeting cost of integrated circuits, the availability of bipolar control stores, and more recently, of bipolar microprocessor elements have resulted in the hardware or firmware implementation of functions which have traditionally been realized in software, and the firmware or software realization of functions traditionally implemented in hardware. Designers of computer systems are faced with the choice of implementing file handling functions, telecommunication service functions, floating point units, and even parts of scheduling algorithms in either hardware, software, or a combination of both.
What can be learned from arcade games and home computer applications? (A Panel Discussion): The case for considering games and home applications (abstract only)
Authors: Karl L. Zinn
Venue: ACM SIGSOC Bulletin (1982)

The presentation deals with two questions:1) What makes games so captivating?2) How can the same features (that make computer games captivating) be used to make other user interfaces more interesting and enjoyable to use?First, three empirical studies are described. These studies analyze which features of several computer games are most important in making the games enjoyable. Then a set of heuristics for incorporating these features in other user interfaces will be outlined. The heuristics are organized in three categories: challenge, fantasy and curiosity.
Shape Reconstruction of 3D Bilaterally Symmetric Surfaces
Authors: Ilan Shimshoni, Michael Lindenbaumlpr, Yael Moses
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The paper presents a new approach for shape recovery based on integrating geometric and photometric information. We consider 3D objects which are symmetric with respect to a plane (e.g., faces) and their reconstruction from a single image. Both the viewpoint and the illumination are not necessarily frontal. In principle, no correspondence between symmetric points is required, but knowledge about a few corresponding pairs accelerates the process. The basic idea is that an image taken from a general, non frontal viewpoint, under non-frontal illumination can be regarded as a pair of images of half of the object, taken from two different viewing positions and two different lighting directions. We show that integrating the photometric and geometric information yields the unknown lighting and viewing parameters, as well as dense correspondence between pairs of symmetric points. As a result, a dense shape recovery of the object is computed. The method has been implemented and tested experimentally on simulated and real data.
Transmission gate modeling in an existing three-value simulator
Authors: Robert M. McDermott
Venue: Proceedings of the 19th Design Automation Conference (1982)

Existing three value (0, 1, X,) logic simulators cannot support the use of MOS transmission gates, but this deficiency can be easily eliminated by the addition of one logic value - the high impedance (Z) state. This paper demonstrates that complete transmission gate modeling, including bi-directional operation and Ratio Logic, can be accomplished with this single Z state and explicit node models; and, since four states require the same internal storage as three states, such an enhancement would not require a major software rewrite.
Machine organization for multiprogramming
Authors: Peter Wegner
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper is intended as an introduction to some of the basic concepts of multiprogramming for readers who wish to study the more specialized literature in this field. It attempts to develop a framework for the discussion of multiprogramming which motivates the forms of machine organization used in current multiprogramming systems. The key requirement in multiprogramming systems is that information structures be represented in a hardware-independent form until the moment of execution, rather than being converted to a hardware-dependent form at load time. This requirement leads directly to the concept of hardware-independent virtual address spaces, and to the concept of virtual processors which are linked to physical computer resources through address mapping tables. The structure of the class of hardware-independent virtual processors in the IBM 360 model 67 and GE 645 systems (1), (2), (3), (4), is developed in some detail. Questions of efficiency of throughput in the resulting class of computer systems are considered.
The new Computer Science: It meets many needs
Authors: A. Crosland, D. Codespoti
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Requests from local industries led to the need for new curricula in Computer Science at the University of South Carolina at Spartanburg. The faculty discovered that the body of courses outlined in Curriculum 78 could be manipulated into alternative curricula, while leaving the standard ACM major intact. Indeed, the ACM curriculum includes exactly half of the &ldquo;technical&rdquo; courses required in the DPMA Model Curriculum. Thus, by using Curriculum 78 as a base, it is possible to implement a number of specialized degree programs without creating new courses and adding the new faculty required to teach them.
An approach to interactive graphic programming
Authors: P. Velderman, Gregory F. Pfister, P. June Min
Venue: Proceedings of the 13th Design Automation Conference (1976)

The development of interactive, display oriented systems for the manipulation of online information has traditionally been an extremely difficult and prohibitively expensive effort. This paper describes an approach based on the concept of interaction oriented specification and execution of applications and state networks. The general approach is described and then illustrated with a current display application development product.
Model curricula for 4-year computer science and engineering programs
Authors: Michael Mulder
Venue: Proceedings of the 1976 annual conference (1976)

It is with pleasure that the IEEE Computer Society welcomes this opportunity to participate with ACM members concerned with education of computer scientists and computer engineers. It is hoped that this cooperation will continue in the future. Described in this panel presentation will be the results of two years of concentrated development by members of the IEEE Computer Society Education Committee towards cohesive and flexible model curricula for 4-year computer science and engineering programs. This effort was initiated in May 1974, and since has resulted in eight working sessions, has involved 20 active module developers, has called upon nearly 40 outside reviewers, and has sought cooperation with academia, industry, the ACM and the DISE Committee. The first test of the model curricula was held in June 1976 at a IEEE Computer Society Educators Workshop; a test that seemed to be passed as judged by those attending the workshop. Specifically, this panel presentation will introduce the IEEE Computer Society effort, will place the effort in historical perspective, and will describe in detail the need as seen by many educators. It will dwell briefly on past contributions by similar committees, will provide a definition of computer science and engineering and will provide a pictorial outline of the 17 modules that comprise the five subject areas of the proposed curricula. This will be followed with selected examples of possible implementation strategies. The presentation will close with a summary of future work and a short comparison of the IEEE and ACM efforts.
APL pi designing an APL type font
Authors: Joey K. Tuttle
Venue: ACM SIGAPL APL Quote Quad (1981)

APL is probably best known for its unusual set of graphic symbols. The symbols used to write in APL are very important to understanding the concepts of programs. Some terminals currently in use produce such poor graphic images of APL symbols that the meaning of displayed statements is not clear. In addition, the usefulness of published material depends a great deal on its appearance. The current technology for producing high quality printed material is phototypesetting. This paper is a collection of notes resulting from the author's investigation of the problems involved in designing an APL type font for a phototypesetter.
ORLY: A digital computer flight simulator
Authors: Dan Cohen, Edward Taft
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

ORLY is an all-digital computer flight simulation system designed for both visual and instrument flight training. The system features real-time operation with a trainee and an instructor at the controls, and includes facilities for varying flying conditions and for recording the trainee's performance for later evaluation. In addition, the system is constructed in a modular fashion so as to easily permit experimentation with different flight models, instrument configurations, training techniques, and the like.
Local optimizations
Authors: John T. Bagwell,  Jr.
Venue: Proceedings of a symposium on Compiler optimization (1970)

Some local optimizations (as opposed to global optimizations} are presented and a suitable one-pass compiler design for using them is shown. Optimizations shown are divided into machine dependent and independent classes with examples of each. There is some discussion of a subscript calculation technique which is an improvement over the usual technique, and a discussion of the best way to raise a quantity to a known small constant power by inline code. Various register allocation criteria are mentioned.
An APL interface to the open systems interconnection for large scale application systems
Authors: R. Beltrame, G. Faconti, P. Palamidese
Venue: Proceedings of the international conference on APL (1984)

Large scale applications require the integration of logical and physical resources (i.e. systems) to be mainly operated by non programmers. In many cases this integration is obtained by gathering in a computer network the different systems which are part of the application itself. The Reference Model of Open Systems Interconnection (OSI) provides a common basis for the coordination of standards developments for the systems interconnection. APL can be profitably used as end-user interface language to access the services provided by a distributed application implemented following the OSI Reference Model.
Abstract models of dialogue concepts
Authors: R. Studer
Venue: Proceedings of the 7th international conference on Software engineering (1984)

We introduce formal, abstract models for specifying modern dialogue concepts offered by dialogue interfaces. The dialogue concepts considered in this paper are menus, forms, and windows. Using these abstract models a totally formal definition of man-machine interactions and screen layouts is achieved. Thus the semantics of user actions can be formalized. The specification method we are using is the Vienna Development Method. Examples are taken from the Application Development and Support System ADS which offers dialogue functions for generating and using application systems.
Scaling Server Selection Using a Multi-Broker Architecture
Authors: Mohamed Vall O. Mohamed-Salem, Gregor von Bochmann, Johnny W. Wong
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Server replication is a common approach to improving the scalability of a service on theInternet. For this approach, the task of finding an appropriate server from a set of replicas is acritical issue. We have proposed in a previous work an architecture where a broker is used toprovide server selection on a per session basis. When the number of servers and/or the number of clients becomes large, a single broker may not have sufficient capacity to handle the load. An extended architecture based on the replication of brokers is therefore considered. We first discuss alternative organizations that support access to multiple brokers and the needed cooperation between brokers in order to achieve server selection effectively. We then propose a server selection policy for our multiple broker architecture and evaluate its performance by simulation.
&ldquo;Experience with simulation models&rdquo;
Authors: T. A. Bratz
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Mr. Bratz will comment on two simulators which have been developed and used by Bay Area Rapid Transit District, one which was created for the purpose of designing the system and the other which was created to test the design.
Experiences in transferring a management game across cultural and economic boundaries
Authors: Myron Uretsky
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The New York University Management Game is a complex man machine simulation. It is based upon the original Carnegie Tech Game, but has since been extensively modified. One of the most significant aspects of this particular simulation is its extensive interaction with the surrounding business community: Boards of Directors are utilized, consisting of high level business men; financing is handled through live negotiations with major banks, insurance companies, and underwriters; federal regulatory agencies monitor and investigate Game-related activities. Legal counsel is available together with the provision of judicial services. Auditing and labor union activities are provided through other courses being offered. The heavy involvement of external participants has made it possible to modify this Game in order meet the needs of Polish and Hungarian educational institutions. The programming modifications have been accomplished in a straight-forward manner. Involvement of Polish and Hungarian businessmen and ministry officials has provided automatic adjustments for some socio-economic factors. At the present time a working version is operational in Budapest and a Polish version is expected be tested in late January. A number of behaviorally oriented research projects are now being carried out in parallel in the United States and in eastern Europe. These studies represent attempts to determine the impact of Management Gaming on eastern European businessmen, and an attempt to isolate differences in business behavior in these two societies.
Beyond laminate: Generalizing creation of new dimensions in arrays and function action along them
Authors: Jim Lucas
Venue: ACM SIGAPL APL Quote Quad (1981)

Lamination is a composition of rank expansion, or creation of new axes, catenation, and an axis operator. These components of lamination are separately defined, then the rank expansion and axis specification are recombined into a single operator, which can be applied in a consistent manner to any APL function for which an axis of application may be specified. Two different conventions for specifying the new axes are developed, each self consistent. A compatible variation of the syntax is suggested for specifying rank expansion without action of any function along the new axis or axes. The second of the conventions is shown to be compatible with and complementary to axis specification without rank expansion, allowing a common operator symbol and syntax for both.