ppxscal/embedding_network huggingface dataset:
An Enterprise Application Architecture for Reconfigurable Distributed Process Topologies
Authors: Christoph Hartwich
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Enterprise applications are transactional, distributed multi-user applications. Their distributed structure can be modeled as a process topology that consists of distributed application processes, datastores, and client/server communication relationships. Many non-functional properties of an enterprise application, such as scalability, response time, and availability are directly influenced by the design of the underlying process topology. It is the thesis of this paper that demanding enterprise applications require custom process topologies to address application-specific requirements. Furthermore, topologies should easy to adapt to changing requirements without having to redesign large parts of the enterprise application. We identifykey requirements for enterprise application middleware. Based on the requirements, we present an architecture with explicit support for custom and configurable distributed process topologies. With our architecture, the evolution of the distributed structure of an enterprise application is mainly a matter of reconfiguration.
A Metafile for efficient sequential and random display of graphics
Authors: Theodore N. Reed
Venue: ACM SIGGRAPH Computer Graphics (1982)

Graphics metafiles have been in use at the Los Alamos National Laboratory since early 1977. The first metafile format was defined in 1976 and has been updated several times to allow efficient graphics support in the Los Alamos computing environment. History and current applications of the Common Graphics System (CGS) Metafile are given. Design objectives, details of the format, and random access extensions incorporated in the Metafile are described.
Simulation of the dynamic response of radioactive material shipping package - railcar systems during coupling operations
Authors: Stanley R. Fields
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

The basic equations of the computer model CARDS (Cask-Railcar DDynamic Simulator), developed for the U.S. Nuclear Regulatory Commission to simulate the dynamic behavior of radioactive material shipping package - railcar systems, are presented. A companion model, CARRS (Cask Railcar Response Spectrum Generator), that generates system response as frequency response spectra is also presented in terms of its basic equations.
A statistical model for net length estimation
Authors: Lai-Chering Suen
Venue: Proceedings of the 18th Design Automation Conference (1981)

The prerouting estimation of net length is very important to the physical design since the estimated length can be employed as a figure-of-merit of the placement process, as an evaluation of the placement result, and in the calculation of capacitance in the predictive timing analysis. The traditional methods, bounded rectangle method, minimal spanning tree method and minimal Steiner tree method, result in either poor estimation or time consuming processing. Moreover, they do not consider the interference between each net and the technology influence. A statistical model for net length estimation has been developed to overcome these deficiencies. This model provides an unbiased estimate with 7 percent relative root-mean-squares error on an average.
A device independent computer plotting system
Authors: Uday G. Gujar
Venue: ACM SIGGRAPH Computer Graphics (1976)

This paper describes a computer plotting system which is completely device independent. The user can switch from one plotting device to another without any programming changes. The interface for adding new plotting devices is formalized and discussed. The addition of a new plotting device is completely transparent to the user; in fact, the old programs may be used to produce plots on the new device without any programming changes whatsoever. The system was designed and implemented by the author in late 1971 and has been in use ever since (see Ref. 1). Several new plotting devices, real as well as pseudo, have been added successfully without affecting the users of the system.
META LISP and META PLUS:: Tools for rapidly implementing extendable language translators
Authors: R. D. Jenks
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

A unique feature of the SCRATCHPAD system for symbolic manipulation is its powerful translation facilities. The essential components are META/LISP, a translator writing system, and META/PLUS, a facility for immediately extending the syntax of any translator produced through META/LISP. This talk will illustrate how these facilities may be used to produce a conversational higher-level LISP system. The language chosen is called ALPL because of its similarity to APL and LPL, a language resident in the SCRATCHPAD system. The essential characteristics of ALPL are described by eight syntax rules together with brief examples of corresponding ALPL and LISP programs. It is shown how a META/LISP program may be easily written to produce a conversation ALPL system. The ALPL language is then incrementally extended by introducing new notations defined in terms of existing ALPL constructs through calls to META/PLUS.
Computer-assisted instruction for the deaf: The Stanford project
Authors: J. D. Fletcher
Venue: Proceedings of the ACM annual conference (1973)

An overview is presented of the design and evaluation of computer-assisted instruction (CAI) for hearing-impaired, or 'deaf', students undertaken by the Institute for Mathematical Studies in the Social Sciences (IMSSS) at Stanford University. In 1972-73, curriculums developed by the Institute were used by more than 2,000 students in 14 elementary and secondary schools for the deaf in California, Oklahoma, Texas, Florida, and the District of Columbia. These curriculums were presented by the IMSSS computer system which used dedicated telephone lines to communicate with CAI terminals in the participating schools.
A design for a community/junior college curriculum with options for two neighboring institutions
Authors: Iva Helen Lee, Claudia Elizabeth Plog
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper presents a curriculum design for applications programmers in two neighboring community/junior colleges in the state of Texas. McLennan Community College serves a rural area with predominantly small DP shops environments whereas E1 Centro serves an urban area with a wide range of installation sizes. Despite their differing student bodies and environments, a common curriculum has been designed based on the draft of the ACM C3S-CAJC model curriculum in computer programming (1). The authors have designed a flexible curriculum in which the language emphasis is based on community needs. The curriculum includes a second major language because the knowledge of two business programming languages greatly enhances the job prospects of students in the Southwest area.
A survey of techniques to reduce/minimize the control part/rom of a microprogrammed digital computer
Authors: Tilak Agerwala
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

In this report a survey of the research to date in microprogram minimization is presented. We discuss the works of Glushkov, Casaglia, et. al., Flynn and Rosin, Mishchenko, Schwartz, Grasselli and Montanari and Das et. al. The techniques are classified into three broad categories: the Glushkov Approach, the Ad Hoc or Engineering Approach and the Schwartz Approach. The author's views are summarized in the conclusion but the survey presents more than sufficient detail for the reader to draw his own.
Desisn automation and VLSI in the 80's (Position Statement)
Authors: Steve Sapiro
Venue: Proceedings of the 17th Design Automation Conference (1980)

As a semiconductor company devoted to the production of high volume custom IC's, AMI views the world differently than systems houses and most other semiconductor houses. With standard product semiconductor manufacturers we share the goal of keeping the part price as low as possible, however our circuit complexity is less and our need to quickly get the product to a customer is greater. With the systems houses we share the need for quickly getting the part to production, but our larger volumes make the chip cost (and therefore minimizing its size) of paramount importance. VLSI represents a significant chip design challenge that requires an advanced design automation (DA) system. A typical VLSI device of 200,000 gates and 106 transistors moves the chip design problem from the circuit level to the system level and requires that chip design be viewed as a system design problem. VLSI design demands a hierarchical design approach with tools for each level of abstraction in the hierarchy. As it will not be possible for one chip designer to design the entire device, the task must be divided among members of a design team to benefit from parallel activity to minimize development span times. We see the 1980s as broken up into two segments-the early 1980s, when the work started on physical design tools in the late '70s will bear fruit, and the late '80s when a shift will occur away from physical design tools toward front-end tools to help the system designer cope with greatly increased density and complexity. All these tools must be glued together by the much touted hierarchical design style.
On the performance of decentralized software
Authors: Edward E. Balkovich, Colin Whitby-Strevens
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Distribution of computing to achieve goals such as enhanced reliability depend on the use of decentralized software. Decentralization typically replaces a sequential process by a system of small, concurrent processes that interact frequently. The implementation of processes and their interactions represents a cost incurred as a result of decentralization. Performance measurements are reported in this paper for decentralized software written in a programming language for distributed computer systems. These performance measurements confirm that low-cost implementations of concurrency are possible, but indicate that decentralized software makes heavy use of run-time functions managing concurrency. An initial model comparing the performance of a specific decentralized software structure to its centralized counterpart indicates that these implementation costs are generally offset by the performance improvements that are due to the parallelism inherent in the decentralized structure. The research facilities for continued study of decentralized software performance are described in the summary.
Computerized conferencing in the 80's: What could be, what should be and what probably will be
Authors: Murray Turoff
Venue: Proceedings of the 1979 annual conference (1979)

Current developments in computerized conferencing are extropolated to infer the options that could be made available by the technology. Primary among these is the concept of &ldquo;Self networking&rdquo; by individuals and groups utilizing their own hardware and software. The needs and requirements of individuals, groups and institutions are characterized to establish what should be the accomplishment of the free market place in information and commnunications. The pragmatics of the institutional, social and political system are weighed to Judge what probably will be. Perhaps the chief characterization here is the historical mismatch between the institutions associated with computers and separately with communications as the technology continues to mesh. The results are a number of rather different views of the future; the question is addressed as to what could make these alternative perspectives consistent.
The semantics of graphic input devices
Authors: Victor L. Wallace
Venue: ACM SIGGRAPH Computer Graphics (1976)

All input devices for interactive computer graphics can be effectively modelled in programs by a small number of virtual input devices. By specifying an appropriate set of such virtual devices, the semantics of interactive input can be defined independently of the physical form of the devices. In the service of program portability, human factors adaptability, economy, and maximal use of terminal capability, a sufficient set of virtual devices is described.
A study of late MIS projects
Authors: Theodore C. Willoughby, Paul L. Veneskey
Venue: Proceedings of the sixteenth annual SIGCPR conference (1979)

Late MIS projects, or any late project for that matter can be costly in terms of lost opportunities, revenues, etc. Predicting events such as completion dates of products is impossible to do with certainty but such projections are made and relied on as a matter of course and are an important part o f everyday business life. The purpose of this study is to investigate late MIS projects and their relationship to characteristics of the project team such as the level of education and experience of that team. The basis for this study is a doctoral thesis by Richard F. Powers, (1), entitled &ldquo;An Emperical Investigation of Selected Hypothesis Related to the Success of Management Information Systems Projects.&rdquo; In his thesis, Powers defined success of projects in terms of four criteria: time, cost, user evaluations and computer operations. This paper will not elaborate on all of Powers' findings but will investigate one that shows a negative correlation of the educational level of the project team and success of a project In terms of time. More simply it appears that a project team with a higher level of education is less likely to meet a deadline than one with a lower level of education.
Visualizing algorithms and processes with the aid of a computer
Authors: Jeffrey W. Mincy, Alan L. Tharp, Kuo-Chung Tai
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Communicating algorithms and processes is an integral part of computer science education yet in many instances is difficult to carry out effectively using traditional techniques. Using the computer as an aid in visualizing and understanding an algorithm is one way to improve this communication process. With the computer technology available to us today, it would be unfortunate if we did not make effective use of it in computer science education. (We don't want to be like the shoemaker's children.) The prototype systems described in this paper exemplify how a computer might be used as an instructional aid; the observations resulting from their application suggest further experimentation and use.
Priority determination/discrimination networks: Alternatives to conventional design
Authors: Patrick D. Goodrich
Venue: Proceedings of the 1977 annual conference (1977)

The priority network, an often overlooked part of computer architecture, has remained in its most primitive form even in the newest minicomputer designs. Methods of priority determination/discrimination can be classified by three aspects and, of these, several combinations exist which promise significant improvements over conventional methods. These aspects and all of the implementable combinations are presented in this paper, and the trade-offs between methods are discussed. Emphasis is placed on new minicomputer interrupt priority network design, but other applications include; the implementation of Content Comparable Memory (an extension to CAM which can retrieve its contents in order of value), and other hardware queuing structures.
Heeding More Than the Top Template
Authors: Prateek Sarkar, George Nagy
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

We present a method of classifying a pattern using information furnished by a ranked list of templates, rather than just the best matching template. We propose a parsimonious model to compute the class-conditional likelihood of a list of templates ranked on the basis of their match scores. We discuss the estimation of parameters used in the model. The results of maximum likelihood classification on isolated digit patterns consistently show a 10-20% relative gain in recognition accuracy when we use more than one top-template.
Deriving design guidelines for diagnosable computer systems
Authors: John M. Hemphill, S. A. Szygenda
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

Diagnosable computer systems are designed to detect and isolate the faults that occur during system operation. A number of techniques are available to the system designer of diagnosable systems. This paper examines a number of these techniques and derives a set of design guidelines incorporating them.
High-speed fault simulation for UNIVAC 1107 computer system
Authors: Irvin H Yetter
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A high-speed logic simulation system of programs with the ability to simulate logic faults has been implemented for the UNIVAC(R) 1107 Computer System. The central simulator program is capable of achieving an average speed of less than one-half microsecond per logical element and has a capacity of up to 10,000 logical components, with a simulated memory of 256 bytes. Among the techniques employed to achieve the speed are (1) logical component &ldquo;levelizing,&rdquo; an automatic logic equation ordering method, (2) compiler method of equation evaluation, (3) parallel or simultaneous evaluations of the model, (4) storage of the model equations in main memory storage and (5) for fault simulation, parallel fault perturbations.
Theory and design of multivalued memory elements
Authors: J. L. Huertas, J. I. Acha, G. Sanchez Gomez
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

An extension of the concept of Boolean memories is presented. A new formulation is given which allows to investigate multivalued memory elements. These elements define a class of asynchronous memory circuits, particular cases of which are the usual multistables. A systematic method of shyntesis is developed. The method is based on a simple interpr&ebarbelow;tation of the stability constraints which are imposed by an state matrix.
NONLISA: Nonlinear network simulation and analysis program
Authors: Toru Tsuda, Takuhito Kojima, Shinji Goto, Toshihiko Nakamura
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Many programs for analyzing electronic circuits including nonlinear elements have been reported. It became difficult to evaluate circuits such as ICs by the breadboard method, because this method is not always suitable for simulation of high speed and high density circuits. Moreover lengthy experiments are involved. In the case of circuits composed of discrete parts, it was considered that many manual experiments could be replaced by computer aided analysis. We developed a general nonlinear network analysis program NONLISA to enable the use of medium scale computer system FACOM 270-30 for scientific and technical applications. This program is aimed mainly at the capability of circuit designers' easy treating and extending system functions without many modifications. Functions of NONLISA are DC analysis, transient analysis, sensitivity analysis, worst case analysis, Monte Carlo Simulation etc. for networks including nonlinear elements. This paper deals with the structure and the functions of NONLISA.
Reorganizing to serve users better
Authors: James Nichols
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

This presentation will outline the emerging computing environment on four campuses of the University of Colorado and describe the facilities and services of the University Academic Computing System. In particular, the organization and activities of User Services personnel will be discussed in some detail.
A designing system for multi-family housing
Authors: Barry Jackson
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper reports on the development of a computer program, SYSBLD2, which generates passive solar designs for multi-family housing from a database of apartment plans, their components, and their associated economic and energy analysis. Although the program has been designed to be generic, the plans are associated with a precast concrete modular housing system. The program development acts as a framework for re-evaluation and modification of an industrialized housing system to include passive or low energy technology. Design criteria are established as objective functions which are linked to analytical programs and files in the database. The program utilizes the record structure of PASCAL to provide its data structure. Data input is interactive using a keyboard or digitizer; output is graphic or numeric.
On effective procedures for speeding up algorithms
Authors: Manuel Blum
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

This paper is concerned with the nature of speedups. Let f be any recursive function. We show that there is no effective procedure for going from an algorithm for f to a significantly faster algorithm for f. On the other hand, there is an effective procedure for going from any algorithm to a faster algorithm, provided one has a bound on the size of the algorithm that does the computation faster for all inputs. If no bound on the size of the faster algorithm is known in advance, one can still obtain a pseudo speedup: This is a very fast algorithm which computes a variant of the function, one which differs from the original function on a finite number of inputs.
Analysis of computing protection structures by means of multi-valued logic systems
Authors: Ladislav J. Kohout
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The paper presents a formulation of a combinatorial multi-valued protection model which is a special case of the possibilistic protection models developed by the author. A class of 5-valued functionally complete logic systems based on the Pinkava multi-valued logic algebras is used as a notational base for the MVL-protection model. The complexity measures given in the paper show that the MVL-protection models are clearly superior to binary ones.
QUEASY: The design and implementation of a management information system for casual users
Authors: Michael Andrew Christensen, Mary Anne Herndon
Venue: Proceedings of the 1978 annual conference (1978)

Currently a debate ensues over which design methods can achieve a simultaneous enhancement of casual user skill effectiveness as well as providing a suitable tool for more sophisticated users of information management systems. In this research, a classroom managerial system was designed to achieve the goal of functioning successfully for a hierarchy of user skills and needs. For the design of the system, a formalized query language was used to enhance casual user effectiveness while a relational data base structure provided the capability for more advanced query structures. In an operational test, the system functioned for a self-paced mathematics course at San Diego State University with favorable initial reactions.
The Segment Based File Support System
Authors: Richard M. Kogut
Venue: Proceedings of the workshop on virtual computer systems (1973)

This paper describes the Segment Based File Support System (SBFSS) which was designed and implemented by Robert g. Munck and the author, both of Brown University. SBFSS is an extension to IBM's CP-67/CMS virtual machine operating system for the IBM 360/67 computer. Its primary purpose is to allow CP to allocate more efficiently its direct access device (DASD) resources among a large number of users. Other advantages include improved response time, greater flexibility in sharing processors and data bases, and simple billing and back-up procedures.