ppxscal/embedding_network huggingface dataset:
Invitation to artificial intelligence
Authors: Robert N. D'heedene
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Artificial Intelligence (AI) is intelligence displayed by non-living objects, that is, machines. The possibility of creating intelligent machines has been a motivating force behind a great deal of computing machine development. The methods of AI are not only of historical interest, but are powerful in themselves. Artificial Intelligence therefore deserves a prominent place in the undergraduate Computer Science curriculum. This paper discusses the pedagogical advantages of emphasizing AI in upper level courses, reasons for its present neglect, and the importance of introducing AI study.
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems
Authors: Harold N. Gabow
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Efficient algorithms are given for the bidirected network flow problem and the degree-constrained subgraph problem. Four versions of each are solved, depending on whether edge capacities/multiplicities are one or arbitrary, and whether maximum value/maximum cardinality or minimum cost/maximum weight is the objective. A version of the shortest path problem is also efficiently solved. The algorithms use a reduction technique that solves one problem instance by reducing to a number of problems.
Automatic synthesis&mdash;programs and plans
Authors: Cordell Green, Richard Fikes
Venue: Proceedings of the 1976 annual conference (1976)

This session focuses on the continuing effort to develop automatic techniques for transforming a specification of &ldquo;what&rdquo; is to be done into a specification of &ldquo;how&rdquo; the &ldquo;what&rdquo; is to be done. One presentation deals with programming tasks, where the results of the transformation are executable computer programs. The other with tasks being carried out by people or organizations, where the results of the transformation are plans and schedules.
Extracting Multispectral Edges in Satellite Images over Agricultural Fields
Authors: Anna Rydberg, Gunilla Borgefors
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This article presents a multi-spectral edge detection method that combines the best approaches from several sources. It uses all available multi-spectral information, by adding the magnitudes and directions of edges derived from edge detection in single bands, instead of just taking the maximum, which is commonly done. The addition is weighted on the edge direction, to remove noise and enhance the "major direction". The resulting image is then thinned using magnitude and direction information, together with hysteresis thresholding, so that weak edges can be preserved without adding too much noise. Small gaps in the edges are filled in. All edges between areas with different spectral characteristics are detected. The same technique could also be used for edge detection in multi-temporal images, or even multi-temporal/ multi-spectral images. The edge image can then be used for further analysis, such as field segmentation and subsequent classification.
JABR 265
Authors: Robert Novak, Aaron Chun, Jay Goldberg, Bernard Sivin
Venue: Proceedings of the 1975 annual conference (1975)

The design for the JABR 265 8-bit minicomputer was done as part of the coursework for a class at the University of Illinois. The class was Computer Science 265, a logic design laboratory taught by Professor M. Faiman. The processor was designed to be built with the U of I's 'Excel' logic design boxes. There are three main principals or 'themes' upon which the design of this processor is based: (1) Memory is paged, (2) the CPU contains a register file, and (3) the processor is microprogrammed. The decision to use a paging scheme for addressing is based on the simple fact that 8 bits provide an extremely limited addressing capability. The use of a register 'file' made the implementation of the 3rd 'theme' simpler since 'spare' registers were used for scratchpads and there were still plenty of registers for both dedicated user and CPU usage. By designing the processor as a microprogrammed machine, the actual hardware implementation was simplified.
APLDOT an APL programmer's modeling language
Authors: Stephen R. Kruba
Venue: ACM SIGAPL APL Quote Quad (1983)

APLDOT is a general purpose modeling language that has been used successfully in a variety of applications. To date, it has found widest applicability as an extension to APL in complex modeling problems. APLDOT significantly amplifies the power of APL by: (1) providing a useful model hierarchy; (2) providing additional indexing paths into the model; and (3) by handling calculational precedence (APLDOT is a non-procedural language).
The phantom customer and marked customer methods for optimization of closed queueing networks with blocking and general service times
Authors: Rajan Suri, Xiren Cao
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

This paper is based on a recent technique called perturbation analysis of discrete event systems. The aims of the paper are two-fold. The first, is to bring this technique, which is still relatively new, to the attention of a wider audience, since the method is particularly relevant to practical systems optimization. The second, is to develop two new methods, the phantom customer method and the marked customer method, as extensions of the perturbation analysis approach. These methods enable efficient and accurate optimization of closed queueing networks with blocking and general service-time distributions. Useful practical applications of these methods would be for optimization of performance of computer systems, communication networks, and automated manufacturing complexes. The accuracy of the methods is illustrated by several numerical examples.
Reduction of the order of a nonlinear system
Authors: Joseph Roge Amyot
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A steam-driven electrical power generating station was designed with the aid of a hybrid computer simulation. In the process, it was advantageous to reduce the order of the system of nonlinear equations describing the boilers and turbines. Since there is no general procedure for reducing the order of nonlinear systems, each case must be treated individually. However, the methods used in one system are sometimes applicable to others. The approach taken in the above reduction is presented with this in mind.
Data structures for CAD object description
Authors: M. Lacroix, A. Pirotte
Venue: Proceedings of the 18th Design Automation Conference (1981)

Designing databases allowing the inter-application communication of designs in integrated CAD systems is a very complex task. A way of breaking this complexity consists in clearly separating the logical and physical concerns in database design. A data model well-suited to the logical description of elaborate objects such as those handled in CAD in electronics is presented. It is argued to be more adapted to the CAD needs than the hierarchic, network and relational data models.
Convex shape reconstruction from noisy ray probe measurements
Authors: J. S. Lerman, S. R. Kulkarni
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Two algorithms for two-dimensional convex shape reconstruction from noisy ray probe measurements are developed and compared. Given a coordinate system located within the object, the data consists of a finite set of angles together with the corresponding radial distances to the boundary corrupted by additive noise. We first characterize when such data is consistent with some convex shape. The algorithms estimate the target shape by finding the consistent set of probe measurements that is closest to the original noisy data. A direct formulation leads to a quadratic minimization problem with nonlinear constraints. By applying a simple transformation, an alternative algorithm is developed that trades off performance for computational simplicity as it requires quadratic minimization with linear constraints. Both algorithms are successfully applied to a variety of shapes with substantial noise.
The shaded surface display of large molecules
Authors: Thomas K Porter
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

The complexity of computer generated images is often restricted by the storage requirements of the data and the processing time in keeping it sorted. A method is presented which alleviates the burden of storing and sorting for one previously published hidden surface algorithm.
Elementary computer literacy (SIGCAS)
Authors: Orrin Taulbee, Philip L. Miller, Robert Hare
Venue: Proceedings of the ACM '81 conference (1981)

Computer science departments have spent a large percentage of their efforts on educating majors. This is as it should have been since there was a need to establish an identity for computer science. This task is by no means complete, but it is far enough along that more attention can be directed to the large numbers of students who do not want to be majors. Departments are beginning to respond to students who want a minor - particularly those who are majoring in the sciences. But, other than providing what might be labeled &ldquo;computer appreciation&rdquo; courses or introductory programming courses, little has been done for the large body of non-science majors. The challenge is; what should be the content of a course in which the assumption must be made that this is the only opportunity for the student to study commuter science as an undergraduate? My remarks will be directed toward answering this question.
A simulation model for overseas telephone operations districts
Authors: Randall Bolten
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The American Telephone and Telegraph Long Lines Department is responsible for international telephone traffic. To handle this traffic Long Lines has eight International Operating Centers (IOC), or districts, throughout the country. In the system, variable factors include the number and schedules of telephone operators, circuitry configurations, and country data such as traffic volume and quality of service. As a result of this multiplicity of factors; the effects of proposed or expected changes in the system are extremely difficult to estimate computationally. The model described here is a computer program written in the GPSS-V simulation language which simulates stochastically each event in the handling of overseas telephone calls through an IOC for a period of up to 24 hours.
Fast programs for initial segments and polynomial time computation in weak models of arithmetic (Preliminary Abstract)
Authors: Deborah Joseph, Paul Young
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper we study two alternative approaches for investigating whether NP complete sets have fast algorithms. One is to ask whether there are long initial segments on which such sets are easily decidable by relatively short programs. The other approach is to ask whether there are weak fragments of arithmetic for which it is consistent to believe that P &equil; NP. We show, perhaps surprisingly, that the two questions are equivalent: It is consistent to believe that P &equil; NP in certain models of weak arithmetic theories iff it is true (in the standard model of computation) that there are infinitely many initial segments on which satisfiability is polynomially decidable by programs that are much shorter than the length of the initial segment.
Proving properties of shared data structures application to functional programming
Authors: J. Hagelstein
Venue: Proceedings of the ACM '82 conference (1982)

We describe a proof-oriented semantics for languages handling shared pointer structures. The main difficulty is to describe the store containing the pointer structure in an appropriate way. On the one hand, it should be easy to express the effect of the instructions handling pointers and on the other, it should be possible to state high-level properties of the structure (involving the concepts of lists, graphs,...). We review the previous works and propose an original solution which considers the store as a graph described by means of a collection of trees. This allows us to use a calculus of recursive functions in the domain of trees to specify properties of the pointer structure. We have chosen to illustrate those concepts in the case of a functional programming language, as no proof-oriented semantics of pointer handling has been proposed for such languages. To perform symbolic execution, we need to record both the value and the effect of a program at different stages of evaluation. To do so, we use the states (p;e)where p is a partially evaluated program and e is a store (described as stated above). To obtain a suitable proof method, we define (p;e) in a way which hides all details that are not observable by the user of the language. We axiomatize the needed relations between these pairs and use the resulting axioms as a basis of a formal proof technique, where the proofs proceed by symbolic execution and induction over trees. The language Lisp has been chosen because it is well-known. Nevertheless, no prior knowledge in Lisp is required.
On the use of the linear assignment algorithm in module placement
Authors: Sheldon B. Akers
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper examines the application of the computationally powerful linear assignment algorithm to the placement problem. A brief description of the algorithm is given, followed by a discussion of its use with various problem constraints, for improving existing placements, and in a constructive-initial placement procedure. Several examples are included.
Provable programming
Authors: Donald I. Good
Venue: Proceedings of the international conference on Reliable software (1975)

Techniques are presented for the design of computer programs that are proved to meet stated specifications. The design strategy is the simultaneous step-wise refinement of both the program and its proof so that at each step the program constructed so far is proved. At each step, the specifications for a single program unit are given, the unit is designed, and then proved, by automatically supportable methods, before going on to successive steps. The proof i) shows that the program unit meets its specifications, ii) exhibits any assumptions the unit makes about the problem domain, and iii) defines the specifications for units to be designed in later steps. The design process is based on the refinement of operational and data abstractions in both the program and its specifications. These abstractions are what allow the proof at each step to be supported by automatic, or interactive, program proving systems. The abstractions also keep the proofs of the individual units at an appropriate level of abstraction and also largely independent, thus significantly reducing the size of the complete proof of the entire program. These techniques of provable programming are illustrated by two examples.
VERDI: A computer aided design system for development and city planning
Authors: M. Bouyat, H. Botta, J. C. Vignat
Venue: Proceedings of the 20th Design Automation Conference (1983)

The system presented is a C.A.D. system for use in planning Road and Other Facility Networks. Taking a draft master plan as its point of departure it makes it possible: - to plan in a dynamic fashion since it permits the back-and-forth study of the interconnections between the design of the master plan and network design, - to preserve, from one work session to another, data which has already been acquired and calculated, - to make relevant technical evaluations in the following three fields: earthworks, road, and sewerage networks.
Computer science education in small colleges
Authors: Richard Austing, Gerald Engel
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

A Subcommittee on Small College Programs, was appointed by the Committee on Curriculum in Computer Science, of the Association for Computing Machinery in 1969. This group was charged with responsibility of making recommendations for the development of programs in computer science in smaller colleges and universities. The report will consider course structure, to be offered with the constraints of limited faculty, and with a wide variety of objectives. Outlines of the key courses will be included, as well as recommendations for independent study courses. Another significant factor involved in these considerations, is the relationship of computer science to the computer center, and to the college as a whole. In particular, the service nature of the department and the center, and the development of meaningful computer use within the schools will be considered. Finally, recommendations will be given regarding faculty acquisition and development.
Experimental comparison of two interpretation methods of APL.
Authors: Dimitri Tusera
Venue: Proceedings of seventh international conference on APL (1975)

A new interpretation method of APL inspired by the work of P.S.Abrams [1] was elaborated by the autor [2]. Our objective is to describe the results of an experimental comparison of the usual interpretation method with the proposed one and to deduce the conclusions from them. Section 1 of this paper contains a short description of the compared methods. The results of measurements are introduced in Section 2. Section 3 gives the conclusions that may be deduced from the established experience.
On the locus of program flow within and among secondary functions
Authors: Garth H. Foster
Venue: Proceedings of the international conference on APL: part 1 (1979)

Several authors have considered the problem of control of program flow in secondary (user-written) functions in APL and forms which would give APL equivalents of the control structures of more traditional languages have been proposed. Rather than expanding or altering the means of controlling program flow in APL, this paper suggests restricting the forms, but not the power, of branching. The motivation and implications are presented and the advantages and disadvantages are weighed. Problems of migration of functions and questions regarding the resumption of suspended functions are considered. Consideration of function call and the system variable, @@@@LC, suggests a generalization of secondary-function execution with regard to program flow among user-written functions. This provides an alternate view of suspended functions and permits branching to be generalized to include co-routines.
Factionalism versus fraternalism in computing: A plea for the latter
Authors: Ronald S. Lemos
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

Computing is currently characterized by an undesirable trend towards factionalism. Factionalism is the consequence of the immature evolutionary status of computing as an inexact science. The optimist (uniglots, rhythmists, stylizers, and communicants) and pessimist factions are described. An advocacy for a move from factionalism towards fraternalism is presented. The multidisciplinary nature of computing is discussed with its implications for alternative problem perspectives. The need for experimentalism in computing is emphasized. The proposed move from factionalism to fraternalism will encourage the balanced objectivity necessary for the further evolutionary development of computing as a formal discipline.
APL unary matrix operators as represented by the eighth order Dihedral group
Authors: John H. Crayton
Venue: Proceedings of the sixth international conference on APL (1974)

The unary matrix functions transpose, reverse, and rotate form a group of operators over the standard group of m x n matrices under addition. Moreover, the operators themselves form a group proved isomorphic to the eighth-order Dihedral group, D 4.
Role conflict and ambiguity: Critical variables in the MIS user-designer relationship
Authors: Robert P. Bostrom
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

One way to make progress in improving the probability of successful Management Information Systems (MIS) and Management Science and Operation Research (MS/OR)1 projects is to take the view that the design process is a politically-based, planned change process. The political dimension emphasizes that MIS design is inevitable imbedded in an organization with a political order which acts to shape and constrain the design and use of an MIS. The planned change dimension emphasizes the interaction process and relationships among the participants in the design process. Recent articles in the MIS/MS literature have suggested that the politically-based change approach is the most viable for understanding and managing the design process and enhancing the chances for a successful system (for example, see: Bostrom and Heinen, 1977; Keen and Gerson, 1977; and Ginzberg, 1978). But to date little research, other than case studies, has been conducted with this focus.
A generalized assertion language
Authors: Tsun S. Chow
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The motivation behind the work in debugging languages is to provide the programmer with primitives so that he may search for events during execution, which are suspected to be anomalous. Events that may be specified by most existing debugging languages are very elementary. Also, there are no facilities to combine them into more complex events. Even though he can selectively monitor the history of execution, the programmer usually has to explore a vast mass of information in order to check the absence or presence of anomalous conditions. The philosophy of the assertion approach is to provide facilities with which the programmer may specify conditions, which the system can check at execution time. Only violations are reported. By suppressing irrelevant information, it makes it a lot easier to detect anomalies. The assertion language described in this paper is generalized in the sense that it permits the programmer to refer to not only current events, but also past events. Without such generalization, it is not possible to specify many interesting properties of programs. In addition, the language is open-ended by allowing a user to define checking routines of his own. Relevant aspects of the language and examples are given.
Programming style
Authors: B. W. Kernighan, P. J. Plauger
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

Programs written with good style are easier to read and understand, and typically smaller and more efficient than those written badly, regardless of the language used. Yet most programmers have never been taught programming style&mdash;as proof we need only look at their programs. In this paper we will discuss several principles of programming style, illustrating our points by criticizing and rewriting some real programs. The examples are all taken verbatim from programming textbooks, and the revisions have all been tested.