ppxscal/embedding_network huggingface dataset:
Engineering commitment-based multiagent systems: a temporal logic approach
Authors: Jie Xing, Munindar P. Singh
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Commitments model important aspects of agent interactions, especially those arising in e-business. A small number of patterns of commitments accommodate a variety of realistic interactions among agents. We represent these patterns and agent behavior models formally and show how certain behavior models can be formally proved to be sound for certain patterns. Thus a designer may use a library of patterns and behaviors to engineer systems that are guaranteed to work correctly.
Compiling Communicating Processes into Delay-Insensitive VLSI Circuits
Authors: Alain J. Martin
Venue:  (1986)

No abstract available.
The Evolution of Websites
Authors: Paul Warren, Cornelia Boldyreff, Malcolm Munro
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

One major attraction of the World-Wide Web is the ease with which a relatively untrained user can create or modify a Web hypertext document. However, this same flexibility often causes problems of low quality, similar to those encountered in software developed by programmers before the advent of software engineering. Evolution of sofmare has been the subject of much recent research. It is now well-understood that a large proportion of software costs arise during the maintenance phase.This research aims to characterise the evolution o f Web sites in terms of new metrics and models. The research draws on the work on (I) software evolution, and (2) the analysis of hypertext and sofrware by use of metrics and other means. The work is being evaluated by means of case studies.
Efficient Computation of Interprocedural Control Dependence
Authors: James Ezick, Gianfranco Bilardi, Keshav Pingali
Venue:  (2001)

Control dependence information is useful for a wide range of software maintenance and testing tasks. For example, program slicers use it to determine statements and predicates that might affect the value of a particular variable at a particular program location. In the intraprocedural context an optimal algorithm is known for computing control dependence which unfortunately relies critically on the underlying intraprocedural postdominance relation being tree-structured. Hence, this algorithm is not directly applicable to the interprocedural case where the transitive reduction of the postdominance relation can be a directed acyclic graph (DAG), with nodes having multiple immediate dominators. In this paper we present two efficient, conceptually simple algorithms for computing the interprocedural postdominance relation that can be used to compute interprocedural control dependence. For an interprocedural control flow graph $G=(V,E)$, our reachability based algorithm takes time and space $O(|V|^2 + |V||E|)$. Unlike other algorithms, it does not perform confluence operations on whole bit-vectors and can be tuned to concentrate on the interprocedural rather than intraprocedural relations in a program thus allowing it to scale better to larger programs.
Retrieving Electronic Ink by Content
Authors: I. Kamel, D. Barbara
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

This paper deals with a new emerging multimedia data, namely, electronic ink. As pen-based computers and personal digital assistant' s (PDA ' s) become more popular, searching electronic ink becomes an important issue. We treat the ink object as a one dimensional image which is described by a set of features. This is different from the traditional methods that use Handwritten Recognition techniques to convert it into ASCII. The search retrieves a set of ink objects that most resembles the query object. We describe a multi-stages filter for searching large repository of electronic ink. The first stage is an R-tree based index used to prune the search space. The output of the first stage is a set of words that have some common features with the query. A sequential search algorithm is then used to extract the most similar word to the query string. Our schema is 12 time faster than the sequential and improves the retrieval rate by up to 50%. 12 time faster than the sequential and improves the retrieval rate by up to 50%.
Towards an Architecture for Reactive Systems Using an Active Real-Time Database and Standardized Components
Authors: A. Münnich, M. Birkhold, G. Färber, P. Woitschach
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Component-based concepts are used to an increasing extent in software design since they allow high-quality software to be generated within short time and hence at low costs. By contrast component technologies up till now do not provide the means of composing the software from components without additional programming. The reason for this lies in the combined transfer of control and data flow and the fact that there is no standardized control flow.Here an architecture model is presented that separates the transfer of the two information flows. The data flow is transferred via an active real-time database (ARTDB) and the control flow reduced to a few, indispensable commands. In this way it is possible to design applications simply by combining and configuring components without any additional code development. Initial positive experience with this architecture was gained from its industrial application. It was possible to demonstrate the suitability for systems with soft deadlines.
Routing using potentials: a dynamic traffic-aware routing algorithm
Authors: Anindya Basu, Alvin Lin, Sharad Ramanathan
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

We present a routing paradigm called PBR that utilizes steepest gradient search methods to route data packets. More specifically, the PBR paradigm assigns scalar potentials to network elements and forwards packets in the direction of maximum positive force. We show that the family of PBR schemes are loop free and that the standard shortest path routing algorithms are a special case of the PBR paradigm. We then show how to design a potential function that accounts for traffic conditions at a node. The resulting routing algorithm routes around congested areas while preserving the key desirable properties of IP routing mechanisms including hop-by-hop routing, local route computations and statistical multiplexing. Our simulations using the ns simulator indicate that the traffic aware routing algorithm shows significant improvements in end-to-end delay and jitter when compared to standard shortest path routing algorithms. The simulations also indicate that our algorithm does not incur too much control overheads and is fairly stable even when traffic conditions are dynamic.
System Mechanisms for Partial Rollback of Mobile Agent Execution
Authors: M. Strasser, K. Rothermel
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Mobile agent technology has been proposed for various fault-sensitive application areas, including electronic commerce, systems management and active messaging. Recently proposed protocols providing the exactly-once execution of mobile agents allow the usage of mobile agents in these application areas.Based on these protocols, a mechanism for the application-initiated partial rollback of the agent execution is presented in this paper. The rollback mechanism uses compensation operations to roll back the effects of the agent execution on the resources and uses a mixture of physical logging and compensation operations to roll back the state of the agent. The introduction of different types of compensation operations allows performance improvements during the agent rollback.
Software Quality Classification Modeling Using The SPRINT Decision Tree Algorithm
Authors: Taghi M. Khoshgoftaar, Naeem Seliya
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Predicting the quality of system modules prior to software testing and operations can benefit the software development team. Such a timely reliability estimation can be used to direct cost-effective quality improvement efforts to the high-risk modules. Tree-based softwarequality classification models based on software metrics are used to predict whether a software module is fauIt-prone or not fault-prone. They are white box quality estimation models with good accuracy, and are simpIe and easy to interpret.This paper presents an in-depth study of calibrating classification trees for software quality estimation using the SPRINT decision tree algorithm. Many classification algorithms have memory limitations including the requirement that data sets be memory resident. SPRINT removes all of these limitations and provides a fast and scalable analysis. It is an extension of a commonly used decision tree algorithm, CART, and provides a unique tree-pruning technique based on the Minimum Description Length (MDL) principle. Combining the MDL pruning technique and the modified classification algorithm, SPRINT yields classification trees with useful prediction accuracy. The case study used comprises of software metrics and fault data collected over four releases from a very large telecommunications system. It is observed that classification trees built by SPRINT are more balanced and demonstrate better stability incomparison to those built by CART.
Providing Generalized Rate Monotonic Scheduling Theory to I/O Abstractions over Timed Token Protocol MAC Networks
Authors: Juan Echague, Joan Vila, Alfons Crespo
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper presents a high-level abstraction for remote communication which allows to establish connections with real-time requirements. The approach is based on the idea of structuring applications as modules with a set of external visible data structures which act as I/O ports. Ports can be interconnected using real-time connections. This interconnection is done in a configuration phase and it allows to integrate modules or applications dynamically. Real-time connections produce streams of messages with time constraints. Messages are scheduled by means of a priority model where priorities are assigned following Generalized Rate Monotonic Scheduling (GRMS) theory. The proposed system is built over a network with the Timed Token Protocol (TTP) medium access control (MAC). A discussion on how to provide GRMS abstractions over TTP is given. Comparison results between current scheduling algorithms and the proposed model are also provided.
VLSI Concurrent Computation for Music Synthesis
Authors: John Wawrzynek
Venue:  (1987)

This thesis presents a very large-scale integrated circuit (VLSI) approach to the generation of musical sounds. The approach allows the generation of rich musical sounds using models that are easy to control and have parameters corresponding to many of the physical attributes of musical instruments. The generality of the approach for music synthesis is demonstrated by presenting several primitive sound generation mechanisms. Utilizing these primitives, several musical instruments are assembled to produce struck, plucked, and blown sounds. Refinements of the instruments are easily accomplished by adjusting or rearranging different functional components. A concurrent computing engine supporting the sound generation mechanisms is presented along with details of its VLSI implementation. Involved in the implementation is a new CMOS design methodology. Several alternative architectures for the computing engine are also presented and studied.
Message Scheduling on Trees under a Generalized Line-Communication Model
Authors: Dominique Barth, Mario E. Valencia-Pabon
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this paper, we generalize the line-communication model by relaxing the notion of conflictness between paths. We show that the problem of finding optimal schedules to route any set of messages under both our generalized line-communication model and the bufferless routing model is NP-hard even if restricted to binary trees. Finally, a simple offline 2-approximation algorithm for our model on trees is presented.
An Evolutionary Approach For Time Dependant Optimization
Authors: Philippe Collard, Cathy Escazut Alessio Gaspar
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Many real-world problems involve measures of objectives that may be dynamically optimized. The application of evolutionary algorithms in time dependent optimization is currently receiving growing interest as potential applications are numerous ranging from mobile robotics to real time process command. Moreover, constant evaluation functions skew results relative to natural evolution so that it has become a promising gap to combine effectiveness and diversity in a Genetic Algorithm. This paper features both theoretical and empirical analysis of the behavior of Genetic Algorithms in such an environment. We present a comparison between the effectiveness of traditional Simple Genetic Algorithm (SGA) and the Dual Genetic Algorithm (DGA) which has revealed to be a particularly adaptive tool for optimizing a lot of diversified classes of functions. This comparison has been performed on a model of dynamical environment which characteristic are analyzed in order to establish the basis of a testbed for further experiments. At last, we discuss fundamental properties that explain the effectiveness of the dual paradigm to manage dynamical environments.
A New Scheme for Sharing Secret Color Images in Computer Network
Authors: Chin-Chen Chang, Chwei-Shyong Tsai, Tung-Shou Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Based on visual cryptography scheme, an effective and generalized scheme of color image hiding is proposed. By means of little additional computations, it goes through a color index table to hide and recover a secret image. In this scheme, a secret color image hides itself in two arbitrary color images, which can be constructed and then are kept by two participants, separately. Note that the processed images are significant. It is a kind of camouflage. Later, the secret image can be recovered through the same simple algorithms on two camouflage color images. This paper proves that only one of the two camouflage color images cannot reveal the secret image. Thus, the hidden information is secured.
Local Search by Concentration Controlled DNA Computing
Authors: Masahito Yamamoto, Nobuo Matsuura, Toshikazu Shiba, Yumi Kawazoe, Azuma Ohuchi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Concentration controlled DNA computing are presented for realizing a local search for thesolution of a shortest path problem.In this method, the concentrations of DNAs representingedges are determined according to the costs on the edges, and then the hybridization processis performed.Since the concentrations of hopeless candidate solutions tend to be small inthe result of the hybridization process, we can realize a local search by the concentrationcontrolled DNA computing.In order to discuss about the relation between given costs onedges in the graph and concentrations of generated DNA paths, the simulation model of thehybridization process is used, and the result of laboratory experiment is shown.
Role allocation and reallocation in multiagent teams: towards a practical analysis
Authors: Ranjit Nair, Milind Tambe, Stacy Marsella
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon failure remain open challenges. What remain missing are analysis techniques to aid human developers in quantitatively comparing different initial role allocations and competing role reallocation algorithms. To remedy this problem, this paper makes three key contributions. First, the paper introduces RMTDP (Role-based Multiagent Team Decision Problem), an extension to MTDP [9], for quantitative evaluations of role allocation and reallocation approaches. Second, the paper illustrates an RMTDP-based methodology for not only comparing two competing algorithms for role reallocation, but also for identifying the types of domains where each algorithm is suboptimal, how much each algorithm can be improved and at what computational cost (complexity). Such algorithmic improvements are identified via a new automated procedure that generates a family of locally optimal policies for comparative evaluations. Third, since there are combinatorially many initial role allocations, evaluating each in RMTDP to identify the best is extremely difficult. Therefore, we introduce methods to exploit task decompositions among subteams to significantly prune the search space of initial role allocations. We present experimental results from two distinct domains.
Sams Teach Yourself J2EE in 21 Days, 2 edition
Authors: Martin Bond, Dan Haywood, Debbie Law
Venue:  (2003)

:J2EE has become required knowledge for any serious Java developer, but learning this large and complex specification requires a substantial investment of time and energy. Sams Teach Yourself J2EE in 21 Days presents the enterprise Java architecture in accessible, easy-to-comprehend lessons, describing how each J2EE tool solves the challenges of n-Tier development. Using the architecture as a roadmap, following chapters describe Enterprise JavaBeans (EJB), JavaServer Pages (JSP), servlets, and more, giving readers a full understanding of J2EE development.Further chapters cover the role of XML, custom JSP tags, and how Java Connectors allow J2EE applications to interact with legacy and non-Java systems. The book finishes with sample applications that put all the pieces together, including an example using J2EE to create Web Services. Along the way, every concept is illustrated with practical, real-world examples to ensure understanding by Java students as well as experts.
Learning comprehensible theories from structured data
Authors: J. W. Lloyd
Venue: Advanced lectures on machine learning (2003)

This tutorial discusses some knowledge representation issues in machine learning. The focus is on machine learning applications for which the individuals that are the subject of learning have complex structure. To represent such individuals, a rich knowledge representation language based on higher-order logic is introduced. The logic is also employed to construct comprehensible hypotheses that one might want to learn about the individuals. The tutorial introduces the main ideas of this approach to knowledge representation in a mostly informal way and gives a number of illustrations. The application of the ideas to decision-tree learning is also illustrated with an example.
An Analytic Throughput Model for TCP Reno over Wireless Networks
Authors: Feng Zheng, Min Li, Chuanshan Gao
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Many wireless network applications are built on TCP, and will continue to be in the foreseeable future, it is important to study TCP performance in wireless networks scenariowith high loss rate. In this paper, we develop a simple analytic characterization of the steady state throughput of a bulk transfer TCP Reno flow over wireless networks, as a function of loss rate and round trip time. Our model incorporates many important aspects, such as slow start, congestion avoidance, fast retransmit, fast recovery and timeout mechanism. Our simulation results demonstrate that our model is able to accurately predict TCP throughput over wireless networks and is accurate over a wide range of loss rate.
Hash-Based Symmetric Data Structure and Join Algorithm for OLAP Applications
Authors: Motomichi Toyama, Akira Ohara
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of join algorithm becomes critical under such a condition. The fluent join is a join algorithm that operates on relations organized as multidimensional linear hash files. Like a merge join on relations which are already sorted on the joining key, its execution reads each page in the operand relations no more than once and does not create intermediate result files. Unlike sorting, the multi- dimensional linear hash can cluster records in several keys symmetrically. In this paper, the concept of the fluent join is applied to an OLAP system to cluster records in each table on the joining keys. As a result, the algorithm yields symmetric performances on joins with different dimension tables.