ppxscal/embedding_network huggingface dataset:
Distributed enactment of multiagent workflows: temporal logic for web service composition
Authors: Munindar P. Singh
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We address the problem of constructing multiagent systems by coordinating heterogeneous, autonomous agents, whose internal designs may not be fully known. A major application area is Web service composition. We develop an approach that (a) takes declarative specifications of the desired interactions, and (b) automatically enacts them. Our approach is based on temporal logic, has a rigorous semantics, and yields a naturally distributed execution.
Parallel Finite Element Analysis of Biomechanical Structures on the Ncube 6400
Authors: Shirish Chinchalkar, Thomas F. Coleman
Venue:  (1991)

This paper presents parallel 3-D finite element analysis for distributed memory multiprocessors. Traditionally, finite element analysis has been performed on sequential computers. Current research in high performance finite element analysis shows considerable promise for fast, efficient implementation on MIMD and SIMD computers. This paper demonstrates the use of a standard, banded Cholesky method for solving the finite element system of equations. The uniformity of the underlying data distribution ensures high performance due to load balance. Moreover, since a distributed banded Cholesky algorithm is likely to a part of a standard parallel numerical library, it reduces the burden on the applications programmer, making this method simpler to implement than the substructuring method. Since a parallel solver requires the rows of the coefficient matrix to be distributed in a wrap fashion, it might appear that the assembly of the element stiffness matrices would not be efficient. However, as shown in this paper, the calculation of element stiffness matrices, assembly and the calculation of Gauss-point stresses can be done efficiently in parallel without any inter-processor communication. In fact, once nodal coordinates and element connectivity is made available to all processors, message passing is required only during the factorization and solution stages. The next few sections describe how parallelism was exploited during the assembly, solution and stress recovery strages of the finite element analysis. The parallel program developed was tested on large 3-D finite element problems arising from biomechanical structural systems, on an Ncube 6400. High performance Basic Linear Algebra Subprograms (BLAS) were used to improve the execution speed.
Formal Analysis of an Online Stock Trading System by Temporal Petri Nets
Authors: Y. Y. Du, C. J. Jiang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Temporal Petri nets enhance greatly the modeling and analyzing power of Petri nets. The dynamic behavior of a given system and causality in events can be elegantly described by formulas containing temporal operators. We show how temporal Petri nets can be used for formal specification and verification of an online stock trading system. The functional correctness of the modeled system is formally analyzed by using the inference rules oftemporal logic. Certain important properties of the temporal Petri net model are given. Finally, the further studying subjects are represented.
Flexible Protocol Composition in Bast
Authors: Benoit Garbinato, Rachid Guerraoui
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

This paper presents Bast, an object-oriented library of reliable distributed protocols. We show how Bast can be used to build fault-tolerant distributed applications, and how new protocols can be added to it. We discuss some distributed protocol design issues and the way these issues are circumvented in Bast. We briefly describe our Smalltalk and Java implementations of Bast, together with some performance results.
Design Issues in Data Networks
Authors: Elias Drakopoulos
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The paper describes the network design and analysis of a multi-protocol application environment characterized by a client/server architecture, integration of legacy and distributed database structures, frame relay wide area network, and token ring local area networks. Detailed workload characterization and performance modeling of the application environment is presented, and network design issues are addressed. The model is used to study network performance under various load conditions, identify bottlenecks and compare design alternatives.
Teambotica: a robotic framework for integrated teaming, tasking, networking, and control
Authors: Régis Vincent, Pauline Berry, Andrew Agno, Charlie Ortiz, David Wilkins
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Teambotica is a research environment for the exploration of theories, designs and implementations of team-based robotics. In developing Teambotica, we found that many of the simplifying assumptions that are often taken in both multiagent systems and behavior-based robotics had to be discarded. Central to our approach is a multilevel agent architecture which is adaptive along a number of dimensions and which is based on a vertically integrated design that spans a wide range of operations, from team-level reasoning to low-level control. The design addresses a number of pertinent issues: the proper mix of deliberation and action, flexible networking support including planning for communications, adaptive task level control, team-based monitoring, and an open systems modularity that takes form-factor considerations seriously. We also describe simulation tools for development and discuss several robotic teams that we have demonstrated.
The impact of three pedagogical agent roles
Authors: Amy L. Baylor, PALS (Pedagogical Agent Learning Systems) Research Group
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This exploratory experimental study validated the effectiveness of pedagogical agent roles for promoting motivational and learning outcomes within the MIMIC agent-based learning environment. In a between-subjects design, 73 learners worked with an agent representing one of the following three agent roles while learning about instructional planning: Motivator, Expert, or Mentor (designed to incorporate both motivation and expertise). The roles were evaluated according to three contrast comparisons, comparing the value of the agents with and without motivation, the value of the agents with and without expertise, and the overall value of the Mentor agent (which combined motivation and expertise). Results indicated that the motivational agents (Motivator & Mentor) were significantly more engaging, human-like and facilitative of learning than the Expert agent, yet were also less credible. The agents with expertise (Expert & Mentor) were significantly more credible, and led to better performance on the transfer measure than the Motivator agent, yet were also less supportive and less human-like. Overall, the Mentor was perceived as significantly more engaging and facilitative of learning than the other two agents, and also led to significantly better transfer performance.
Correctness of Constructing Optimal Alphabetic Trees Revisited
Authors: Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
Venue:  (1996)

Several new observations which lead to new correctness proofs of two known algorithms (Hu-Tucker and Garsia-Wachs) for construction of optimal alphabetic trees are presented. A generalized version of the Garsia-Wachs algorithm is given. Proof of this generalized version works in a structured and illustrative way and clarifies the usually poorly-understood behavior of both the Hu-Tucker and Garsia-Wachs algorithms. The generalized version permits any non-negative weights, as opposed to strictly positive weights required in the original Garsia-Wachs algorithm. New local structural properties of optimal alphabetic trees are given. The concept of {\em well-shaped segment\/} (a part of an optimal tree) is introduced. It is shown that some parts of the optimal tree are known in advance to be well-shaped, and this implies correctness of the algorithms rather easily. The crucial part of the correctness proof of the Garsia-Wachs algorithm, namely the {\em structural theorem}, is identified. The correctness proof of the Hu-Tucker algorithm consists of showing a very simple mutual simulation between this algorithm and the Garsia-Wachs algorithm. For this proof, it is essential to use the generalized version of Garsia-Wachs algorithm, in which an arbitrary locally minimal pair is processed, not necessarily the rightmost minimal pair. Such a generalized version is also needed for parallel implementations. Another result presented in this paper is the clarification of the problem of resolving ties (equalities between weights of items) in the Hu-Tucker algorithm. This is related to the proof, by simulation, of correctness of the Hu-Tucker algorithm. It is shown that the condition that there are no ties may generally be assumed without harm and that, essentially, the Hu-Tucker algorithm avoids ties automatically.
Relevant document distribution estimation method for resource selection
Authors: Luo Si, Jamie Callan
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Prior research under a variety of conditions has shown the CORI algorithm to be one of the most effective resource selection algorithms, but the range of database sizes studied was not large. This paper shows that the CORI algorithm does not do well in environments with a mix of "small" and "very large" databases. A new resource selection algorithm is proposed that uses information about database sizes as well as database contents. We also show how to acquire database size estimates in uncooperative environments as an extension of the query-based sampling used to acquire resource descriptions. Experiments demonstrate that the database size estimates are more accurate for large databases than estimates produced by a competing method; the new resource ranking algorithm is always at least as effective as the CORI algorithm; and the new algorithm results in better document rankings than the CORI algorithm.
Minimum Norm Symmetric Quasi-Newton Updates Restricted to Subspaces
Authors: Robert B. Schnabel
Venue:  (1977)

The Davidson-Fletcher-Powell and Broyden-Fletcher-Goldfarb-Shanno updates have been the two most successful quasi-Newton updates for a variety of applications. One reason offered in explanation is that they constitute, in an appropriate norm and metric, the minimum norm change to the matrix, or its inverse, being approximated which preserves symmetry and obeys the quasi-Newton equation. Recent methods have reason to consider updates restricted to certain subspaces. In this paper we derive the general minimum norm symmetric quasi-Newton updates restricted to such subspaces. In the same appropriate norm and metric, the minimum norm change update to the matrix or its inverse is shown to be, respectively, the rank-two update which is a particular projection of the DFP or BFGS onto this subspace.
Real Time Queue Operations in Pure LISP
Authors: Robert T. Hood, Robert C. Melville
Venue:  (1980)

Several methods of implementing a queue in Pure LISP are presented. A technique to distribute the reversal of a list over a number of operations leads to a real-time queue implementation.
Control-Volume Mixed Finite Element Methods
Authors: Z. Cai, J. E. Jones, S. F. McCormick, T. F. Russell
Venue:  (1996)

A key ingredient in simulation of flow in porous media is accurate determination if the velocities that drive the flow. Large-scale irregularities if the geology (faults, fractures, and layers) suggest the use if irregular grids in simulation. This paper presents a control-volume mixed finite element method that provides a simple, systematic, easily implemented procedure for obtaining accurate velocity approximations on irregular block-centered grids. The control-volume formulated of Darcy''s law can be viewed as a discrete Darcy law analogous to the block-by-block conservation in the usual mixed discretizaton of the mass-conservation equation. Numerical results in two dimensions show second-order convergence in the velocity, even with discontinuous anisotropic permeability on an irregular grid. The method extends readily to three dimensions.
ACME/PRIME: Requirements Acquisition for Process-Driven Systems
Authors: Mark Feblowitz, Sol Greenspan, Howard Reubenstein, Robert Walford
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

This paper discusses a requirements gathering methodology and tool support for a class of systems we term service-oriented systems. The requirements acquisition methodology that our tools support is, not surprisingly, a process centered methodology, since the processes of the system map to the services provided by our organization. The ACME/PRIME tool to support this methodology is built upon a conceptual modeling platform (ACME) that traces its roots to RML. The paper will discuss our approach to one of the fundamental problems of requirements engineering, i.e., dealing with over and under specification of requirements. We also provide some lessons learned from deploying the ACME/PRIME tool in our corporate requirements office.
Efficient Rendering on Massively Parallel Architectures
Authors: Matthew N Pappas, Oren J. Tversky, D. B Conner
Venue:  (1992)

In this paper, we discuss the design and implementation of some three-dimensional rendering algorithms on massively parallel computers. These algorithms employ SIMD-style parallelism; that is, each processor runs the same instructions on different data. We have implemented some of these algorithms on the Connection Machine 2, a computer manufactured by Thinking Machines Corporation.
Toward a Common Reference Process Model for SC7
Authors: James W. Moore, David H. Kitson
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

ISO/IEC JTC1/SC7 is responsible for the development of standards for software engineering. To define the processes of the software life cycle, SC7 developed ISO/IEC 12207, Software Life Cycle Processes. Continued work on other standards and technical reports, however, has suggested that the scope and level of description in 12207 does not support all of the needs of SC7. Some projects have proposed additional processes. Others have described processes at a higher level of abstraction or have organized the processes differently. Another project will offer processes for the system life cycle. To halt the trend toward divergence, an ad hoc group of interested SC7 participants has offered a reference model. The model is intended to unify the existing base of SC7 documents by offering a common set of reference process and a set of operations for constructing the processes of the various documents. The model is also designed with an eye toward extensibility in the hope that it might also fill the future needs of SC7.
An Auto-Generating Tool for the MPEG-2 Formatted Test Data: ATEP
Authors: Byoungju Choi, Sunhwa Yeum, Taehee Gwak, Byoungkyu Min
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Digital TV Application Software Environment (DASE) is an international standard for Digital Television Broadcasting being rapidly spread throughout the world.DASE consists of software modules that decode and execute application programs transmitted in the form ofMPEG-2 that deliver interactive and data broadcast services, within the context of digital TV beyond the existing audio/video service.Therefore, MPEG-2 formatted test data is needed to test DASE.Generating MPEG-2 test data is not only expensive and time-consuming but also requires expert knowledge of MPEG-2 due to the high complexity of MPEG-2 Standard.In this paper, we propose the Auto-Test data generator for Protocol standards (ATEP) that automatically generates MPEG-2 formatted test data for the DASE System Test.Our ATEP generates test data using database consisted of the `Structure Information¿, the `Content Information¿, and the `Raw Data¿. The Raw Data is used to make a broadcasting scenario while the Structure and Content Information are used to form this scenario into MPEG-2 formatted data. Our tool enables a tester to perform the DASE System Test efficiently without any knowledgeabout MPEG-2 Standard.
Verification of microplane model by means of various numerical simulations
Authors: J. Němeček, M. Ventluka, Z. Bittnar
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper is focused on numerical simulations of different engineering structures using the microplane model M4 [1], [2] and its verification. The model is calibrated according to standard experimental procedure (uniaxial compression test). The obtained material parameters are used for subsequent simulations of several different specimens loaded differently. Comparison with available experimental data is shown.
Dealing with Dense Rows in the Solution of Sparse Linear Least Squares Problems
Authors: Chunguang Sun
Venue:  (1995)

Sparse linear least squares problems containing a few relatively dense rows occur frequently in practice. Straightforward solution of these problems could cause catastrophic fill and delivers extremely poor performance. This paper studies a scheme for solving such problems efficiently by handling dense rows and sparse rows separately. How a sparse matrix is partitioned into dense rows and sparse rows determines the efficiency of the overall solution process. A new algorithm is proposed to find a partition of a sparse matrix which leads to satisfactory or even optimal performance. Extensive numerical experiments are performed to demonstrate the effectiveness of the proposed scheme. A MATLAB implementation is included.
Automatic Hypertext Construction
Authors: James Allan
Venue:  (1995)

The unprecedented growth of the World Wide Web illustrates the importance of hypertext as a method for organizing the rapidly expanding amount of on-line text. As document collections become larger and more dynamic, however, it is not feasible to construct more than an occasional hypertext manually. This thesis presents entirely automatic methods for gathering documents for a hypertext, linking them, and annotating those connections with a description of the type or nature of the link. The problem of automatically collecting related documents is addressed in Chapter 2, where robust Information Retrieval methods are applied to form high-quality links between documents. A local context check identifies links where ambiguous vocabulary erroneously suggests a relationship. Dynamic part retrieval is employed to select the portions of documents which are most related, allowing parts to be linked when it is more appropriate to link subtopics than entire documents. Chapter 3 presents a taxonomy of hypertext link types and defines the following three classes of links: ``pattern-matching'''' links can be found using simple string-matching methods, ``manual'''' links require substantial application of natural language understanding methods (which are currently beyond the state of the art), and ``automatic'''' links are those which can be found using the methods of this thesis. Chapter 4 begins the work of automatic link typing by describing two novel graphical techniques for visualizing the relationship between two or more documents. ``Uniform'''' visuals display the relationship between documents or document parts without regard to their relative sizes, whereas ``varying'''' visuals include information about sizes and locations. Both methods highlight relationships between documents and motivate the automatic techniques of Chapter 5. Chapter 5, thus, demonstrates automatic methods for identifying the relationships depicted in the visualizations. Using an approach based upon graph simplification, this method automatically identifies revision, summary, expansion, equivalence, comparison, contrast, tangential, and aggregate links. Chapter 6 discusses an informal evaluation of the link typing. Though somewhat inconclusive, the evaluation demonstrates that automatic document linking performs well, but also indicates that much work remains to be done toward understanding automatic link typing.
Provably Conservative Approximations to Complex Reliability Models
Authors: Mark Smotherman, Robert Geist, Kishor Trivedi
Venue:  (1985)

Provably conservative (and optimistic) reliability models can be systematically derived from more complex models. These derived models incorporate a reduced state space and fewer transitions, and, therefore, have solutions that are more cost-effective than those of the original complex models. The designer can extensively explore the design space without incurring the expense of solving multiple complex models. A conservative-optimistic pair of derived models produces a band that includes the solution to the complex model. Sensitivity analysis can be performed on this pair of models to determine those parameters of the original model that are most sensitive to change (i.e., uncertainty) and hence warrant further expense in obtaining tighter specifications.
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs
Authors: David Applegate, Edith Cohen
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. Two important components of traffic engineering are understanding the traffic demandsand configuring the routing protocols. These two components are inter-linked, as it is widely believed that an accurate view of traffic is important for optimizing the configuration of routing protocols and through that, the utilization of the network.This basic premise, however, never seems to have been quantified --How important is accurate knowledge of traffic demands for obtaining good utilization of the network? Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands? Armed with enhanced recent algorithmic tools we explore these questions on a diverse collection of ISP networks. We arrive at a surprising conclusion: it is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands.
A Level Line Selection Approach for Object Boundary Estimation
Authors: Charles Kervrann, Mark Hoebeke, Alain Trubuil
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

An energy model-based approach for estimating object boundaries is presented. We study a particular energy, which minimizer can be determined. The method estimates the unknown number of objects and draws object boundaries by selecting the "best" level lines computed from level sets of the original image. Unlike previous standard methods, the proposed method does not require iteration for minimizing the energy. In addition, our segmentation algorithm combines anisotropic diffusion-based regularization with level line selection to extract smooth object boundaries. Experimental results on 2D biomedical and meteorological images are reported.