ppxscal/embedding_network huggingface dataset:
A Conceptual Model for Context-Aware Dynamic Architectures
Authors: Javier Jaén Martínez, Isidro Ramos Salavert
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Dealing with architectural complexity and software evolution imposes new challenges to traditional software development methodologies. One of the key challenges is capturing the context where applications exist so that effective adaptive strategies can be implemented. However, existing architectural approaches for software adaptation perform context acquisition and analysis in an ad hoc way, hard-wiring those specifications in any part of a system's definition. In this paper we present a conceptual model for context-awareness that can be integrated into existing architectural approaches for autoadaptive systems. Managing context as a separate concern or aspect allows for context models reutilization in different architectural definitions and what is more important allows different implementation infrastructures to be used for context awareness.
Lower bounds for algebraic computation trees
Authors: Michael Ben-Or
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision trees. Using this method we are able to generalize, and present in a uniform and easy way, almost all the known nonlinear lower bounds for algebraic computations. Applying the method to decision trees we extend all the apparently known lower bounds for linear decision trees to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20]. We also show how this new method can be used to establish lower bounds on the complexity of constructions with ruler and compass in plane Euclidean geometry.
Gate assignment and pack placement: Two approaches compared
Authors: Frank Luebbert, Mike Ulrey
Venue: Proceedings of the 17th Design Automation Conference (1980)

In this paper we discuss mathematical models for the gate assignment and pack placement problems. Relative to objective functions to be described, heuristic methods of solution are discussed, one for gate assignment and two for pack placement. Performance figures for two actual boards are presented, together with a comparison to manual layout for one of the boards.
Evaluation of various scheduling disciplines by computer systems
Authors: Benjamin Lev, Robert J. Caltagirone
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The assignment of patients to examination rooms in a diagnostic radiology department can be categorized as a job-shop scheduling problem. This paper shows a way of using a GPSS (General Purpose Simulation System) discrete event simulation model to test, analyze and find the best heuristic scheduling algorithms that can be applied to patient flow in a diagnostic radiology department. Four main measures of performance are considered; waiting time before examination, total time in the system, utilization of staff and equipment, and the number of patients in the system at the end of a working day. Among the scheduling disciplines tested include the following six; smallest number of patients in each queue, smallest work load in each queue, shortest processing time (SPT), truncated SPT (with priorities), common queue (patients join a single queue versus multiple queues based on examination type), and truncated common queue. Numerical data of Temple University's Radiology Department are included, and results indicate that two scheduling disciplines are superior to the others. Finally, a feasibility study of implementing the findings with and without a computer are discussed.
A generalized object display processor architecture
Authors: Samuel M. Goldwasser
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

A multiprocessor architecture has been developed which addresses the problem of the display and manipulation of multiple shaded three dimensional objects derived from emperical data on a raster scan CRT. Fully general control of such parameters as position, size, orientation, rotation, tone scale, and shading are accomplished at video rates permitting real-time interaction with the display presentation. The GODPA architecture is based on a large number of relatively simple processing elements which access their own memory modules without input conflict. Reconstruction algorithms are used which do not require any complex arithmetic or logical high speed operations. This hardware organization is highly modular and expandible and is ideally suited for implementation with VLSI technology.
FAST: A second generation program analysis system
Authors: J. C. Browne, David B. Johnson
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

FAST (Fortran Analysis System) implements a powerful set of analysis capabilities on Fortran source language programs. Its implementation was accomplished through the integration of existing software systems and by the use of modern language system development tools. The result is an order of magnitude reduction in effort of implementation coupled with a sizable increase in system capabilities. The use of a general purpose, commercially available data management system as a data handler and data correlator was a dominant factor in both reduction in effort of implementation and generation of additional power and flexibility in the analysis capabilities offered by FAST. FAST implements a capability for systematically qualified program analyses which is unique among existing program analyzers. This capability should be particularly useful in the program maintenance environment.
&ldquo;Software reliability in online real time environment&rdquo;
Authors: Isao Miyamoto
Venue: Proceedings of the international conference on Reliable software (1975)

This paper discusses actual software reliability data obtained in an on line real time environment. The measures used are the reliability function R(t) and the mean time between software errors MTBSE. How to measure the operational data of R(t) or MTBSE and to analyze the measurement results are described, presenting collected reliability data. This paper proposes some quantitative models which can be used to measure, manage and predict the level of perfection of software during the test stage. The error model used in this paper is based on Shooman's work1), and the number of errors remaining in a software program is modeled in terms of the number of errors corrected, the additional errors because of erroneous debugging, and observed number of errors detected. Also the assumption is made that the software error rate is proportional to the number of remaining errors. The major problems to be met during system development are readjusted.
Cell compilation with constraints
Authors: Chidchanok Lursinsap, Daniel Gajski
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes a cell compiler that translates cell descriptions given in form of Boolean equations including pass transistors into layout descriptions in Caltech Intermediate Form (CIF). The translation process is constrained by given height and width of the cell and the position of each I/O signal on the boundary of the cell. Furthermore, the size of each transistor as well as power consumption can be arbitrarily chosen. This cell compiler allows routing through the cell in any direction. The cell architecture is based on PLA structures.
An automated probing procedure for board testing
Authors: William A. Johnson
Venue: Proceedings of the 13th Design Automation Conference (1976)

Described is an algorithm used in PC board test programs to direct and control the probing sequence once the board has failed the functional test. Applicable to all static logic, the algorithm is used to test boards with TTL Series 54/74 dual-inline-packages (DIPS), probing with 16-pin and 24-pin IC probes (DIP-CLIPS) capable of simultaneous contact with all pins of a package. Since test data and circuit interconnection information are imbedded in the program, minimal documentation is required by the operator at the test stand during production testing. Program-generated failure data can be filed with each failed board for subsequent repair.
The design of an object oriented architecture
Authors: Yutaka Ishikawa, Mario TOKORO
Venue: ACM SIGARCH Computer Architecture News (1984)

This paper proposes a new object model, called the distributed object model, wherein the model is unified as a protection unit, as a method of data abstraction, and as a computational unit, so as to realize reliable, maintainable, and secure systems. An object oriented architecture called ZOOM is designed based on this object model. A software simulator and cross assembler for this architecture have been implemented. The feasibility and performance of the architecture are discussed according to program sizes and estimated hardware size and execution speed.
MIRAGE - a simple-model routing program for the hierarchical layout design of IC masks
Authors: Koji Sato, Takao Nagai, Hiroyoshi Shimoyama, Toshihiko Yahara
Venue: Proceedings of the 16th Design Automation Conference (1979)

A simple-model routing program -MIRAGE- which is used in the hierarchical layout design of large scale IC masks is described together with some experimental results. By applying it hierarchically several times, satisfactory results can generally be obtained.
A microinstruction system
Authors: E. D. Conroy, R. M. Meade
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Classical instruction systems specify all functions, simple and complex, through the same mechanism. This paper describes a new organization in which more elementary operations are programmer specified by a second instruction set in micro-subroutines controlled by a subordinate instruction counter. Contingencies in the execution of primary instructions cause automatic seizure of control by the subordinate level and the execution of the appropriate microinstructions. At the completion of a micro-subroutine control reverts to the primary level for continuation of the suspended primary operation. Coding techniques, priority problems, and validity considerations are explored. The relationship of this system to interruption techniques and parallel instruction counters is discussed.
Social responsibility and computer education
Authors: Norman R. Nielsen
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

The issue of responsibility on the part of the computer professional is one that has blossomed very recently. Members of the computing field have become very much aware of some of the issues, even if there isn't any consensus on how to handle them. The ACM debates on standards of professional conduct and on the desirability of a professional society such as the ACM taking formal positions on social issues are illustrative. It is the position of this paper that the faculty member should try to prepare the student to make better decisions for himself rather than try to persuade him to take particular stands on particular issues.
Software support for the Yorktown Simulation Engine
Authors: E. Kronstadt, G. Pfister
Venue: Proceedings of the 19th Design Automation Conference (1982)

The Yorktown Simulation Engine (YSE) is a special-purpose, highly-parallel programmable machine for the gate-level simulation of logic. The YSE has been designed and is being constructed at the IBM T. J. Watson Research Center. It can simulate up to one million gates at a speed of over two billion gate simulations per second; it is estimated that the IBM 3081 processor could have been simulated on the YSE at a rate of 1000 instructions per second. This is far beyond the capabilities of existing register-level software simulators. This paper describes the software support for the YSE.
A clustering method and radius tuning by end users
Authors: H. Takahashi, K. M. Mohiuddin
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In this paper we describe a top-down clustering method consisting of an intra class step and an inter class step. In the intra class step all the samples for each category are initially divided into a small number of clusters, then the largest cluster is split and its members reallocated. The largest cluster is decided based on a new concept, "Volume" of a cluster that is a hybrid of existing two common criteria for splitting: number of members in a cluster, and variance of a cluster. In the inter class step recognition is done for all the training set to assign best radius to each prototype. The radii are used as a normalizing factor in the computation of distance metrics. In our experiments we generated a prototype library by clustering characters written by Americans. When we used another training set written by Japanese only for tuning radii of the American library, the recognition rate of Japanese test set increased from 87.9% to 92.1%. The radii can be tuned even by OCR end users when the application domain is quite different from that of the initial clustering by OCR developers.
Name resolutions using a microprogrammed interpretive technique
Authors: Stanley Habib
Venue: Proceedings of the ACM annual conference (1973)

During the compiling process certain name resolutions must be made to ascertain whether a particular name has been used previously. If it has been used previously, the attributes this particular name possesses must be noted for use during the execution process. If the name has not been used previously we assign default attributes. In some block structured languages, such as the procedural languages PL/I and ALGOL, a declaration of a name is made and there is a certain well defined region of the program over which the declaration is applicable.1 This region is called the scope of the name established by the declaration. In general, distinct declarations of the same identifier imply distinct names with non-overlapping scopes. In some internal blocks names are used without being explicitly declared. As a result, situations arise in which a resolution is required to establish the scope of a particular name.
Software team projects
Authors: D. J. Kenworthy, K. A. Redish
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

At McMaster University a lecture course on compilers is offered in the Fall term of the final undergraduate year. In the following Spring term some students elect a project course based on this material. The course amounts to about 20% of their term's work. This paper reports experience with the course.
The computer and you a proposed new course on the impact of computers on society
Authors: W. B. Andrews
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

That the applications of computer systems are having an increasing impact on the lives of people at present as well as for the foreseeable future has become commonly accepted to almost everyone, particularly to the citizens of highly industrialized countries such as the United States. Creating and implementing means for educating people to cope with the issues and problems raised or promised by these information processing systems is of importance especially in any form of democracy. This is particularly true since little accurate and detailed knowledge of the larger problem has been widely disseminated. One often hears people express ignorance or misconceptions concerning the particular issues with some commonly mentioned pervasive fear of consequences for people from computer systems in the future. Something must be done! Large segments of the populace must be given adequate bases for decision-making insofar as the applications of computer systems promise to affect the present and future. This paper proposes a university course as a realistic and practical approach to the creation of these bases in an important segment of the population&mdash;college undergraduates.
Queue-based multi-processing LISP
Authors: Richard P. Gabriel, John McCarthy
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

As the need for high-speed computers increases, the need for multi-processors will be become more apparent. One of the major stumbling blocks to the development of useful multi-processors has been the lack of a good multi-processing language&mdash;one which is both powerful and understandable to programmers. Among the most compute-intensive programs are artificial intelligence (AI) programs, and researchers hope that the potential degree of parallelism in AI programs is higher than in many other applications. In this paper we propose multi-processing extensions to Lisp. Unlike other proposed multi-processing Lisps, this one provides only a few very powerful and intuitive primitives rather than a number of parallel variants of familiar constructs.
Electron beam lithography
Authors: Faik S. Ozdemir
Venue: Proceedings of the 16th Design Automation Conference (1979)

Electron beam lithography is a rapidly maturing technology that has opened the realm of submicron design to the semiconductor device and circuit designer. This improved pattern resolution has already yielded devices and circuits exhibiting higher density, higher operating frequency, and lower operating power than has been possible with other lithography methods. This paper discusses electron beam lithography and the devices and circuits that have been fabricated with this technology.
Queue Management for TFRC-Based Traffic in 3G Networks
Authors: Hannes Ekström, Reiner Ludwig
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We study the performance of TFRC-based traffic running across a 3G network. The goal is to evaluate the impact of three different queue management schemes on the end-to-end performance provided by TFRC. We show that drop-on-full queuing is absolutely inappropriate for TFRC traffic running over 3G links since it leads to burst packet drops and oscillatory behaviour in TFRC. Although, this is mostly avoided with RED (Random Early Discard) queuing, we find large initial probing phases of TFRC when using RED. With a simpler active queue management scheme we propose, PDPC, this probing phase is significantly reduced.
Open systems standardization
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

A major challenge in the Fifth Generation is the integration of tens, hundreds or even thousands of information processing systems into cooperative application networks. For example, computer aided engineering, factory automation, tactical command and control, and videotex information services, all represent challenging but accessible applications for distributed networks involving Fifth Generation systems. The International Organization for Standardization (ISO) is in the midst of a major world program to develop &ldquo;open systems&rdquo; standards needed to facilitate the rapid and flexible integration of cooperating independent systems into such application networks. The purpose of this session of ACM 84 is to describe the ISO program of standardization for open systems and discuss some of its implications for the Fifth Generation. In each area covered&mdash;systems interconnection, graphics, and database&mdash;the speaker surveys the main current standards activities, presents the up-to-date status of the standards developments, and discusses the plans and prospects for the Fifth Generation. The speakers are leading national and international chairs and participants in the standards activities presented.
Contents and relevance of the CDP examination (A Survey)
Authors: Theodore C. Willoughby
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

At the 1975 conference of S16CPR a brief history and some of the psychometric characteristics of the Certificate in Data Processing (CDP) examination were described. As indicated the examination has changed from time to time. The Certification Council is currently considering another change. A change, if made at this time, would be effective for the 1978 examination. Changes would be instigated by the Certification Council with approval by the Board of Directors of the Institute for the Certification of Computer Professionals (ICCP). To get some feedback from the DP community about the contents of the examination, a survey was made of members of the Society of Certified Data Processors (SCDP). The survey was included in a newsletter reaching perhaps 700 people. 95 responses were received of which 92 were usable. This report describes the results of that survey.
TWIGY - a topological algorithm based routing system
Authors: Michel T. Doreau, Piotr Koziol
Venue: Proceedings of the 18th Design Automation Conference (1981)

A two-level approach to routing is described, in which a multi-layer printed circuit board routing problem is broken down into a set of single-layer ones. A topological transformation is then applied to accomplish single-layer routing. A solution found for each layer by a search in this new domain is then translated back into physical space by means of a deterministic drawing algorithm. The algorithms are independent of specific technological parameters, affording their use on a variety of board routing grids, pad diameters and wire sizes.
The IMSL environment for software development
Authors: T. J. Aird, D. G. Kainer
Venue: ACM SIGNUM Newsletter (1979)

IMSL has developed a set of macros and a file naming convention that automates the subroutine development and testing process over ten computer types. The IMSL software development system is implemented on a Data General Eclipse C330 computer with 256K bytes of central memory and 192M bytes of disk storage using the AOS Operating System. RJE activity is handled by a Data 100 communications computer. The system allows the programmer to work with basis decks. Distribution decks are generated, by the IMSL Fortran converter, as they are needed for testing and whenever the basis deck has been modified.
Management information systems: A modular approach to business EDP problem solving
Authors: James R. Zieglar
Venue: Proceedings of the 1965 20th national conference (1965)

MODULARITY&mdash;a requirement in computer hardware for several years&mdash;has now become a property of software. Early electronic computers were designed for very specific applications. They provided little or no opportunity for use on other operations without radical modifications in structure. As needs grew larger and application possibilities became more numerous, the concept of modularity evolved. Economic necessity, as well as common sense, dictated against building a completely new machine to do a partially new job. Many already well-designed parts of the computer could be lifted intact for inclusion in the new operation. Ultimately, this logic led to the general purpose digital computer.
Issues in message technology
Authors: D. Austin Henderson,  Jr., Theodore H. Myer
Venue: Proceedings of the fifth symposium on Data communications (1977)

Five years of collaborative development have established message communication as a way of life on the ARPAnet. Many lessons were learned in building the network-wide message system, and it does a generally reliable and efficient job. However, the haste with which the system was built has forced numerous compromises and left many questions unresolved. This paper sketches the history and design of the system and then explores conclusions, compromises and questions in four areas of the technology: message form and structure, addressing, authentication and protection, and the implications of a network environment.