ppxscal/embedding_network huggingface dataset:
Evolving teamwork and role-allocation with real robots
Authors: Matt Quinn, Lincoln Smith, Giles Mayley, Phil Husbands
Venue: Proceedings of the eighth international conference on Artificial life (2002)

We report on recent work in which we employed artificial evolution to design neural network controllers for small, homogeneous teams of mobile autonomous robots. The robots are evolved to perform a formation movement task from random starting positions, equipped only with infrared sensors. The dual constraints of homogeneity and minimal sensors make this a non-trivial task. We describe the behaviour of a successful evolved team in which robots adopt and maintain functionally distinct roles in order to achieve the task. We believe this to be the first example of the use of artificial evolution to design coordinated, cooperative behaviour for real robots.
Minimum Rate Guarantee without Per-Flow Information
Authors: Yuseok Kim, Wei K. Tsai, Mahadeven Iyer, Jordi Ros
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The protocol is called MR-ASAP (Minimum Rate guaranteeing Adaptive Source-link Accounting Protocol). MR-ASAP is an extension of ASAP [Tsa98a, Kim99], the first exact maxmin flow control protocol for best-effort connection-oriented traffic in integrated service networks, without requiring per-flow accounting at the intermediate network node. In the classical maxmin computation, only the maximum rate constraints are considered; in this paper the minimum rate requirements are treated similarly as the maximum rate constraints. Existing protocols that achieve exact maxmin optimality with minimum rate guarantee require per-flow information and complex computation such as sorting of the minimum rates at the switch. By generalizing the concept of constraint, the complex sorting and per-flow accounting required in the existing protocols are avoided. Simulation demonstrates fast convergence to optimality.
Learn XML in a Weekend
Authors: Erik Westermann, Essam Ahmed
Venue:  (2002)

:Unlike most books on the market, Learn XML In a Weekend is specific to using XML on Microsoft platforms thereby narrowing its focus and making it easier to become instantly productive. It focuses on using tools to create, edit, and transform the language and shows you how to use XML for Web site design and other real-world applications. Plus, you'll learn how to use XML with: ASP.NET, the Microsoft .NET framework, HTML, data binding, and the XML DOM based on Microsoft operating systems. The companion Web site contains the book's sample code, XML tools, information on installing the parser, and more!
Getting High-Performance Silicon from System-Level Design
Authors: W. Rhett Davis
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

System-level design techniques promise a way to lessenthe productivity gap between fabrication and design.Unfortunately, these techniques have been slow to catchon, in part because they do little to help designersoptimize hardware. This paper presents a brief summaryof three system-level design techniques, Platform-baseddesign, SystemC, and Chip-in-a-day, in order to proposethat more system-level abstraction of physicalperformance is needed to make these techniques moreuseful. An analysis of design-productivity for three chipsdesigned with the Chip-in-a-Day flow is also presented.
Understanding Program Understanding
Authors: Francoise Balmas, Harald Wertz, Janice Singer
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

It is well known that many software activities involve Program Understanding tasks. In fact, anyone working in Software Engineering is confronted with the task of understanding programs, at one level or another, in one form or another, and normally s/he succeeds rather well. However, we don't have any clear understanding of what ¿to understand programs¿ means: is it to extract the program's structure or control/data flows? Is it to understand the relations between data and its transformations with respect to meanings in the application domain? Etc. We do neither have explicit guidelines to help us to perform a given program understanding task, nor do we have good criteria to decide how to represent knowledge derived by and used for program understanding. We conclude from the latter a strong need for further (fundamental) research in the Program Understanding area itself.Below is a provisional list of questions about program understanding: How could we define ¿Program Understanding¿? When do we decide we understand (enough) a program? What kind of program understanding do we achieve depending on the task at hand? How do we represent, in our minds, on paper or in files, our understanding of a program? What kind of help can we get from existing Program Understanding tools? What would we like to get actually (be it feasible or not)? What can we expect to have, as automatic help to understand programs, in the near future, in the long term? How could we describe our experiments, our own knowledge, so that they can be shared, re-used? What about Program Understanding Patterns?The goal of this Working Session is to exchange views on the former questions and others, to discuss possible research strategies, and to create an international interest group on Program Understanding, enhancing the sharing of tools, ideas and repositories.
Totally Undecomposable Functions: Applications to Efficient Multiple-Valued Decompositions
Authors: Tsutomu Sasao
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

A function \math\mathis k-decomposable if \mathcan be represented as \math\mathwhere \mathis a bipartition of input variables. This paper introduces the notion of totally k-undecomposable functions. By using this concept, we can drastically reduce the search space to find k-decompositions. A systematic method to find the bipartitions of input variables that will not produce any k-decompositions is presented. By combining it to the conventional decomposition methods, we can build an efficient functional decomposition system. This method is promising to design LUT-based FPGAs.
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Authors: Mitchell D. Theys, Noah B. Beck, Howard Jay Siegel, Michael Jurczyk, Min Tan
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links available. Sites in the network request data items and each request has an associated deadline and priority.This work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. The network is assumed to be oversubscribed and not all requests for data items can be satisfied. A mathematical model for the basic data-staging problem is given. Then, three multiple-source shortest-path algorithm based heuristics for finding a near-optimal schedule of the communication steps for staging the data are presented.Each heuristic can be used with each of four cost criteria developed. Thus, twelve implementations are examined. In addition, two different weightings for the relative importance of different priority levels are considered. The performance of the proposed heuristics is evaluated and compared by simulations.The proposed heuristics are shown to perform well with respect to upper and lower bounds. Furthermore, the heuristics and a complex cost criterion allow more highest priority messages to be received than a simple-cost-based heuristic that schedules all highest priority messages first.
Performance Models for Software/Hardware Codesign
Authors: U C Smith
Venue:  (1985)

The software/hardware codesign methodology is described. It is oriented to the design of both software algorithms and hardware architectures in parallel in order to customize them to create the best match. The role of performance assessment for codesign is defined: analytic models are first used to reduce the design space, simulation models are used later for a more detailed evaluation of selected designs. The analytic performance models are then defined. The timed computation graphs used for design representation are mapped to timed petri nets augmented with the data flow parameters of the computation graphs (ATPNs). Robust solution algorithms for the ATPNs are then defined. They involve the decomposition of the ATPN and the solution using customized algorithms. The decomposition recognizes structures that are acyclic, cycles with local balance (data flow between adjacent computations is balanced), and cycles with global balance (data flow within the cycle is balanced). Experience with the algorithms and their applicability is given and the advantages of the dual modeling approach are summarized.
Dynamic agent population in agent-based distance vector routing
Authors: Kaizar A. Amin, Armin R. Mikler, Venkatesan Iyengar Prasanna
Venue: Neural, Parallel Scientific Computations (2003)

The Intelligent Mobile Agent paradigm can be applied to a wide variety of intrinsically parallel and distributed applications. Network routing is one such application that can be mapped to an agent-based approach. The performance of any agent-based system will depend on the size of its agent population. Although a significant amount of research has been conducted on mobile agent-based systems, little consideration has been given to the importance of dynamically and autonomously adapting the size of the agent population as function of circumstances in the environment. A large number of constituent agents can consume considerable amounts of network resources, thereby impeding the overall performance of the network. Hence, it is imperative to have a control mechanism whereby the agent population can be adjusted in a distributed manner to balance the resource overhead in the network. This paper briefly discusses an agent-based approach to Distance Vector Routing, referred as Agent-based Distance Vector Routing. It also describes a framework for an adaptive approach to control the number of agents in the network using pheromones and discusses its limitations.
Fast 3D Visualization of Road Product Models
Authors: Andrej Tibaut, Branko Kauèiè, Danijel Rebolj
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Due to its monolithic nature, 3D visualization software integrated with legacy engineering applications contain every possible feature you might use - whether or not a user really wants them. With the advent of distributed objects and interpreted platform-independent languages such as Java and VRML it is possible to develop cross-platform portable 3D visualization software as components that work in an ease-to-use manner. Adopting these advances, fast 3D visualization can considerably simplify the job of maintaining the life cycle of a road integrated within an agreed road product model. This paper aims to introduce new levels of support to engineers throughout the integrated product life cycle by dealing with issues such as fast platform-independent 3D visualization and product modelling using roads as an example.
Efficient and effective web change detection
Authors: S. Flesca, E. Masciari
Venue: Data Knowledge Engineering (2003)

In this paper we present a new technique for detecting changes in Web documents. The technique is based on a new method to measure the similarity of two documents, that represent the actual and the previous version of the monitored page. The technique has been effectively used to discover changes in selected portions of the original document.The proposed technique has been implemented in the CMW system providing a change monitoring service on the Web. The main features of CMW are the detection of changes on selected portions of web documents and the possibility to express complex queries on the changed information. For instance, a query can require to check if the value of a given stock has increased by more than 10%. Several tests on stock exchange and auction web pages proved the effectiveness of the proposed approach.
Putting non-functional requirements into software architecture
Authors: Xavier Franch, Pere Botella
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

This paper presents an approach for incorporating non-functional information of software systems into software architectures. To do so, components present two distinguished slots: their non-functional specification, where non-functional requirements on components are placed, and their non-functional behaviour with respect to these requirements. Also, connector protocols may describe which non-functional aspects are relevant to component connections. We propose a notation to describe non-functionality in a systematic manner, and we use it to analyse two particular aspects of the meeting scheduler case study, user interaction and performance.
Commitment-Based Interoperation for E-Commerce
Authors: Jie Xing, Feng Wan, Sudhir K. Rustogi, Munindar P. Singh
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Successful e-commerce presupposes techniques by which autonomous trading entities can interoperate. Although much progress has been made on data exchange and payment protocols, interoperation in the face of autonomy is still inadequately understood. Current techniques, designed for closed environments, support only the simplest interactions. We develop a multiagent approach for interoperation in e-commerce. This approach consists of (1) a behavioral model to specify autonomous, heterogeneous agents representing different trading entities (businesses, consumers, brokers), (2) a metamodel that provides a language (based on XML) for specifying a variety of service agreements and accommodating exceptions and revisions, and (3) an execution architecture that supports persistent and dynamic (re)execution.
Keynote Address - exploring, modeling, and using the web graph
Authors: Andrei Broder
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

The Web graph, meaning the graph induced by Web pages as nodes and their hyperlinks as directed edges, has become a fascinating object of study for many people: physicists, sociologists, mathematicians, computer scientists, and information retrieval specialists.Recent results range from theoretical (e.g.: models for the graph, semi-external algorithms), to experimental (e.g.: new insights regarding the rate of change of pages, new data on the distribution of degrees), to practical (e.g.: improvements in crawling technology).Recent results range from theoretical (e.g.: models for the graph, semi-external algorithms), to experimental (e.g.: new insights regarding the rate of change of pages, new data on the distribution of degrees), to practical (e.g.: improvements in crawling technology).The goal of this talk is to convey an introduction to the state of the art in this area and to sketch the current issues in collecting, representing, analyzing, and modeling this graph. Although graph analytic methods are essential tools in the Web IR arsenal, they are well known to the SIGIR community and will not be discussed here in any detail; instead, we will explore some challenges and opportunities for using IR methods and techniques in the exploration of the Web graph, in particular in dealing with legitimate and "spam" perturbations of the "natural" process of birth and death of nodes and links, and conversely, the challenges and opportunities of using graph methods in support of IR on the Web and in the enterprise.
Program Understanding During Software Adaptation Tasks
Authors: Anneliese von Mayrhauser, A. Marie Vans
Venue: Proceedings of the International Conference on Software Maintenance (1998)

This paper reports on a software understanding study during adaptation of large-scale software by software maintenance professionals. The paper explains the general understanding process, the information needs of these software engineers during their tasks, and the tool capabilities that would help them to be more productive. We also contrast programmer behavior during adaptation with that during other maintenance activities like corrective maintenance and enhancement.
A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem
Authors: Afonso Ferreira, Nicolas Schabanel
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

This paper presents a randomized parallel algorithm for the Maximal Independent Set problem. Our algorithm uses a BSP-like computer with p processors and requires (n+m)/p larger or equal to p for a graph with n vertices and m edges. Under this scalability assumption, and after a preprocessing phase, it computes a maximal independent set after O(log p) communication rounds, with high probability, each round requiring linear computation time O((n+m)/p). The preprocessing phase is deterministic and important in order to ensure that degree computations can be implemented efficiently. For this, we give an optimal parallel BSP/CGM algorithm to the p-quantiles search problem, which runs in O(m log p/p) time and a constant number of communication rounds, and could be of interest in its own right, as shown in the full text.
Packing of induced stars in a graph
Authors: Alexander K. Kelmans
Venue:  (1996)

We consider simple undirected graphs. An edge subset $A$ of $G$ is called an {\em induced $n$--star packing} of $G$ if every component of the subgraph $G[A]$ induced by $A$ is a star with at most $n$ edges and is an induced subgraph of $G$. We consider the problem of finding an induced $n$--star packing of $G$ that covers the maximum number of vertices. This problem is a natural generalization of the classical matching problem. We show that many classical results on matchings (such as the Tutte 1-Factor Theorem, the Berge Duality Theorem, the Gallai--Edmonds Structure Theorem, the Matching Matroid Theorem) can be extended to induced $n$--star packings in a graph.
Parameter Adaptive Congestion Control of ABR Traffic in ATM Networks
Authors: R. G. de Silva, W. J. Dewar
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Congestion control is an important issue in resource management of ATM networks. It is therefore necessary to develop stable rate based ABR congestion control schemes that minimize or prevent cell loss, require small buffer sizes and minimize end to end delay. Although there are some excellent congestion control methods reported in the literature that use formal control theory, the issues of ensuring minimum cell rate (MCR) and guaranteeing global asymptotic stability have not been handled successfully. In a recent paper [16], we proposed a method to alleviate these problems. However, the development of the controller and the proof of the stability was based on an approximate model of the system. When the cell rate within a time slot is not uniform, this model does not hold true. In this paper, we propose a parameter adaptive congestion avoidance method that uses a one step ahead predictor. It has been shown analytically and by simulation that the proposed method performs better than our former method while guaranteeing global asymptotic stability. However, as the controller is adaptive, the computational burden is increased.
Testing Production System Programs
Authors: Grigoris Antoniou, Oliver Jack
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

A production system (PS) is a forward chaining rule-based system used to build large expert systems. Testing a PS must involve the construction of a covering set of test data but it is not clear what the meaning of covering a PS is and how a test data set can be measured according to coverage.We propose a test data coverage measure for a subset for PS with well defined semantics. We use a correspondence between PS and function free first order Horn logic programs to define the declarative coverage notion and measure.We found that the coverage measure can be used to determine the coverage of the program logic of a PS as well as to automate test data generation. Unification theory is utilised to measure test data coverage and constrained inductive generation is used for test data construction.
Viewpoints as an evolutionary approach to software system maintenance
Authors: P. Alencar, D. Cowan, T. Nelson, C. J. Lucena
Venue: Proceedings of the International Conference on Software Maintenance (1997)

We describe a black box approach to software system evolution where viewpoints are used to alter a design without modifying the original system. A viewpoint is a model, possibly incomplete, of a domain from a given perspective. We discuss the views-an operator and its semantics, and then apply the concepts to the NACHOS file system as a case study. We believe the approach can be applied to existing object oriented software systems, and serve as a guide for developing systems which are more easily maintained. This case study is an example of an application of a more general transformational approach to software design and implementation.