ppxscal/embedding_network huggingface dataset:
Evaluating a Flexible Architecture for Distributed Control
Authors: P. Bellini, M. Buonopane, M. Montanelli, P. Nesi
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

Along production pipelines in manufactory industries several elaboration phases in which the movement of Interpolated axes are present. These activities have to be synchronized with several other simpler activities along the pipeline. Computerized numerical controls for such systems have to be flexible and strongly expandable and reusable since pipelines are frequently reconfigured to realize differently arranged pipelines with different technical requirements. In this paper, the assessment of such a flexible architecture is presented on the basis of which the building of flexible distributed controls for pipelines is possible. The architecture has been defined in the ESPRIT HPCN (High Performance Computer Networking) project MUPAAC [Multi Processor Architecture for Automatic Control]. MUPAAC architecture and prototype has been assessed in order to identify the most important performance indexes.
Dynamic Server Selection in the Internet
Authors: Mark Crovella, Robert Carter
Venue:  (1995)

Abstract As distributed information services like the World Wide Web become increasingly popular on the Internet, problems of scale are clearly evident. A promising technique that addresses many of these problems is service (or document) replication. However, when a service is replicated, clients then need the additional ability to find a ``good'''' provider of that service. In this paper we report on techniques for finding good service providers without a priori knowledge of server location or network topology. We consider the use of two principal metrics for measuring distance in the Internet: hops, and round-trip latency. We show that these two metrics yield very different results in practice. Surprisingly, we show data indicating that the number of hops between two hosts in the Internet is {\em not\/} strongly correlated to round-trip latency. Thus, the distance in hops between two hosts is not necessarily a good predictor of the expected latency of a document transfer. Instead of using known or measured distances in hops, we show that the extra cost at runtime incurred by dynamic latency measurement is well justified based on the resulting improved performance. In addition we show that selection based on dynamic latency measurement performs much better in practice that any static selection scheme. Finally, the difference between the distribution of hops and latencies is fundamental enough to suggest differences in algorithms for server replication. We show that conclusions drawn about service replication based on the distribution of hops need to be revised when the distribution of latencies is considered instead.
Analysis of a distributed system for lifting trucks
Authors: Jan F Groote, J. Pang, A. G. Wouters
Venue:  (2001)

The process-algebraic language muCRL is used to analyse an existing distributed system for lifting trucks. Four errors are found in the original design. We propose solutions for these problems and show by means of model-checking that the modified system meets the requirements.
A Wavelet-Based Technique for Image Similarity Estimation
Authors: Emma Regentova, Shahram Latifi, Shulan Deng
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In this paper, we proposed a method to evaluate the similarity of images compressed by a given digital wavelet transform, which allows for comparing lossless-or-lossy-compressed images. Two features that describe the image structural content, edge point locations and edge density, are computed directly from multiscale data. Depending on the image type and the feature selections for processing, the distance between two images is computed in one- or two-dimensional space. This method facilitates content-based image querying and automatic database retrieval. In addition, images can be sorted and appropriately indexed with respect to such global characteristics as smoothness, texture direction and repetition period.
Java applets for the dynamic visualization of Voronoi diagrams
Authors: Christian Icking, Rolf Klein, Peter Köllner, Lihong Ma
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

This paper is dedicated to Thomas Ottmann on the occasion of his 60th birthday. We discuss the design of several Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying distance function is changed. Moreover, we report on some experiences made in using these applets in teaching and research. The applets can be found and tried out at http://wwwpi6.fernuni-hagen.de/GeomLab/.
A Relaxed Mutual Exclusion Problem with Application to Channel Allocation in Mobile Cellular Networks
Authors: Ten H. Lai, Jianping Jiang, Tao Ma
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Distributed channel allocation is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). However, it is still not clear what is the relationship between the two problems.In this paper, we establish the exact relationship between the two. Specifically, we introduce the problem of relaxed mutual exclusion to model the problem of distributed channel allocation. We develop a general algorithm that guarantees relaxed mutual exclusion for a single resource, prove a necessary and sufficient condition for the information structure, and address the issues that arise in relaxed mutual exclusion, including deadlock resolution, dealing with multiple resources, and design of efficient information structure.
Building Maintainable COTS Based Systems
Authors: Mark R. Vigder, John Dean
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Maintaining large software systems based on Commercial Off-The-Shelf (COTS) components is a major cost driver for these systems. Maintenance includes activities from component replacement to trouble-shooting and configuration management. The maintenance costs for COTS based software systems can be reduced by building systems according to specific design criteria. This paper identifies the major activities of a system maintainer, describes the properties that can be designed into a system to facilitate these activities, and outlines a checklist of items that can be verified during a design or code review, or during the evaluation of a COTS components in order to guarantee these properties are built into the system. The verification is illustrated using a photo imaging system that is currently under development.
HASDF: a generalized LR-parser generator for Haskell
Authors: M. Jonge, T. Kuipers, J. M.W. Visser
Venue:  (1999)

Language-centered software engineering requires language technology that (i) handles the full class of context-free grammars, and (ii) accepts grammars that contain syntactic information only. The syntax definition formalism SDF combined with GLR-parser generation offers such technology. We propose to make SDF and GLR-parsing available for use with various programming languages. We have done so for the functional programming language Haskell. By combining Haskell data type definitions with the syntax definition formalism SDF we have designed HASDF. HASDF is a domain-specific language in which the concrete syntax of an arbitrary context-free language can be defined in combination with the Haskell data types that represent its abstract syntax. We have implemented a tool that generates a GLR-parser and an unparser from a HASDF definition.
A system of exchange values to support social interactions in artificial societies
Authors: Maíra Ribeiro Rodrigues, A. C. da Rocha Costa, Rafael H. Bordini
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes a system of values for modelling social exchanges among agents in artificial societies. The system consists of an algebra of exchange values, a social-reasoning mechanism based on that algebra, and the specification of structures for storing and manipulating such values. The notion of exchange values used here is the one defined in J.Piaget's sociology of small groups, which provides a simple theoretical framework for our endeavour. We show how the system can be integrated with existing interaction models in multi-agent systems. We also illustrate the use of our value-based system by a brief model of the political process of lobbying through campaign contributions.
Hardware Schemes for Early Register Release
Authors: Teresa Monreal, Víctor Viñals, Antonio González, Mateo Valero
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Register files are becoming one of the critical components of current out-of-order processors in terms of delay and power consumption, since their potential to exploit instruction-level parallelism is quite related to the size and number of ports of the register file. In conventional register renaming schemes, register releasing is conservatively done only after the instruction that redefines the same register is committed. Instead, we propose a scheme that releases registers as soon as the processor knows that there will be no further use of them. We present two early-releasing hardware implementations with different performance/complexity trade-offs. Detailed cycle-level simulations show either a significant speedup for a given register file size, or a reduction in register file size for a given performance level.
A Comparison of Known Classes of Reliable Multicast Protocols
Authors: Brian Neil Levine, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the premise that the mechanisms used to release data at the source after correct delivery should be decoupled from the mechanisms used to pace the transmission of data and to effect error recovery. Receiver-initiated protocols, which are based entirely on negative acknowledgments (NAKs) sent from the receivers to the sender, have been proposed to avoid the implosion of acknowledgments (ACKs) to the source. However, these protocols are shown to require infinite buffers in order to prevent deadlocks. Two other solutions to the ACK-implosion problem are tree-based protocols and ring-based protocols. The first organize the receivers in a tree and send ACKs along the tree; the latter send ACKs to the sender along a ring of receivers. These two classes of protocols are shown to operate correctly with finite buffers. Following our taxonomy, the maximum attainable throughput by the known classes of reliable multicast protocols is analyzed. It is shown that tree-based protocols constitute the most scalable class of all reliable multicast protocols proposed to date.
A Secure Key Registration System Based on Proactive Secret-Sharing Scheme
Authors: Masayuki Numao
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

We designed a secure key registration system based on the proactive secret-sharing scheme. A user can register important data such as a session key to a distributed system in a (t, n)-threshold scheme, which means that the data can be recovered if t servers cooperate (in other words, that the data cannot be revealed unless t servers collude). The proactive scheme provides stronger security against an active adversary. We designed the protocol to generate an implicit secret, to distribute shares of it, and to reconstruct the secret for proactive secret-sharing without a dealer.We also developed a prototype of a data archiving service framework on the Internet. To allow users to access the system via a Web browser, we implemented a system based on the PKI (public key infrastructure), where the client/server authentication is done by means of X.509 certification. We also used the publish/subscribe communication model to realize interaction between key management servers, because it is easy to implement the broadcasting channels used in the share update phase.
Understanding Replication in Databases and Distributed Systems
Authors: M. Wiesmann, F. Pedone, A. Schiper, B. Kemme, G. Alonso
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Replication is an area of interest to both distributed systems and databases. The solutions developed from these two perspectives are conceptually similar but differ in many aspects: model, assumptions, mechanisms, guarantees provided, and implementation. In this paper, we provide an abstract and ¿neutral¿ framework to compare replication techniques from both communities. The framework has been designed to emphasize the role played by different mechanisms and to facilitate comparisons. The paper describes the replication techniques used in both communities, compares them, and points out ways in which they can be integrated to arrive to better, more robust replication protocols.
Contract bridge as a Micro-world for reasoning about communication agents
Authors: Bjorn Gamback, Manny Rayner
Venue:  (1990)

We argue that bidding in the game of Contract Bridge can profitably be regarded as a micro-world suitable for experimenting with pragmatics. We sketch an analysis in which a "bidding system" is treated as the semantics of an artificial language, and show how this "language", despite its apparent simplicity, is capable of supporting a wide variety of common speech acts parallel to those in natural languages; we also argue that the reason for the relatively unsuccessful nature of previous attempts to write strong Bridge playing programs has been their failure to address the need to reason explicitly about knowledge, pragmatics, probabilities and plans. We give an overview of Pragma, a system currently under development at SICS, which embodies these ideas in concrete form, using a combination of rule-based inference, stochastic simulation, and "neural-net" learning. Examples are given illustrating the functionality of the system in its current form.
Resource and connection admission control in real-time transport protocols with deterministic QoS guarantees
Authors: Shanzeng Guo, N. D. Georganas
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Real-time multimedia applications will require guaranteed quality of service (QoS) such as a bound on the maximum message delay and/or on the maximum message loss rate. This poses an exciting challenge to the highspeed transport protocol design and implementations. In this paper, we study the resource and connection admission control algorithms, and give the necessary and sufficient conditions for the schedulability, of n real-time transport connections at a destination host under preemptive and non-preemptive deadline scheduling policy for deterministic QoS guarantees. These necessary and sufficient conditions form the mathematical basis for the deterministic QoS guarantees in real-time transport communication services. On the basis of these necessary and sufficient conditions, we give the connection admission control algorithms for deterministic QoS guarantees. We also calculate the buffer space needed for each real-time transport connection. The results show that real-time transport connections with deterministic QoS guarantees can reserve the buffer space at the establishment phase, and no flow control mechanism is required during the data transport phase. Our results could be applied to other fields as well, such as real-time operating systems.
A Concept for the Application of Augmented Reality in Manual Gas Metal Arc Welding
Authors: Petra Tschirner, Bernd Hillers, Axel Gräser
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

The large problem to create manual welds of constant high quality results from missing optical information during the actual welding process. Due to the extreme brightness conditions in arc welding and the use of protective glasses, even experienced welders can hardly recognizedetails of the welding process and the environment. This paper describes a new research project for the development of a support system for the welder.
Autonomous Coordination in Sensor Networks: Heterogeneous ADS
Authors: Yongdong Tan, Qunzhan Li, Qingquan Qian, Kinji Mori
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

In the future, intelligent sensors will connected through networks, each node have its own autonomy, heterogeneity, and under dynamic environments. We call these systems as a Heterogeneous Autonomous Decentralized Systems (HADS). Autonomy is an essential characteristic of HADS. In this paper, the application scenario, the technical challenge, the spatial and temporal measurements of sensor networks are discussed. When extending traditional ADS technologies to the sensor networks, we proposed some technical problems from autonomous coordination point of view, which are based on those measurements. It will help researchers for their research on sensor networks.
Content-based Retrieval of 3D Models in Distributed Web Databases by Visual Shape Information
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Digital documents assembled of different components like text, images, video, audio and 3D models are supported today by many distributed applications. This paper presents a new approach to retrieve 3D models as part of digital documents using content-based image retrieval functionality. To find a 3D model best fitting the user's query, shape information is extracted from the retrieved models and comparing shape images with the graphical user input generates a score. A distributed database environment with a WWW interface is presented and used as a generic implementation platform for this technique. The new retrieval method for 3D geometry is then described by extending the generic architecture in two steps with a server-side module and an interactive client display. It is outlined how this method can be used for partial geometry download of 3D models in digital libraries.
A graph-theoretical analysis of multicast authentication
Authors: Aldar C-F. Chan
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Message authentication is considered as a serious bottleneckto multicast security, particular for stream-type oftraffic. The technique of hash chaining/signature amortizationhas been proposed in many schemes for streamauthentication, with or without multicast settings. However,none of them is optimal. They either have a largepacket overhead or are not robust to packet loss. Someeven have a large receiver delay or require a large receiverbuffer size. These schemes are constructed by trial-and-errormethods. There lack tools to evaluate and comparetheir performances. There is no systematic way to constructthese schemes either. In this paper, we introduce the notionof dependence-graphs which links these hash-chained authenticationschemes to the well-known graph theory, andprovides an effective analytical tool. Many important metricsof a hash-chained authentication scheme can be readilyand easily determined from its dependence-graph. As well,a dependence-graph demonstrates design tradeoff and providesinsights into optimizing hash-chained schemes.
The Shifted Hessenberg System Solve Computation
Authors: Greg Henry
Venue:  (1994)

We present methods for improving data reuse in solving sequences of linear systems that are Hessenberg matrices shifted by a sequence of scalars times the identity or a triangular matrix. The methods take into consideration the robust handling of overflow and include new condition estimation strategies. We provide timings on both scalar and vector machines to demonstrate both the diversity and importance of these ideas. We also consider the application of these ideas on a distributed computer. Keywords: Hessenberg, Linear Equations, Parallel
Electrophoresis of Charged polymers: Simulation and Scaling in the Repton Model
Authors: G. T. Barkema, J. F. Marko, B. Widom
Venue:  (1994)

(The following contains mathematical symbols that may become distorted in ASCII text.) We report numerical results on the repton model of Rubinstein as adapted by Duke as a model for the gel electrophoresis of DNA. We describe an efficient algorithm with which we have simulated chains of N reptons with N several hundred in some instances. The diffusion coefficient D in the absence of an external electric field is obtained for N >= 100; we find (formula omitted) for large N. The coefficient 1/3 is in accord with the analytical results of Rubinstein and of van Leeuwen and Kooiman. The drift velocity v in a static field of variable strength E is obtained for various N and N E up to N=30 when N E is as small as 0.01 and up to N=400 when N E is as large as 20. We find that v has a finite, non-zero limit as N (right arrow symbol)(infinity symbol) at fixed E and that this limit is proportional to |E| E, in accord with the conclusions of Duke, Viovy, and Semenov for a different but related model. In a scaling limit in which N(right arrow symbol)(infinity symbol) and E(right arrow symbol)0 the drift velocity in the repton model is fit well by the formula (formula omitted) for all values of the scaling variable NE. We present a scaling analysis complementary to that of Duke et al., with which we rationalize the |E| E behavior of the limiting drift velocity.
Character animation scripting languages: a comparison
Authors: Yasmine Arafa, Kaveh Kamyab, Ebrahim Mamdani
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Designing lifelike animated agents presents a challenging agenda for research. Such agent metaphors will only be widely applicable to real-time applications when there is a standardised way to map underlying engines with the visual presentation of the agents. As a number of such scripting languages are now emerging, there appears to be the need for the research community to look at and agree upon the requirements of and the expectations from them.In this paper we address the current fragmentation in the field of embodied character animation and representation. We outline functions and specifications of the markup languages for scripting animation and the representing attributes of virtual characters.
Shock Waves in the Hydrodynamic Model for Semiconductor Devices
Authors: L C Gardner
Venue:  (1991)

\indent Numerical simulations of a family of steady-state electron shock waves (parametrized by the amount of heat conduction) in a one micron Si semiconductor device at 77 K are presented, using a steady-state upwind method. The electron shock wave has a finite width which scales linearly with the amount of heat conduction. Comparisons of the hydrodynamic simulations with a Monte Carlo simulation of Laux using the DAMOCLES program are also presented. The hydrodynamic prediction of an electron shock wave [1] in Si at 77 K is confirmed by the DAMOCLES simulation of the Boltzmann equation. Good agreement between the two different methods for simulating the electron shock wave can be obtained by adjusting the amount of heat conduction in the hydrodynamic model.