ppxscal/embedding_network huggingface dataset:
An environment for distributed collaboration among humans and software agents
Authors: C. Martin, D. Schreckenghost, P. Bonasso, D. Kortenkamp, T. Milam, C. Thronesbery
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes an implemented software prototype for the Distributed Collaboration and Interaction (DCI) system, which helps humans to act as an integrated part of a multi-agent system. Human interaction with agents who act autonomously most of the time, such as a process control agent in a refinery, has received little attention compared to human interaction with agents who provide a direct service to humans, such as information retrieval. This paper describes how liaison agents within the DCI system can support human interaction with other agents that are not, by design, human-centric but must be supervised by, or coordinated with, humans. The DCI system provides a step toward future seamless integration of humans and software agents into a cohesive multi-agent system.
Zooming on a Multiagent Simulation System: From the Conceptual Architecture to the Interaction Protocol
Authors: Rémy Courdier, Pierre Marcenac, Stéphane Calderoni
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

GEAMAS is a knowledge engineering environment for multi-agent simulation of complex systems. The basic architecture of GEAMAS is designed around three dimensions: MultiAgent Systems (MAS) software design, MAS knowledge abstraction and MAS services dimension. Each one of this third aspects, is implemented into several modular open software layers.First, the paper argues the benefits of a such architecture for a MAS environment. We especially present 1) how the MAS software design dimension enables to define appropriate tools levels for designing multi-agent systems 2) how MAS knowledge abstraction adds significant value to implement a computational model of agents 3) how MAS services dimension allows to correctly extend the GEAMAS environment by integrating new multi-agent concepts such as organization capacities or learning mechanisms.
Transaction Oriented Computational Models for Multi-Agent Systems
Authors: Kotagiri Ramamohanarao, James Bailey, Paolo Busetta
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

BDI (Belief, Desire, Intention) is a mature and commonly adopted architecture for Intelligent Agents. However, the current computational model adopted by BDI has a number of problems with concurrency control, recoverability and predictability. This has hindered the construction of agents having robust and predictable behaviour. Indeed the conceptual and practical tools needed for building dependable agent systems, resilient to faults and other unexpected situations, are still at an early stage of research.To this end, we propose to use ideas from established database technology as an adjunct to BDI agent systems. In the long term, we envisage a two layer model for distributed system development. The upper layer, called "behavioural" in our scheme, consists of concepts and techniques coming from agent research. The lower layer, called "control", is based on more traditional computer technologies and implements the actions decided by the upper layer. The emphasis of the upper behavioural layer is on flexibility of the software development process, in order to be effective in application domains that are difficult to analyse or rapidly changing. By contrast, the main focus of the lower control layer is rigorous and efficient implementation within well-known boundaries.We discuss the development of an agent system having a computational model with well-defined correctness criteria. Instead of hardwiring robustness and fault-tolerant behaviour into agent plans, well defined notions of correctness exist at the semantic level. Verification can then be undertaken at the desired level of abstraction.
Dragon Ball Z: Budokai
Authors: Temp Authors Prima, Eric Mylonas
Venue:  (2002)

:Will you be the last warrior standing? ·Techniques for every battleground ·Detailed walkthroughs for Story mode ·Strategies and combos for all 23 characters ·Tips for customizing your own fighters ·All secrets unlocked
Image Modeling with Position-Encoding Dynamic Trees
Authors: Amos J. Storkey, Christopher K. I. Williams
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

This paper describes the Position-Encoding Dynamic Tree (PEDT). The PEDT is a probabilistic model for images that improves on the dynamic tree by allowing the positions of objects to play a part in the model. This increases the flexibility of the model over the dynamic tree and allows the positions of objects to be located and manipulated. This paper motivates and defines this form of probabilistic model using the belief network formalism. A structured variational approach for inference and learning in the PEDT is developed, and the resulting variational updates are obtained, along with additional implementation considerations that ensure the computational cost scales linearly in the number of nodes of the belief network. The PEDT model is demonstrated and compared with the dynamic tree and fixed tree. The structured variational learning method is compared with mean field approaches.
Fault Trees and Imperfect Coverage
Authors: B J Dugan
Venue:  (1987)

Fault trees are used for reliability prediction because they provide a concise representation of the failure modes of a non-repairable fault-tolerant system, but they cannot accurately model dynamic behavior intrinsic to the fault recovery process. One answer to this problem is to convert a fault tree to a Markov chain, and then add the dynamic fault/error handling behavior to the resulting Markov chain. Typically the Markov chain is then solved using a standard ODE solver. We present a new algorithm for the solution of the fault tree that includes the dynamic behavior of the fault/error handling model (FEHM), but which obviates the need for the Markov chain solution. As the state space is expanded in a breadth-first search (the same as is done in the conversion to a Markov chain), the state''s contribution to each failure state is calculated exactly.
Self-Validating Diagnosis of Hypercube Systems
Authors: Piero Maestrini, Paolo Santi
Venue:  (1999)

A novel approach to the diagnosis of hypercubes, called Self-Validating Diagnosis, is introduced. An algorithm based on this approach, called SVD algorithm, is presented and evaluated. Given any fault set and the resulting syndrome, the algorithm returns a diagnosis and a syndrome-dependent bound, Ts, with the property that diagnosis is correct (although possibly incomplete) if the actual number of faulty units is less than Ts. The average of Ts is very large and the diagnosis is almost complete even when the percentage of faulty units in the system approaches 50%. Moreover, the diagnosis correctness can be validated deterministically by individually probing a very small number of units. These results suggest that the SVD algorithm is suitable for applications requiring a large degree of diagnosability, as it is the case of wafer-scale testing of VLSI chips, where the percentage of faulty units may be as large as 50%. TEL:: +39-50-593462
Optimal scheduling of soft handoffs in DS/CDMA communication systems
Authors: M. Asawa, W. E. Stark
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Considers the problem of optimal scheduling of soft handoffs as applicable to DS/CDMA based cellular networks. The authors have formulated the phenomenon of soft handoffs as a reward/cost stochastic optimization problem wherein the reward is a function of some measurable characteristics of the received signal, and cost can be associated with different factors such as multiple simultaneous active connections, connection set-up and termination overheads. Using dynamic programming, a maximum net reward policy that specifies the optimal base stations the mobile should be associated with during each time slot, is determined. The authors also extend their results to the case when there are more than two base stations. Furthermore, the decisions are taken in a decentralized online manner. Simulation results show that the proposed algorithms offer considerable improvement over the policy proposed in the IS-95 standard.
High Performance Code Generation through Lazy Activation Records
Authors: M. Satpathy, R. N. Mahapatra, S. Choudhuri, S. V. Chitnis
Venue: Proceedings of the Seventh Workshop on Interaction between Compilers and Computer Architectures (2003)

For call intensive rograms, function calls are majorbottlenecks during rogram execution since they usuallyforce register contents to be spilled into memory. Suchregister to memory spills are much more ronounced inpresence of recursion. A function call is usually accompanied by the creation of its activation record at functionentry. In this paper, we will deviate from this usual practice; we create an activation record only when we find itnecessary. The result is that on many occasions we can execute a function call without actually creating its activationrecord. We call our strategy lazy activation record strategy(LARS) and show how this strategy is particularly important for call-intensive programs. The LARS subsumes manytraditional techniques like leaf-call optimization and tail-recursion optimization, and in addition, it extends Chow'sshrink-wrapping in terms of scope and granularity.We also demonstrate how the LARS can be an effectiveoptimization strategy in case of battery operated embeddedsystems, since not only it can reduce execution time but alsoenergy consumption.
Multi-objective Topology optimization of structures
Authors: J. F. Aguilar Madeira
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This work presents a method to develop computational models for topology optimization of linear elastic structures, when we have more than one objective function, each of them with different individual optimal solution.The method is developed for multi-objective optimization problems. Its purpose is to evolve an evenly distributed group of solutions to determinate the optimum Pareto set for the given problem.The algorithm evaluates a set of solutions (population) sorting it by considering domination properties and using a definition of filter to retain Pareto solutions.To reduce computational effort, it is introduced, in the initial population, optimal solutions of each of the single-objective problems.The computational model is applied and tested in two numerical applications.
Localizer: A Modeling Language for Local Search
Authors: Laurent Michel, Pascal Van Hentenryck
Venue:  (1997)

Local search is a traditional technique to solve combinatorial search problems which has raised much interest in recent years. The design and implementation of local search algorithms is not an easy task in general and may require considerable experimentation and programming effort. However, contrary to global search, little support is available to assist the design and implementation of local search algorithms. This paper is an attempt to support the implementation of local search. It presents the preliminary design of Localizer, a modeling language which makes it possible to express local search algorithms in a notation close to their informal descriptions in scientific papers. Experimental results on our first implementation show the feasibility of the approach.
Some error expansions for certain Gaussian quadrature rules
Authors: H. V. Smith
Venue: Journal of Computational and Applied Mathematics (2003)

Complex-variable methods are used to obtain some error expansions for certain quadrature rules over the interval [- 1,1].
Authoring of Physical Models Using Mobile Computers
Authors: Yohan Baillot, Dennis Brown, Simon Julier
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Context-aware computers rely on user and physical models to describe the context of a user. In this paper, we focus on the problem of developing and maintaining a physical model of the environment using a mobile computer. We describe a set of tools for automatically creating and modifying three-dimensional contextual information. The tools can be utilized across multiple hardware platforms with different capabilities, and operating in collaboration with one another. We demonstrate the capabilities of the tools using two mobile platforms. One of them, a mobile augmented reality system is used to contruct a geometric model of an indoor environment which is then visualized on the same platform.
Integrate software agents and CORBA in computational grid
Authors: Li Chunlin, Li Layuan
Venue: Computer Standards Interfaces (2003)

This paper presents an Agent-based Computational Grid (ACG), which applies the concept of CORBA and agent to computational grid. The ACG system is used to implement a uniform higher level management of the computing resources and services on the Grid, and provide users with a consistent and transparent interface for accessing such services. In ACG grid, grid services are implemented by CORBA or by grid agent. Grid agents and CORBA objects will interact with each other to achieve user's service request. Our solution is the creation of a bridge between the CORBA and grid agents The solution provides with the opportunity of considering an agent as a CORBA service and accessing CORBA services even from a grid agent. Thus, in AGC grid, existing legacy systems can be easily exploited as grid services. In this paper, firstly, the features of ACG grid are described, and then the design and implementation are given. Finally, some conclusions are given.
On the Verification of Open Distributed Systems
Authors: Mads Dam, Lars Fredlund
Venue:  (1997)

A logic and proof system is introduced for specifying and proving properties of open distributed systems. Key problems that are addressed include the verification of process networks with a changing interconnection structure, and where new processes can be continuously spawned. To demonstrate the results in a realistic setting we consider a core fragment of the Erlang programming language. Roughly this amounts to a first-order actor language with data types, buffered asynchronous communication, and dynamic process spawning. Our aim is to verify quite general properties of programs in this fragment. The specification logic extends the first-order $\mu$-calculus with Erlang-specific primitives. For verification we use an approach which combines local model checking with facilities for compositional verification. We give a specification and verification example based on a billing agent which controls and charges for user access to a given resource.
Signature Matching: A Key to Reuse
Authors: Amy M Zaremski, Jeannette M. Wing
Venue:  (1993)

Software reuse is only effective if it is easier to locate (and appropriately modify) a reusable component than to write it from scratch. We present signature matching as a method for achieving this goal by using signature information easily derived from the component. We consider two kinds of software components, functions and modules, and hence two kinds of matching, function matching and module matching. The signature of a function is simply its type; the signature of a module is a multiset of user-defined types and a multiset of function signatures. For both functions and modules, we consider not just @i(exact) match, but also various flavors of relaxed match. We briefly describe an experimental facility written in Standard ML for performing signature matching over a library of ML functions.
Concurrent Replication Garbage Collection: An Implementation Report
Authors: James O''Toole, Scott Nettles
Venue:  (1993)

MIT-LCS-TR-570, Massachusetts Institute of Technology Keywords: Storage management, garbage collection, concurrent garbage collection, incremental garbage collection, copying garbage collection, replication garbage collection 15 pages [FTP: CMU-CS-93-138.ps] We have implemented a concurrent copying garbage collector that uses replication garbage collection. In our design, the client can continuously access the heap during garbage collection. No low-level synchronization between the client and the garbage collector is required on individual object operations. The garbage collector replicates live heap objects and periodically synchronizes with the client to obtain the client''s current root set and mutation log. An experimental implementation using the Standard ML of New Jersey system on a shared-memory multiprocessor demonstrates excellent pause time performance and moderate execution time speedups.
Microsoft Office FrontPage 2003 Inside Out
Authors: Jim Buyens
Venue:  (2003)

Take your Microsoft FrontPage experience to the next level! This supremely organized reference packs hundreds of timesaving solutions, troubleshooting tips, and handy workarounds for FrontPage 2003 in concise, fast-answer format.
Queueing analysis of ATM tandem queues with correlated arrivals
Authors: F. Kamoun, M. Mehmet Ali
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Considers tandem queues with correlated arrivals and joining interference, which model a portion of a virtual circuit at the access node in an ATM network. The authors focus the main analysis on a two-node tandem network, which they model as a discrete-time queueing system. They derive a functional equation relating the joint generating function of this system between two consecutive slots. The functional equation is then transformed into a suitable form, which enables the derivation of the steady-state joint generating function of the contents of the queues. From this, any moment of the queue length at each node can be extracted. They also give explicit expressions for the average time delay at each node as well as for the total average delay in the network. They illustrate the solution technique by some numerical examples.
On a parallel mesh-chopping algorithm for a class of initial value problems using fourth-order explicit Runge-Kutta method
Authors: C. P. Katti, D. K. Srivastava
Venue: Applied Mathematics and Computation (2003)

In this paper, we extend the results of [Comput. Math. Appl. 35 (1998) 121] to the class of initial value problems y' = f(x, y), y(x0) = n0, represented as a system of first order differential equations. We propose a simple modification in the existing fourth-order Runge-Kutta method which makes it amenable to parallelization on p processors. A numerical example illustrating the theory is presented and theoretical estimates for speed up are given which are in agreement.
Formalizing Reference Types in NuPRL, PhD Thesis
Authors: Pavel Naumov
Venue:  (1998)

This dissertation defines a Type Theory based semantics for Java-like reference type constructors. The primary focus is made on finding an adequate axiomatization of reference types in Type Theory. An extension of Type Theory, called {\em Reference Type Theory}, is introduced. It adds to the Type Theory language a reference type constructor and operations on reference type elements as primitive notions. The dissertation provides informal graph-based semantics for the Reference Type Theory, describes inference rules for this theory, and proves their consistency. Reference Type Theory is formalized in the Nuprl Proof Development System. This formalization is used to define a formal semantics for a fragment of the Java programming language and to verify several simple Java programs.
A Generalization of the Erdos-Szekeres Theorem to Disjoint Convex Sets
Authors: Janos Pach, Geza Toth
Venue:  (1997)

Let ${\cal F}$ denote a family of pairwise disjoint convex sets in the plane. ${\cal F}$ is said to be in {\em convex position}, if none of its members is contained in the convex hull of the union of the others. For any fixed $k\geq 3$, we estimate $P_k(n)$, the maximum size of a family ${\cal F}$ with the property that any $k$ members of ${\cal F}$ are in convex position, but no $n$ are. In particular, for $k=3$, we improve the triply exponential upper bound of T. Bisztriczky and G. Fejes T\''oth by showing that $P_3(n)>16^n$.
Implementation of self-healing function in ATM networks based on virtual path concept
Authors: R. Kawamura, H. Hadama, I. Tokizawa
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

This paper proposes an implementation scheme for the self-healing function in ATM networks and assesses its performance. First, our proposed ATM self-healing scheme is described. This scheme realizes more rapid restoration of failed virtual paths than other self-healing algorithms, supports the node failure case, and minimizes the spare resources required. Next, an implementation scheme is proposed. We propose that the self-healing function be implemented as a software process, and that OAM cells are utilized for fast message transmission. Next, results of a prototype system that we implemented on an ATM cross-connect system are discussed. The fundamental characteristics of restoration performance are measured using an experimental network. Based on these results, an NE processing system analysis and computer simulation for estimating the characteristics as applied to a real-scale network are discussed. Finally, a management scheme for self-healing is proposed based on the TMN concept.
Preserving Bandwidth Through A Lazy Packet Discard Policy in ATM Networks
Authors: Gitae Kim, Azer Bestavros
Venue:  (1998)

Abstract A number of recent studies have pointed out that TCP''s performance over ATM networks tends to suffer, especially under congestion and switch buffer limitations. Switch-level enhancements and link-level flow control have been proposed to improve TCP''s performance in ATM networks. Seletive Cell Discard (SCD) and Early Packet Discard (EPD) ensure that partial packets are discarded from the network "as early as possible", thus reducing wasted bandwidth. While such techniques improve the achievable throughput, their effectiveness tends to degrade in multi-hop networks. In this paper, we introduce Lazy Packet Discard (LPD), an AAL-level enhancement that improves effective throughput, reduces response time, and minimizes wasted bandwidth for TCP/IP over ATM. In contrast to the SCD and EPD policies, LPD delays as much as possible the removal from the network of cells belonging to a partially communicated packet. We outline the implementation of LPD and show the performance advantage of TCP/LPD, compared to plain TCP and TCP/EPD through analysis and simulations.
The Network Effects of Prefetching
Authors: Mark Crovella, Paul Barford
Venue:  (1997)

Abstract Prefetching has been shown to be an effective technique for reducing user perceived latency in distributed systems. In this paper we show that even when prefetching adds no extra traffic to the network, it can have serious negative performance effects. Straightforward approaches to prefetching increase the burstiness of individual sources, leading to increased average queue sizes in network switches. However, we also show that applications can avoid the undesirable queueing effects of prefetching. In fact, we show that applications employing prefetching can significantly improve network performance, to a level much better than that obtained without any prefetching at all. This is because prefetching offers increased opportunities for traffic shaping that are not available in the absence of prefetching. Using a simple transport rate control mechanism, a prefetching application can modify its behavior from a distinctly ON/OFF entity to one whose data transfer rate changes less abruptly, while still delivering all data in advance of the user''s actual requests.