ppxscal/embedding_network huggingface dataset:
RESILIENT MEMORY-RESIDENT DATA OBJECTS
Authors: Jehan Paris, Darrell D.E. Long
Venue:  (1990)

Data replication has been widely used to build resilient data objects. These objects normally consist of several replicas stored in stable storage and a replication control protocol managing these replicas. Replicated data objects incur a significant penalty resulting from the increased number of disk accesses. We propose several protocols that improve performance while not significantly impacting the availability of the replicated data object. Our replicated data objects consist of several memory-resident replicas and one append-only log maintained on disk. We analyze, under standard Markovian hypotheses, the availability of these data objects when combined with three of the most popular replication control protocols: *available copy* (AC), *majority consensus voting* (MCV), and *dynamic-linear voting* (DLV). We show that replicated objects consisting of n memory-resident replicas and a disk-resident log have almost the same availability as replicated objects having n disk-resident replicas.
MBone - Systemspezifische Gestaltung und erste Erfahrungen mit Videokonferenzen
Authors: J. Elkner, S. Geschke, O. Kunert, F. Zbrog
Venue:  (1997)

Der vorliegende Report widmet sich wesentlichen Aspekten des Aufbaus und Betriebes von Videokonferenz-Systemen. Neben einem Einblick in die theoretischen Grundlagen - insbesondere Gruppen- und Routing-Techniken in IP-Multicasting - bildet eine Analyse des soziologischen Umfeldes von Videokonferenzen sowie eine Einfuhrung in geeignete Multimedia-Applikationen den Rahmen fur die Bewertung von Lastmessungen, welche im Abschlu? des Reports die technischen Anforderungen an die Kommuniukationsinfrastruktur dokumentieren. Die praktischen Erfahrungen beruhen dabei auf der Planung, Organisation und Durchfuhrung von Videokonferenzen an der Fakultat Informatik der Universitat Magdeburg, und sind als Leitfaden zur Vorbereitung aquivalenter Systeme gedacht.
Counting Unlabelled Subrees of a Tree is #P-complete
Authors: Leslie A Goldberg, Mark Jerrum
Venue:  (1999)

The problem of counting unlabelled subtrees of a tree (i.e., subtrees that are distinct up to isomorphism) is #P-complete, and hence equivalent in computational difficulty to evaluating the permanent of a 0,1-matrix.
Specifying Schedulability for Real-Time Programs
Authors: Zhiming Liu, M. Joseph, Tomasz Janowski
Venue:  (1993)

Assume that a real-time program PT consisting of a number of parallel processes is executed on a system with a set Pr of processors. This paper considers how it can be proved that PT will meet its timing deadlines when the processors are shared between the processes by a real-time scheduler ST. We show that such an implementation of PT can be represented as a transformation SCH(ST, PT, Pr) and that the deadlines of PT will be met if they are satisfied by the timing properties of the transformed program. The scheduler ST can be specified generically and applied to different programs, making it unnecessary to introduce low-level operations such as scheduling primitives into the programming language. The approach has the advantage of considering realtime program specification and schedulability in the same framework and provides a way to determine at the level of the specification the timing properties of a program implementation. By separating the specification of the scheduler from that of the program we can prove the feasibility of an implementation by considering a scheduling policy rather than its implementation details.
Agents That Model Themselves
Authors: I. D. Craig
Venue:  (1994)

In this paper, we adopt a symbolic interactionist perspective on Multi-Agent Systems. We investigate the uses and genesis of agent models, both Self and acquaintance models and argue that the symbolic interactionist view is superior to the ad hoc, static and somewhat low-level approach adopted at present. We consider agent modelsQboth Self and acquaintance modelsQas devices for making predictions about and the formation of explanations of agentsU actions. We then argue that Self models are prior to and instrumental in, because of perspective and because of role taking, the construction of acquaintance models. We also argue for our position that social structure is dynamic and that socially organised agents must be dynamic in their nature.
A COMPARISON OF NEW AND OLD ALGORITHMS FOR A MIXTURE ESTIMATION PROBLEM
Authors: David Helmbold, Robert Schapire, Yoram Singer, Manfred Warmuth
Venue:  (1995)

We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for supervised learning and give simple derivations for many of the standard iterative algorithms like gradient projection and EM. In this framework, the distance between the new and old proportion vectors is used as a penalty term. The square distance leads to the gradient projection update, and the relative entropy to a new update which we call the exponentiated gradient update ($EG_\eta$). Curiously, when a second order Taylor expansion of the relative entropy is used, we arrive at an update $\EMeta$ which, for $\eta=1$, gives the usual EM update. Experimentally, both the $EM_\eta$-update and the $EG_\eta$-update for $\eta<1$ outperform the EM algorithm and its variants. We also prove a polynomial bound on the worst-case global rate of convergence of the $EG_\eta$ algorithm.
Comparing Multiple File Copies With a Primary Copy Using Minimal Communication
Authors: Khaled A.S. Abdel-Ghaffar, Amr El Abbadi
Venue:  (1993)

For data consistency in distributed database systems, it is necessary to compare remotely located copies of a file. The cost of such comparison is in the amount of communication required to identify the erroneous pages in the different copies. We assume that the sites at which the copies reside can communicate only with a primary site that contains an exact copy of the file. The minimum amount of communication necessary to identify any given number of erroneous pages is determined and a technique to attain this minimum is presented.
Predicting Maintainability with Software Quality Metrics
Authors: Sallie M. Henry, Steven A. Wake
Venue:  (1988)

Maintenance of software makes up a large fraction of the time and money spent in the software life cycle. By reducing the need for maintenance these costs can also be reduced. Predicting where maintenance is likely to occur can help to reduce maintenance by prevention. This paper details a study of the use of software quality metrics to determine high complexity components in a software system. By the use of a history of maintenance done on a particular system, it is shown that a predictor equation can be developed to identify components which needed maintenance activities. This same equation can also be used to determine which components are likely to need maintenance in the future. Through the use of these predictions and software metric complexities it should be possible to reduce the likelihood of a component needing maintenance. This might be accomplished by reducing the complexity of that component through further decomposition. Even though this is only one study, this methodology of developing maintenance predictors could be applied in any environment.
Polar Backpropagation - Determining the Chromaticity of a Light Source
Authors: Keith Godfrey, Yianni Attikiouzel
Venue:  (1990)

A modification of the backpropagation paradigm called polar backpropagation is used to determine the chromaticity of a light source from the scattergram of an image. Knowledge of the light source enables correct classification of hues.
On Numerical Differential Algebraic Problems with Application to Semiconductor Device Simulation
Authors: Uri Ascher
Venue:  (1987)

This paper considers questions of conditioning of and numerical methods for certain differential algebraic equations subject to initial and boundary conditions. The approach taken is that of separating ``differential'''' and ``algebraic'''' solution components, at least theoretically. This yields conditioning results for differential algebraic boundary value problems in terms of ``pure'''' differential problems, for which existing theory is well-developed. We carry the process out for problems with (global) index 1 or 2. For semi-explicit boundary value problems of index 1 (where solution components are separated) we give a convergence theorem for a special class of collocation methods. For general index 1 problems we discuss advantages and disadvantages of certain symmetric difference schemes. For initial value problems with index 2 we discuss the use of BDF schemes, summarizing conditions for their successful and stable utilization. Finally, the present considerations and analysis are applied to two problems involving differential algebraic equations which arise in semiconductor device simulation.
APPROACHES TO UNCERTAINTY VISUALIZATION
Authors: Alex Pang, Craig Wittenbrink, Suresh Lodha
Venue:  (1996)

Visualized data often have dubious origins and quality. Different forms of uncertainty and errors are also introduced as the data are derived, transformed, interpolated, and finally rendered. In the absence of integrated presentation of data and uncertainty, the analysis of the visualization is incomplete at best and often leads to inaccurate or incorrect conclusions. This paper surveys techniques for presenting data together with uncertainty. These uncertainty visualization techniques present data in such a manner that users are made aware of the locations and degree of uncertainties in their data so as to make more informed analyses and decisions. The techniques include adding glyphs, adding geometry, modifying geometry, modifying attributes, animation, sonification, and psycho-visual approaches. We present our results in uncertainty visualization for environmental visualization, surface interpolation, global illumination with radiosity, flow visualization, and figure animation. We also present a classification of the possibilities in uncertainty visualization, and locate our contributions within this classification.
An Alternative Characterization of Precomplete Numerations
Authors: K, Akira a
Venue:  (1984)

Er\u{s}ov [1] characterized precomplete numerations as those numerations which satisfy the 2nd recursion theorem. In this short note we show that they are exactly those numerations which satisfy the strongest form of the 2nd recursion theorem.
Optimum features for pattern recognition
Authors: Arkell
Venue:  (1994)

Abstract unavailable. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Processor-Efficient Scheme for Supporting Fault-Tolerance in Rate-Monotonic Scheduling
Authors: Yingfeng Oh, Sang H. Son
Venue:  (1995)

We address the issue of supporting fault-tolerance in a real-time system, where the deadlines of periodic tasks are guaranteed by the Rate-Monotonic algorithm. The problem is stated as one to minimize the total number of processors required to execute a set of periodic tasks, each of which, for fault-tolerance purposes, has multiple versions. A simple but effective algorithm is proposed to solve the task allocation problem. The algorithm is shown to have superior worst-case and average-case performance.
RF-Maple: A Logic Programming Language with Functions, Types \& Concurrency
Authors: Paul J. Voda, Yu Benjamin
Venue:  (1984)

Currently there is a wide interest in the combination of functional programs with logic programs. The advantage is that both the compostion of functions and non-determinism of relations can be obtained. The language RF-Maple is an attempt to combine logic programming style with functional programming style. ``RF'''' stands for ``Relational and Functional''''. It is a true union of a relational programming language R-Maple and a functional programming language F-Maple. R-Maple is a concurrent relational logic programming language which tries to strike a balance between control and meaning. Sequential and parallel execution of programs can be specified in finer details than in Concurrent Prolog. R-Maple uses explicit quantifiers and has negation. As a result, the declarative reading of R-Maple programs is never compromised by the cuts and commits of both Prologs. F-Maple is a very simple typed functional programming language (it has only four constructs) which was designed as an operating system at the same time. It is a syntactically extensible language where the syntax of types and functions is entirely under the programmer''s control. In combining the two concepts of R-Maple and F-Maple producing RF-Maple, the readability of programs and the speed of execution are improved. The latter is due to the fact that many relations are functional and therefore, do not require backtracking. We believe its power as well as its expressiveness and ease of use go a little beyond the possibilities of the currently available languages.
Element-free crack propagation by partition of unity weighted quadrature
Authors: A. Carpinteri, G. Ferro, G. Ventura
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

One of the most promising application of element-free methods is the ability of analyzing crack propagation problems without the necessity of remeshing the model as the crack advances. Moreover the possibility of enriching the classical polynomial basis, introducing some integrals of the Westergaard's solution, make the near crack tip solution accurate without requiring a very fine discretization or special treatment. In the paper the crack propagation problem is numerically analyzed by a new approach in computing the equilibrium equations. In this approach the quadrature of the variational form is not realized by introducing a background cell structure, as commonly done in literature, but by a truly mesh-free approach based on the partition of unity property of the shape functions. Some numerical examples illustrate the effectiveness of the method.
Message Dispatch on Modern Computer Architectures
Authors: Karel Driesen, Urs Holzle, Jan Vitek
Venue:  (1995)

Object-oriented systems must implement message dispatch efficiently in order not to penalize the object-oriented programming style. We characterize the performance of most previously published dispatch techniques for both statically- and dynamically-typed languages with both single and multiple inheritance. Hardware organization (in particular, branch latency and superscalar instruction issue) significantly impacts dispatch performance. For example, inline caching may outperform c++-style "vtables" on deeply pipelined processors even though it executes more instructions per dispatch. We also show that adding support for dynamic typing or multiple inheritance does not significantly impact dispatch speed for most techniques, especially on superscalar machines. Also, instruction space overhead (calling sequences) can exceed the space cost of data structures (dispatch tables), so that minimal table size may not imply minimal run-time space usage.
The Spring System: Integrated Support for Complex Real-Time Systems
Authors: John A. Stankovic, Krithi Ramamritham, Douglas Niehaus, Marty Humphrey, Gary Wallace
Venue:  (1998)

The Spring system is a highly integrated collection of software and hardware that synergistically operates to provide end-to-end support in building complex real-time applications. In this paper, we show how Spring''s specification language, programming language, software generation system, and operating system kernel are applied to build a flexible manufacturing testbed. The same ingredients have also been used to realize a predictable version of a robot pick and place application used in industry. These applications are good examples of complex real-time systems that require flexibility. The goal of this paper is to demonstrate the integrated nature of the system and the benefits of integration; in particular, the use of reflective information and the value of function and time composition. The lessons learned from these applications and the project as a whole are also presented.
Practical application of an advanced real time structural monitoring system
Authors: A. Goodier, S. L. Matthews
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper describes the new and novel aspects of an advanced monitoring system developed for a unique structural test undertaken by the Building Research Establishment (BRE). To set the context for the monitoring system the paper briefly describes the building being tested, the reasons for the testing, the test apparatus and the testing itself. The paper describes the development and use of the test computer system, known as the Cardington Test System (CTS), to illustrate: how such a system is developed, the advantages of using a real time expert system to develop the system and the operation of the system. The CTS was developed using a real time expert system environment (shell) from Gensym called G2 on a medium specification Windows NT workstation. The system was developed using the rapid prototyping methodology. Figures are presented to illustrate the system in use and demonstrate the benefits of the chosen approach.
Site-Select Messaging for Distributed Systems
Authors: Jonathan C. Hill
Venue:  (2002)

A technical description of the expressiveness and cost of Site-Select Messaging implemented on content-driven Publish/Subscribe.
Evolving coordinated agents
Authors: Sandip Sen, Sandip Debnath, Manisha Mundhe
Venue: Advances in evolutionary computing: theory and applications (2003)

In recent years, considerable interest and enthusiasm have been generated by the prospect of widespread use of intelligent agent-based systems [18]. In particular, a number of researchers have been investigating the design and implementation of systems consisting of multiple agents [26]. The design of successful multiagent systems is, however, a problem of significant magnitude and difficulty. Often multiple, conflicting criteria have to be simultaneously optimized to come up with a cost-effective multiagent system design. Agent system design may involve designing the infrastructure or environment for agent interaction as well as behavioral strategies for individual or multiple agents. Agent behaviors handcrafted offline can be inadequate if possible interactions are overlooked. Genetic algorithms provide us with another tool for designing both individual agent behaviors as well as social rules for multiagent systems. In this chapter we identify different modes for evolving agent groups and present instances of two different approaches: a coevolutionary optimization approach, and an adaptive system approach.
Legion: An Operating System for Wide-Area Computing
Authors: A. Grimshaw, A. Ferrari, F. Knabe, M. Humphrey
Venue:  (1999)

Applications enabled by the increasing availability of high-performance networks require the ability to share resources that are spread over complex, large-scale, heterogeneous, distributed environments spanning multiple administrative domains. We call this the wide-area computing problem. We argue that the right way to solve this problem is to build an operating system for the network that can abstract over a complex set of resources and provide high-level means for sharing and managing them. We describe the design of one such wide-area operating system: Legion. Through discussion of application examples, we demonstrate the attractive features of Legion approach to constructing a wide-area operating system using distributed object components.
An Introduction to the CHIP3S Language for Characterising Parallel Systems in Performance Studies
Authors: E. Papaefstathiou, Darren J. Kerbyson, Graham R. Nudd, T. J. Atherton
Venue:  (1995)

A characterisation toolset, Characterisation Instrumentation for Performance Prediction of Parallel Systems (CHIP3S), for predicting the performance of parallel systems is presented in this report. In this toolset expert knowledge about the performance evaluation techniques is not required as a prerequisite for the user. Instead a declarative approach to the performance study is taken by describing the application in a way that is both intuitive to the user, but can also be used to obtain performance results. The underlying performance related characterisation models and their evaluation processes are hidden from the user. This document describes the special purpose language, and the evaluation system, that form the core of the CHIP3S toolset. Amongst the aims of the toolset is the support of characterisation model reusability, ease of experimentation, provide different levels of prediction accuracy, and support of different levels of characterisation model abstraction.
Partial Metrics, Valuations and Domain Theory
Authors: S. J. O''Neill
Venue:  (1995)

In this paper we develop some connections between the partial metrics of Matthews and the topological aspects of domain theory. We do this by introducing the valuation spaces, which are a special class of partial metric spaces. We develop the natural duality of partial metrics and propose that a natural context in which to view a partial metric space is as a bitopological space. We then see that successive conditions on a valuation can ensure that the pmetric topology is first of all order consistent (with the underlying poset), then equivalent to the Scott topology, and finally that the induced metric topology is equivalent to the patch topology.
An Operation Model Supporting the Generation of Requirements That Capture Customer Intent
Authors: Arthur James D., Groner Markus K.
Venue:  (1999)

Product quality is a direct reflection of how well it meets the cutomer''s needs. Hence, the ability to capture customer requirements correctly and succinctly is paramount. Unfortunately, within software development frameworks the gathering of requirements is one of the more ill-defined and least structured processes. To address this inadequacy, our paper (a) proposes a refinement (or decomposition) to the requirements generation phase that admits to detailed examination and promotes a better understanding of where requirements generation goes wrong,(b) using the results of a preliminary study, identifies where and how miscommunication and requirements omission occur, and (c) outlines a more structured process that can be applied early in the requirements generation process to minimize requirement faults.
GROVER: A Graph Plotting Program for Sun Workstations
Authors: Paul Chown
Venue:  (1990)

This report is a manual for the GROVER plotting package, which provides a facility for users of a Sun Workstation to manipulate numerical data in graphical form. The interface to GROVER is in the form of an interpreted command language, allowing interactive manipulation of two dimensional graphs generated from a variety of data formats. The interface can be operated from a standard character terminal although access to a Sun Workstation enables the effect of commands to be seen directly.