ppxscal/embedding_network huggingface dataset:
Morphological Interpolation and Color Images
Authors: Marcin Iwanowski, Jean Serra
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper regards the application of interpolation tools offered by mathematical morphology to color images. The approach presented here uses the lexicographic ordering to compare values of the pixels. These comparisons are performed in a new, transformed color space - the comparative color space, which is essential with respect to the visual importance of color channels for the human perception.By combining the morphological median and the proposed approach to treatment of color images, an efficient and fully automatic method of creation of color interpolation sequence has been obtained. It enables entirely automatic creation of morphing sequence for some types of images.However, certain classes of images contain sensitive areas. In order to control the behavior of such areas, control points are introduced. Starting from the control points and two initial images, a warped morphological median is created, which is then used instead of a simple morphological median to create a deformation sequence for the mentioned images with sensitive areas.
SIGNUM a spectrum of mathematical software considerations&mdash;1975 (Paper Session)
Authors: David S. Cochran, M. K. Gordon, Michael Minkoff, John C. Knight, Gabor T. Herman, Arnold Lent, Peter H. Lutz
Venue: Proceedings of the 1975 annual conference (1975)

In this session, mathematical software developments are considered which range across the spectrum of computer technologies available in 1975. At one end of the spectrum algorithm development for scientific pocket calculators is presented. At the extreme other end of the spectrum the impact on mathematical software development of advanced systems like the Control Data Corporation STAR-100 and the Texas Instruments, Inc. Advanced scientific Computer (ASC) is discussed. Concomitant with the latter end of the spectrum, an algorithm for solving large systems of inequalities is developed. More towards the conventional middle of this spectrum, some new developments in solving (1) initial value problems for ordinary differential equations and (2) constrained nonlinear optimization problems are discussed.
The exact solution of systems of linear equations with polynomial coefficients
Authors: Michael T. McClellan
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

An algorithm for computing exactly a general solution to a system of linear equations with coefficients that are polynomials over the integers is presented. The algorithm applies mod-p mappings and then evaluation mappings, eventually solving linear systems of equations with coefficients in GF(p) by a special Gaussian elimination algorithm. Then by applying interpolation and the Chinese Remainder Theorem a general solution is obtained. For a consistent system, the evaluation-interpolation part of the algorithm computes the determinantal RRE form of the mod-p reduced augmented system matrices. The Chinese Remainder Theorem then uses these to construct an RRE matrix with polynomial entries over the integers, from which a general solution is constructed. For an inconsistent system, only one mod-p mapping is needed. The average computing time for the algorithm is obtained and compared to that for the exact division method. The new method is found to be far superior. Also, a mod-p/evaluation mapping algorithm for computing matrix products is discussed briefly.
A formal approach to code optimization
Authors: Alfred V. Aho, Ravi Sethi, J. D. Ullman
Venue: Proceedings of a symposium on Compiler optimization (1970)

We examine from a formal point of view some problems which arise in code optimization and present some of the results which can come from such an approach. Specifically, a set of transformations which characterize optimization algorithms for straight line code is presented. Then we present an algorithm which produces machine code for evaluating arithmetic expressions on machines with N &ge; 1 general purpose registers. We can prove that this algorithm produces optimal code when the cost criterion is the length of machine code generated.
Evaluating computer graphics systems organizations
Authors: R. A. Ellis
Venue: Proceedings of the 1975 annual conference (1975)

In many situations the potential user of a high-performance computer graphics system must not only select a specific system, but he must also determine which generic type of system best serves his needs. Of course, this is not always the case because frequently he is constrained by the local environment; an appropriate graphics system may already exist or the biases of the computing scene may favor a particular system organization. Never the less, the potential user may still have to select among several different graphics systems. We will be discussing high-performance graphics systems. By this is meant the ability to display at least a few thousand lines and most likely hardware capability for rotation, translation, and clipping of the image. The term graphics device or display includes the actual display tube and associated driving electronics, any special-purpose hardware and possibly a small computer if the computer is used strictly to control the graphics device and is not available for general-purpose computing even if such computing is related to the graphics application.
Some observations on field trials as a means for assessing the impact of new technology systems
Authors: Michael Gurstein, Fernande Faulkner
Venue: ACM SIGOA Newsletter (1984)

We have, over the last several years, had the opportunity to participate as observers/impact assessors/evaluators of field trials or pilot studies of a number of new computer and telecommunications technology systems. We thought it might be useful to reflect on our work and on field trials/pilots as a process to see whether some lessons might be drawn over and above the details of the specific trials.
An exercise in constructing multi-phase communication protocols
Authors: C. H. Chow, M. G. Gouda, S. S. Lam
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

Many real-life protocols can be observed to go through different phases performing a distinct function in each phase. We present a multi-phase model for such protocols. A phase is formally defined to be a network of communicating finite state machines with certain desirable correctness properties; these include proper termination, and freedom from deadlocks and unspecified receptions. A multi-function protocol is constructed by first constructing separate phases to perform its different functions. We discuss how to connect these phases together to implement the multi-function protocol such that the resulting network of communicating finite state machines is also a phase (i.e. it possesses the desirable properties defined for phases). A high-level session control protocol modeled after one in IBM's Systems Network Architecture is discussed, and constructed as a multi-phase protocol.
Computer aided exam generation (Session Summary): Some thoughts on a taxonomy of related efforts Richard Brewer
Authors: Lorrie Lawrence Hoffman, Jesse M. Heines
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The first efforts directed at bringing to bear the power of the computer to the task of constructing an exam are doubtless lost to history, but as with events in the pre-history of many areas, a reasonable reconstruction is possible. From such a reconstruction come many useful suggestions for a possible taxonomy of this sort of endeavor although one must be careful to realize that more than one genesis is involved. I wish to suggest two basic categories that might be useful at the start: compositional aids and derivational aids. Perhaps the word &ldquo;aids&rdquo; is itself misleading since the degree of computational involvement, itself a separate dimension, can be small or great independently of the category of aid. The term compositional refers to the use of automation to compose an exam from an existing base of questions. Considerable variation can be found in the form of this base. The term derivational refers to the use of computation to derive the questions themselves from some form of data base. As with so many complex fields, there is not a simple way to draw a line between the two; difference observers may categorize borderline cases differently. At the extreme, the process of derivation is the product of research in the area known as artificial intelligence. The problem involved in question answering are virtually identical with those in question formulation.
HARD - hardware simulation in education
Authors: Ivan Tomek
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Introduction to digital circuits and computer organization is usually a required course in computer science curricula. The subject is often taught as a textbook course although experience shows that students enormously benefit from simple laboratory experiments and enjoy them. Another form of contact with basic physical realities is via computer simulation of hardware. The use of simulation can not only replace experiments if necessary but also add insight into aspects of the function of hardware not easily observable in the lab, such as the effect of delays and noise and allow the study of phenomena that cannot be observed such as data transfer between registers hidden inside a component. Exposure to simulation also introduces students to one major application of computers - simulation - which is often some-what neglected in computer science curricula. Moreover, simulation is becoming an essential component of design and student's perspective of the design process is incomplete without some experience with it. Three main reasons why hardware simulation is not usually used in introductory hardware courses are the orientation of typical hardware simulation languages towards the professional designer and the resulting structure poorly suited for education, the scarcity of easily available, inexpensive, and portable languages, and the lack of coverage of the subject in most textbooks on hardware. A hardware simulation language called HARD developed at Acadia University is an attempt to remedy the above mentioned problems. It is designed specifically for education. It includes features typically required in a computer organization course, namely simulation at the gate and RTL levels, and simulation of delays and noise. The syntax is quite flexible in that there are practically no reserved words. The language is not based on any programming language so that no previous experience with computers is necessary. The structure of circuit descriptions is natural and English-like. The translator and simulator are interactive. The language allows modular descriptions and their connections into multi-level hierarchies as required by the problem. The system is very portable since it is written in Pascal with a minimal use of non-standard features. The language is not as complete as a professional design tool since its intended use is in education. It is, however, expected that new features will be added to it in the future in response to the feedback from the system's users.
A hardware stochastic interpolator for raster displays
Authors: Timothy S. Piper, Alain Fournier
Venue: ACM SIGGRAPH Computer Graphics (1984)

Stochastic modeling has found uses so far mainly for expensive very realistic graphics display. The cost of rendering is not intrinsic to the technique, but mainly due to the high resolution and the sophisticated display techniques which accompany it. We describe here a basic tool for a less expensive approach to stochastic modeling which is designed for a more &ldquo;down to earth&rdquo; type of application, and brings the display of stochastic models nearer to real-time. A special purpose board for stochastic interpolation has been built, which can generate an array of up to 129&times;129 12 bit stochastic values to be used by the rest of the display system as a texture source, or for more elaborate algorithms. The board functions as a coprocessor in a traditional frame buffer system, and includes a micro-coded bit-slice processor, a multiplier, special hardware to generate uniformly distributed random numbers, memory to store a look-up table for random numbers with the required distribution, and two buffers for the resulting arrays. The current implementation generates values at less than 4 microseconds per point, and in conjunction with a standard graphics processor can display nearly 10000 stochastic points in real-time, or can update a full screen of stochastic values in less than one second. Illustrations are given of the output of the board and of pictures and animations generated with it.
A measure for memory utilization
Authors: Yin Wei
Venue: Proceedings of the ACM annual conference (1973)

As the computer users getting more sophisticated, the demand for more memory has been growing. At a computer installation, the cost of memory often exceeds the cost of CPU. As a result the efficient utilization of memory has received much attention of the computer system managers and analysts. This fact is evidenced by the effort in monitoring memory location activities at major computer centers and many published articles such as those by Luderer1 and Denning.2 Here the memory utilization is defined and discussed from the point view of system performance. This definition of utilization may be applied to all levels of storage such as drum, disk and tape. Also, the guiding principle for memory management will be discussed.
Human factors studies with system message styles (abstract only)
Authors: Ben Shneiderman
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Computer systems often contain messages which are imprecise ('SYNTAX ERROR'), hostile ('FATAL ERROR, RUN ABORTED'), cryptic ('IEH291H'), or obscure ('CTL DAMAGE, TRANS ERR'). Such messages may be acceptable to computer professionals who regularly use a specific system, but they lead to frustration for novices and for professionals who are using new features or facilities.We have conducted five studies using COBOL compiler syntax errors and text editor command errors to measure the impact of improving the wording of system messages. The results indicate that increased specificity, more positive tone, and greater clarity can improve correction rates and user satisfaction.An overview of the experimental results will be presented along with guidelines for writing system messages.
Robustness and analytic computer system models
Authors: R. Vavra, W. R. Franta
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The use of simulation studies to investigate the behavior of computer hardware/software systems is well established, although in some sense analytic models are more desirable. Simulation is used in a situation which is completely intractable to analytic machinery, or for which the essence is lost when the prerequisite abstractions and simplifying assumptions necessary to the analytic technique are made. In this paper, the term analytic model is used to refer to that set of computer system models based upon queuing theory. Many view the operating system as a network of resources each potentially precipitating queues. Such a view allows the units passing through the network to request (employ) the devices in various combinations in a multiprogramming environment. The computing system is thus viewed as sequences of resource seizures and releases (processors, memory and input-output equipment) with appropriate holding time assumptions. In many cases, the models indicate rather clearly how various policies and variables interact to effect system performance, and the predictions of some coincide well with measurable data.
Computer education for secondary school mathematics teachers
Authors: Kenneth J. Travers
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

This paper discusses the role of computer education in the training of high school mathematics teachers, including rationale, motivation, suggested topics and their implementation in the college classroom. The rationale has to do mainly with a general updating of training programs to reflect the increasingly technological nature of our world. The emergence of the computer now makes possible new approaches to the subject matter which can provide the student with added insights as to the nature of mathematics and his own abilities to deal with it. The computer education component of the teacher-training program has three broad divisions: (1) general orientation to computers, and basic skills in programming, (2) study of computer applications to problems in mathematics, (3) consideration of influence of the computer on secondary school mathematics education (curriculum, instruction, administrative practice, etc.). These three areas are delt with in three separate courses at the University of Illinois, which are described.
A simulation of an export commodity distribution system
Authors: A. J. Parker
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A stochastic model describes the flow of commodities through a distribution system for export. Primary emphasis is placed on the role of the decision maker (merchandizing manager) of the system, the means of transportation, and the export facility (export elevator). In the model appear submodels of descriptive, heuristic, and normative-analytic types. The output of the model gives all of the relevant costs associated with the system and has implications as to the physical configuration of the export facility.
Closed loop stability controls for s-aloha satellite communications
Authors: Mario Gerla, Leonard Kleinrock
Venue: Proceedings of the fifth symposium on Data communications (1977)

S-ALOHA channels are intrinsically unstable and must be equipped with proper controls. The function of the controls is to dynamically adjust the ALOHA channel transmission gates in accordance with the dynamic load fluctuations. The purpose of the controls is to protect the channel from unstable behavior while optimizing channel efficiency and performance during normal operating conditions. Two control algorithms are proposed: the Closed Loop Control-Collision Detect (CLC-CD) algorithm, which assumes the capability of distinguishing collision slots from empty slots at the receiving station; and the Closed Loop Control-Collision Non-Detect (CLC-CND) algorithm, which does not require such capability. The control implementation is distributed among all stations. Channel stability and efficiency is achieved by driving the total transmission and retransmission rate to unity, using a feedback, closed loop control approach. A family of simulation runs was made to evaluate and compare the performance of the CLC schemes with that of other schemes in a variety of traffic conditions. Simulation results show that the controlled systems converge to near optimality at steady state. Futhermore, the performance of the CLC-CND algorithms is about equivalent to that of the CLC-CD algorithm, thus indicating that the requirement of distinguishing collisions from empty slots is not critical for the performance of closed loop controls. The stability properties of the CLC algorithms and their superiority over other schemes for varying load patterns are demonstrated in a series of experiments involving cyclic traffic patterns and pulse patterns. The CLC scheme displays better performance than the uncontrolled schemes as well as the previously proposed control schemes (namely, the Control Limit scheme and the Retransmission Control scheme) even when the latter are specifically tuned to handle the traffic pattern under consideration (the CLC scheme does not require any prior setting of the parameters).
Data transmission network computer-to-computer study
Authors: P. J. Trafton, H. A. Blank, N. F. McAllister
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

This study addresses the problems of designing a low undetected error rate (e. g., 10&minus;8) communication system for the transmission of large quantities of computer data between two remote locations. The study effort includes a characterization of the interconnect channels, and an analysis, evaluation and recommendations for coding techniques. The channel characterization effort is directed toward producing a model of the interconnect links. The model is shown to be representative of real interconnect links based on a comparison with measured bit error data. The error correcting coding effort is directed toward the development and evaluation of forward error correcting (FEC) coding techniques based on generalized burst trapping codes. In addition, consideration is given to automatic repeat request (ARQ) error control. Several basic approaches to providing error control for the computer-to-computer data transmission channel are considered.
Symbol manipulation with an associative memory
Authors: Robert R. Seeber
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

In extending the capabilities of a computer in the direction of solving what might be called problems of higher intellect, much work has been done, on association list structures and on programs for processing lists. A typical word in such a structure would be divided into two halves, each of which would &ldquo;point&rdquo; to, i.e., give the address of, another word. From such a word it is possible to determine a pair of successor words. Determining the predecessor may not be easy, particularly where common substructure is permitted, that is, where some list may serve as a portion of two or more lists without in itself being repeated.
Microprogramming of a burst structure
Authors: G. M. Foujoulat
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The aim of this research is to improve the efficiency of Control Units by transfering the management of Disk Drivers into peripheral sub-processors. Synchronization between these sub-processors is performed by a microprogrammed Control Unit. Microprogramming is necessary to allow modifications of the scheduling algorithm and simplifies the hardware structure. Here in we present microprogramming and hardware architecture which have been designed to manage the communication between several sub-processors, by way of a single Control Storage.
Equations between regular terms and an application to process logic
Authors: Ashok Chandra, Joe Halpern, Albert Meyer, Rohit Parikh
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

Regular terms with the Kleene operations &ugr;,;, and * can be thought of as operators on languages, generating other languages. An equation r1 &equil; r2 between two such terms is said to be satisfiable just in case languages exist which make this equation true. We show that the satisfiability problem even for *-free regular terms is undecidable. Similar techniques are used to show that a very natural extension of the Process Logic of Harel, Kozen and Parikh is undecidable.