ppxscal/embedding_network huggingface dataset:
Evaluation of conversion to a back-end data base management system
Authors: Fred J. Maryanski, Paul S. Fisher, Virgil E. Wallentine
Venue: Proceedings of the 1976 annual conference (1976)

This paper presents a methodology for, and an evaluation of the feasibility of converting a typical data processing system to a data base management system. This methodology is applied to a particular system. The data base management system under evaluation uses a back-end mini-computer to perform the data management functions. The evaluation is made in terms of changes in system resources, program requirements, and human factors. The results of this study provide considerable insight into the problem of conversion to a data base management system, and suggest guidelines for the evaluation of any proposed data base conversions.
Analysis of computational systems: Cumulative polygon address calculation sorting
Authors: R. Kronmal, M. Tarter
Venue: Proceedings of the 1965 20th national conference (1965)

The cumulative polygon address calculation sort has been shown to be of considerably more general use, in terms of speed, robustness, and capacity than previously investigated algorithms. A method will be given which will make it possible for the file to be sorted in place instead of in a work area. There will not be space in this paper to derive expressions for the expected number of comparisons and exchanges as well as storage and time estimates. Instead the effect of the simplifying assumptions will be discussed in the light of their effect upon &ldquo;sorting in place.&rdquo;
Fast image search using a multiscale stochastic model
Authors: S. Sista, C. A. Bouman, J. P. Allebach
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching criterion based on the generalized log likelihood ratio. We also developed a multiscale search technique which facilitates finding the best solution by searching a small subset of the entire set of possible template locations. The search technique is designed to keep the amount of computation at each resolution approximately the same. The results obtained on our example images demonstrate the robustness and accuracy of the matching criterion along with a speed-up of over two orders of magnitude by the search technique.
Automatic floorplan design
Authors: Ralph H.J.M. Otten
Venue: Proceedings of the 19th Design Automation Conference (1982)

The problem of allocating area to modules at the highest level of a top-down decomposition is treated in this paper. A theorem of Schoenberg is applied to obtain a good embedding of the module space into the plane. The dutch metric is introduced to transform netlist information - if available - into a distance matrix. This metric is flexible enough to enable the user to steer the design in an interactive environment, and rigorous enough to yield results satisfying optimality criterions. The embedding is used to derive the topology of the floorplan in the form of the structure tree of a slicing structure. To store the partial structure tree during the construction a concise and convenient data structure, the shorthand tree, is introduced. For any aspect ratio of the chip a minimum area floorplan can be generated. The paper also shows how wiring space predictions can be incorporated, how varying degrees of module flexibility can be accounted for, and how fixing bonding pad macros affects the procedure.
Meditations on style
Authors: Stephen W. Smoliar
Venue: ACM SIGCSE Bulletin (1976)

At the 1968 NATO Conference on Software Engineering,1 Edsger W. Dijkstra remarked that he found his position, as a teacher, analogous to that of a teacher of composition at a school of music. This paper wishes to pursue this analogy in greater detail. In particular, the role of style in computer science education is assessed in terms of the corresponding role it plays in music education.
Accent: A communication oriented network operating system kernel
Authors: Richard F. Rashid, George G. Robertson
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

Accent is a communication oriented operating system kernel being built at Carnegie-Mellon University to support the distributed personal computing project, Spice, and the development of a fault-tolerant distributed sensor network (DSN). Accent is built around a single, powerful abstraction of communication between processes, with all kernel functions, such as device access and virtual memory management accessible through messages and distributable throughout a network. In this paper, specific attention is given to system supplied facilities which support transparent network access and fault-tolerant behavior. Many of these facilities are already being provided under a modified version of VAX/UNIX. The Accent system itself is currently being implemented on the Three Rivers Corp. PERQ.
Concepts of building a design automation system
Authors: D. Lyons, M. McLuhan
Venue: Proceedings of the SHARE design automation project (1966)

&ldquo;....automation creates roles for people, which is to say depth of involvement in their work and human association that our preceding mechanical technology had destroyed.&rdquo; There are many terms used for the computer application to the aid of design and production, none of which truly state the case. We are concerned here with a system that will implement the ideas behind these terms. The tools used for this implementation are the computers and a large amount of software. This combination is ideally suited for the long, tedious, and dull tasks. The user, who is a human being is capable of working easily with abstractions. It is the combination of man and the machine which produces a system to perform our task. Thus it becomes clear that the engineer should be designing systems to design products, and not designing products.
Communication needs in computer modeling
Authors: Hubert Lipinski, Roy Amara, Kathleen Spangler
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

With the development of computer-based group communication media, the computer may play an increasing role in managing the complexities of the modeling process. Large-scale policy models are usually developed by groups of five to seven people. Frequently, some of these model builders work in different locations around the country; they nearly always come from at least two or three different disciplinary backgrounds. The users of their models typically come from different organizations, with their own perspective on problem solving. These basic characteristics of the modeling environment create a number of communication problems. These include communication barriers between model builders and users; obstacles to communication among model builders; inadequate documentation; and problems of validation. To address some of these problems, communication-oriented computer software should provide more frequent communication in the modeling group, easier record-keeping, special formats for presentation of results, structured interaction, and user training procedures. This paper examines the communication needs in modeling and introduces a computer-based communication system designed to meet some of these needs.
Functional computer literacy
Authors: John H. Major, Roi F. Prueher,  Jr.
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

Many volumes have been written about computer literacy; unfortunately, most of these have not defined it, and those that do tend to disagree. With so little agreement, it is not surprising that computer literacy has become one of our most frequently abused buzz words. Playing games, teaching physical education, accounting for one of the Big 8 firms, and programming on a supercomputer may all involve computers and, if so, require a certain level of computer literacy. But not all to the same extent. Many universities have begun talking about a computer literacy requirement. Indeed, several have already adopted one. Those that have adopted such a requirement differ in how it is to be met. This paper discusses how these differences appear to have arisen and proposes a comprehensive plan to achieve functional computer literacy, the initial task being to define computer literacy.
Accelerated program training in a developing country
Authors: Kevin T. Ryan
Venue: Proceedings of the sixteenth annual SIGCPR conference (1979)

Zambia, like many developing countries in Africa, has a small but significant data processing sector; see (Wallace 1977) for a survey. The need for data processing is particularly acute in the copper mining industry which generates practically all of the foreign exchange that enters the country. The copper mines are so important to the national economy that at first the independent government did not risk interfering with them, although it eventually acquired a controlling interest. With increased general education and particularly since the downturn in copper prices, Zambia, like other countries, has sought to minimize its dependence on foreign experts. Nowhere is such expertise more prevalent or more crucial than in the area of data processing. It is therefore government policy to train Zambians to fill as many as possible, and ultimately all, of the positions from data preparation clerk to D.P. Manager. A first step was taken in 1970 when a few carefully selected secondary school graduates began studying for university entrance in the United Kingdom. There was a need for a training program which would have as intake secondary level trainees with good, not to say outstanding, academic records, and would produce competent, reliable programmers in the shortest possible time. The remainder of this paper describes the development and implementation of this training program and attempts to identify the lessons learned and the degree of success achieved.
An analytical method for compacting routing area in integrated circuits
Authors: M. J. Ciesielski, E. Kinnen
Venue: Proceedings of the 19th Design Automation Conference (1982)

An analytical method is proposed for solving a routing area compaction problem in building block integrated circuits. Related minimization is performed with a linear programming technique. Minimum channel dimensions are calculated for a preliminary routing; these dimensions are used to construct routing constraints. Placement constraints are added for the interrelations between placement and routing. This combined set of constraints leads to a least overestimation of routing area and under certain conditions guarantees routing feasibility. Computational complexity and existence of a solution are discussed.
Dynamic function exchanging mechanism in Poly-Processor system
Authors: M. Sato, S. Nishikawa, K. Murakami, S. Takahira
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

Microprogramming is a basic technique that realizes functionally specialized processors in a functionally distributed multiprocessor system which consists of many small processors. In such a multiprocessor system, it is necessary to change processor functions dynamically in order to back up a heavily loaded processor or a failed processor by a lightly loaded processor. This paper proposes a mechanism for exchanging processor functions in firmware level and shows a hardware organization which realizes the mechanism in an experimental system. In order to clarify the design conditions of an operating system and microprograms, the performance of the mechanism is analyzed from the load balancing point of view. Moreover, the conditions which the mechanism must satisfy are derived.
Optimal layout of CMOS functional arrays
Authors: Takao Uehara, William M. vanCleemput
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper discusses the implementation of a random logic function on an array of CMOS transistors. A graph-theoretical algorithm which minimizes the size of an array is presented.
Attributes of computer professionals
Authors: Bruce H. Barnes, Malcolm H. Gotterer
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

In order to ascertain the attributes of computer professionals and to determine their attitudes toward their undergraduate education, a questionnaire was sent to each of the graduates of the computer science program at The Pennsylvania State University who earned the degree of Bachelor of Science in Computer Science. This is a relatively new program having been established in 1967. By 1970 there were over 60 graduates, and to determine something about these people a survey was conducted. The questionnaire consisted of two parts. Part 1 dealt with job related information, such as salary, type of employment, job title, job satisfaction, etc. Part 2 delved into the graduates' attitudes concerning the baccalaureate program in Computer Science at Penn State. It was concerned primarily with courses and curriculum. A complete copy of the questionnaire is given in Appendix A. The survey did not substantiate any of these preconceptions; therefore, the survey results for each of these categories will be discussed in detail.
The effect of register-transfer design tradeoffs on chip area and performance
Authors: John J. Granacki, Alice C. Parker
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes an experiment to determine how register-transfer tradeoffs affect the resultant silicon area and performance of layouts. Six register-transfer level designs, each performing the same function with different register transfer level structures, were implemented using a library of CMOS/SOS standard cells, and an automatic placement and routing program. The consumption of area and the critical path timing were calculated for each design. The results show that register-transfer design variations do produce changes in area and performance at the layout level. However, optimistic timing analysis at the RT level, variations in relative storage timing across technologies, and omission of fanout and path length delays altered the resultant area and timing from that predicted at the RT level.
Adaptation and personalization of VLSI-based computer architecture
Authors: Chiaki Ishikawa, Ken Sakamura, Mamoru Maekawa
Venue: ACM SIGMICRO Newsletter (1981)

This paper discusses the important problem of the adaptation and the personalization of VLSI-based computer systems by means of microprogramming. In order to fully exploit the VLSI chip with one million transistors on it, we propose the scheme of mass-producing the general purpose devices and then specializing them to particular application needs at the instruction set processor level and at upper levels of the computer systems. Many algorithms and examples are given. We show what facilities future computer systems should possess in the course of discussion.
Personal computer software support
Authors: Thomas O'Flaherty
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The issues and information presented here will be useful to all current and potential users of personal computers (PC's). Much of the presentation is focussed on the proper role of the MIS department. Data is based on a study of how a cross-section of medium and large organizations are dealing with PC software support issues. The best observed practices are described as well as recommendations for further improvements.
Use of structured flowcharts in the undergraduate Computer Science curriculum
Authors: R. E. Haskell, D. E. Boddy, G. A. Jackson
Venue: ACM SIGCSE Bulletin (1976)

Over the last four years a new Computer Science major program has been introduced into the curriculum of the School of Engineering at Oakland University. During this period computer science educators throughout the country have debated the best way to introduce structured programming into the curriculum. There is now a widespread belief that beginning FORTRAN courses cannot be taught using structured programming in a form that is palatable to freshmen students without the aid of a structured FORTRAN preprocessor. Our experience in teaching structured programming using FORTRAN to large numbers of freshmen students has indicated that this widespread belief is false. We will illustrate the use of structured flowcharts with FORTRAN in Section 2 by showing one of the actual programming assignments that was given to our freshman introductory computer course this term. The same structured flowcharting techniques are used throughout the curriculum. An example that uses ALGOL and is taken from our junior level data structures class is given in Section 3. The use of the structured flowcharts forces all programs to be well-structured and encourages a top-down approach to programming. It is a very useful vehicle for describing any language-independent structured algorithm. An example of using structured flowcharts to describe a simple precedence parser in a senior course on compilers is given in Section 4.
Two tapes are better than one for nondeterministic machines
Authors: Pavol Dûriš, Zvi Galil
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

It is known that k tapes are no better than two tapes for nondeterministic machines. We show here that two tapes are better than one. In fact, we show that two pushdown stores are better than one tape. Also, k tapes are no better than two for nondeterministic reversal-bounded machines. We show here that two tapes are better than one for such machines. In fact, we show that two reversal-bounded pushdown stores are better than one reversal-bounded tape. We also show that for one-tape nondeterministic machines, unrestricted machines are better than reversal-bounded machines.
An interactive design automation system
Authors: Stephen Y. H. Su
Venue: Proceedings of the 10th Design Automation Workshop (1973)

An interactive design automation system is presented which, after complete implementation, will allow the designer to check the determinacy and dead locks of the system before implementation. The design can be evaluated at various levels and modified interactively. The designer enters his design specification using either graphical representation or design language statements. The translator accepts the input and produces a data base for both the simulator and the logic synthesizer. The synthesizer accepts information from the function library of integrated circuits and designer-defined modules as well as the design constraints such as fan-in, fan-out and cost, and design goals set by the designer and produces a logic diagram. Simulators are utilized for design verification and performance evaluation at system and gate levels.
Fitting processors to the needs of a General Purpose Array (EGPA)
Authors: Wolfgang Händler, Rainer Klar
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

1.1 General Purpose Processor The vast majority of contemporary processors can be described as general purpose processors (GPP), with a structure often referred to as &ldquo;von Neumann&rdquo;. 1.2 Associative Array Processor In addition special processors have been developed for dedicated applications, some involving parallel processing. The associative array processors (AAP) [2] or the synchronous array processors like ILLIAC IV [3] are answers to the challenge of parallel processing. This paper examines whether these two, apparently very different, types of processors can be united in a single design. To achieve this a Conventional GPP is extended by additional logic, such that additional microprograms and possibly additional microoperations are included in the control unit and in the arithmetic unit.
A data abstraction language based on microprogramming
Authors: R. Kurki-Suonio, J. Heinänen
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

The paper describes the basic ideas in extending a machine-oriented microprogramming language into a system implementation language through data and control abstraction. The approach allows an extremely primitive base language to be bootstrapped to a higher level by a type definition mechanism where the operations of the types may be microprogrammed. Vertical migration is then possible by local modifications in operation definitions. On the other hand, a suitable type definition library would make it unnecessary for an ordinary user to know that all operations are ultimately based on microprogrammed definitions. This work is part of project Ukko which has designed a special microprogrammable computer for experimentation with user microprogramming.
Color table animation
Authors: Richard G. Shoup
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

Even a small amount of animation can greatly enhance graphic communication&mdash;particularly when it is desired to show change, movement, or a complex idea or relationship. In raster scan display systems, however, the cost of providing animation has usually been prohibitively high due to the large bandwidths involved in changing a picture rapidly. This paper describes a simple method for providing a limited but very useful real-time interactive animation capability on many existing frame buffer systems. Color table animation relies on changing only the colors of objects and areas present within a single, static picture via the frame buffer's color table RAM. Several variations of this technique are discussed and examples are given of such a capability in use for illustration, educational animation, and television graphics.
A low-overhead coherence solution for multiprocessors with private cache memories
Authors: Mark S. Papamarcos, Janak H. Patel
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

This paper presents a cache coherence solution for multiprocessors organized around a single time-shared bus. The solution aims at reducing bus traffic and hence bus wait time. This in turn increases the overall processor utilization. Unlike most traditional high-performance coherence solutions, this solution does not use any global tables. Furthermore, this coherence scheme is modular and easily extensible, requiring no modification of cache modules to add more processors to a system. The performance of this scheme is evaluated by using an approximate analysis method. It is shown that the performance of this scheme is closely tied with the miss ratio and the amount of sharing between processors.
What should we teach in an introductory programming course?
Authors: David Gries
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

An introductory course (and its successor) in programming should be concerned with three aspects of programming: 1. How to solve problems, 2. How to describe an algorithmic solution to a problem, 3. How to verify that an algorithm is correct. I should like to discuss mainly the first two aspects. The third is just as important, but if the first two are carried out in a systematic fashion, the third is much easier than commonly supposed. (Note that the third step is not &ldquo;debugging,&rdquo; because the word &ldquo;debugging&rdquo; conveys the impression that errors are alright&mdash;that they are a natural phenomenon which, like flies in a house, must be found and swatted. If &ldquo;debugging&rdquo; was called &ldquo;getting rid of one's mistakes,&rdquo; I'm sure most programmers would change their attitude and work harder at producing a correct program initially.)