ppxscal/embedding_network huggingface dataset:
3D Models of Architectural Scenes from Uncalibrated Images and Vanishing Points
Authors: Roberto Cipolla, Duncan Robertson
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We address the problem of recovering 3D models from uncalibrated images of architectural scenes. We propose a simple, geometrically intuitive method which exploits the strong rigidity constraints of parallelism and orthogonality present in indoor and outdoor architectural scenes. We show how these simple constraints can be used to calibrate the cameras and to recover the projection matrices for each viewpoint. The projection matrices are used to recover partial 3D models of the scene and these can be used to visualize new viewpoints. Our approach does not need any a priori information about the cameras being used. A working system called PhotoBuilder had been designed and implemented to allow a user to interactively build a VRML model of a building from uncalibrated images from arbitrary viewpoints.
Probabilistic Tree Automata
Authors: Clarence A. Ellis
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

The purpose of this paper is meant to be three-fold. First it will introduce the reader to the concepts of Probabilistic Languages and Probabilistic Grammars. Second, it indicates that previous definitions of probabilistic finite automaton have always been restricted to 1 of 8 classes of automaton and shows that other classes are useful. Third, the probabilistic concept is extended from finite automata to higher level automata (such as probabilistic PDAs and probabilistic Turing automata). A specific application of this theory is given in the development of Probabilistic Tree Automata. Theorems concerning these automata and operations on them are presented. It is indicated that this type of automaton is relevant because it characterizes Probabilistic Context Free Languages. The results are taken from the author's PhD Thesis.4
Semi-symbolic methods in partial differential equations
Authors: Cleve B. Moler
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

We discuss some partly numeric, partly symbolic methods which could conceivably be used for the solution of a reasonably large class of elliptic boundary value problems. The methods have already proved to be quite effective for some simpler forms of these problems. But as more general problems are approached, we exceed the capabilities of all the symbolic manipulation systems with which we are familiar.
An efficient procedure for locating the optimal simular response
Authors: G. Arthur Mihram
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

This paper indicates the applicability of statistical procedures, known as response surface methodology, to the design and analysis of experiments performed with a stochastic simulation model. Fundamental simplex-sum designs are displayed explicitly and inferences therefrom are interpreted in terms suitable to the optimisation of the simular response function.
A study of order transformations of hierarchical structures in IMS data bases
Authors: J. W. Mehl, C. P. Wang
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

Hierarchical structures are widely used in information processing. An application program written to traverse a hierarchical structure will not work properly, if at all, when the order of the structure (in the sense of tree order) is altered. This paper presents a method in the context of IMS systems to intercept and interpret data base manipulation commands issued by the application program to eliminate the necessity of reprogramming when a hierarchical structure is subject to an order transformation. Algorithms involving command substitution rules for various situations have been derived to insure the correct execution of application programs irrespective of the order of the structure.
Abstract data types and the development of data structures
Authors: John Guttag
Venue: ACM SIGPLAN Notices (1976)

Abstract data types can play a significant role in the development of software that is reliable, efficient, and flexible. This paper presents and discusses the application of an algebraic technique for the specification of abstract data types. Among the examples presented is a top-down development of a symbol table for a block structured language, including a discussion of the proof of its correctness. The paper also contains a brief discussion of the problems involved in constructing algebraic specifications that are both consistent and sufficiently-complete.
THE SITE MACHINE Computer-aided instruction in architectural education
Authors: Edward F. Smith
Venue: Proceedings of the 14th Design Automation Conference (1977)

THE SITE MACHINE is one of two prototype, graphics-based programs written to evaluate the potential of computer-aided instruction (CAI) programs in architectural education. Some CAI systems are now highly developed but almost no use has occurred in architectural education. The special characteristics and diverse nature of architectural education as well as the requirement for fast, high quality graphics, especially in the design areas, requires special applications and consideration. THE SITE MACHINE was a research attempt in open ended problem solving at the high end of a hierarchy of computer use in CAI in architecture. The major objectives of the test programs were: 1. To determine the feasibility of implementing viable CAI programs using existing computing resources at reasonable development and user costs and to determine the useability of existing developed programs, techniques, capabilities and algorithms from CAI, computer graphics, mathematical and spatial modeling. 2. Identify problems of acceptance and use by present faculty members, compatability and ease of integration in the curriculum, acceptance, use and motivation of student users. 3. Develop test programs that will identify student differences in learning, recognize subject mastery and demonstrate that learning has occurred. 4. Test initial ideas, concepts, instructional models and provide guidance and direction for future research and development efforts.
A review of modeling and simulation in education and training
Authors: A. M. Wildberger
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper, as delivered, will provide an overview and survey of modeling and simulation in the field of education and training. It will consist mainly of brief descriptions and comparisons of some thirty representative models and/or simulations. Each one is presented in detail by one or more of the documents in the bibliography which also contains additional references to partial compendiums, critiques, and elaborations of some of these models and/or simulations.
Performance evaluation of CCD chip organizations from memory system design viewpoint
Authors: Satish L. Rege
Venue: Proceedings of the 1976 annual conference (1976)

This paper discusses the computer memory system design implications of different CCD devices, such as Circulating Shift Register, Serial Parallel Serial, and Line Addressable Organizations. The performance of the memory using these devices is evaluated in a stand alone mode using a single server queuing model, and as a buffer between the disk and main memory in a computer system by using a two server cyclic queuing model. The performance of the stand alone mode for CCD memory system is defined as the time elapsed between the request for a record and the completion of that request. The performance comparison of stand alone mode shows that Serial Parallel Serial Organization has the worst performance as one should expect. It is shown that the Circulating Shift Register with burst mode for refreshing has better performance than the Line Addressable Organization. Circulating Shift Register Organization with cache has the best performance of all but would require a considerable amount of extra cost. In evaluating the CCD chip organizations as a buffer between the disk and the main memory, it is shown that all the three organizations (Serial Parallel Serial, Circulating Shift Register, and Line Addressable) have a place in a memory system design depending on the user requirements. It is also shown that a three level (Bipolar, MOS and CCD) memory system using the different CCD chip organizations has a considerable advantage in performance over a two level (Bipolar, MOS) organization for the same total cost.
Scientific information retrieval system: A new approach to research data management
Authors: Gary D. Anderson, Eli Cohen, Wally Gazdzik, Barry Robinson
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

This manuscript is addressed particularly to the researcher and data analyst faced with the need to manage and analyze data sets in a form of complex file. This complex file arises when data is collected from multiple sources over a period of time. In the health sciences, studies of this nature are quite common, examples being large multi-centered clinical trials, patient record studies, health surveys, patient monitoring studies, etc.. Such studies generally contain variable amounts of data on each case as a result of missing examinations, a variable number of visits to the clinic, etc.. The result of such situations is a case-oriented hierarchical file. Similarly, such a case can arise in the social sciences, as in surveying a family or a school population; or in economics, as in analyzing an industry or an entire country. SIR was designed specifically for the management of such complex hierarchical data. Also, SIR adopted the language of the most widely-used statistical system presently in existence, namely that of SPSS(1), which is easily learned by those who are not yet familiar with it.
Trace driven modeling and analysis of CPU scheduling in a multi-programming system
Authors: Stephen Sherman, Forest Baskett,  III, J. C. Browne
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

Microscopic level job stream data obtained in a production environment by an event driven software probe is used to drive a model of a multiprogramming computer system. The CPU scheduling algorithm of the model is systematically varied. This technique, called trace driven modeling, provides an accurate replica of a production environment for the testing of variations in the system. At the same time alterations in scheduling methods can be easily carried out in a controlled way with cause and effects relationships being isolated. The scheduling methods tested included the best possible and worst possible methods, the traditional methods of multiprogramming theory, round-robin, first-come-first-serve, etc., and dynamic predictors. The relative and absolute performance of these scheduling methods is given. It is concluded that a successful CPU scheduling method must be pre-emptive and must prevent a given job from holding the CPU for too long a period.
A microprocessor-controlled asynchronous circuit switching network
Authors: Tse-yun Feng, Chuan-lin Wu, Dharma P. Agrawal
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper describes an asynchronous circuit switching network for multiple-processor systems. Several circuit switching networks for various applications have been proposed and constructed. However, there are problems associated with these networks. The asynchronous circuit switching network possesses several features that can solve these problems. A three-stage fully connected topology is utilized to construct the network. Each switching element is functionally and physically identical and this facilitates a cost-effective LSI implementation and software development. The control structure of the switching element and the routing algorithm are re-organized to fit the asynchronous operation. The network takes advantage of low-cost microcomputers to do the distributed routing control and to implement the communication protocols. The graceful degradation characteristic in the network is provided by independent multiple paths existing between any pair of the source and the destination. A network monitor is incorporated to facilitate an adaptive routing strategy and to have the fault diagnostic capability. Three alternatives for the switching element implementation are described to demonstrate the hardware and software tradeoffs.
A new representation for linear lists
Authors: Leo J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

We present a new data structure for maintaining a set of records in a linear list according to their key values. This data structure has the property that we can keep a number of fingers at points of interest in the key space (e.g., the beginning or the end of the list), so that access and modification in the neighborhood of a finger is very efficient. In the Section 2 we discuss the general structure of our B-tree. Since we propose to search the tree from a leaf upwards, additional links need to be introduced. In Section 3 we show how to obtain our result for the case of one finger. A key idea is the construction of a number representation behaving as described above, which we can use to model the propagation of modifications in the B-tree along the finger path. In Section 4 we generalize the structure so that several fingers in the key space can be maintained, with the advantage that access is cheap in the neighborhood of each finger. Finally in Section 5 we present some implementation notes and applications, mostly to sorting.
ICARUS: An interactive integrated circuit layout program
Authors: Douglas G. Fairbairn, James A. Rowson
Venue: Proceedings of the 15th Design Automation Conference (1978)

ICARUS (Integrated Circuit ARtwork Utility System) is a software system which allows the user to create and modify an integrated circuit layout directly on a refresh CRT screen. The system can generate check plots on the matrix type printers available from Versatec or on a raster-scan laser printer such as the 9700 Xerox has recently announced. The ICARUS files can be used to create standard pattern generation tapes from which integrated circuit masks can be made. All the software to accomplish these various steps runs on a small experimental minicomputer known as the Alto.
Computer network operations&mdash;making it all go at once
Authors: David A. Feinberg
Venue: Proceedings of the ACM '81 conference (1981)

Approximately seven years ago, the Boeing Commercial Airplane Company (BCAC) commenced experimentation with computerized transmission of aircraft design data between engineering groups. It is typical for several engineering groups, located at different company plants throughout the country, to work on an aircraft drawing as it develops from initial geometric shapes to a final, dimensioned, annotated, part. Historically, these drawings had always been prepared manually using drafting tables and transmitted between plants via company inter-office mail. With the advent of early computerized drawing techniques (primarily, adaptations of the Automatically Programmed Tool and Master Dimension programs), and the availability of quality Interactive Computer Graphic (ICG) systems (e.g., Gerber, Computervision), BCAC management decided to supplement and, eventually replace, both the manual drafting and inter-office mailing of aircraft design drawings. This was the beginning of the BCAC Computer Aided Design/Computer Assisted Manufacturing (CAD/CAM) Integrated Information Network (CIIN).
Variable Mesh Simulator
Authors: M. J. Kelly
Venue: Proceedings of the second conference on Applications of simulations (1968)

The Variable Mesh Simulator is an experimental program running on S/360 under MVT OS. It is so named by analogy with the numerical solution of differential equations where finite difference approximations are systematically evaluated at discrete intervals of their variables. The largest intervals consistent with the accuracy of these approximations are used in order to minimize the amount of computation. In areas where greater precision is required, smaller intervals must be used and so we get a picture of an n-dimensional grid whose mesh-size varies according to local needs. In VMS, different language-levels of description of the system (to cater for different objectives) are our approximations, and these levels imply the degree of detail required&mdash;our interval sizes. Also, by dividing the system into parts, independently described at different levels, we can concentrate our computer power on those areas needing the most intensive study. Each such &ldquo;part&rdquo; is called a region, and each level of description of a region is called a cut. Our overall objective is, then, to be able to simulate economically any or all parts of a system, no matter how large, at any levels of description and for any purpose the user has.
An application of network flow programming to locate concentrators in a communication network
Authors: H. T. Lau
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

In a subscriber network, the conventional method of satisfying the circuit demands is by voice frequency engineering. Modern electronic equipments such as pair gain systems, distributed and lumped subscriber carriers, which will be called concentrators for simplicity, can substantially reduce the network reinforcement cost. This has a significant impact on the conventional voice frequency provisioning. The problem is to determine the time and locations of concentrators so that the demands are met at the minimum cost over a planning period. This paper gives a formulation of the problem. The combinatorial nature of the problem makes the enumerative approach prohibitively expensive. By making use of the network flow programming technique, we propose an iterative procedure that provides a good approximate solution. The testing of the computer program indicates that it is efficient and flexible enough for practical purposes.
Teaching project management
Authors: John Beidler
Venue: Proceedings of the sixteenth annual SIGCPR conference (1979)

In this paper we make some observations about several items which should receive heavier emphasis in undergraduate curricula. We make no pretense about having all the answers about how these things can be ideally fit into undergraduate curricula. On the contrary, what we do have is a mixed bag of successes and failures which we believe might prove useful to others. We would prefer to emphasize three items: 1. Promotion of some understanding of the life cycles of a system; 2. More emphasis on documentation, its purpose, level, and methods of organization; 3. Software tools for analysis, design, and systems documentation and communication. More consideration of these items must appear in undergraduate curricula. They all have a direct bearing on the problems of project management.
PRIMEAIDS: An integrated electrical design environment
Authors: Roger Cleghorn
Venue: Proceedings of the 18th Design Automation Conference (1981)

PRIMEAIDS is a CAD system that provides a total interactive command environment for electrical engineers, draftsmen, and technicians. It integrates the many computer tools that are needed to increase productivity and accuracy of producing electronic products. PRIMEAIDS provides interfaces to major CAD tools such as simulation, wire-wrap generation, and PCB and LSI layout in a way that is consistent to the designer; making all of these tools appear as a single, integrated system.
The effects of symbology and spatial arrangement on the comprehension of software specifications
Authors: Sylvia B. Sheppard, Elizabeth Kruesi, Bill Curtis
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Seventy-two participants were presented with specifications for each of three modular-sized computer programs. Nine different specification formats were prepared for each program. These formats varied along two dimensions: type of symbology and spatial arrangement. The type of symbology included natural language, constrained language (PDL), and ideograms (flowchart symbols). The spatial arrangement included sequential, branching, and hierarchical versions. The participants answered a series of comprehension questions on each program using only the program specifications. Three types of questions were presented: forward-tracing, backward-tracing, and input-output. Both forward- and backward-tracing questions were answered more quickly from specifications presented in PDL or ideograms than in natural language. Forward-tracing questions were answered most quickly from a branching arrangement, and backward-tracing questions were answered more quickly from branching and hierarchical arrangements. Response times to the input-output questions did not vary significantly as a function of the type of symbology or the spatial arrangement.
The effective use of user advisory committees in the management of computer resources
Authors: Barry L. Bateman
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The use of committees for advisory purposes in the management of computer resources can be a very effective and useful means of receiving user input if it is managed correctly. The key word for user committees is advisory. If a committee becomes a policy-making committee, then personal biases by either the academic or the administrative members of the committee can adversely influence the progress of the computer center. If, however, one utilizes two committees in an advisory fashion, one for academic computing and one for administrative computing, it is possible to take the good ideas of both groups and utilize these suggestions in the long-range goals and planning of the computer center. This idea holds true whether you are using a single centralized facility or whether you have two computing centers, one for academic use and one for administrative use but both under centralized management.
A batch processing version of APL 1130 for student use
Authors: Joel D. Hail, Joel D. Kirscher
Venue: Proceedings of the sixth international conference on APL (1974)

A Monitor-compatible version of APL 1130 has been adapted for batch use by large numbers of students. Modifications in the I/O phases accomplish the sign-on, workspace loading, and make the card reader the principle input device. These changes allow the user to access the system as part of our normal mixed job-stream operation.
An emulator for an automatic test system
Authors: P. Wilcox, W. J.L. McCready
Venue: Proceedings of the 12th Design Automation Conference (1975)

Testing is an integral part of an integrated circuit production facility and is a major step in the production process. Of the many problems associated with testing, we wish to address our selves to one aspect of the problem of test program verification. Test program verification is carried out on two levels; one is to ensure that the program operates as specified, and the second is to ensure that the specified test is a correct or adequate test. Test verification at BNR can be a time consuming, hence expensive, operation because the test system supports a prototype production line and thus the testing load is composed of a large number of different circuit types with only a small number of each type. A major part of the testing effort is devoted to the writing and debugging of test programs and then the subsequent debugging of the tests themselves. Verification of the test itself is a problem because the characteristics of a prototype device are not necessarily known with a high degree of accuracy and so the test specification may be based only on educated guesswork.