ppxscal/embedding_network huggingface dataset:
The computational speed of supercomputers
Authors: Ingrid Y. Bucher
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

Problems related to the evaluation of computational speeds of supercomputers are discussed. Measurements of sequential speeds, vector speeds, and asynchronous parallel processing speeds are presented. A simple model is developed that allows us to evaluate the workload-dependent effective speed of current systems such as vector computers and asynchronous parallel processing systems. Results indicate that the effective speed of a supercomputer is severely limited by its slowest processing mode unless the fraction of the workload that has to be processed in this mode is negligibly small.
Performance verification of circuits
Authors: Jerry Mar, You-Pang Wei
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes a multi-level simulation strategy for verifying and-optimizing VLSI circuit performance. Circuit simulation alone is insufficient for ensuring that VLSI designs meet performance targets. To meet VLSI needs, a tri-level family of simulation tools consisting of critical path analyzers, parasitic timing simulators, and circuit simulators is proposed. The relationship and interface between these tools, including how they combine &ldquo;tops-down&rdquo; and &ldquo;bottoms-up&rdquo; design methodologies, and some results from the initial implementation of this strategy in actual VLSI product designs are also discussed.
ALGOL-E: An Experimental Approach to The Study of Programming Languages
Authors: Gary A. Kildall, Alan B. Roberts
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

A common approach to the teaching of Programming Languages (course 12, Curriculum 68) has been to teach several languages, each demonstrating a feature deemed significant, such as ALGOL, LISP, SNOBOL, and COBOL [3,7]. The problem that exists with this method is that far too much time is spent learning the details necessary to use the languages, leaving time for only a few trivial programs in each language. A popular alternative to this approach is to teach the course using a single general-purpose language which has a broad repertoire of language features, such as PL/I. While this method successfully avoids much of the detail which characterizes the former, it too seems to have a serious drawback. The student can become quite talented at programming in the language and still have very little feel for the implications of the higher level language structures at the machine level. Moreover, these languages typically provide no means by which the student can readily investigate these implications. Hence, ALGOL-E is proposed as a programming language system which provides such a capability.
An analytical model of a teleprocessing system
Authors: Terence Berinato
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

A queuing model has been developed to study the performance and capacity of a casualty insurance teleprocessing system. This paper presents the salient features of the system itself, relates those features to basic queuing theory algorithms, outlines the basic model construction, and discusses the validation results.
A self-paced first course in computer science
Authors: John O. Aikin
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

As demand for a first course in computer science increases, more efficient and effective approaches to such a course become increasingly desirable. This paper describes the development and use of a completely self-paced CAI course at The Evergreen State College. Use of behavioral objectives in designing the course is explained, the content of the course is outlined, the process used to develop the course is described, experiences with 256 students are reported, and some general observations on implementing CAI courses are offered.
A simple, efficient design automation processor
Authors: Lawrence E. Druffel, Douglas C. Schmidt, Robert A. Wagner
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper describes a design automation processor which was developed as a design, pedagogical, and research tool at Vanderbilt University. The processor was intended to provide a design aid for the development of small scale switching systems (e.g., controllers, interfaces, etc.). These designs were intended to be realized using TTL logic and TI #218763 wire-wrap boards. While the initial implementation was limited to this technology, flexibility for growth was included in the system design. In addition, although the system is primarily designed for wire-wrapped technology, a wire router is included to provide a printed circuit capability.
Adventures in PASCAL&mdash;the academy approach
Authors: A. C. Jost, R. Bolz, G. Topping
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A new curriculum was designed for the computer science major at the Air Force Academy with the initial majors course being Elements of Programming Languages (CS359). The course consists of four major blocks: detailed concepts of PASCAL; examination of elements of programming languages; examination of FORTRAN77 and COBOL; and student comparative reports on other contemporary languages. The initial block about PASCAL in this course is unique in concept and approach; and is the focus of this paper. The underlying basis for the approach taken is that PASCAL is an extremely small language; therefore, very easy to master. Once a student has mastered a programming language it is easy to compare other languages against the 'mastered' language. Also, it is much easier for the student to learn new programming languages once one is mastered. The approach we used in this course is what makes it fairly unique.
An overview of the &ldquo;1981 ACM SIGMETRICS Workshop/Symposium on Measurement and Evaluation of Software Quality&rdquo;
Venue: Proceedings of the ACM '81 conference (1981)

The 1981 ACM SIGMETRICS Workshop/Symposium on Measurement and Evaluation of Software Quality focused on the broad subject of software quality. It addressed some of the major topics covered by the term &ldquo;software quality,&rdquo; including the software life cycle, software quality requirements, software configuration management, software quality assurance metrics, and software reliability measurement. Over 220 practitioners and researchers from industry, government, and universities gathered together at the University of Maryland Conference Center in College Park on March 25-27 to participate in two tutorials and eight workship sessions. Workship participants represented a wide range of interests from the purely qualitative to the purely quantitative.
Delay analysis for Datapac - a packet switched network with two priority classes
Authors: R. N. Pandya
Venue: Proceedings of the fifth symposium on Data communications (1977)

Datapac is the public, packet-switched data communication network recently introduced into service by the Trans-Canada Telephone System. It supports two distinct categories of services - 'priority' and 'normal', where the priorities are user assigned. The delay performance for the Datapac services is specified in terms of the 'average delay' as well as '90th percentile delay' for priority and normal class packets. This paper presents some queueing models for estimating packet delays in the communication subnetwork of Datapac. The models can be applied for analyzing the sensitivity of packet delays to changes in such system parameters as: link capacities, link occupancies, relative packet lengths for priority and normal class packets and relative mix of priority and normal class packets.
A foundation course in computer science
Authors: Ali Behforooz
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

The discipline of computer science has matured to the extent that now it has become necessary to define a foundation course primarily designed for majors in computer science. Such a course will include an introduction to the basic areas to which these students are later on exposed at their junior and senior years. In particular, the syllabus may consist of five core areas: problem solving including algorithm design, development and testing; data structures including representation and implementation of arrays, stacks, queues, trees, lists and files; computer systems including traditional hardware and software concepts; program design and development including modern programming methodology, debugging and documentation; and finally the syntax and semantics of one or two programming languages. The duration of the course will be one full academic year for a total of 12 quarter or 8 semester credits of work. The course will assume an entry level equivalent to college algebra, computer literacy and collegiate maturity measured by completion of a total of about 32 quarter or an equivalent amount of semester credits of college level work.
The derivation of performance expressions for communication protocols from timed petri net models
Authors: Rami R. Razouk
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

Petri Net models have been extended in a variety of ways and have been used to prove the correctness and evaluate the performance of communication protocols. Several extensions have been proposed to model time. This work uses a form of Timed Petri Nets and presents a technique for symbolically deriving expressions, which describe system performance. Unlike past work on performance evaluation of Petri Nets which assumes a priori knowledge of specific time delays, the technique presented here applies to a wide range of time delays so long as the delays satisfy a set of timing constraints. The technique is demonstrated using a simple communication protocol.
A Hough-Based Method for Hatched Pattern Detection in Maps and Diagrams
Authors: Josep Lladós, Enric Martí, Jaime López-Krahe
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A hatched area is characterized by a set of parallel straight lines placed at regular intervals. In this paper, a Hough-based schema is introduced to recognize hatched areas in technical documents from attributed graph structures representing the document once it has been vectorized. Defining a Hough-based transform from a graph instead of the raster image allows to drastically reduce the processing time and, second, to obtain more reliable results because straight lines have already been detected in the vectorization step. A second advantage of the proposed method is that no assumptions must be made {\em a priori} about the slope and frequency of hatching patterns, but they are computed in run time for each hatched area.
Computation with permutation groups
Authors: Charles C. Sims
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The purpose of this paper is to provide an introduction to some computational techniques which have proved useful in the study of large permutation groups. In particular they have been used to study the Suzuki simple group of degree 1782 and order 448,345,497,600 and the simple group G2(5) of order 5,859,000,000 in a representation of degree 3906. Many of the algorithms discussed here are still in a developmental state and no claim is made that the most efficient solutions have been found.
Finite semantics: A technique for program testing
Authors: J. Hořejš
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The problem of program specification, design and verification is the problem of complexity: too many states are involved and too complicated are the transitions induced by statements execution. A deliberately chosen simplification of the set of states and transitions which still retains some characteristic properties of the computation, can help. It is proposed to develop general means for implementation of such additional semantics. While finite automata are the most important tools for definition of such semantics, the suggested approach seems to be considerably more general.
A dual method for discrete Chebychev curve fitting
Authors: R. D. Armstrong, D. S. Kung
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper presents a special purpose dual algorithm for obtaining a Chebychev approximation to an overdetermined system of linear equations. The method is founded on the principles of linear programming but is designed to take advantage of the problem's special structure. It is shown that, while maintaining a basis of smaller dimension, certain iterations of the standard dual algorithm may be combined into one. Two computer code implementations of the method are discussed and a computational comparison with another algorithm for Chebychev approximation is given.
Invited papers: The theory of multipoint iteration functions
Authors: J. F. Traub
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

WE WISH to approximate a simple root a' of the equation f (x) &equil; 0. A sequence of approximants [xi] is generated by an iteration function @@@@(x) which depends on f(x) and its first j derivatives. We introduce two additional concepts. The informational usage of @@@@(x) is defined as the number of new evaluations of fj (x), j &ge; 0, per iteration step. The informational efficiency, EFF, of @@@@(x) is defined as EFF (@@@@(x)) &equil; order (@@@@(x))/informational usage (@@@@(x)).
An IC design station needs a high performance color graphic display
Authors: Neil Weste, Bryan Ackland
Venue: Proceedings of the 17th Design Automation Conference (1980)

Raster-scan color graphic displays provide increased visual feedback in many CAD areas. In addition the unique architecture of displays used for this purpose enable other CAD related problems to be solved within the hardware structure of the display. Achieving these features commensurate with human response times requires new architecures and algorithm development for color displays. This paper presents the architecture and some of the algorithms used in an advanced color display station for IC design. The display architecture is based on a high-speed microprogrammable bit-slice microprocessor which is optimised for the algorithms found in raster-scan graphics. A new algorithm for area filling is presented which is optimised for firmware implementation. The performance of the display in an I.C. design environment is described as an example of integration into a complete design station. A unique feature of the display system is the ability to pan, in real time, over a hierarchical data base.
Optimal techniques in OCR error correction for Japanese texts
Authors: T. Hisamitsu, K. Marukawa, Y. Shima, H. Fujisawa, Y. Nitta
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper investigates three fundamental techniques in OCR error correction for Japanese texts using morphological analysis: (1) an optimal method for candidate word extraction from a candidate character lattice, (2) optimal word entries for Japanese verb inflection analysis, and (3) a new method of word matching cost calculation which is more suitable to be used with linguistic criteria. Comparative evaluation shows that the combination of these techniques requires 84% less computation, captures 2.6% more candidate words, reduces the chart parsing computation by 20%, and attains 25% higher error correction rate than a commonly used method.
Deadlock- and livelock-free packet switching networks
Authors: Sam Toueg
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

A controller for a packet switching network is an algorithm to control the flow of packets through the network. A local controller is a controller executed independently by each node in the network, using only local information available to these nodes. A controller is deadlock- and livelock-free if it guarantees that every packet in the network reaches its destination within a finite amount of time. We present a local controller which is proved to be deadlock- and livelock-free.
On guiding the business school toward computer literacy
Authors: Donald F. Costello, Richard J. Schonberger
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

In colleges and unversities around the country it is common to find that needs for new courses in computing are recognized long before suitable courses are made available. This is especially true for colleges of business administration. The needs have long been obvious, but staffing such courses internally is a slow process. Some colleges of business are well served by computer science departments, but in other schools the catalyst for getting started is lacking. This paper addresses the problem by describing the development of a service course in computing offered by the Department of Computer Science for the College of Business Administration at the University of Nebraska. The approach taken to course development postulated that if a course is to appeal to a college of business administration, it must appeal to the special needs and aptitudes of the typical business student. This particular service course concentrated on special behavioral objectives: need to develop man-machine interface skills, attention to developing self-confidence and a sense of accomplishment, and understanding the information processing concepts needed in business today. The pedagogical approach to attainment of these objectives also was carefully fashioned for the given audience. As originally conceived, the cognitive objectives of the course aimed at teaching the analytically oriented business college under-graduate how to write programs in the FORTRAN language. In addition, the student was expected to be able to read application programs in the areas of marketing, accounting, finance, operations and personnel management. The course explained how these latter applications packages aid in the management decision process. Finally, the course required that the student become more familar with the general expository material in the area of electronic data processing.
Programming aids in Xerox APL
Authors: William J. Maybury
Venue: Proceedings of the sixth international conference on APL (1974)

Enhancements have been made to Xerox APL which are beneficial from a programming point of view. Two new system commands and a variation of the stop control vector have been added. These provide assistance in the following programming tasks: Debugging. Ferreting our inefficient APL statements. Gaining insight into existing APL algorithms. Obtaining control of errors and breaks.
Fast computation of GCDs
Authors: R. T. Moenck
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

An integer greatest common divisor (GCD) algorithm due to Sch&ouml;nhage is generalized to hold in all euclidean domains which possess a fast multiplication algorithm. It is shown that if two N precision elements can be multiplied in O(N loga N), then their GCD can be computed in O(N loga+1 N). As a consequence, a new faster algorithm for multivariate polynomial GCD's can be derived and with that new bounds for rational function manipulation.
Object-oriented user interfaces and object-oriented languages (Keynote Address)
Authors: Larry Tesler
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The Smalltalk system developed at Xerox PARC in the last decade demonstrated what might be called a &ldquo;direct-drive&rdquo; style of user interaction that is more reactive and intuitive than the older dialog-driven style, and puts the user more in control. Many contemporary systems have borrowed Smalltalk's most obvious user-interface concepts: a mouse, a bit-mapped display, and overlapping windows. In the design of the Lisa, we at Apple have adopted these concepts as well as on-screen typefaces, pop-up menus, scroll bars, and other Smalltalk ideas.
Artificial texturing: An aid to surface visualization
Authors: Dino Schweitzer
Venue: ACM SIGGRAPH Computer Graphics (1983)

Texture is an important surface characteristic which provides a great deal of information about the nature of a surface, and several computationally complex algorithms have been implemented to replicate realistic textures in computer shaded images. Perceptual psychologists have recognized the importance of surface texture as a cue to space perception, and have attempted to delineate which factors provide primary shape information. A rendering algorithm is presented which uses these factors to produce a texture specifically designed to aid visualization. Since the texture is not attempting to replicate an actual texture pattern, it is called &ldquo;artificial&rdquo; texturing. This algorithm avoids the computational limitations of other methods because this &ldquo;artificial&rdquo; approach does not require complex mappings from a defined texture space to the transformed image to be rendered. A simple filtering method is presented to avoid unacceptable aliasing.
Optimal coding of video sequence over ATM networks
Authors: Jiann-Jone Chen, D. W. Lin
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We study video coding in the ATM environment under the constraints of finite encoder and decoder buffer sizes. ATM allows flexible transmission rates which can be tuned to better match picture property variation over time. We consider the leaky bucket policing mechanism and obtain the rate constraints on encoded video. We then address the optimization of video coding under the constraints. Two cases are investigated. In one the pictures are coded independently (e.g., motion JPEG), while in the other the coding quality of a later picture may depend on that of an earlier picture (e.g., MPEG). The aggregate distortion-rate relationship for the latter case exhibits a tree structure and its solution commands a higher degree of complexity than the former. We derive an efficient solution for distortion-rate relations which display certain monotonic and hierarchical characteristics. These characteristics are assumed to hold for most distortion-rate relations. Realistic nonconvex distortion-rate relations can be handled with a minor modification of the algorithm.
Systematic protection mechanism design
Authors: Douglas W. Jones
Venue: ACM SIGPLAN Notices (1982)

This work describes an attempt to systematically design a hardware resource protection mechanism when given the requirements of a particular language as a target. The design process is formalized as a structured walk through the multidimensional computer design space towards a hypothetical class of optimal machines. Each step in this walk involves a change in the distribution of work between the compiler and run-time system but no change in the source language semantics. The starting point for this walk is the result of a semantic analysis of the language to be implemented; typically, this produces a very high level machine where the compiler, if any, is trivial. The walk ends when no changes result in a net improvement. This does not guarantee that the result is even locally optimal, since the changes tried depend on the ingenuity and persistence of the designer. This design approach has been used to arrive at a practical, general purpose protection mechanism oriented towards the needs of the Ada language (preliminary version). This architecture was evaluated by comparing it with the PDP-11/45. For the purpose of this comparison, the protection mechanism was incorporated into a partially specified PDP-11 like instruction set. The number of bits making up the processor state and the number of operations involved in address computation were evaluated. On this basis, the result appears to be competitive and worth further investigation.