ppxscal/embedding_network huggingface dataset:
Depth-from-motion estimation based on a multiscale analysis of motion constraint equation validity
Authors: J.-L. Sune, V. Rebuffel, R. Samy
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We present a new method of estimating the depth-from-motion in a image sequence. It is assumed that the camera motion is known and the scene is rigid. Our idea is to evaluate carefully the pixels where the brightness change constraint equation is valid, and consequently the depth value is reliable. A confidence measure is derived from local analysis. This analysis is performed at various levels of resolution, increasing the number of reliable pixels. The depth values obtained at each level are then fused within a statistical framework, allowing one to also integrate the temporal information. Results are shown for real and synthetic images used in the performance evaluation.
Location Update for PCS Networks with a Fractional Movement Threshold
Authors: Yang Xiao, Kui Wu
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Many dynamic location update schemes, such as the time-based, movement-based, and distance-based schemes, have been studied in the location management for Personal Communication Service networks, whereas the movement-based scheme is the most practical approach. In this paper, we propose a novel fractional movement-based location update scheme, in which the movement threshold is a real number with a fraction instead of an integer. We prove analytically that there is a unique optimal fractional movement threshold that minimizes the total cost of location updates and paging per call arrival. Our study shows that the fractional movement-based scheme outperforms the pure movement-based scheme.Furthermore, we propose a hybrid location management scheme, in which when the call-to-mobility ratio is larger than another threshold, the optimal fractional movement-based scheme is adopted. Otherwise, the static location update scheme is adopted. The Newton approximation method is adopted to find the 2nd threshold.
Non-integral event timing for digital logic simulation
Authors: Ernest G. Ulrich
Venue: Proceedings of the 13th Design Automation Conference (1976)

Due to reasons of efficiency, digital logic simulation is normally performed by restricting timing accuracy to integral event timing. However, this restriction causes disadvantages which can be avoided if a sufficiently efficient event processing algorithm for nonintegral timing becomes available. The algorithm described here combines features of the standard linear list algorithm and the time-mapping algorithm often used for logic simulation. The combination results in a compromise between the timing accuracy of the former and the efficiency of the latter. The control mechanism required for the new algorithm can and should be directly exploited to improve the control and flexibility of the detailed simulation processing. Some of the advantages gained due to non-integral timing are described in the conclusions of this paper.
SPIL: A language for construction of reliable system software
Authors: Barbara H. Liskov, Leroy A. Smith
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

Structured programming is gaining wide acceptance as a technique for increasing the reliability and understandability of software. Nowhere is the need for better software felt more keenly than in the area of systems programming. In the near future it is likely that systems will be programmed in structured programming languages, just as systems have been programmed in higher level languages in the past. This paper describes SPIL: a structured programming language intended to be used for system design and implementation. The paper discusses how the objectives of structured programming and system programming may be realized in a programming language, and delineates the influence of the objectives on the design of SPIL. The most important features of the language are briefly described. The paper concludes by evaluating SPIL as a language for system design and implementation.
On fault detection in CMOS logic networks
Authors: Kuang-Wei Chiang, Zvonko G. Vranesic
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper considers the problem of detecting faults in CMOS combinational networks. Effects of open and short faults in CMOS networks are analyzed. It is shown that the test sequence must be properly organized if the effects of all open faults are to be observable at the network output terminal. A simple and efficient heuristic method for organizing the test sequence to detect all single faults in a CMOS network is suggested.
Block structure (Extended Abstract): Retention or deletion?
Authors: Daniel M. Berry
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

The question as to the correct block exit strategy, retention or deletion, is resolved by formally comparing the contour model and the stack model, each of which implements one of the strategies, to the copy rule, a formal definition of block structuring.
A Data Base Management System
Authors: Albert C. Patterson
Venue: Proceedings of the 1971 26th annual conference (1971)

A brief description of the advent of the Data Base Task Force at GUIDE and SHARE is given. Discussion of coordination among the several data base committees. The major components of the Data Base Management System (DBMS) proposed by the GUIDE Group are discussed: Data Base Manager (DBM), Data Base Descriptive Language (DBDL), Data Base Command Language (DBCL), and Data Base Administrator (DBA). The concept that the Requestor (possibly the application programmer) of data from the data base is not concerned with procedure or strategy for accessing data is stressed. Complete data independence is set as a primary objective of DBMS. Data Base directory concept is explained. Organization of data around an entity is discussed and qualification levels, associations, memberships, and other relationships are described. The functions of the major components of the DBMS are discussed in detail. An implementation schedule is proposed along with what the current objectives of data base task groups should be.
On providing user support in a changing environment
Authors: Joan Franz
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

In the face of rapidly changing products and user needs, a familiar problem to large computing facilities today is deciding what services to offer, and how to offer them. Dropping hardware costs, increasing need for interactive computing (including text processing, graphics, and data management systems), and fiscal limitations for both the central facility and the users are some of the changes we are experiencing at Lawrence Berkeley Laboratory. How can the central computing facility provide the services users need in the most expedient and inexpensive way possible?
Minimizing the problem of logic testing by the interaction of a design group with user-oriented facilities
Authors: Manuel Correia, Donald Cossman, Franco Putzolu, Thomas Snethen
Venue: Proceedings of the 7th Design Automation Workshop (1970)

Early design decisions concerning logic packages often make subsequent testing difficult. To minimize such problems, logic designers must maintain close communication with those responsible for testing the finished product. This paper explores a user-oriented system which enables the designer to recognize and correct testing problems in the early stages of design.
&ldquo;A generalized learning&rdquo; game
Authors: Howard A. Peelle
Venue: Proceedings of the sixth international conference on APL (1974)

APL is used to describe a &ldquo;learning&rdquo; game, generalized to a class of rules.
GSP: A system for computer assisted space planning
Authors: Charles E. Eastman
Venue: Proceedings of the 8th Design Automation Workshop (1971)

This paper focuses on computer augmentation of some simple design tasks found in every architectural office - the design and contract specification of arrangements of objects and equipment within a space. Examples of such tasks include stairwells, restrooms, mechanical rooms, and kitchens. This type of design is not considered creative, for it consists of a variation of a standard design within a particular context. Rather, it is an example of the &ldquo;dogwork&rdquo; involved in realizing initial design conceptions. A major portion of an architectural firm's time and effort is currently expended on the production aspects of design, of translating schematic design into construction documents1. General Space Planner* (GSP) is an automated design, drafting, and problem solving system recently implemented on Carnegie-Mellon University's IBM 360/67 time-shared computer that begins to explore how arrangement problems and other production aspects of design can be either automated or augmented by the computer. This paper describes the current user interface of the GSP system, its required inputs, modes of interaction, and its outputs, and describes how GSP solves several classes of drafting design problems.
Dynamic restructuring of databases with generation data structures
Authors: Rob Gerritsen, Howard L. Morgan
Venue: Proceedings of the 1976 annual conference (1976)

Most logical database restructuring schemes require a complete pass through the database for reformatting. Our approach is to leave the database in situ and to permit a mixture (several generations) of structures to co-exist. Each generation of structure is described in a Generation Data Structure Schema, which has a generic structure of its own. A Restructuring Data Definition Language is proposed for describing the evolution from one schema to the next. Steps toward implementation are discussed.
Exact and approximate membership testers
Authors: Larry Carter, Robert Floyd, John Gill, George Markowsky, Mark Wegman
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an exact membership tester is a procedure that for each element s in U determines if s is in V. An approximate membership tester is allowed to make mistakes: we require that the membership tester correctly accepts every element of V, but we allow it to also accept a small fraction of the elements of U - V.
Maintaining order in a linked list
Authors: Paul F. Dietz
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

We present a new representation for linked lists. This representation allows one to efficiently insert objects into the list and to quickly determine the order of list elements. The basic data structure, called an indexed 2-3 tree, allows one to do n inserts in O(nlogn) steps and to determine order in constant time. We speed up the algorithm by dividing the data structure up into log*n layers. The improved algorithm does n insertions and comparisons in O(nlog*n) steps. The paper concludes with two applications: determining ancestor relationships in a growing tree and maintaining a tree structured environment (context tree).
Goals for computer science education in the 1980s
Authors: Mary Shaw
Venue: ACM SIGCSE Bulletin (1984)

The nature of computing, and hence of computer science, is changing rapidly. Many topics that now seem interesting will be obsolete or irrelevant within ten years, and our perspective on other topics will change. If a curriculum designed now is to remain effective through 1990 or beyond, we must try to understand the forces that are shaping the field and to anticipate the roles that computing and computer science will play in the future. At Carnegie-Mellon, a group of eight faculty and graduate students is designing a new undergraduate computer science curriculum. We began by examining the trends that will affect the field over the next decade and the new phenomena and issues that may arise. From this basis we are developing a new curriculum without prior assumptions drawn from existing curricula. In this talk I will discuss our view of current trends in computer science and the roles that colleges and universities must play over the next decade.
Design for integration of a DBMS into a network environment
Authors: E. A. Unger, R. A. McBride, J. Slonim, F. J. Maryanski
Venue: Proceedings of the sixth symposium on Data communications (1979)

This research deals with the methodology of integrating a data base management system (DBMS) into a distributed network system. The focus of concern is upon the interfaces and communications among a DBMS, an operating system with associated network interface features, and other such components at distributed nodes. The environment of a generalized data base management system is extended to a distributed generalized data base management system. The definition of this system by the authors allows the DBMS, schema, subschema, and application program to be distributed individually throughout nodes in the network and for the data base itself to be distributed. A network interface is defined consisting of a command interpreter and a command handler to effect and coordinate the communication of the units of the system (e.g., applications program with schema, etc.). The message transmission is studied for the various topological distributions, and for a restricted set of these topologies a selection algorithm is developed with considers simple priorities and estimated costs. The distribution of a generalized data base management system with the flexibility of locating the schema, subschema, application programs and data appears technically possible, and for some topologies and environments, economically feasible. Further study is indicated.
The 'data shunt box' an easy, inexpensive way to transfer text files between computers
Authors: G. S. Herman-Giddens, J. J. Shifflette, M. S. Spach
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

A simple, low-cost mechanical switch is used in transfering text files between computers of widely varying size, architecture, manufacturer, and geographic location utilizing standard serial interfaces, typically at 300-1200 baud. No special software is required since the standard utility programs of each computer are used to transmit and receive the text. The only requirement is that the effective rate of character transmission must be slow enough to allow the receiving system to process a character before the next one arrives since no hand-shaking interlock is provided. With the data shunt box, direct 'media-free' data transfer between different systems is within the budget of any user of small systems.
Development and verification of a model for predicting fog over cooling ponds
Authors: Robert R. Hippler, Edward Cohen, Orville G. Tranby
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

At low atmospheric temperatures, between 5&deg;C and -20&deg;C, water evaporated from an open water surface, such as a power plant cooling pond, can cause frequent fog formations. To study the environmental effect of proposed cooling pond designs, a simulation model was developed which provided the following: the amount of water evaporated from the surface of the pond as a function of the pond surface temperatures and atmospheric conditions (the source terms); the diffusion of the water vapor and liquid water content by the atmosphere, and the resulting spatial distribution of quantity of liquid water in the atmosphere, which defines the visibility ranges. The model was tested and verified for an operating cooling pond and applied to design cooling ponds.
Cooperation in the office-office communication systems as a management tool
Authors: Ralf Reichwald
Venue: ACM SIGOA Newsletter (1984)

Traditional methods for the analysis of office work have focussed on the quantitative rather than on the qualitative and social aspects, while neglecting cooperation and the social context of managerial work. Based on an empirical study, a framework for office work analysis is presented. It shows the kind of support required for different components of managerial work and the dependence of management on contributions of secretaries. Finally, possibilities for increasing the effectiveness of managerial work through new technology are presented.
Report of session on systems programming languages
Authors: Robert M. Graham
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

Discussion in this session centered around two major topics: experience using a particular language for systems programming and features which are required or desirable in a systems programming language. In general, as one might expect, the users of a particular language were happy with that language and felt they had made the right choice, even though they were not completely satisfied. There seemed to be general agreement that a higher level language than machine language (assembly language) should be used for systems programming. There was considerable difference of opinion as to how high level the language should be. There was a similar difference of opinion as to what features are desirable, and even necessary, in a systems programming language. Although the session was organized so as to discuss the two major topics separately, there was considerable discussion of desirable and necessary language features mixed in with the discussion of experience with specific languages. The session opened with a report by Bob Freiburghouse on the use of PL/I for implementation of Multics. "In general the project was successful. We're not about to switch to some other programming language. But we would like to enforce more discipline. I think we would like to recognize and enforce a subset of all this. He listed a number of key features, the most important of which was external procedures and external variables. Other important features included structured data with controlled packing, recursion, block structure, high level control statements, type checking, pointers and dynamic storage allocation, and % include. A few extensions were made to the language such as pointer valued functions, functions to construct and take apart pointers, P and V operations, and a notation for referencing Multics segments. In addition, a support routine called the binder was implemented. Using this routine one can combine a number of procedure and data segments into a single module. References to this module can be made using only designated names, all other names originally associated with the segments in the module will be hidden, that is, undefined outside the module.
The National Software Works: Operational issues in a distributed processing system
Authors: Ross A. Faneuf
Venue: Proceedings of the 1977 annual conference (1977)

The National Software Works (NSW) inaugurates a new class of operating systems&mdash;that of network interactive systems. Its operational properties differ in significant ways from those of current interactive systems, and consequently the rules of behavior NSW enforces on its users differ as well. Three factors condition the expectations, habitual behavior, and consequent productivity of most users of interactive systems: the basic properties of the system itself (i.e., the system's virtual machine, what the operating systems designer thinks of as &ldquo;the system&rdquo; and to which he devotes most of his attention); the means by which the user accesses the system(e.g. Arpanet as opposed to hard-wired in-house access); and the set of &ldquo;least-adequate&rdquo; software tools which represent obstacles to software development. NSW exists in large part to help solve the latter problem by granting access to existing high-quality software tools irrespective of their distribution over diverse host operating systems. The benefits to be gained are described in [1,2,3]. Here we are chiefly interested in NSW's behavior as seen at the user's terminal, and how that behavior will affect the user's expectations and habitual ways of using the system. For this purpose, an interactive system may be characterized by a &ldquo;virtual machine&rdquo; which is the sum of its system characteristics and the user's access mode.
Design principles for network interconnection
Authors: Michel Gien, Hubert Zimmermann
Venue: Proceedings of the sixth symposium on Data communications (1979)

With the development of individual computer networks comes the need to interconnect them. Network designers are faced with heterogeneity of networks just as they were previously faced with heterogeneity of computers within a single network. This paper shows that similar structuring techniques, namely multiplexing, switching, cascading, wrapping and layering, can be applied, and that a set of simple principles can be derived which facilitate greatly the design of the interconnection of computer networks. These simple principles are applied to the analysis of some typical examples of network interconnection problems, in the areas of addressing, routing, non-equivalent communication services, error control, flow control and terminal access. It is suggested that similar principles could be applied to some unresolved issues in computer network interconnection, such as congestion control or administrative functions. It is finally claimed that the final objective of network interconnection studies would be to determine the set of international standards which are required to make network interconnection straightforward in the near future.
Multimicrocomputer system for building with full service facility automation
Authors: J. F. Tirado, J. J. Ruz, M. Mellado
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

The system here presented has been designed to be used on lodging establishments or institutions such as hotels, apartment buildings, hospitals, etc. The system picks up building generated data in order to provide the actual status of the building at any moment and performs status-dependent operations to provide: a) service to guest; b) security in the installment, and c) statistical and accounting information for management purposes. The aforementioned operations are realized by the system within two distinct forms: 1) An automatic form which takes care of control of power consumption, accounting on service in each room (sell points, taxes for special services, fire-prevention, automatic wake-up, service) updating and reporting of statistical data for management. 2) An interactive form which through CRT stations attached to the system performs customer check in/check out; invoicing, query operations on guests, service lock/unlock, building status report, ... The system has been implemented as a microcomputer network made up by a microcomputer in each room and a master unit of two tightly-coupled CPU's with shared-memory which is in charge of network controlling, terminal controlling, and processing functions.
Booking operations in a jail: A GPSS model
Authors: Val Silbey, William M. Band
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This study used a GPSS model of the booking operations in a county jail to determine the effect of randomness and manpower allocations on the processing of incoming inmates. Problems of data collection and alternative presentation to management are considered. The model illustrated that the major delays and manpower requirements for booking resulted from factors not controllable by jail management.