ppxscal/embedding_network huggingface dataset:
Automatic and general solution to the adaptation of programs in a paging environment
Authors: J. Y. Babonneau, M. S. Achard, G. Morisset, M. B. Mounajjed
Venue: Proceedings of the sixth ACM symposium on Operating systems principles (1977)

The efficiency of replacement algorithms in paged virtual-storage systems depends on the locality of memory references. The restructuring of the blocks which compose the program may improve this locality. [HATFIELD and GERALD 71] [MASUDA SHIOTA NOGUCHI and OHKI 74] [FERRARI 76]. In confining this restructuring to the link-editing operation, a general and completely automatic solution has been implemented, in the form of a self-adaptative system, on the SIRIS 8 operating system. A reduction of 40 to 70% in the page fault rate has been obtained.
Automatic synthesis of systolic arrays from uniform recurrent equations
Authors: Patrice Quinton
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

We describe a systematic method for the design of systolic arrays. This method may be used for algorithms that can be expressed as a set of uniform recurrent equations over a convex set D of Cartesian coordinates. Most of the algorithms already considered for systolic implementation may be represented in this way. The methods consists of two steps: finding a timing-function for the computations that is compatible with the dependences introduced by the equations, then mapping the domain D onto another finite set of coordinates, each representing a processor of the systolic array, in such a way that concurrent computations are mapped onto different processors. The scheduling and mapping functions meet conditions that allow the full automation of the method. The method is exemplified on the convolution product and the matrix product.
Complex spectral logic
Authors: Claudio Moraga
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A spectral expansion of multiple-valued logical functions is studied. Chrestenson transforms and a mapping of logical functions into the unit circle in the complex plane are used. It is shown that a set of transformations in the function domain corresponds to permutations and/or complex scaling in the spectral domain. Spectral expansion of a function is unique and this is used to reduce complexity in multiple-valued logic design.
Maintenance planning and scheduling using network simulations
Authors: Robert E. Mortenson,  Jr.
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

There are many opportunities for applying modeling and simulation techniques in an Air Force maintenance depot. This paper provides an overview of the scope and types of maintenance done at Sacramento Air Logistics Center and describes some of our Q-GERT and computer-generated graphics uses. The paper emphasizes the uses in the planning and scheduling of our aircraft maintenance activities and identifies areas for future application of simulations.
On representation and matching of multi-coloured objects
Authors: J. Matas, R. Marik, J. Kittler
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A new representation for objects with multiple colours-the colour adjacency graph (CAG)-is proposed. Each node of the CAG represents a single chromatic component of the image defined as a set of pixels forming a unimodal cluster in the chromatic scattergram. Edges encode information about adjacency of colour components and their reflectance ratio. The CAG is related to both the histogram and region adjacency graph representations. It is shown to be preserving and combining the best features of these two approaches while avoiding their drawbacks. The proposed approach is tested on a range of difficult object recognition and localisation problems involving complex imagery of non-rigid 3D objects under varied viewing conditions with excellent results.
On-line computer auditing
Authors: Harvey S. Koch
Venue: Proceedings of the 1979 annual conference (1979)

An auditing technique that audits transactions as they are being processed will be introduced. Concurrent and Intermittent Simulation (CIS) is an auditing technique that is very similar to parallel simulation in terms of the amount of work and type of code that must be completed by the auditor. However, in terms of capabilities, CIS is much more advanced than parallel simulation. CIS is an auditing technique that simulates the instruction execution of the application at the time the application is processing a transaction. All data and input to the application is accessible by and shared with the simulation. This means that the simulation knows about each transaction that is entered to the application, all accesses to the data base by the application can be monitored and all working-storage values of the application can be accessed by the simulation. Before any updates are made to the data base or before any output is returned to the users, the simulation can verify the results by executing the appropriate instructions of the simulation by having access to the transaction, working storage values and the data base. If an inconsistency is found, all pertinent information about the system status can be put into the exception log. The simulation then has the choice to allow the results computed by the application to be used, to use the results computed by the simulation or not to use any of the results, as if there was no transaction.
Gest implementation
Authors: Tuncer I. Oren
Venue: Proceedings of the ACM annual conference (1973)

GEST is a combined simulation language especially developed for the simulation studies of large scale systems.1 The modelling methodology of GEST is based on the general system theory developed by Wymore.2 GEST provides facilities for time-varying and adaptive system3 simulation studies where both the components and the structure of a system can vary. The discrete portion of the GEST language is being implemented at the Computer Science Department of the University of Ottawa.4,5 Current status and salient features of the implementation are discussed.
Artemis&mdash;an operating system for OSI microcomputers
Authors: N. Solntseff
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

The file system and structure of a single-user operating system is described. The system is designed to run in a laboratory setting on a small microcomputer connected to a network with both private and network disk storage.
Zeus: An object-oriented distributed operating system for reliable applications
Authors: James C. Browne, James E. Dutton, Vincent Fernandes, Annette Palmer, Jonathan Silverman, Anand R. Tripathi, Pong-sheng Wang
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This paper presents the principles followed in designing Zeus, an object-oriented distributed operating system designed to study integration of recovery mechanisms into the designs of distributed command and control systems. The primary goal of the Zeus design is to define reliable object management functions for distributed command and control systems and to evaluate the performance and the correctness of the recovery mechanisms for these functions. Therefore, no implementation of this design currently exists. The user provided functions support definition of object types, creation of objects, and updating of distributed objects using atomic transactions. We are currently evaluating the performance characteristics of this design using simulation models and proving the correctness of the recovery mechanisms using formal methods based on Gypsy language [AKER83], events and state transition based models [TRIP83b], and simulation models. To achieve these goals we have refined the Zeus design to a significantly detailed level. To date we have explored this design only from the viewpoint of these goals. Several research problems necessary to implement this system remain unexplored. For example, a linguistic mechanism is needed to introduce object type definitions into the system and to define processes and transactions. A distributed operating system for highly reliable applications must provide 1) recovery mechanisms that are transparent to the application developers and 2) naming mechanisms that make the physical distribution of objects and functions transparent to the application programmer. The second feature is important to make development of distributed software no more difficult than the development of conventional software systems. The Zeus design has made a significant contribution In this direction. Other systems have integrated these two concepts in their designs, however they typically limit object management to the file storage level. To date, Argus [LISK82] is the only other system which provides a set of general mechanisms for reliable management of distributed objects of any type. Zeus provides these mechanisms and addresses several other issues such as object relocation, authentication and object protection, not included in the Argus design. Another novel feature in Zeus is the integration of the conventional database management functions into the operating system object management functions. This is important because most of the todays popular operating systems do not provide efficient machanisms for database applications [STON81]. Even with respect to its recovery model, the Zeus design differs significantly from other known designs.
A fast maze router with iterative use of variable search space restriction
Authors: Fumiya Tada, Kiyoshi Yoshimura, Takashi Kagata, Takeyoshi Shirakawa
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper describes a new method of restricting search space for maze routing, to achieve a higher routing completion ratio and shorter machine time. The router is applied iteratively, expanding the width of L-shaped search space restriction from narrow one to wider ones successively. Using this method, machine time was reduced to one-fourth and the routing completion ratio was more than 10% higher in experimental comparison with singly restricted routers of no iteration. This paper also discusses an analysis to help to decide the iteration number and L-shaped path width.
DREAM - an approach to designing large scale, concurrent software systems
Authors: Jack C. Wileden
Venue: Proceedings of the 1979 annual conference (1979)

The Design Realization, Evaluation And Modelling (DREAM) system is an automated support system for designers of large-scale, concurrent software systems. DREAM is intended to facilitate the orderly development of such software systems by supporting high-level, abstract design descriptions and the successive modification and elaboration of incomplete descriptions. DREAM also provides a basis for formulating arguments regarding the correctness of an evolving design at any stage during its development. We begin this paper by presenting a viewpoint which has served to motivate our work in developing the DREAM system. Next we will describe DREAM itself, and its associated design language (the DREAM Design Notation or DDN). This discussion will highlight the major features of DREAM and the approach to software system design which DREAM supports. Finally, we will present a simple example of a DREAM design description. This should serve to illustrate both the specifics of the DREAM Design Notation and also the application of DDN to the description of concurrent software system designs.
Cruise missile logistics support simulation model
Authors: D. Ingerman, C. M. Marshall
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

This paper describes a simulation model developed as a tool for designing a logistics system that will be used to support the deployment of Sea Launched Cruise Missiles (SLCM). The SLCM deployment scenario is complicated by a number of independent factors that influence each other to create an enormous resource-management problem. A GPSS model was implemented to assist in evaluating alternative strategies for dealing with the problem.
Serializability in multi-level monitor environments
Authors: Abraham Silberschatz
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper presents a method of proving the correctness of systems which allow process synchronization. It is assumed that a system is modelled as a collection of monitors which cooperate to fulfill requests for service submitted to the system by user processes. Such systems can be proved correct in two steps. First, show that each user request is handled correctly under the assumption that there is no other concurrent activity in the system. Second, show that when requests are processed concurrently, the results are the same as would be obtained by processing the requests serially. The purpose of this paper is to establish a set of conditions which will be sufficient to guarantee that concurrent operation will be equivalent to serial operation. Given such conditions, we establish restrictions on the structure of a system to guarantee this equivalence. These restrictions provide insight into the questions as to how the system modules should be constructed and how these modules should he interconnected.
Secure use of personal workstations and local area networks
Authors: Leslie D. Ball
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This panel is charged with presenting solutions to problems associated with securing the personal workstation and local area networks. My function is to set the stage for the presentations which will follow by defining technology changes that are occurring and suggesting security issues that evolve from these changes. My job, then, is to raise the problems while my esteemed associates will present the solutions. Changes are occurring both in the technology that we are using and in the manner in which businesses are managed. At least nine major technology changes impact office systems. First, there is a move which seems to grow daily towards distributed data processing. A partial cause of this movement is the increased availability of small computers and management's desire to have their processing power closer to the information users.
The status of systems for on-line mathematical assistance
Authors: Adrian Ruyle, John W. Brackett, Roy Kaplow
Venue: Proceedings of the 1967 22nd national conference (1967)

Accelerated by the advent of time-sharing, on-line systems of all types have come into being during the past five years. All of these systems are designed to facilitate the interchange of information between the user and the machine. The applications to which such systems have been put are numerous and extremely varied, yet those systems which attempt to provide a general facility for mathematical computation form a relatively small class. This paper attempts to survey and analyze some members of this restricted class in order to illustrate their common features, strong points, and areas of weakness, as well as to indicate some of the features which are desirable in any system designed to provide on-line mathematical assistance. We believe that these systems, when implemented on third generation computers, will serve large numbers of users, including numerical analysts, scientists and engineers.
Character Segmentation in Highly Blurred Ancient Printed Documents
Authors: Anna Tonazzini, Luigi Bedini
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Character segmentation, which is a fundamental preliminary step for character recognition, is particularly critic in the case of ancient printed documents, where several degradation processes may cause the characters to touch and merge one another. In the paper the problem of character segmentation is formulated as the minimization of a cost function which accounts for data consistency and expresses both radiometric constraints on the image gray levels and geometrical constraints on the character boundaries. Since the degradation operator, which derives from several and diverse factors, is also unknown, it must be estimated along with the segmented image. Hence, we propose a solution strategy where steps of image estimation iteratively alternate with steps of estimation for the degradation operator. Results of both simulated and real experiments are shown to validate the method.
APL models for operational planning of shipment routing, loading, and scheduling
Authors: Richard D. Cuthbert, Larry Peckham
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A vehicle routing algorithm with an imbedded loading heuristic and movement simulation was developed to provide the interactive capability to plan shipment delivery and returns. The vehicle movement model is a small discrete event fixed interval simulation that uses the APL operators to keep track of loading facility status, truck location, etc. for scheduling purposes. The models operate in a field environment, but are linked to centralized planning models and data bases. They are illustrative of APL's almost unique ability to combine simulation modeling with operational restrictions such as interactive operation by non-programmers.
Some pedagogic considerations in teaching elementary programming using structured FORTRAN
Authors: Frank L. Friedman, Elliot B. Koffman
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This paper contains a description of several aspects of a course in introductory computer programming that is taught using a few basic control structure extensions to FORTRAN. The FORTRAN syntactic forms and flow diagram patterns of these structures are defined, and some of the advantages of these forms are listed. The problem solving methods developed in the course are outlined, and the structures are shown to be consistent with these methods. Some pedagogic considerations which provide an effective environment for the presentation of these control structures are described.
Data Usage And The Data Base Processor
Authors: Olin H. Bray, Sperry Univac
Venue: Proceedings of the 1978 annual conference (1978)

Although the use of Data Base Management Systems is rapidly growing, there is little hard data on how these systems are being used. However, this information is critical to defining the functional requirements for a data base processor which can effectively support current applications. This paper reports on a survey conducted to show how Data Base Management Systems are currently being used. It describes the survey taken, the respondees to the questionnaire, and the questionnaire itself&mdash;what items were included and the reasons for including them. A summary of the results of this survey and the implications of these results on the different architecture features and alternatives are given. Conclusions are drawn as to the survey/questionnaire approach. Additional survey work that may be needed and new areas for investigation as well as areas in which more depth is required are included.
Evolving toward Ada in real time systems
Authors: Lee MacLaren
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

The Ada view of multitasking represents a radical departure from the traditional &ldquo;cyclic executive&rdquo; approach to real time operating systems. Since system designers must by necessity be conservative, it would be unrealistic to expect an abrupt change of this magnitude in engineering practice. Instead, this paper outlines a sequence of intermediate steps designed so that the advantages and familiar structures of cyclic systems may be retained, while the capabilities of Ada multitasking are gradually incorporated. A scale of increasing scheduling complexity provides the justification for this sequence. The discussion of each step then briefly mentions some of the related benefits and costs. The paper draws some conclusions about the use of Ada in real time systems.
A more flexible image generation environment
Authors: F. C. Crow
Venue: ACM SIGGRAPH Computer Graphics (1982)

A supervisory process is used to distribute picture-generation tasks to heterogeneous subprocesses. Significant advantages accrue by tailoring the subprocesses to their tasks. In particular, scan conversion algorithms tailored to different surface types may be used in the same image, a changing mixture of processors is possible, and, by multiprogramming, a single processor may be used more effectively. A two-level shape data structure supports this execution environment, allowing top-level priority decisions which avoid comparisons between surface elements from non-interfering objects during image construction.
Managed file distribution on the universe network
Authors: Christopher S Cooper
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

The file distribution system on the Universe Network consists of a distributed set of co-operating agents which provide clients with a reliable bulk file collection, transfer and delivery service. The agent systems incorporate specialised techniques for optimizing use of the satellite channel, as well as making available facilities for broadcast file distribution. The distributed system architecture and protocols are described, with emphasis on the separation of control and data transfer. A detailed presentation is given of the way in which agents interact with both hosts and other agents to achieve both reliability and robustness in the face of breaks in host or network availability. A description is given of the special transfer methods used and some of the possible applications for such a system. An indication is given of possible future developments to enable evolution from an experimental to service system.