ppxscal/embedding_network huggingface dataset:
Bizarre APL solutions
Authors: Roy A. Sykes,  Jr.
Venue: Proceedings of seventh international conference on APL (1975)

APL, possibly more than any other computer language, has inspired programmers to great extremes. APL enthusiasts are constantly striving for one superlative or another - the most concise solution, the shortest line, the longest line, the most opaque code, the least opaque code, the fastest execution, the largest workspace, the greatest elegance. These extremes are not always desirable, but they are often amusing, and almost always bizarre. Ebullient APL'ers gather together at conferences like this one and count characters; the measure of one's worth as an APL programmer is counted in terms of bytes and sixtieths. Minute differences distinguish truly inspired code from merely adequate code. Of course, everyone can solve the problem - that's expected - it's how the solution is arrived at that counts.
Network modeling with bursty traffic and finite buffer space
Authors: Jeffrey R. Spirn
Venue: Proceedings of the Computer Network Performance Symposium (1982)

In this paper, we propose a class of queueing network models, and a method for their approximate solution, for computer networks with bursty traffic and finite buffer space. The model is open, implying no population limit except for buffer size limits and therefore no window-type flow control mechanism. Each node of the computer network is represented as a finite-length queue with exponential service and an arrival process which is initially bulk Poisson, but becomes less and less clustered from hop to hop. Elaborations are possible to account for varying mean packet sizes and certain buffer pooling schemes, although these involve further approximation. The approximations of the method were validated against several simulations, with reasonable agreement, and certainly with much less error than is obtained by modeling a bursty traffic source as Poisson.
How does ada affect the way we teach software engineering?How does software engineering affect the way we teach ada?
Authors: Norman Cohen
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

Ada* is more than just a programming language. It is a tool that affects every stage of the software life cycle. Ada provides mechanisms for (among other things) formal specification of software interfaces, encapsulation of abstract data types, production of general-purpose, resusable software components, enforced consistency between separate compilation units, and forced recompilation of one compilation unit when a change to another compilation unit renders the previous compilation obsolete. The advent of Ada blurs the distinction between the teaching of programming languages and the teaching of software engineering. To truly teach Ada, must one teach not only the language rules for each feature, but also the software engineering methodology relevant to its use? Does Ada provide an attractive vehicle for teaching software engineering? The panel discussion will deal with these and other issues.
Stonewalls: Experiments in intelligent drafting
Authors: Chris I. Yessios
Venue: Proceedings of the 16th Design Automation Conference (1979)

Algorithms for the derivation and drafting of stonewalls are discussed and illustrated. They are of two basic types. Stone-by-stone algorithms which simulate procedures known to be applied in practice, and joint-by-joint algorithms which pursue techniques aimed at deriving &ldquo;good&rdquo; results without simulating known procedures.
An improved graph-theoretic model for the circuit layout problem
Authors: W. M. Vancleemput, J. G. Linders
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The use of topological methods for the circuit layout problem is surveyed first. In the second part an improved model is proposed, which allows pin and gate assignment in function of the layout.
A Novel Method for Discriminating Between Oriental and European Languages by Fractal Features
Authors: Dihua Xi, Seong-Whan Lee, Yuan Y. Tang
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A new method that uses a modified fractal dimension theory to segment a document image and to discriminate between Oriental and European languages is presented in this paper. Two Types of techniques have been usually adopted in language discrimination: token matching and statistical analysis. A modified fractal feature is used to discriminate the distinct textual structure complexities of Oriental and European languages. Experiments show that this method is effective and reliable for processing the document image even if it is skewed or contains noise that can not be removed clearly.
SIMPLE: A simplified ecosystem model for Lake George, New York
Authors: J. P. Killus
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

A computer simulation model for oligotrophic lake systems is described. The variables included are organic matter, nutrients, phytoplankton, zooplankton, and fish. Sunlight, temperature, benthic organisms and nutrient loadings are treated as inputs. When calibrated using data from Lake George, N. Y., the model gives good results, differing from data primarily in absolute zooplankton biomass and lake behavior in autumn.
A structured beginning COBOL class using structured programming with objectives
Authors: Ed Keith
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

This paper presents the structure of a beginning class in COBOL which stresses structured programming techniques and is organized as a series of stair-step type objectives. Three topics are stressed in this presentation: the application of student-centered objectives to a COBOL class, structured COBOL examples for commonly encountered logic constructs, and an approach to documenting structured COBOL through an indentation scheme.
Asynchronous simulation of some discrete time models
Authors: Jay B. Ghosh
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Traditionally, simulations are carried out in a synchronous manner in that most simulators advance their clocks from the time of one event to that of the most imminent event in order to execute the simulations. This synchronization is achieved at the expense of maintaining a data-structure called the event-list. An alternative to this situation is asynchronous simulation. Asynchronous simulators do not always process events in their natural order of occurence. The event-list and the associated costs may thus be eliminated. While asynchronous simulation has found considerable exposure in the literature of distributed processing, little attention has been paid to assess its applicability in the conventional environments. Some research in the past have considered simulating without the event-list. But such research have inevitably lacked generality. This paper intends to broaden the scope of asynchronous simulation in the conventional environment. It does so by presenting asynchronous solutions to a set of disparate problems and by hoping that the commonality underlying these solutions shall be captured and eventually lead to a general framework for simulation.
On the structure and control of commands
Authors: C. J. Stephenson
Venue: ACM SIGOPS Operating Systems Review (1973)

An interactive command language, with its underlying data, defines a command environment. In general a command environment supports a number of commands which once issued perform non-interactively, and which when finished leave the old command environment in control. It also supports some special commands which move to other command environments, after which commands are interpreted according to a different set of rules. The usefulness of a command environment can be extended by programming it, i.e. by dynamically constructing and conditionally executing sequences of its commands; but, unlike a programming language, a command language does not usually contain any general-purpose variables or means for conditional execution. These facilities can however be provided by a command control language, which makes it possible to construct sequences or commands to be issued to the currently active command environment from a program. A command control language is described, and the usefulness, limitations and repercussions of command language programming are discussed.
SIGMETRICS Computer system performance analysis
Venue: Proceedings of the 1975 annual conference (1975)

The papers of this session span the field of computer system performance analysis. Kachhal and Arora develop an analytic approach to the much discussed, but relatively little explored field of configuration optimization. Peterson and Bulgren compare several frequently used computer system models. Reddy describes the design and analysis of a statistical experiment in computer system performance tuning. Schwetman describes the use of a unique data gathering facility to gather and analyze operating data on the Purdue System.
An Engineering Analysis System
Authors: Paul S. Jensen
Venue: Proceedings of the 1978 annual conference (1978)

Two important characteristics of the computational problems associated with production engineering analysis are: (1) a large number of variations in the computational procedure is required to treat the many "special cases&rdquo; and (2) the problems involve large volumes of numerical data. A systematic approach for dealing with these problems is discussed. It includes a library of loosely coupled, data-base-oriented utility programs that are conveniently used as "building blocks&rdquo; for constructing appropriate computational procedures. The difficult problems of data base organization and program linkage are discussed.
A network model of the U. S. air transportation system
Authors: Aurel N. de Hollan, Arthur S. Priver, Andres Zellweger
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A basic conceptual simulation of the entire Air Transportation System was developed to serve as an analytical tool for studying the interactions among the System elements. The simulation is designed to function in an interactive computer graphics environment which permits rapid alteration of rules and parameters, as well as continuous real-time graphical monitoring of system operations. The simulation described here is the first member in an evolving hierarchy of increasingly complex models, progressing in the direction of closer approximation to the real-world Air Transportation System.
Chapter 2: Functional specification for a Core graphics System
Venue: Specifications on The SIGGRAPH/GSPC Core System (1977)

According to criteria discussed below in Section 1.4, the Core System is intended to be a rich, essentially stand-alone subroutine package for most (simple) application programs on modern line drawing plotters and displays. It should be usable from such high-level application programming languages as FORTRAN or PL/I, and the user interface is device-, machine-, and operating system-independent. Its functional characteristics (i.e., its semantics) are defined below in Sections 2 through 9, with a suggested but not mandated syntax. Each of those sections contains an overview, a description of functional capabilities, and a list of major issues discussed during the design phase. A fuller presentation of these issues is found in Chapter 3 on Core System issues. Section 1 starts with the notion of device-independence in the Core System. An overview of the Core System's functional capabilities by category is provided in Section 1.2, followed in Section 1.3 by a delineation of the four upward compatible levels of the Core System. The specific methodological and pragmatic criteria used to design the Core System's facilities are stated in Section 1.4. A glossary ends Section 1.
Minimizing goods-movement impacts on urban mobility through simulation
Authors: Philip A. Habib, Kenneth W. Crowley
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper describes the use of simulation techniques in the development of standards for off-street loading facilities for goods distribution in the city center. This work uses a simple GPSS model to quantify queues of trucks and also uses a complex traffic simulator to quantify the &ldquo;congestion&rdquo; resulting from the formation of queues at inadequately planned and operated off-street loading facilities. This paper is drawn from research sponsored by The Office of University Research, U.S. Department of Transportation.
Evaluation of academic computing&mdash;user oriented
Authors: M. Lloyd Edwards
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

In several of the conferences that I have attended in the past year, evaluation of computing services has been a key topic. Individuals from colleges and universities have referred to a need for some type of measure, standard, and/or guideline to aid in such evaluation. Along with the need it is also a general conclusion of many that it is difficult, if not impossible, to evaluate computing services because of the diversity of users in an academic computing environment. To make an evaluation meaningful, sound reasons must be established for doing the evaluation. Measures resulting from a sound evaluation program might serve such purposes as: Evaluation or auditing existing services; Establishing the impact of an increase or change in demand; Judging potential costs; Comparing institutions; Defending budget requests; Polling users regarding needs.
Effects of cache coherency in multiprocessors
Authors: Michel Dubois, Fayė A. Briggs
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

In many commercial multiprocessor systems, each processor accesses the memory through a private cache. One problem that could limit the extensibility of the system and its performance is the enforcement of cache coherence. A mechanism must exist which prevents the existence of several different copies of the same data block in different private caches. In this paper, we present an indepth analysis of the effect of cache coherency in multiprocessors. A novel analytical model for the program behavior of a multitasked system is introduced. The model includes the behavior of each process and the interactions between processes with regard to the sharing of data blocks. An approximation is developed to derive the main effects of the cache coherency contributing to degradations in system performance.
Discrete-relaxation-based heuristic techniques for video algorithm/architecture matching and system level transformations
Authors: M. Potkonjak
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

System level design and computational transformations have been rapidly establishing themselves as important high impact design steps which often have the most influential impact on the most important final performance parameter, throughput, of a design. In this paper, we introduce an iterative heuristic approach for throughput optimization when algorithm-architecture matching, and any of three behavioral transformations, retiming, rephasing, and pipelining, are considered simultaneously. The effectiveness of the approach and optimization algorithms is demonstrated on several video and image processing examples.
Automatic input of flow chart in document image
Authors: S. Ito
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The technology of document image processing has the possibility of automatic document input. By utilizing it, the flow chart in document image as the alternate expression of FORTRAN source statements is automatically input into the computer. The paper reports the algorithm and the experimental results of field segmentation and classification in document image, the recognition of flow chart including control lines and blocks, and hand-written alpha-numerical characters in the blocks and the explanatory fields, the conversion of flow chart into program functions and the generation of FORTRAN source statements. It showed the possibility that program functions such as initialization, input/output format and branch address were determined by the analysis of flow chart and explanatory description under the writing rule of it and also the restriction that the flow chart should have the good quality in order to recognize the flow and characters and be subject to the writing rule.
Graphical systems and two-dimensional mathematical expressions
Authors: James E. George
Venue: Proceedings of the symposium on Two-dimensional man-machine communication (1972)

The additional facilities needed to generate two-dimensional mathematical expression displays and their implications to a graphical language system are discussed and result in a linguistic based graphical system. An elementary mathematical expression display system is used to motivate and illustrate these additional facilities and is defined utilizing a linguistic based graphical meta system. The use of the elementary system is illustrated for the evaluation of expressions, the display of expressions on different display devices and the use of the entire elementary system by a text formatting program to produce linear and two-dimensional text.
THEMIS logic simulator - a mix mode, multi-level, hierarchical, interactive digital circuit simulator
Authors: Mahesh H. Doshi, Roderick B. Sullivan, Donald M. Schuler
Venue: Proceedings of the 21st Design Automation Conference (1984)

A new logic simulator called THEMISTM Logic Simulator for the design of LSI, VLSI and PCBs is described. THEMIS supports design verification and test development from initial specification in behavioral and RTL languages to analysis of the final layout at the gate and switch level. To allow the simulation of an entire system or check the correctness of a single circuit, the different modeling techniques can be easily intermixed. THEMIS is a highly interactive simulator that minimizes a hardware engineer's time and effort to debug logic. This paper gives an overview of THEMIS and its use by design engineers.
Comparison of two information retrieval methods on videotex: Tree-structure versus alphabetical directory
Authors: Jo W. Tombaugh, Scott A. McEwen
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Videotex systems are two-way communnication systems intended to give users access to large amounts of stored information from their homes and offices. These systems link computer databases to modified television sets over the telephone network. A central computer is used as a large information storage device, monitoring requests for information from several users at one time, finding and sending the information to the person who requested it. It is possible however, that the addition of an inexpensive supplement to the hierarchical tree search will improve user search performance without substantially altering the cost-benefits of the menu selection approach. One such method of retrieval is the on-line alphabetical directory approach where users look for a search term from a list of alphabetically organized items by menu selection. An example will indicate the difference between this method and a typical hierarchical search:
Task communication in DEMOS
Authors: Forest Baskett, John H. Howard, John T. Montague
Venue: ACM SIGOPS Operating Systems Review (1977)

This paper describes the fundamentals and some of the details of task communication in DEMOS, the operating system for the CRAY-1 computer being developed at the Los Alamos Scientific Laboratory. The communication mechanism is a message system with several novel features. Messages are sent from one task to another over links. Links are the primary protected objects in the system; they provide both message paths and optional data sharing between tasks. They can be used to represent other objects with capability-like access controls. Links point to the tasks that created them. A task that creates a link determines its contents and possibly restricts its use. A link may be passed from one task to another along with a message sent over some other link subject to the restrictions imposed by the creator of the link being passed. The link based message and data sharing system is an attractive alternative to the semaphore or monitor type of shared variable based operating system on machines with only very simple memory protection mechanisms or on machines connected together in a network.
Queueing delays on virtual circuits using a sliding window flow control scheme
Authors: G. Varghese, W. Chou, A. A. Nilsson
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

A tandem queue model is developed that models the end-to-end delay behavior in networks that employ sliding window flow control. Messages arriving to find the window filled are assumed to be queued outside the network to await their turn to enter. The model is analyzed using a hierarchical decomposition method; the key step entails incorporating the fact that the interdeparture process is not exponentially distributed. End-to-end delay in virtual circuits can then be obtained by modelling a virtual route as a tandem queue [1] using the method of &ldquo;adjusted rates.&rdquo;
Analysis of reliable broadcast in local-area networks
Authors: J. W. Wong, G. Gopal
Venue: Proceedings of the eighth symposium on Data communications (1983)

The performance characteristics of a reliable broadcast protocol in a local-area network environment are analyzed. This protocol involves a source broadcasting a message to all destinations and collecting replies from these destinations. Reliability is achieved by using Send-and-Wait protocols for transmitting broadcast and reply messages. A queueing model is developed and results on the throughput and delay of the broadcast operation are obtained by approximate analysis. Numerical results showing the effect of model parameters on throughput are provided.
An approach for a working relational data system
Authors: Brian Jervis, James L. Parker
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

Users of large data bases and applications programs which access them must be prevented from having to know how the information they access is organized internally. On the other hand, systems programmers must be allowed to arrange the data base in some way which is both natural and convenient to them. This paper proposes a system which acts as an interface between a user or an applications program, and a data base which consists of multiple files of differing types. The system handles all requests for data, and returns the results in a standard way. The most important feature of this system is that it presents a standard view of data that is highly independent of its machine representation.
An experimental evaluation of multivariate graphical point representations
Authors: Leland Wilkinson
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

In a generally optimistic assessment of progress in the psychology of human-computer interaction, Moran [30] reported that the field &ldquo;needs to work more at bringing existing areas of cognitive psychology and traditional human factors to bear on user behavior.&rdquo; This caveat applies especially to the area of computer graphics because of the dearth of experiments and theory on the effectiveness of various types of graphical displays. Broad applications of psychological theory to graphic design have been presented in [6], [19], [28], [32] and [33]. These articles have drawn heavily on Gestalt theory, memory models, and the theory of cognitive schemas in human judgment. They present little experimental evidence relevant to complex visual displays, however.