ppxscal/embedding_network huggingface dataset:
Interactive compaction router for VLSI layout
Authors: Hajimu Mori
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes an interactive router for compacting building block VLSI layout. It allows the designer to manipulate the functional block location on the CRT display without breaking interconnections between functional blocks. Following the movement of a functional block, it reroutes the wirings so as to retain interconnections with keeping the layout obeying design rules. The interactive compaction router provides an efficient tool to achieve a minimum chip area layout design.
Videodiscs and microprocessors the issue of useability
Authors: S. Reisman
Venue: Proceedings of the ACM '81 conference (1981)

A recent publication describing the variety of benefits which will be derived from the integration of videodiscs and microprocessors led me to an interesting observation. By replacing every instance of the words &ldquo;videodisc&rdquo; and &ldquo;microprocessor&rdquo; with the words &ldquo;computer assisted instruction&rdquo;, the article could easily have been written in 1968. We all know, that despite the forecasts of the 1960's, and through no fault of the technology, those early promises have still not materialized. Today, in 1981, I am quite concerned that unless we learn from the past the full potential of discs and micros may not be realized soon enough. Despite the major reductions in size and price of hardware and software as well as audio-video function, very little progress seems to have been made in developing the man/machine interface. And it is this interface which is necessary to enable end-users to readily utilize the inexpensive function provided by the hardware manufacturers.
Computer Aided Programming
Authors: Paul Bassett
Venue: Proceedings of the 20th Design Automation Conference (1983)

A software manufacturing paradigm is described which deals effectively with many issues long associated with software development and maintenance. In essence, Computer Aided Programming is to software manufacturing what CAD/CAM is to conventional manufacturing. A reusable component approach to automated software assembly, CAP provides an intelligent software development environment in which the computer handles the bulk of the work required to build and to maintain code. CAP builds a program from specific goal-oriented instructions supplied by the user. Custom code is automatically spliced with reusable CAP computer code to create customized application programs.
Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version)
Authors: S. Rao Kosaraju
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

It is shown that concatenable double-ended queues can be simulated in real-time by double-ended queues without concatenation. Consequently, every multihead Turing machine with head-to-head jumps can be simulated in real-time by multitape Turing machines.
Context-free error analysis by evaluation of algebraic power series
Authors: Ray Teitelbaum
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Optimal error analysis with respect to a context-free language may be viewed as the evaluation of an algebraic power series. By generalization of the nodal span context-free recognition algorithm, any algebraic power series is computable in O(n3) steps. The closure of algebraic power series under sequential transduction yields a generous class of reasonable error measures for which optimal analysis is O(n3). Included is minimizing the number of symbol insertions, deletions and/or replacements needed for correction, a special case which has been studied separately.
A firmware monitor to support vertical migration decisions in the UNIX operating system
Authors: B. Holtkamp, H. Kaestner
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

From a methodological point of view vertical migration involves the following four steps: identification of migration objects, prediction of expected system improvements, implementation, and verification of the results. In this paper a firmware monitor is presented as a support tool for the first and fourth step. The application environment for this monitor is a PDP-11/60 with writable control store running the UNIX operating system. Based upon a UNIX system model the requirements for the monitor are defined in terms of objects and their parameters to be measured. Afterwards the hierarchical structure and the components of the firmware monitor are presented. Furthermore the monitor handling and its influence on the operating system are discussed.
Microprogramming: A step of a top-down design methodology
Authors: J. P. Schoellkopf
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

Microprogramming is presented as a mean of implementing a given interpretation algorithm. Hardware architecture is approached in a top-down manner : it is considered as a mean of interpreting the previously defined microprogramming language. Microprogramming is presented as a peculiar level in a hierarchical organization of interpretation levels.
Computer simulation and the performance capabilities of the Navstar space-based navigation system
Authors: T. S. Logsdon, C. W. Helms
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Six Navstar navigation satellites are presently traveling through space 10,898 nautical miles above the earth. By 1987, the operational constellation, which will consist of at least 18 larger and more advanced satellites, will be providing continuous navigation coverage to a worldwide class of civilian and military users. The Navstar satellite constellation will yield routine accuracies nearly 20 times better than any other global navigation system. This paper explores some of the computer modeling methods used by the Navstar system itself and by researchers who have been simulating the military and civilian benefits to be derived from its use.
A network-based research support facility and data archive
Authors: Richard C. Roistacher, Barbara B. Noble
Venue: Proceedings of the 1976 annual conference (1976)

A data archive and research support facility for researchers and planners in criminal justice provides services over a nationwide data communication network. The use of a network allows many services not otherwise possible, such as use of shared archival data files and common software. Clients are encouraged to form working groups which share experiences and resources. Additional problems encountered in managing a network-based facility are discussed.
Information retrieval I: The MERGE system of information dissemination, retrieval, and indexing using the IBM 7090 DPS
Authors: R. H. Stanwood
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THIS PAPER will describe the development and application of a complete Information Retrieval and Dissemination System. The system combines useful phases of two separate programs to provide keyword-in-context indexing, selective dissemination of information, selective retrieval of information, and the basis for directing the acquisitions of a technical reports center. The system, which is known as MERGE,has been programmed for the IBM 7090 DPS.
A proper model for the partitioning of electrical circuits
Authors: D. G. Schweikert, B. W. Kernighan
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Partitioning algorithms for electrical circuits are often based on the heuristic manipulation of a simple element-to-element interconnection matrix. However, the element-to-element interconnection matrix does not properly represent an electrical interconnection, or &ldquo;net&rdquo;, among more than two elements. This paper expands on several aspects of the discrepancy: 1) its source, 2) the circumstances under which it is likely to be significant, and its magnitude for typical circuits, and 3) the comparative difficulty and expense of using a more appropriate representation. A physically correct &ldquo;net-cut&rdquo; model is presented. This model is computationally straightforward and is easily adapted to the typical heuristic solution strategies. The &ldquo;net-cut&rdquo; model is coupled with the Kernighan-Lin partitioning algorithm [3]; using the same algorithm, comparisons with the &ldquo;edge-cut&rdquo; model demonstrate that the correct model reduces net-cuts by 19 to 50% for four digital logic circuits.
Issues in the design of database programming languages
Authors: Lawrence A. Rowe
Venue: ACM SIGPLAN Notices (1981)

This paper discusses two issues in the design of database constructs for programming languages. The first issue is whether records in a database correspond to records in a programming language or to a distinct type such as tuple. The second issue is what facilities are provided to define the interface between an application program and a database. The discussion below is based on our research on the RIGEL database programming language [Rowe 79, 80a]. RIGEL is a block-structured language with constructs for accessing relational databases, a module construct for data abstraction, and an exception-handling mechanism. The first implementation of the language has recently been completed and is being distributed.
A Parallel Downloading Method of Coping with Variable Bandwidth
Authors: Junichi Funasaka, Nozomi Nakawaki, Kenji Ishida, Kitsutaro Amano
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

As a lot of programs and contents such as movie files are being delivered via the Internet, and copies are often stored in distributed servers in order to reduce the load on the original servers, to ease network congestion, and to decrease response time. To retrieve an object file, existing methods simply select one or more servers. Such methods divide a file into equal pieces whose size is determined a priori. This approach is not practical for networks that offer variable bandwidth. In order to more utilize variable bandwidth, we propose an adaptive downloading method. We evaluate it by experiments conducted on the Internet. The results show that the new method is effective and that it will become an important network control technology for assurance.
Semantic attributes and improvement of generated code
Authors: D. Neel, M. Amirchahy
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Once the general principles of compilation by semantic attributes have been exposed, it is then demonstrated, with the help of a simple example, how such an approach leads naturally to an amelioration of the generated code without resorting to any special optimization treatment. Also included is the determination of basic blocks of a program, the fundamental elements in code optimization, by the method of attributes. This offers the possibility of formalizing semantically the principal optimization algorithms. To our knowledge this is the very first attempt undertaken to describe optimizing compilers methodically.
An over-cell gate array channel router
Authors: Howard E. Krohn
Venue: Proceedings of the 20th Design Automation Conference (1983)

A gate array router that utilizes horizontal and vertical over-cell routing channels to increase cell density is described. Logic macros, with fixed intraconnect metal that may span several cell columns, are mapped onto the array producing partially filled routing channels. Macro interconnects are loosely assigned to the partially filled horizontal and vertical routing channels during global routing. Each loose horizontal channel segment is assigned to a channel track using a maze router. Vertical channel segments are completed by a modified dogleg channel router.
A relational storage scheme suitable for derived views
Authors: James R. Driscoll, Beverly A. Dutton, Kathryn C. Kinsley
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A physical storage scheme used within a relational DBMS is described. The storage scheme is network in nature. The scheme implements physical linkage through shared attributes and enables data duplication to be eliminated. It results in a homogeneous structure for both permanent and temporary relations, and it is convenient for implementation of dynamic derived relations and supportability of updates by means of derived views. Our relational DBMS language incorporates unique features to facilitate the above objectives. These features make the user aware of the natural consequence of his data base.
On-line manipulation of small area demographic data: AmericanProfilesm
Authors: Garry S. Meyer
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

A new approach to the way in which users interact with the computer in an on-line environment is presented. The method is designed specifically to provide both a friendly and highly productive means of communicating user requirements. Unlike systems which are targeted toward either novice computer users or experienced programmers, the approach we take is well suited for all levels along this continuum. AmericanProfilesm, a system which provides access to demographic and economic data for both standard geo-political units of analysis (states, counties, SMSA's, Zip codes, etc.) and unique small areas (polygons, circles, etc.), is discussed as an actual case point to illustrate our approach.
Folk (abstract only)
Authors: Jan Oldervoll
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

Ethnography is a methodology which emphasises a "soft" interpretative approach to social reality. It is often portrayed as being at the opposite pole to quantitative approaches as exemplified in the classic Merton-Lazarsfeld paradigm (Structural-Functionalism wedded to the survey method).Ethnography is a method in which the researcher actively engages in and records the life of a social group. This record of experience is essentially qualitative. It is primarily constructed in the form of textual description: an ongoing account of a person's observations, thoughts and feelings while in the "field". This text is usually given the generic title of field-notes.The Ethnographic researcher is therefore normally confronted with a vast amount of textual data. To get some understanding of, and control over this data, the Ethnographer must in some way split up this record of raw experience. He must in some way "chunk" up his data into easily manageable units or categories. It is this classificatory activity which forms the basis of Ethnographic analysis.In greater detail, Ethnographic data analysis may be generally portrayed as consisting of three analytically distinct, but empirically indistinct activities: represents a1. The reading of field-notes, accompanied by the recording of themes and hypotheses;2. The coding of important topics observed within the field-notes under different category headings;3. The disassembling of field-notes by coded category; the purpose being the creative filing and retrieving of one's data.The prime concern of this presentation will be to discuss means by which such analysis may be accomplished.It is the author's belief that the schema shown below possible evolutionary trend in Ethnographic data analysis: items lower down the schema give the Ethnographer greater power and flexibility in the way he handles text. Reference will be made to presently ongoing research at Cardiff as evidence of this claim.1. The Traditional Filing Cabinet.a. Simple chronological filing of text.b. Multiple filing: the actual disassembling of text into files.2. The Filing cabinet and Separate Indices.a. Chronological filing: card indices.b. Chronological filing: specialised indices.c. Chronological filing: computer indices.3. The Full Computer Approach.a. Indices and fieldnotes stored on UNIX.b. A System of Personalised Interactive Computing for Ethnographers. SPICE: a term purely invented to emphasise the "spice" of Ethnographic research.Finally, this presentation will also discuss the implications that this research has for textual management in general. The projected computer arrangement will, I believe, prove of advantage not only to the Ethnographer, but to any researcher who employs continuous text as his/her primary resource.
A simulation study of a multi-nodal communications network with contention
Authors: S. Kumar
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

We consider a communication network in which one set of nodes receive messages which are transmitted to another set of nodes. The simulation attempts to examine the growth of congestion due to conflicts, the impact of contention on several system performance measures and the effects of the contention resolution procedures on these measures.
Breadth or depth in introductory computer courses: A controlled experiment
Authors: S. D. Stoddard, R. L. Sedlmeyer, R. G. Lee
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

A controlled experiment comparing the first-year approaches of in-depth study of programming methodology to breadth of experience in programming and languages is described. The experiment involves two groups of students who will follow different paths in the freshman year which converge in the sophomore year. Performance of students from each group in the common sophomore courses will be analyzed. The efforts to reduce bias and the methods of measurement and analysis are described in detail.
A semantic approach in designing relational data bases
Authors: Stewart N. T. Shen
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper proposes a semantic approach to data base design in the relational approach. The analysis on entity types, associations and attributes presented may be applied to data base design in other approaches too. Entity types, associations, and attributes in an operational environment are recognized and their semantic properties are studied. The attributes are categorized into simple and repeating, and the associations are categorized into atomic and molecular. Based on the analysis, relation schemas are established for the data base. These relation schemas are mostly in fourth normal form. Further normalization and optimization guarantees that optimal fourth normal form relation schemas are to be obtained. In this paper, the concept of semantically irrelevant functional dependency is also proposed. If this concept is adopted, then we may have a more optimal data model, which is semantically sound, than the optimal fourth normal form data model.
A study of document image degradation effects on font recognition
Authors: A. Zramdini, R. Ingold
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A font recognition system allowing the identification of font families, weights, slopes and sizes with an accuracy of 99% for weights and slopes and 96% for families and sizes, has been developed. Our system uses a knowledge base of 240 fonts models, which have been created from a training set of text images written with these different fonts. In this paper, a study of image degradations effects on the system performances, is presented. The evaluation that has been carried out, shows that the system is robust against natural degradations such as those introduced by scanning and photocopying, but its performances decrease with very degraded document images. In order to avoid this weakness, a degradation modeling strategy has been adopted, allowing an automatic adaptation of the system to these degradations. The adaptation is derived from statistical analysis of features behavior against degradations and is performed by specific transformations applied to the system knowledge base. Some promising results are reported.
Implications Of VLSI On Computer Design(Panel Discussion)
Authors: Erich Bloch, Fred Buelow, Sukas Patil, William Pohlman
Venue: Proceedings of the 1978 annual conference (1978)

Strictly speaking, the term &ldquo;Very Large Scale Integration&rdquo; refers to the number of gates or elementary cells which can be reliably fabricated on a single integrated circuit chip. The current state of the art yields memory chips having 16K elements and random logic (microprocessor) chips having 5K gates. The near future should see 64K bit memory chips and 10K gate random logic chips in production. Utilizing this tremendous gate density in the design of the &ldquo;random logic&rdquo; portion of computers is not at all straight-forward. It is the objective of this panel session to identify and discuss many of the technical issues related to designing computers with VLSI. This document will serve to highlight several of these issues. A brief bibliography is included for those who would like to pursue this subject further.
Optimization of service-equipment fleet by simulation
Authors: M. Sadek Eid
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The optimization of service-equipment fleet involves multiple variables, many of which are non-deterministic in nature. The demand for fleet services is normally time and zone dependent and follows certain random distributions. The type and size of the fleet affect the level of the services rendered and is a function of the initial investment, the operational costs and the desired service quality. This paper gives an application of a simulation approach for planning the optimal fleet of fire-fighting equipment for a given municipality. The area under study is divided into a commercial/industrial zone and a residential zone. Possible fires and their intensities are described by stochastic variables that are time, zone and service dependent. In addition to the local equipment that is made available, possible assistance from neighbouring localities may be rendered subject to given priorities, constraints, costs and penalties. A simulation model using GUSS (General Utility Simulation System) is used to determine the optimal fleet.
On some generalizations of binary search
Authors: David Dobkin, R. J. Lipton
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Classic binary search is extended to multidimensional search problems. These new search methods can efficiently solve several important problems of computer science. Applications of these results to an open problem in the theory of computation are discussed yielding new insight into the Lba problem.
A simulation of a minicomputer-based data base transaction system
Authors: Lawrence K. Fried, David Pravidlo
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper is a presentation of a model which simulates an on-line minicomputer-based information system dealing with the installation and maintenance of private line circuits. The model was designed and implemented subject to several user objectives. An important objective is to identify serious bottlenecks early in system development. If such bottlenecks are identified early, the cost involved in relieving the congestion could be minimized. Moreover the model is used to study the effects of parameter and design changes on system performance and to evaluate the viability of the system.