ppxscal/embedding_network huggingface dataset:
Recursive programming in english for freshmen
Authors: Takayuki Kimura
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

The importance of recursive programming in an introductory computer science course is discussed from the viewpoint that the notions of 'process', 'program' and 'processor' are fundamental in computer programming. Several examples demonstrate how the concept of recursive programming and proving program correctness can be taught to freshman business majors before they are exposed to any programming language.
Consulting is not a matter of facts
Authors: Nancy O. Broadhead
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

We can look at consulting as a function rather than as a personification. More and more, User Services consist of a group of people each having their own different area of expertise. They may each have primary responsibilities in areas quite separate from user consulting. The assembling of a consulting staff can be seen as a three-part ongoing project. First, obtain the people who can bring the necessary variety of skills to the group. Second, make plans to spread the knowledge each brings among the others in the group. Third, the challenge that may bring success or failure to the entire effort, turn the &ldquo;visiting experts&rdquo; into consultants. We have recently had to face the situation of initiating a diverse group of people into the world of consulting.
Information resource management theory training
Authors: John F. Schrage
Venue: Proceedings of the ACM '81 conference (1981)

As with most topics in the information systems area, there is generally a problem with acceptance in educating people about new areas. One of the newest areas for information systems is that of IRM, Information Resource(s) Management. The term has been noted with the &ldquo;R&rdquo; being resource or resources thus resulting in a splitting of fine points to create, for some, two distinct areas. Discussion has resulted in government, business, and education as to what is IRM with the term being analyzed during the last two years in two major information systems curriculum studies.
Models of Pure time-sharing disciplines for resource allocation
Authors: E. G. Coffman,  Jr., R. R. Muntz
Venue: Proceedings of the 1969 24th national conference (1969)

Pure time sharing (PTS) disciplines are those which involve in some way the simultaneous sharing of a processor or other service facility by more than one job at a time. Implicit is the requirement that the total processor capacity is fixed so that individual job processing rates are reduced according as the number of jobs sharing the processor increases. In this paper the general class of such disciplines is surveyed and studied by the investigation of the behavior of mathematical models. By the introduction of appropriate algorithms it is shown how these disciplines can be applied to static processor scheduling problems in which total schedule time is to be minimized. Application of these disciplines to queueing systems is also examined, yielding characterizations which classify the performance measures optimized. The PTS disciplines discussed include one which bases scheduling decisions on the elapsed times of jobs and one which bases decisions on the expected remaining processing times of jobs. The simplest PTS discipline studied is one which makes no explicit use of any processing time information.
An Experiment in senior staff working alongside student consultants
Authors: John Thornton, Agnes Hoey
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

This past Spring, Syracuse University Academic Computing Services (SUACS) had all staff members spend time working with our users at the AID Desk. The staff has progressed from a initial reluctance to an enthusiastic environment with enhanced communications, new ideas, and new learning experiences. The paper discusses the beginnings of our experiment, the reactions of the participants, and some of the resulting ideas.
Systems documentation
Authors: Ricardo Ameneyro, Carolina Arena, Ruben Colmenares, Pedro Cornejo, Rafael Garcia, Eloy Hernandez, Genaro Mariscal, Socrates Rivera
Venue: Proceedings of the 3rd annual international conference on Systems documentation (1984)

We present as a practical case the payroll system developed for the Education Planning and Culture Offices of the Ministry of Public Education. It is the old payroll problem, but payment normativity in the Mexican government and the characteristics of the education sector involve greater complexity. Because the system is for employees' payment, it is important that any modification to the system be done as soon as possible (not more than a week) and with maximum reliability to get the expected results. With these considerations in mind, one of the principal objectives at the beginning of the project was that documentation must be good enough to permit a programmer to become familiar with the system and perform maintenance easily and accurately, even if he or she was not a member of the team that developed it.
A fast and economic scan-to-line-conversion algorithm
Authors: Gerd Woetzel
Venue: ACM SIGGRAPH Computer Graphics (1978)

In order to generate cartographic data bases, it is necessary to digitize a large number of existing base maps. One way of replacing the error-prone and very time-consuming manual digitization by an automatic method is scanning the map and extracting the linework from the resulting binary matrix. A sufficiently fast and economic scan-to-line-conversion algorithm has to be developed for the line extraction. The algorithm presented operates with a skeletonization technique which is further developed from known line thinning methods, so that the scan lines are now skeletonized in a single pass and that only a small number of scan lines has to be held in core storage. The result of this process is equivalent to a multi-pass skeletonization which utilizes a quasi-parallel line thinning in four partitions of the binary matrix for each pass. The data produced by the extraction algorithm following the skeletonization have two important advantages over data produced by manual digitization: First, the nodes corresponding to the line end points are exactly determined and, second, the correction phase is shortened since the automatic process is less error-prone. Time and storage requirements of the implemented algorithm applied to some typical scan data show that the conversion for even a complex line structure can be carried out within the time of scanning and the economic use of core storage makes it possible to implement the algorithm on a minicomputer with an on-line scanner.
The design of a parallel processor for image processing on-board satellites: An application oriented approach
Authors: Gérard Gaillat
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

A parallel MIMD type processor for use in image processing applications on board satellites is described. Emphasis is given to the application requirements in terms of processing power, type of parallelism, communication need and to the impact of these requirements on the architecture design. The choice of a MIMD processor with a ring bus, the convenience of a multiple bus structure, the definition of the bus protocole, the synchronization mechanism and the typical performances are presented as successive choices and discussed in regard of the requirements. Possibilities and limits of the architecture are carefully analyzed: Typical examples of efficiently implementable applications in other fields of image processing are given. But limits of the structure are pointed out for other types of parallel processing.
Toward foundations for the understanding of type
Authors: Douglas T. Ross
Venue: Proceedings of the 1976 conference on Data : Abstraction, definition and structure (1976)

I have now written, have available from SofTech, and have submitted for publication elsewhere, the first two of a series of deep philosophical papers [1, 2] about Plex [3]. Among other things, I believe these papers begin to provide a proper foundation for our endeavors in computer science and software engineering. The trend of these developments is indicated in the following, which I call The Proem of Plex1 and Plex2 [&ldquo;Proem: 1.) A preliminary discourse to a longer piece of writing. 2.) An introductory comment before a speech. 3.) Something that opens or begins.&rdquo;&mdash;Webster's].
Fortran simulation of an oil tanker fleet
Authors: Lowell C. Jerpe
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper describes the design and development of a discrete simulation model (written in Fortran) of a distribution network supplied by a tanker fleet. The model simulates a tanker fleet of up to 50 ships, each of which can visit up to 10 distribution facilities. A total of 30 distribution facilities are allowed. The paper describes how data available only in graphical form was processed for input to the model. A unique method of data verification is also discussed.
The use of simulation for design analysis of an on-line financial application in a multi-programmed environment
Authors: Richard A. Mezger
Venue: Proceedings of the 1969 24th national conference (1969)

In late Spring, 1968, the State Street Bank and Trust Company, Boston, Massachusetts, undertook a simulation study of a large, on-line file inquiry/update application that was being developed to run in one partition of a multi-programmed computer system. An outside consultant firm, with its own proprietary simulation language, assisted in the study. This paper is an outgrowth of that study, and it deals jointly with the system being simulated and with the bank's approach to using simulation as a design analysis tool. Topics covered include defining the study objectives, the study contract, validating the computerized model, and use of the results as an analysis tool. The purpose is, through the use of the specific example, to discuss some general aspects of the value, cost, returns, and difficulties of using simulation and to present guidelines for doing so.
A concurrency control theory for nested transactions (Preliminary Report)
Authors: C. Beeri, P. A. Bernstein, N. Goodman, M. Y. Lai, D. E. Shasha
Venue: Proceedings of the second annual ACM symposium on Principles of distributed computing (1983)

Concurrency control is the activity of synchronizing transactions that access shared data. A concurrency control algorithm is regarded as correct if it ensures that any interleaved execution of transactions is equivalent to a serial one. Such executions are called serializable. Serializability theory provides a method for modelling and analyzing the correctness of concurrency control algorithms [BSW, Pa]. The concept of nested transaction has recently received much attention [GR], [Mo]. In a nested transaction model, each transaction can invoke sub- transactions, which can invoke sub-subtransactions, and so on. The natural modelling concept is the tree log. The leaves of a tree log are atomic operations executed by the underlying system. Internal nodes are operations (as seen by their parents) implemented as transactions (as seen by their children). Nodes are related by a partial order <, where x<y means x executes before y [La].
Relational queries computable in polynomial time (Extended Abstract)
Authors: Neil Immerman
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Query languages for relational databases have received considerable attention. In 1972 Codd [Cod72] showed that two natural mathematical languages for queries-&-mdash;one algebraic and the other a version of first order predicate calculus-&-mdash;had identical powers of expressibility. Query languages which are as expressive as Codd's Relational Calculus are sometimes called complete. This term is misleading, however, because many interesting queries are not expressible in -&-ldquo;complete-&-rdquo; languages. In this paper we show: Theorem 2: The Fixpoint Hierarchy collapses at the first fixpoint level. That is, any query expressible with several applications of least fixpoint can already be expressed with one. We also show: Theorem 1: Let L be a query language consisting of relational calculus plus the least fixpoint operator. Suppose that L contains a relation symbol for a total ordering relation on the domain (e.g. lexicographic ordering). Then the queries expressible in L are exactly the queries computable in polynomial time. Theorem 1 was discovered independantly by M. Vardi [Var82]. It gives a simple syntactic categorization of those queries which can be answered in polynomial time. Of course queries requiring polynomial time in the size of the database are usually prohibitatively expensive. We also consider weaker languages for expressing less complex queries.
Designing simulation experiments to completely rank alternatives
Authors: Thomas A. Bishop
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Many of the problems of selecting the t-best of k populations with respect to a given parameter have been successfully solved for some time. Important applications, including applications to the design and analysis of simulation experiments, have been demonstrated and the tables required for implementation of solutions are easily available (e.g. in Gibbons, Olkin and Sobel (5)). Solutions to the companion problem of completely ranking k populations have been scarce due to their mathematical complexity. This paper discusses examples of complete ranking problems, some recent advances made towards their solution, and cites sources of tables needed for their implementation.
Factoring multivariate polynomials over finite fields
Authors: Arjen K. Lenstra
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

This paper describes an algorithm for the factorization of multivariate polynomials with coefficients in a finite field that is polynomial-time in the degrees of the polynomial to be factored. The algorithm makes use of a new basis reduction algorithm for lattices over IFq.
Database for office automation
Authors: David M. Choy
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

With a fast growth in the quantity and quality of software applications for office systems and advanced workstations, it is becoming clear that the trend is towards a more integrated software architecture for workstation or office systems. A critical piece in a truly integrated system is a well-designed general purpose database mangement system (DBMS) that supports all applications running on the workstation (or office system). Sophisticated DBMSs have been developed on the main frames, primarily for large data processsing (DP) applications. Is it true, then, that all we need is to transport these systems to the workstation? The first problem that one faces to move a full scale DBMS to a workstation is the size. It is not clear that trimming a big DBMS down is an easy task. Some of the advanced capabilities might be modular and relatively easy to remove. Others could be quite difficult as the code is distributed throughout the system. In some cases, it might not even be possible to &ldquo;trim&rdquo; when the general capability is needed but to a lesser extent. In practice, most major DBMSs are built without serious concern on the space restrictions. It might be easier to design and implement a new system with &ldquo;smallness&rdquo; in mind than to trim down a huge one. The considerations on smallness include the data structures, control blocks, interfaces, buffer requirements, configuration and packaging of the system, as well as the number of lines of code. Size is only the beginning. Smallness makes the DBMS possible to run on a workstation. Because of the new operating environment, there are new requirements for the DBMS which are different from the traditional DP environment on a main frame. The real challenge is to determine what these requirements are and how to design a system accordingly. On an advanced workstation, one has to support word processing, data processing, engineering and scientific, administrative, as well as
Computer aided cinematography techniques for model validation
Authors: M. E. Vansuch, R. H. Strand, M. P. Farrell
Venue: Proceedings of the ACM 1980 annual conference (1980)

Graphical display is a tool for visualizing patterns through quantification of dimensions or parameters that may not be observable by tabular methods. This paper focuses on graphical display where greater than 2 dimensions or parameters are being iteratively evaluated. The specific techniques included in this paper are: (1) two-dimensional plotting of hydrologic flow, with time as a third dimension; (2) three- dimensional plotting of vegetational biomass on a landscape coordinate system; and (3) three-dimensional plotting of carbon monoxide concentrations in a coal gasification facility versus hour-of-day and location with sequential plotting of each day for an extended time period. Each of these examples of cinematography illustrates patterns in data with time- or space-varying parameters. Specific statistical parameters such as the coefficient variation have been used to idenitfy potential patterns of interest. Graphic cinematography is useful for (a) recognition of pattern where a single two-dimensional or three-dimensional display fails to reveal important features, (b) rapid review of data, (c) easy display of various combinations of parameters, and (d) evaluations of large volume temporal data.
Keynote address [summary]: Education before training
Authors: Anthony Ralston
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

The first quarter century of computing has produced a small army of obsolete or obsolescent programmers - although most of them are still employed because their supervisors seldom understand that they are not competent. The cause of this obsolescence is only partly the rapid rate of change of computer technology and science; more important is the undereducation or bad education of many people who have entered our - and the term is used loosely - profession. Training can help but it won't solve the problem. Too many of these people are really untrainable because they lack the educational underpinnings which would enable them to learn new knowledge and techniques. Since the underlying basis of any training or retraining program should be a sound educational base, it is vital that we attempt to avoid the mistakes of the past and present by better educational programs in the future. The first course in computer science is vitally important in this respect; attitudes and orientation which result from this course will help - or plague - the programmer throughout his career. The crucial questions about such a course are: - Does it introduce the student to computer science as well as to a programming language? - Is the programming content taught with a breadth of view rather than narrowly focussed on one language? - Does the approach to programming stress principles and good technique rather than a haphazard, cookbook approach?
Image Basic Features Indexing Techniques for Video Skimming
Authors: V. Di Lecce, A. Guerriero, G. Dimauro, S. Impedovo, G. Pirlo, A. Salzo
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper a comparison of the most widespread automatic indexing techniques, suitable in skimmed video generation, and their performances is presented. To evaluate the performances, using the low level frame features the signatures are computed, the shots are identified using a neural network clustering techniques, in each shot the mean distance between contiguous frames is computed and the shot is resampled according to related distance value to produce a skimmed video sequence. The most relevant feature proves to be the angular spectrum. Using this feature the mean value of the skimming factor is 2.6 in the used test set.
Using business concepts to evaluate large multi-level business systems&mdash;some applied techniques
Authors: COMMANDER STEPHEN R. RUTH
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

The only value of measurement and evaluation in business-related programs is to save money. The most traditional economic maxim, that of marginal analysis, can be applied to the selection of the best mix of measurement and evaluation techniques. Three types of measurement are discussed. Improvements to vendor software, application programs and compilers each give the data processing manager an area for making the same kind of economic analysis which his counterparts in other segments face. Brief examples and discussions of each are also given. This paper suggests that the most fundamental unit&mdash;one understood by manager and worker&mdash;dollar cost&mdash; can be a basic element of any decision system involving measurement and evaluation of a system or its segments.
Simulation hierarchy for microprocessor design
Authors: Will Sherwood
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

There are many levels of abstraction through which a designer passes when implementing a microprocessor chip set or system. He usually begins by configuring the application for the microprocessor, bus, and peripherals (memory, etc.). Section at a time, he expands the system components into a Register Transfer level diagram, followed by a detailed chip or gate description. This paper will show how a hierarchical simulator aids each phase in the design by modeling elements at all levels from the processor as a black box down to gate expansion. This procedure parallels the design process for verification and allows experimentation at each stage. The SAGE2 (Simulation of Asynchronous Gate Elements - Version 2) system will be used to show the features and benefits of incorporating a hierarchical simulator into the design process. Related simulation tools will be discussed as well as hierarchical modeling considerations. Examples are shown throughout to show microprocessor system debugging features.
Multitype multiprogramming: Probability models and numerical procedures
Authors: Donald P. Gaver, George Humfeld
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

The purpose of the present paper is to study systems in which different job types are present at the various servers and are processed according to a variety of scheduling disciplines, in particular in &ldquo;first-come, first-served&rdquo; order. Our approach is numerical, and is applied to an example which is also analyzed by means of the Gordon and Newell (GN) model. Using a plausible method of fitting the latter provides a reasonably, satisfactory approximation to the &ldquo;true&rdquo; multitype system parameters.
An interactive system for reporting hardware and software problems
Authors: Juanita Petrone
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

This paper describes a new interactive visual-display system that provides a means of informing the Virginia Tech Computer Center's Systems Department of problems with the operating system that users have encountered. These problems arise from two sources: the users who report system problems to the User Services Department, and the Computing Center personnel who discover problems while using the system. Only the Computing Center personnel have access to the interactive visual-display system. They use it to inform the Systems Department of their own problems with the system as well as system problems experienced and reported by others.