ppxscal/embedding_network huggingface dataset:
Interaction is meaning: a new model for communication in open systems
Authors: Michael Rovatsos, Matthias Nickles, Gerhard Weiss
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We propose a new model for agent communication in open systems that is based on the principle that the meaning of communicative acts lies in their experienced consequences. A formal framework for analysing such evolving semantics is defined. An extensive analysis of example interaction processes shows that our framework allows for an assessment of several properties of the communicative conventions governing a multiagent system. Among other advantages, our framework is capable of providing a very straightforward definition of communicative conflict. Also, it allows agents to reason about the effects of their communicative behaviour on the structure of communicative expectations as a whole when making decisions.
Testing concurrent programs: a formal evaluation of coverage criteria
Authors: M. Factor, E. Farchi, Y. Lichtenstein, Y. Malka
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

While the literature on testing sequential programs is rich, there has been very little work on testing concurrent programs. One major trend in testing sequential code is to define program-based, test data adequacy criteria. Different criteria are often evaluated using a set of properties which are intended to capture the intuition of what constitutes good testing. The work considers the adaptation of techniques for evaluating sequential program-based coverage criteria to an abstract concurrent language. The authors define two sequential and two concurrent program-based criteria which are evaluated with respect to a set of properties. Based upon their analysis, they are able to define new criteria which combine the sequential and concurrent aspects of the program. They also propose a new property that has no parallel in the field of sequential testing. Finally, they discuss the application of the new criteria to the testing of concurrent programs.
Early Stopping Protocols for Fault-Tolerant Distributed Agreement
Authors: Kenneth J. Perry
Venue:  (1985)

No abstract available
Segmentation Using Eigenvectors: A Unifying View
Authors: Yair Weiss
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the affinity matrix. These approaches are extremely attractive in that they are based on simple eigen-decomposition algorithms whose stability is well understood. Nevertheless, the use of eigen-decompositions in the context of segmentation is far from well understood.In this paper we give a unified treatment of these algorithms, and show the close connections between them while highlighting their distinguishing features. We then prove results on eigenvectors of block matrices that allow us to analyze the performance of these algorithms in simple grouping settings. Finally, we use our analysis to motivate a variation on the existing methods that combines aspects from different eigenvector segmentation algorithms. We illustrate our analysis with results on real and synthetic images.
Perl Programming for Biologists
Authors: D. C. Jamison
Venue:  (2003)

:Upon completing the book, readers will be able to quickly perform such tasks as correcting recurring errors in spreadsheets, scanning a Fasta sequence for every occurrence of an EcoRI site, adapting other writers' scripts to one's own purposes, and most important, writing reusable and maintainable scripts that will spare the rote repetition of code. Students, biologists, and other life scientists will find Perl Programming for Biologists to be an essential resource.
A new HAD algorithm for optimal routing of hierarchically structured data networks
Authors: G. M. Huang, Shan Zhu
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In this paper a new algorithm based on aggregation/disaggregation and decomposition/composition (HAD) scheme is proposed to solve the optimal routing problems (ORP) for hierarchically structured networks. Our algorithm has two major differences with the existing HAD algorithms for hierarchically clustered networks: 1. Our algorithm works with networks which are more general than networks with clustered structure; 2. Our algorithm parallelizes the computations for different commodities so that it speeds up with a parallel time complexity of O(mlog/sup 2/(n)), which is much less than O(Mlog/sup 2/(n)) needed for the existing HAD algorithms, for an n-node network with M commodities. Here, m is a positive number usually much smaller than M and is a function of the patterns of all the commodities. The implementation of the algorithm for a 200-node network is simulated using the OPNET simulation package.
Quality-Driven System-on-a-Chip Design
Authors: Lech Józwiak
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Modern microelectronic technology enables implementation of a complete complex information processing system on a single chip. Progress in microelectronic technology is extremely fast and it is outstripping the system designers' abilities to make use of the created opportunities. The complexity and quality of the microelectronics-based systems as well as their design and production cost and time tend to be more limited by the design methods and tools than by the microelectronic technology. Substantial improvement can only be achieved through development and application of a new generation of more suitable design paradigms, methods and tools. In this paper, some new opportunities and difficulties related to the system-on-a-chip technology are overviewed, the nature of the complex system design problems is analyzed and an appropriate quality-driven system design methodology is proposed and discussed. Some important implications of the modern quality concepts for design modeling, design exploration techniques and tools, design decision making, design reuse and design validation are also discussed.
Using ISO work-in-progress documents in teaching software engineering: an experiment
Authors: A. Abran
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Material to teach evaluation and selection of new technologies is often geared towards major organizations and research centers. However, software engineers in small to medium sized organizations are often faced with the same challenge of selecting new technologies. For graduate courses in software engineering, there is currently is a lack of teaching material geared towards the needs of small to medium sized organizations. The paper discusses the redesigning of a graduate course in software engineering using as base material the work in progress of an ISO subcommittee in software engineering. The test of the redesign was carried out through a class simulation of the review process of an ISO working group. Lessons learned from both the learning and teaching perspectives are presented.
A Two Dimensional Crystalline Atomic Unit Modular Self-reconfigurable Robot
Authors: Marsette A. Vona
Venue:  (1999)

Self-reconfigurable robots are designed so that they can change their external shape without human intervention. One general way to achieve such functionality is to build a robot composed of multiple, identical unit modules. If the modules are designed so that they can be assembled into rigid structures, and so that individual units within such structures can be relocated within and about the structure, then self-reconfiguration is possible. We propose the Crystalline Atomic unit modular self-reconfigurable robot, where each unit is called an Atom. In two dimensions, an Atom is square. Connectors at the faces of each Atom support structure formation (such structures are called Crystals). Centrally placed prismatic degrees of freedom give Atoms the ability to contract their outer side-length by a constant factor. By contracting and expanding groups of Atoms in a coordinated way, Atoms can relocate within and about Crystals. Thus Atoms are shown to satisfy the two properties necessary to function as modules of a self-reconfigurable robot. A powerful software simulator for Crystalline Atomic robots in two and three dimensions, called xtalsim, is presented. Xtalsim includes a high-level language interface for specifying reconfigurations, an engine which expands implicit reconfiguration plans into explicit Crystal state sequences, and an interactive animator which displays the results in a virtual environment. An automated planning algorithm for generating reconfigurations, called the Melt-Grow planner, is described. The Melt-Grow planner is fast (O(n2) for Crystals of n Atoms) and complete for a fully general subset of Crystals. The Melt-Grow planner is implemented and interfaced to xtalsim, and an automatically planned reconfiguration is simulated. Finally, the mechanics, electronics, and software for an Atom implementation are developed. Two Atoms are constructed and experiments are performed which indicate that, with some hardware improvements, an interesting self-reconfiguration could be demonstrated by a group of Atoms.
Java 2 Distributed Object Models Performance Analysis, Comparison and Optimization
Authors: Matjaz B. Juric, Ivan Rozman, Marjan Hericko, Alan P. Stevens, Simon Nash
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

This paper is focused on the performance analysis, comparison and optimization of the most important distributed object models for Java: RMI (Remote Method Invocation) and RMI-IIOP (Remote Method Invocation over Internet Inter-ORB Protocol). The paper presents the following contributions to the research on distributed object performance. First, a detailed performance analysis of both models is provided with the in-depth comparison. These results help to understand how the models perform. Second, an overhead analysis and the bottleneck identification are presented with the explanation why there are differences in performance. Third, optimizations and the results for performance improved post-beta RMI-IIOP versions are presented. These show considerably better performance in all areas compared to the original beta release, with RMI-IIOP having equivalent or better performance to RMI in almost all cases.
Optical Network Control: Architecture, Protocols, and Standards
Authors: Greg Bernstein, Bala Rajagopalan, Debanjan Saha
Venue:  (2003)

Optical Network Control is the first expert guide and single-source reference for controlling and managing optical networks. This book fills the gap between optical network engineering and routing/signaling-helping both optical and IP professionals build networks that are more robust, flexible, manageable, and profitable. Coverage includes: Designing networks to deliver a range of on-demand services from mission-critical, time-sensitive protected services to low-cost unprotected services Network control and operations in WDM/DWDM and SONET/SDH environments Control principles and features for evolving mesh-based optical networks and existing ring networks-with practical examples Emerging, proposed, and future optical routing/signaling protocols and standards including GMPLS, ASON and Optical UNI Optical network control planes: design, scenarios, interworking, and interactions with existing network management systems Crucial IETF, ITU-T, OIF, ANSI, Bellcore, and industry information-brought together for the first time
Newton-Cotes integration for approximating Stieltjes (generalized Euler) constants
Authors: Rick Kreminski
Venue: Mathematics of Computation (2003)

In the Laurent expansion ζ(s,a) = 1/s-1 + Σk=0∞ (-1)kγk(a)/k! (s-1)k, 0 < a ≤ 1, of the Riemann-Hurwitz zeta function, the coefficients γk(a) are known as Stieltjes, or generalized Euler, constants. [When a = 1, ζ(s,1) = ζ(s) (the Riemann zeta function), and γk(1) = γk.] We present a new approach to high-precision approximation of γk(a). Plots of our results reveal much structure in the growth of the generalized Euler constants. Our results when 1 ≤ k ≤ 3200 for γk, and when 1 ≤ k ≤ 600 for γk(a) (for a such as 53/100, 1/2, etc.) suggest that published bounds on the growth of the Stieltjes constants can be much improved, and lead to several conjectures. Defining g(k) = sup0<a≤1|γk(a) - logk a/a|, we conjecture that g is attained: for any given k,g(k) = |γk(a) - logka/a for some a (and similarly that, given ε and a, g(k) is within ε of |γk(a) - logk a/a| for infinitely many k). In addition we conjecture that g satisfies [log (g(k))]/k < log(log(k)) for k > 1. We also conjecture that limk → ∞ (γk(1/2) + γk)/ζk = 0, a special case of a more general conjecture relating the values of γk(a) and γk(a + ½) for 0 < a ≤ ½. Finally, it is known that γk = limn → ∞{ Σj=2n logk j/j - logk+1 n/k+1} for k = 1,2,.... Using this to define γk for all real r > 0, we conjecture that for nonintegral r, γr is precisely (-1)r times the r-th (Weyl) fractional derivative at s = 1 of the entire function ζ(s) - 1/(s - 1) - 1. We also conjecture that g, now defined for all real arguments r > 0, is smooth. Our numerical method uses Newton-Cotes integration formulae for very high-degree interpolating polynomials; it differs in implementation from, but compares in error bounding to, Euler-Maclaurin summation based methods.
Optimization of Instruction Fetch for Decision Support Workloads
Authors: Alex Ramirez, Josep Ll. Larriba-Pey, Carlos Navarro, Xavi Serrano, Mateo Valero, Josep Torrellas
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Instruction fetch bandwidth is feared to be a major limiting factor to the performance of future wide-issue aggressive superscalars.In this paper, we focus on Database applications running Decision Support workloads. We characterize the locality patterns of ia database kernel and find frequently executed paths. Using this information, we propose an algorithm to lay out the basic blocks for improved I-fetch.Our results show a miss reduction of 60-98% for realistic I-cache sizes and a doubling of the number of instructions executed between taken branches. As a consequence, we increase the fetch bandwith provided by an aggressive sequential fetch unit from 5.8 for the original code to 10.6 using our proposed layout. Our software scheme combines well with hardware schemes like a Trace Cache providing up to 12.1 instruction per cycle, suggesting that commercial workloads may be amenable to the aggressive I-fetch of future superscalars.
On Lattice Theory and Program Semantics
Authors: Jan L. A. Van de Snepscheut
Venue:  (1993)

No Abstract.
The Official Guide to DB2 Version 8
Authors: Zikopoulos, Roman B. Melnyk, George Baklarz
Venue:  (2003)

:Written by DB2 certified technical experts from the IBM Toronto Lab, this reference guide provides the most up-to-date information available on DB2 version 8. Coverage includes Performance Enhancements, Manageability Enhancements, SQL Enhancements, and more. Each section presents not only the new features in Version 8 for all platforms, but also gives technical details about the new features, gotchas, tips and tricks, and examples of how to use them.
FPGA Architecture Comparison for Non-Conventional Signal Processing
Authors: D. Franco, L. Carro
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In the design of a specific application requiring scalar processing and a neural network, it was noticed that the same underlying hardware used to process analog signals could be used as another way to implement neural networks. This paper presents the main ideas behind this design approach, and a comparison in terms of area and processing speeds of both solutions, when using an FPGA as a substrate.
On Quiescent Reliable Communication
Authors: Marcos K Aguilera, Wei Chen, Sam Toueg
Venue:  (1998)

We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links. We first show that it is impossible to solve this problem without failure detectors. We then show that, among failure detectors that output lists of suspects, the weakest one that can be used to solve this problem is ><P, a failure detector that cannot be implemented. To overcome this difficulty, we introduce an implementable failure detector called Heartbeat and show that it can be used to achieve quiescent reliable communication. Heartbeat is novel: in contrast to typical failure detectors, it does not output lists of suspects and it is implementable without timeouts. With Heartbeat, many existing algorithms that tolerate only process crashes can be transformed into quiescent algorithms that tolerate both process crashes and message losses. This can be applied to consensus, atomic broadcast, k-set agreement, atomic commitment, etc.
Constructing Client-Server Multi-Player Asynchronous Networked Games Using a Single-Computer Model
Authors: Daniel M. Zimmerman, Brian Rothstein, Yevgeniy Kaganovich, Khai Pham
Venue:  (1997)

We examine the process of creating asynchronous networked games by applying systematic transformations to their single-computer analogues, identify the need for such transformations, and propose a simple system of rules for them. In developing these rules, our primary concerns are comparing the flow of events in single-processor and networked games and examining the restrictions and limitations resulting from speed considerations. Although this paper only discusses games, the transformation rides may apply to any networked application with asynchronous data input and exchange.
Properties of Concurrent Programs
Authors: K. M Chandy
Venue:  (1993)

A program property is a predicate on programs. In this paper we explore program properties of the form U -< V where U and V are either predicates on states of a program or program properties, and -< satisfies three rules that are also used in reasoning about sequential programs and safety properties of parallel programs. We show how such properties can be used to reason about concurrent programs.
Grammar-based Hardware Synthesis of Data Communication Protocols
Authors: Johnny OEberg, Anshul Kumar, Ahmed Royal
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

For a synthesis methodology to support implementation independent design specification, a capability for design space exploration is essential. In this paper we present such a methodology for a specific domain: data communication protocols. A natural way to specify various elements of protocols is in terms of a grammar annotated with actions. Our language for protocol specification, called PRO-GRAM, is based on this idea. The hardware specification of the protocol is done by specifying the bit-patterns of the tokens the protocol is supposed to parse together with the actual grammar to parse the input stream. By specifying constraints on the input and output stream ports, the designer is allowed to explore alternative realizations with different widths of the I/O ports. The PRO-GRAM compiler outputs VHDL-code suitable for Logic Synthesis.
Interoperability and Quality of New EDA Tools for Sequential Logic Synthesis
Authors: A. Slusarczyk L. Józwiak
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

One of the main problems in design of modem microelectronic systems is achieving consistent high quality results along the entire EDA tool chain. Using the sequential logic synthesis tools for a case study, this paper shows how important is the consistent tool collaboration for the quality of the final result. In the paper, a new uniform and consistent information-driven logic synthesis approach is proposed and compared to some other logic synthesis flows, including the traditional flow involving JEDI and SIS. The experimental research demonstrates that the quality of the new information-driven logic synthesis tools and the harmony of the new uniform approach results in much better circuits than the circuits from all other flows. The information-based synthesis flow produced circuits that are on average 25% smaller and 30% faster than the circuits from traditional flow. 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
Exception-handling extension for an object-oriented DBMS
Authors: H. M. Kienle, P. J. Fortier
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The paper describes the implementation of an exception handling facility for the Open OODB, a research database system developed by Texas Instruments. The initial OODB database has been extended and modified to support exception handling. An extended exception handling model was designed and implemented which fits into the existing Open OODB architecture and computation model.
Automated derivation of behavior vocabularies for autonomous humanoid motion
Authors: Odest Chadwicke Jenkins, Maja J. Mataric
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we address the problem of automatically deriving vocabularies of motion modules from human motion data, taking advantage of the underlying spatio-temporal structure in motion. We approach this problem with a data-driven methodology for modularizing a motion stream (or time-series of human motion) into a vocabulary of parameterized primitive motion modules and a set of meta-level behaviors characterizing extended combinations of the primitives. Central to this methodology is the discovery of spatio-temporal structure in a motion stream. We estimate this structure by extending an existing nonlinear dimension reduction technique, Isomap, to handle motion data with spatial and temporal dependencies. The motion vocabularies derived by our methodology provide a substrate of autonomous behavior and can be used in a variety of applications. We demonstrate the utility of derived vocabularies for the application of synthesizing new humanoid motion that is structurally similar to the original demonstrated motion.