ppxscal/embedding_network huggingface dataset:
A multi-resolution approach for imaging hydraulic conductivity
Authors: M. Daniel, A. Willsky, D. McLaughlin, D. Rossi
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Heterogeneities of hydraulic conductivity across multiple spatial scales can significantly affect the flow of groundwater, yet the sparsity of subsurface observations does not allow accurate reconstruction at all such scales. Instead, a common approach is to estimate an effective parameter which predicts large scale variations in flow. We build a new framework upon maximum a posteriori inversions to directly address the problems of scale. This framework consists of (1) a fractal prior model for conductivity which is an autoregressive (AR) process evolving from coarse to fine scale, and (2) a measurement model in which each observation is well-approximated by a linear functional of the AR process at some scale. This framework efficiently incorporates multiple measurement sources, which consist of point measurements of hydraulic conductivity and a piezometric head. The multi-resolution framework produces a conductivity estimate with spatially varying resolution tailored to the measurement sampling geometry.
Regression analysis: Theory and computation
Authors: K. W. Smillie
Venue: Proceedings of the eighth international conference on APL (1976)

The theory of multiple linear regression is developed using APL as a notation. The results of the analysis are then incorporated in a documented set of APL functions for performing regression calculations.
The conlan project: Status and future plans
Authors: Robert Piloty, Dominique Borrione
Venue: Proceedings of the 19th Design Automation Conference (1982)

CONLAN (CONsensus LANguage) is a general formal language construction mechanism for the description of hard- and firmware at different levels of abstraction. It has been developed by the international CONLAN Working Group. Members of the CONLAN language family are derived from a common root language called BCL (Base ConLan). This language provides the basic object types and operations to describe the behavior and the structure of digital systems in space and time. The paper is based on the CONLAN Draft Report (in print). The purpose of the paper is (1) to provide an informal introduction to the Draft Report version of BCL together with examples of its application (2) to outline some work on the derivation of languages from BCL and (3) to describe status and further plans for software tools supporting language derivation and implementation.
S-1 Common Lisp implementation
Authors: Rodney A. Brooks, Richard P. Gabriel, Guy L. Steele,  Jr.
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

We are developing a Lisp implementation for the Lawrence Livermore National Laboratory S-1 Mark IIA computer. The dialect of Lisp is an extension of COMMON Lisp [Steele;1982], a descendant of MacLisp [Moon;1974] and Lisp Machine Lisp [Weinreb;1981]).
High-level microprogramming with APL syntax
Authors: Richard F. Hobson, Patrick Hannon, Jonathan Thornburg
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

The article demonstrates how higher-level microprograms can be written in APL notation. With an architecture support package (ASP) defining and emulating target machine features, the resulting 'microAPL' code is directly APL executable. Firmware development is very straightforward. An implemented ASP, microAPL compiler, and microAPL linker are discussed. MicroAPL is also compared with S* notation.
A performance evaluation of a Lisp-based data-driven machine (EM-3)
Authors: Yoshinori Yamaguchi, Kenji Toda, Toshitsugu Yuba
Venue: ACM SIGARCH Computer Architecture News (1983)

In this paper, a Lisp-based data-driven machine with a novel parallel control mechanism and its performance evaluation are presented. The proposed control mechanism is the natural extension of a data-driven scheme to function evaluation and is achieved by packet communication architecture. First, the organization of the data-driven machine is described and, then the results of the simulation studies are shown which confirm the effectiveness of the control mechanism. The performance characteristics of the data-driven machine obtained by the software simulator are also given.
Program visualization: Graphics support for software development
Authors: David Kramlich, Gretchen P. Brown, Richard T. Carling, Christopher F. Herot
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper reports on the design and implementation of a program visualization (PV) environment, intended to offer the user an integrated graphics programming support system. The PV environment will capitalize on recent progress in the graphical representation of information, to provide designers and programmers with both static and dynamic (animated) views of systems. PV is currently being implemented to support programming in C, although large portions of the system are independent of the software development language. In this paper we provide an overview of the PV environment, along with a detailed discussion of the technique used to instrument programs.
Polynomial real root isolation using Descarte's rule of signs
Authors: George E. Collins, Alkiviadis G. Akritas
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

Uspensky's 1948 book on the theory of equations presents an algorithm, based on Descartes' rule of signs, for isolating the real roots of a squarefree polynomial with real coefficients. Programmed in SAC-1 and applied to several classes of polynomials with integer coefficients, Uspensky's method proves to be a strong competitor of the recently discovered algorithm of Collins and Loos. It is shown, however, that it's maximum computing time is exponential in the coefficient length. This motivates a modification of the Uspensky algorithm which is quadratic in the coefficient length and which also performs well in the practical test cases.
Practical guidelines for a user-friendly interface
Authors: Jill Wade
Venue: Proceedings of the international conference on APL (1984)

'User-friendly' is one of the more popular buzz-words currently in vogue within the information-processing community. Everyone pays lip service to the idea that building user-friendly systems is a good thing, but people are a little more vague about what this really means and how it can be accomplished. This paper suggests some of the key factors which make a system user-friendly, and presents ways in which this objective can be achieved. The bibliography contains several references that are specifically of use to the APL programmer, as well as many of more general interest.
Post-mortem dump on changes, 1981-1983 (A Panel Discussion)
Authors: Alice Howard
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

During the past two years, every university computing center has been experiencing and striving to respond to a broad spectrum of changes in their own local environments. The panalists will share their own recent experiences in the following areas: An Expanding User Audience Evolving Computer Systems Changing Organization Structure The discussion will focus on viewing the stimulus of change as a positive force, providing opportunities for creative and innovative solutions, for re-thinking of roles and responsibilities, and for re-evaluating institutional procedures and structures.
Economies of scale versus specialization - parameters of choice
Authors: J. H. Weber
Venue: Proceedings of the fifth symposium on Data communications (1977)

In this paper the important characteristics of shared and special purpose networks will be examined. The shared networks will include those which are shared among a variety of different types of data services and those which are shared between data services and voice services. Special purpose networks will ordinarily be those which are defined as meeting a particular specialized need for data communications. An attempt will be made to identify the structural differences in such networks, the characteristics of the user's needs which cause one network to be more appropriate than another, and the cost characteristics which lead to a choice of one mechanism or the other. Much of this will be in qualitative terms, although quantitative anslyses of certain situations will be made.
Keynote address: Whose big picture? (An Outline)
Authors: Walter M. Carlson
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

Importance of SIGCPR to ACM Annual Conferences are milestones Traditional role of keynoter is to praise, to summarize, and to stimulate This keynote will do these and will offer major challenges Title comes from the frequent debate which includes the statement: &ldquo;My big picture is bigger than your big picture!&rdquo;
Power: A tool for quantitative evaluation of software project effectiveness
Authors: Michael W. Evans, Louis M. Picinich
Venue: Proceedings of the 7th international conference on Software engineering (1984)

In this paper a tool for quantitative method of evaluating software projects is presented. This method constitutes the Project Observation Workbench and Evaluation Reportor (POWER). A representative project evaluation with POWER is presented to demonstrate its application.
An introductory adaptive systems course for undergraduate computer science majors
Authors: Jeffrey R. Sampson
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

This paper describes the development and implementation of an introductory survey course spanning topics in automata theory, biological information processing, and artificial intelligence. The course, Computing Science 464, is designed (and required) for Undergraduate honors students in the university of Alberta Computing Science Department. Normally taken in the third year of undergraduate study, the course has the following catalog description: CMPUT 464. Introduction to Adaptive Systems.3 Finite and infinite automata and their relation to formal languages; brain models and genetic systems: introduction to artificial intelligence. Prerequisite: Computing Science 314.
An analysis of errors and their causes in system programs
Authors: Albert Endres
Venue: Proceedings of the international conference on Reliable software (1975)

Program errors detected during internal testing of the operating system DOS/VS form the basis for an investigation of error distributions in system programs. Using a classification of the errors according to various attributes, conclusions can be drawn concerning the possible causes of these errors. The information thus obtained is applied in a discussion of the most effective methods for the detection and prevention of errors.
Personal computers in the corporate environment (Panel)
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

A microcomputer differs from a mainframe or a minicomputer in size, cost and power. Typically, micros are smaller, cost less and do not have the throughput of a mainframe. However, with today's technological improvements, microcomputers have surpassed the mainframes of yesteryear. Local processing and small data bases have become usual applications.
Applying program restructuring to dataflow environments
Authors: Sharilyn A. Thoreson, Arlen N. Long
Venue: Proceedings of the 1986 workshop on Applied computing (1986)

This paper describes the effects of program restructuring in a dataflow environment. Previous studies showed that dataflow programs can exhibit locality and that a memory hierarchy is feasible in a dataflow environment. This study shows that the order in which code is placed into pages can affect the performance of a dataflow program executing in a paged virtual memory. The paper reports performance results for selected programs loaded into memory according to various algorithms, one of which is an automatic program restructuring algorithm based on critical paths.
The 1980 computing center newsletter contest
Authors: James Nichols
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

As the first place winner in the 1979 Computing Center Newsletter Contest, the University of Colorado Computing Center served as the judging site for the 1980 contest. This presentation will summarize Colorado's experiences in coordinating the contest.
A distributed computer approach to I/O rooms
Authors: John M. Tyler
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

The Louisiana State University System is composed of ten campuses, located statewide. Each of the ten campuses has some locally installed computer power. On this campus, approximately 25,000 of the students attend and this is also the location of the System Network Computer Center. The System Network Computer Center installed the first IBM 3033 processor complex that was installed in an academic environment. This processor complex is used for research, instruction, and administrative work. The primary use of this is made by the main campus. However, all other campuses use this for large-scale computational support, some administrative supplement, and some instructional support. On campus, there are many TSO terminals for graduate students and faculty and in 1978 there was a single student I/O room which had card input and printer output. There was another I/O room in the main center which was used solely for the faculty and graduate students. This I/O room had a single card reader and printer. The Student I/O room had two Documentation 600 cpm card readers, two Data Products printers at 600 lpm, and 24 card punches.
Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version)
Authors: Udi Manber, Martin Tompa
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

This work generalizes decision trees in order to model algorithms which allow probabilistic, nondeterministic, or alternating control. Two geometric techniques for proving lower bounds on the time required by ordinary decision trees (Dobkin and Lipton's -&-ldquo;region-counting-&-rdquo; technique as applied to the knapsack and element uniqueness problems [1], and Reingold's technique as applied to set equality [4]) are shown to be special cases of one unified technique, which in fact applies to nondeterministic decision trees as well. This technique is applied to yield tight upper and lower bounds on the nondeterministic time for solving element uniqueness, set disjointness, set membership, set equality, -&-egr;-closeness [2], and knapsack problems, as well as many of these problems complements. In section 3 we present evidence that probabilistic decision trees have lower bounds matching the deterministic upper bounds for many of the problems mentioned above, and that they are not substantially more powerful for any similar problems. In section 4 it is shown that non-logarithmic lower bounds on the time required by alternating decision trees will not be easy to demonstrate, because such lower bounds would also apply to time on the seemingly more general alternating Turing machine model.
A system for large econometric models&mdash;management, estimation, and simulation
Authors: M. C. McCracken, Carl A. Sonnen
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A software system to build econometric models that have nonlinear relations requiring simultaneous solution is described. The system is presented in the context of a Canadian government research project that constructed a model of almost 1,600 equations. The system, which is designed to exploit the modular nature of the modelling process, contains programs that assist in the tasks of data management, estimation, solution, analysis, and reporting. Programs are provided to facilitate documentation of the model and error checking at the critical decision points of the model building process. Inputs of researchers generally are in the language familiar to economists and other social scientists, and little training has been required to integrate new researchers into the Canadian project. All parts of the system, which is fully documented, are operational. Some programs are operational on several systems.
Effectiveness of paradigmatic approach in teaching programming
Authors: N. Ram
Venue: Proceedings of the ACM 1980 annual conference (1980)

A paradigmatic approach in teaching FORTRAN programming language has been successfully implemented in the past. The present paper summarizes the results of a pilot experiment conducted to verify the effectiveness of this approach among students. About seventy-five engineering students who took a course in FORTRAN using a paradigmatic approach were instructed to construct problems from their areas of specialization. The constructed problems were compared to the paradigms they had used and a similarity measure was introduced. The results were compared with a control group of the same number of students with the same background who had taken a standard FORTRAN class. A preliminary investigation shows that students who had been exposed to a paradigmatic approach were more successful in providing parallel problems from their areas of specialization than the students who used conventional methods. The implications and further studies needed are outlined at the end of the paper.
General Purpose Tactical Missile Simulation Program
Authors: Sadao Akishita, Fumiaki Imado
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

General Purpose Tactical Missile Simulation Program (GPMS) has been developed. This program can be applied to simulating the operation of the tactical missiles pursuing the various targets, such as airplanes, ships and tanks. The GPMS provides with the dynamical models of missile, the dynamical models of target, and many mathematical models of on-board missile subsystems such as sensing systems, control logics and actuator systems. Any missile guidance and control systems can be simulated with selecting and combining the suitable model among many models. Many control elements and operational elements of common use are prepared in function form, so the programming is very easy even if for a complicated control system. This paper describes the construction and functions of GPMS, and shows some examples of simulation.
The academic/industry gap in systems programming and operating systems
Authors: William M. Conner, Kenneth A. De Jong
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

The results of a survey of individuals working in the systems programming and operating systems areas are presented in an attempt to characterize the academic/industry &ldquo;gap&rdquo; in this area. The implications of this gap are then presented for both the present curriculum in the Department of Computer Science at the University of Pittsburgh and for college/university curricula in general.
A new process for documenting and checking archival data
Authors: Erik W. Austin, Sylvia J. Barge, Susan M. Horvath, Santa M. Traugott
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The Inter-university Consortium for Political and Social Research (ICPSR) is a data archive and repository for social science data. A major function of the ICPSR is to disseminate the data holdings in a reasonably standard format. For holdings that will be extensively used, additional effort is made to prepare comprehensive, machine-readable documentation, to cross-check the documentation against the data for accuracy and consistency, and to correct or document any inconsistencies discovered.In the past, "cleaning" and documenting the data involved using a number of different computer programs. A great deal of human time was expended on procedural matters: which programs to use, when to use them, and how to coordinate the various stages of the cleaning process. As staff costs and the number of new acquisitions skyrocketed, and computers increased in power and decreased in cost, it became imperative to automate as much as possible the procedure for preparing data for distribution. The GIDO software was developed to meet this need.GIDO is an interactive multi-function program package that guides staff members through the procedure for documenting and cleaning social science data. A cohesive history of the processing operations performed on the data is maintained automatically in machine-readable form. Video terminals are used to display "forms" which the staff fill out with the textual and technical documentation for the data. GIDO immediately verifies the contents of each form and provides an opportunity to make corrections. The forms allow the input of information without requiring knowledge of specialized syntax and conventions. After all documentary materials have been entered, GIDO checks the data for consistency with the original documentation, corrects or flags discrepancies encountered, reformats the data using uniform conventions, and produces machine-readable documentation in a form ready for dissemination.Use of GIDO enables the ICPSR archive to perform its data processing functions more efficiently and at lower cost, thus permitting the organization to meet ever-increasing demands on its resources.
Changing attitudes for future growth
Authors: Diana L. Williams
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Everyone's attitude about computers is changing rapidly. It has to. Computers are an everyday part of life that can not be avoided. Telephone bills, electric companies, credit card companies, hospitals, and even grocery store check outs are now computerized in some way. University students at every level of education are also experiencing computer attitude changes. Almost every department in a university system now requires some computer interaction for their students. Several questions come to mind when planning how to best introduce students to the computer. Are formal computer science classes too technical for non-computer science majors? Will specialized short courses be enough? Where do students go for personal help outside the classroom? Are computer professionals able to assist those with little or no computer knowledge? Are departments asking too much of their students? Many universities have promoted satellite computer labs staffed with professionals to meet the needs of the students and faculty in a particular department or college. These satellite labs should be able to provide a user friendly environment and some one-to-one attention to the problem at hand. This paper will discuss some of the problems, we, as a satellite computer lab, have encountered during our existence. Since we deal primarily with graduate students and faculty in Public Health working with statistical packages, our problems are not as numerous as they could be. I plan to present just some of the problems we face and solutions we have tried for changing people's attitudes about the computer.
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time
Authors: Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present a self-stabilizing algorithm for .nding a generalized maximal matching (b-matching) in an arbitrary distributed network. We show that the algorithm converges in 0(m) moves under an unfair central demon independent of the b-values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].