node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
1,480 | 0 | A Java Application Framework for Agent Based Systems Agents are the next significant software abstraction, especially for distributed systems. Agent based systems have been developed in response to the following requirements: - Personalized and customized user interfaces that are pro-active in assisting the user - Adaptable, fault tolerant distributed systems that solve complex problems - Open systems where components come and go and new components are continually added. - Migration and load balancing across platforms, throughout a network. - New metaphors, such as negotiation, for solving distributed, multi- disciplinary problems. Agents appear in a wide range of applications, but all agent development to date has been done independently by each development team. This has led to several problems, including i) duplication of effort, ii) inability to satisfy industrial strength requirements for security and scalability, and iii) incompatibility of agent systems. The application framework described in this chapter captures and clarifies th... | [
1212,
1332
] | Test |
1,481 | 3 | Information Integration: the MOMIS Project Demonstration ranted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment. Proceedings of the 26th VLDB Conference, Cairo, Egypt, 2000. 2 MOMIS is a joint project among the Universit`a di Modena e Reggio Emilia, the Universit`a di Milano, and the Universit`a di Brescia within the national research project INTERDATA, theme n.3 "Integration of Information over the Web", coordinated by V. De Antonellis, Universit`a di Brescia. 1. a common data model, ODM I 3 , which is defined according to the ODL I 3 language, to describe source schemas for integration purposes. ODM I 3 and ODL I 3<F12.24 | [
55,
326,
1819
] | Validation |
1,482 | 3 | The Relationlog System User Manual - Release 1.0 This document introduces the Relationlog system through the use of examples. All examples used here are available as part of the Relationlog release in the directory named demo. 2 INSTALLING RELATIONLOG 3 2 Installing Relationlog | [
2083
] | Train |
1,483 | 4 | Process- and Agent-Based Modelling Techniques for Dialogue Systems and Virtual Environments This text presents results of ongoing research, which is aimed at developing a framework for developing multimodal natural language dialogue systems operating within virtual environments. The aspects of multimodality and presence in a virtual environment are chosen as the main focus of this research. It may be argued that specification techniques would form the basis of such a framework. Therefore, a general overview and evaluation is given of existing specification techniques for interactive systems, based on both literature and previous research results. This includes the object-oriented model, process algebras, interactor models, and agent systems. Agent systems are further subdivided into intentional logics, production rule systems, agent communication languages, agent platforms, and agent architectures. A new agent system is proposed, which is based on update notification mechanisms as found in interactor models, and the `facilitator' function as found in some agent platfo... | [
140,
2309
] | Validation |
1,484 | 5 | Using an Expressive Description Logic: FaCT or Fiction? Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description language is formally defined, so that the subsumption relationship between two concept descriptions can be computed by a suitable algorithm. Description Logics have proved useful in a range of applications but their wider acceptance has been hindered by their limited expressiveness and the intractability of their subsumption algorithms. This paper addresses both these issues by describing a sound and complete tableaux subsumption testing algorithm for a relatively expressive Description Logic which, in spite of the logic's worst case complexity, has been shown to perform well in realistic applications. 1 INTRODUCTION Description Logics (DLs) form a family of formalisms which have grown out of knowledge representation techniques using frames and semantic networks | [
132,
183,
294,
377,
409,
2552,
2789,
3117
] | Train |
1,485 | 2 | Conceptual Linking: Ontology-based Open Hypermedia This paper describes the attempts of the COHSE project to define and deploy a Conceptual Open Hypermedia Service. Consisting of . an ontological reasoning service which is used to represent a sophisticated conceptual model of document terms and their relationships; . a Web-based open hypermedia link service that can offer a range of different linkproviding facilities in a scalable and non-intrusive fashion; and integrated to form a conceptual hypermedia system to enable documents to be linked via metadata describing their contents and hence to improve the consistency and breadth of linking of WWW documents at retrieval time (as readers browse the documents) and authoring time (as authors create the documents). Introduction: concepts and metadata Metadata is data that describes other data to enhance its usefulness. The library catalogue or database schema are canonical examples. For our purposes, metadata falls into three broad categories: . Catalogue information: e.g. the artist ... | [
512,
2616
] | Test |
1,486 | 3 | A General Framework for Evolving Schemata Support . In this paper a semantic approach for the specication and the management of databases with evolving schemata is introduced. It is shown how a general object-oriented model for schema versioning and evolution can be formalised; how the semantics of schema change operations can be dened; how interesting reasoning tasks can be supported, based on an encoding in description logics. 1 Introduction The problems of schema evolution and versioning arose in the context of long-lived database applications, where stored data were considered worth surviving changes in the database schema [23]. According to a widely accepted terminology [19], a database supports schema evolution if it permits modications of the schema without the loss of extant data; in addition, it supports schema versioning if it allows the querying of all data through user-denable version interfaces. For the sake of brevity, schema evolution can be considered as a special case of schema versioning where only the curr... | [
2789,
2935
] | Train |
1,487 | 1 | General Principles Of Learning-Based Multi-Agent Systems We consider the problem of how to design large decentralized multi-agent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a reinforcement learning algorithm. This converts the problem into one of how to automatically set/update the reward functions for each of the agents so that the global goal is achieved. In particular we do not want the agents to “work at cross-purposes ” as far as the global goal is concerned. We use the term artificial COllective INtelligence (COIN) to refer to systems that embody solutions to this problem. In this paper we present a summary of a mathematical framework for COINs. We then investigate the real-world applicability of the core concepts of that framework via two computer experiments: we show that our COINs perform near optimally in a difficult variant of Arthur’s bar problem [1] (and in particular avoid the tragedy of the commons for that problem), and we also illustrate optimal performance for our COINs in the leader-follower problem. 1 | [
229,
1365,
1880,
2530
] | Train |
1,488 | 4 | Nudge Nudge Wink Wink: Elements of Face-to-Face Conversation for Embodied Conversational Agents Introduction Only humans communicate using language and carry on conversations with one another. And the skills of conversation have developed in humans in such a way as to exploit all of the unique affordances of the human body. We make complex representational gestures with our prehensile hands, gaze away and towards one another out of the corners of our centrally set eyes, and use the pitch and melody of our voices to emphasize and clarify what we are saying. Perhaps because conversation is so defining of humanness and human interaction, the metaphor of face-to-face conversation has been applied to human-computer interface design for quite some time. One of the early arguments for the utility of this metaphor gave a list of features of face-to-face conversation that could be applied fruitfully to human-computer interaction, including mixed initiative, nonverbal communication, sense of presence, rules for transfer of control (Nickerson 1976). However, although these feature | [
1492,
2536,
2642
] | Train |
1,489 | 1 | Temporal Interpolation Of Video Sequences Using Zonal Based Algorithms Temporal interpolation has been recently proposed as a solution for increasing temporal resolution or even for predicting missing or corrupted frames within a video sequence. In this paper new techniques on temporal interpolation are presented, by mainly exploiting properties of the very popular and highly efficient zonal based motion estimation algorithms, and by introducing several other techniques such as multihypothesis motion compensation, motion classification and temporal/spatial filtering. In addition we further give an analysis on when temporal interpolation should be employed, thus possibly avoiding unwanted artifacts created from this process, while at the same time significantly improving the overall performance of the interpolation. | [
195
] | Train |
1,490 | 1 | Types of Incremental Learning This paper is intended to introduce a closer look at incremental learning by developing the two concepts of informationally incremental learning and operationally incremental learning. These concept are applied to the problem of learning containment decision lists for demonstrating its relevance. 1 Introduction The intention of the present paper is to introduce two new notions in incremental learning which allow a classification of phenomena finer than known so far in the area. These concepts are denoted by the phrases informationally incremental learning and operationally incremental learning, respectively. Roughly spoken, informationally incremental algorithms are required to work incrementally as usual, i.e. they have no permission to look back at the whole history of information presented during the learning process. Operationally incremental learning algorithms may have permission to look back, but they are not allowed to use information of the past in some effective way. ... | [
636,
1844,
3160,
3176
] | Train |
1,491 | 4 | Putting the Feel in `Look and Feel' Haptic devices are now commercially available and thus touch has become a potentially realistic solution to a variety of interaction design challenges. We reportonanexperimental investigation of the use of touch as a way of reducing visual overload in the conventional desktop. In a two-phase study, we investigated the use of the PHANToM haptic device as a means of interacting with a conventional graphical user interface. The first experiment compared the effects of four different haptic augmentations on user performance in a simple targeting task. The second experiment involved a more ecologically oriented searching and scrolling task. Results indicated that the haptic effects did not improve users performance in terms of task completion time. However, the number of errors made was significantly reduced. Subjective workload measures showed that participants perceived many aspects of workload as significantly less with haptics. The results are described and the implications for the use of haptics in user interface design are discussed. Subject Areas: Multimodal interaction Augmented reality Empirical (quantitative) Evaluation Input devices Interaction technology CHI 2000 Home Page 1of2 13/09/99 11:36 CHI 2000 Call For Papers http://msrconf.microsoft.com/sigchi/AuthorListEditProcess.asp Tactile or gestural I/O CLICK HERE to view the anonymous version of your paper that we have received. Your paper must be viewable by the standard Adobe Acrobat viewer. If you cannot get this to work, then your hardcopy version will be sent to reviewers. Remember, in addition to your electronic submission, you must submit your paper in hardcopy form to CHI 2000 , c/o Mary Czerwinski , Microsoft Research , One Microsoft Way , Redmond, ... | [
1778,
2899
] | Validation |
1,492 | 4 | More Than Just Another Pretty Face: Embodied Conversational Interface Agents this article I describe some of the features of human-human conversation that are being implemented in this new genre of embodied conversational agents. Then I describe an embodied conversational agent that is based on these features. I argue that, because conversation is such a primary skill for humans, and such an early-learned skill (practiced, in fact, between infants and mothers who take turns cooing and burbling at one another), and because the body is so well-equipped to support conversation, embodied conversational agents may turn out to be powerful ways for humans to interact with their computers. However, I claim that in order for embodied conversational agents to live up to their promise, their implementations must be based on actual study of human -- human conversation, and their architectures must reflect some of the intrinsic properties found there. Embodied conversational interfaces are not just computer interfaces represented by way of human or animal bodies. And they are not just interfaces where those human or animal bodies are lifelike or believable in their actions and their reactions to human users. Embodied conversational interfaces are specifically conversational in their behaviors, and specifically human-like in the way they use their bodies in conversation. That is, embodied conversational agents may be defined as those that have the same properties as humans in face-to-face conversation, including: | [
1488,
2094
] | Train |
1,493 | 3 | Beyond Best Effort: Router Architectures for the Differentiated Services of Tomorrow's Internet With the transformation of the Internet to a commercial infrastructure, the ability to provide differentiated services to users with widely varying requirements is rapidly becoming as important as meeting the massive increases in bandwidth demand. Hence, while deploying routers, switches, and transmission systems of ever increasing capacity, Internet Service Providers would also like toprovide customer specific differentiated services using the same shared network infrastructure. In this paper, we describe router architectures that can support the two trends of rising bandwidth demand and rising demand for differentiated services. We focus on router mechanisms that can support differentiated services at a level not being contemplated in proposals currently under consideration due to concern regarding their implementability at high-speeds. We consider the types of differentiated services that service providers may want to offer and then discuss the mechanisms needed in routers to support them. We describe plausible implementations of these mechanisms (the scalability and performance of which have been demonstrated by implementation in a prototype system) and argue that it is technologically possible to raise considerably the level of differentiated services that service providers can offer their customers, and that it is not necessary to restrict differentiated services to rudimentary offerings even in very high-speed networks. | [
52
] | Train |
1,494 | 0 | Second-Order Networks for Wall-Building Agents This paper describes robust neurocontrollers for groups of agents that perform construction tasks. They enable agents to balance multiple goals, perform sequences of actions and survive while building walls, corridors, intersections, and briar patches. | [
129,
1324,
2384
] | Train |
1,495 | 2 | Parallel Strands: A Preliminary Investigation into Mining the Web for Bilingual Text . Parallel corpora are a valuable resource for machine translation, but at present their availability and utility is limited by genreand domain-specificity, licensing restrictions, and the basic difficulty of locating parallel texts in all but the most dominant of the world's languages. A parallel corpus resource not yet explored is the World Wide Web, which hosts an abundance of pages in parallel translation, offering a potential solution to some of these problems and unique opportunities of its own. This paper presents the necessary first step in that exploration: a method for automatically finding parallel translated documents on the Web. The technique is conceptually simple, fully language independent, and scalable, and preliminary evaluation results indicate that the method may be accurate enough to apply without human intervention. 1 Introduction In recent years large parallel corpora have taken on an important role as resources in machine translation and multilingual natural la... | [
1140
] | Train |
1,496 | 4 | An Extensible and Scalable Content Adaptation Pipeline Architecture to Support Heterogeneous Clients The importance of middleware and content adaptation has previously been demonstrated for pervasive use of Web-based applications. In this paper we propose a modular, extensible, and scalable middleware component called the Content Adaptation Pipeline that performs content adaptation on arbitrarily complex data types not limited to text and graphic images. Furthermore, the architecture can be used as part of many client-server applications, not just Web browsers. In our work we leverage the XML language as a uniform means to describe all the elements in our architecture, including the client device and user profiles, the data characteristics, the transcoding operations performed on the data, and the resultant adapted data. We illustrate the flexibility of our architecture to support new data types and adaptation operations by first showing its use with data from a real-world medical application and then extending its capabilities to handle animated graphics and also real-time streaming RTP data. Finally, we demonstrate scalability in our architecture by executing the Content Adaptation Pipeline over a distributed set of servers running an efficient protocol. | [
659,
2447
] | Validation |
1,497 | 4 | What semiotics can and cannot do for HCI Semiotics is "the mathematics of the humanities" in the sense that it provides an abstract language covering a diversity of special sign-usages (language, pictures, movies, theatre, etc.). In this capacity, semiotics is helpful for bringing insights from older media to the task of interface design, and for defining the special characteristics of the computer medium. However, semiotics is not limited to interface design but may also contribute to the proper design of program texts and yield predictions about the interaction between computer systems and their context of use. Keywords Computer based signs, aesthetics, context of use. 0. The mathematics of the humanities. In my experience, semiotics can be useful for the HCI-field, but the purely analytic character of traditional semiotics has to be supplemented by a constructive one. In addition, the semiotic community has to acquire a solid understanding of the technical possibilities and limitations of computer systems in order to b... | [
114
] | Validation |
1,498 | 4 | Design Principles For Resource Management Systems For Intelligent Spaces The idea of ubiquitous computing and smart environments is no longer a dream and has long become a serious area of research and soon this technology will start entering our every day lives. There are two major obstacles that prevent this technology from spreading. First, di#erent smart spaces are equipped with very di#erent kinds of devices (e.g. a projector vs. a computer monitor, vs. a TV set). Second, multiple applications running in a space at the same time inevitably contend for those devices and other scarce resources. The underlying software in a smart space needs to provide tools for self-adaptivity in that it shields the rest of the software from the physical constraints of the space, and that it dynamically adjusts the allocation of scarce resources as the number and priorities of active tasks change. | [
1035,
1618
] | Train |
1,499 | 2 | Multi-Document Summarization and Visualization in the Informedia Digital Video Library The Informedia Digital Video Library project provided a technological foundation for full content indexing and retrieval of video and audio media. The library now contains over 2000 hours of video and is growing daily. A good query engine is not sufficient for information retrieval because often the candidate result sets grow in number as the library grows. Video digests summarize sets of stories from the library, providing users with a visual mechanism for interactive browsing and query refinement. These digests are generated dynamically under the direction of the user based on automatically derived metadata from the video library. Informedia Digital Video Library Foundation Work The Informedia Digital Video Library focused on the development and integration of technologies for information extraction from video and audio content to enable its full content search and retrieval. Over two terabytes (2000 hours, 5,000 segments) of online data was collected, with automatically generated metadata and indices for retrieving video segments from this library. Informedia successfully pioneered the automatic creation of multimedia abstractions, demonstrated empirical proofs of their relative benefits, and gathered usage data of different summarizations and abstractions. Fundamental research and prototyping was conducted in the following areas, shown with a sampling of references to particular work: | [
3044
] | Train |
1,500 | 4 | The eSleeve: A Novel Wearable Computer Configuration for the Discovery of Situated Information This paper describes work in progress on wearable computing configurations which provide audio and visual output based on the position and orientation of the user. We introduce the `eSleeve' - a wearable wrist computer with position and heading sensors combined with a user interface employing speech recognition and a small display. | [
798,
2617
] | Test |
1,501 | 0 | A Formal Specification of dMARS The Procedural Reasoning System (PRS) is the best established agent architecture currently available. It has been deployed in many major industrial applications, ranging from fault diagnosis on the space shuttle to air traffic management and business process control. The theory of PRS-like systems has also been widely studied: within the intelligent agents research community, the beliefdesire -intention (BDI) model of practical reasoning that underpins PRS is arguably the dominant force in the theoretical foundations of rational agency. Despite the interest in PRS and BDI agents, no complete attempt has yet been made to precisely specify the behaviour of real PRS systems. This has led to the development of a range of systems that claim to conform to the PRS model, but which differ from it in many important respects. Our aim in this paper is to rectify this omission. We provide an abstract formal model of an idealised dMARS system (the most recent implementation of the PRS... | [
644,
1935,
2338,
2364
] | Test |
1,502 | 0 | Agent-Oriented Requirements Engineering Using ConGolog and i* : Agent-oriented approaches are becoming popular in software engineering, both as architectural frameworks, and as modeling frameworks for requirements engineering and design. i* is an informal diagram-based language for early-phase requirements engineering that supports the modeling of social dependencies between agents and how process design choices affect the agents' goals both functional and non-functional. ConGolog is an expressive logic-based formalism for specifying processes that involves multiple agents. Tools are being developed to support the validation of ConGolog process models though simulation and verification. The two formalisms complement each other well, and in this work, we develop a methodology for their combined use in requirements engineering. The i* SR-diagram language is extended with process specification annotations, which allow the SR model of a system to be refined and then mapped into a ConGolog model. The mapping must satisfy a set of mapping rules, which ensure that it specifies which elements in the two models are related and that the models are consistent. The methodology is illustrated on a meeting scheduling application example. 1 | [
2309
] | Train |
1,503 | 2 | Query Evaluation for Mediators over Web Catalogs The Web catalogs like Yahoo! and Open Directory are very useful for browsing and querying the Web. Although they index only a fraction of the pages that are indexed by search engines these catalogs are hand-crafted by domain experts and are therefore of high quality. We present a model for building mediators over Web catalogs, so as to provide users with customized views of such catalogs. We focus on query evaluation, specifically on the complexity of query answering by the mediator. | [
2161
] | Validation |
1,504 | 0 | Programmability of Intelligent Agent Avatars In this paper, we propose an approach to the programmability of intelligent agent avatars, supported by the distributed logic programming language DLP. Intelligent agent avatars can be considered as one of the applications of web agents. As one of the testbeds of 3D web agents, we are developing and implementing soccer playing avatars. We discuss how the language DLP can be used to support soccer playing avatars using rules to guide their behaviors in networked virtual environments. Categories and Subject Descriptors I.2 [Computing Methodologies]: Artificial Intelligence; H.4.m [Information Systems]: Miscellaneous General Terms Intelligent Agent Keywords avatar, intelligent agent, distributed logic programming, networked virtual environment 1. | [
1978,
3174
] | Train |
1,505 | 4 | OceanStore: An Architecture for Global-Scale Persistent Storage OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cached anywhere, anytime. Additionally, monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. A prototype implementation is currently under development. 1 | [
276,
783,
1114,
1207
] | Train |
1,506 | 5 | An Expert System for Analyzing Firewall Rules When deploying firewalls in an organization, it is essential to verify that the firewalls are configured properly. The problem of finding out what a given firewall configuration does occurs, for instance, when a new network administrator takes over, or a third party performs a technical security audit for the organization. While the problem can be approached via testing, non-intrusive techniques are often preferred. Existing tools for analyzing firewall configurations usually rely on hard-coded algorithms for analyzing access lists. In this paper we present a tool based on constraint logic programming (CLP) which allows the user to write higher level operations for, e.g., detecting common configuration mistakes. Our tool understands Cisco router access lists, and it is implemented using Eclipse, a constraint logic programming language. The problem of analyzing firewall configurations lends itself quite naturally to be solved by an expert system. We found it surprisingly easy to use logic statements to express knowledge on networking, firewalls, and common configuration mistakes, for instance. Using an existing generic inference engine allowed us to focus on defining the core concepts and relationships in the knowledge base. 1 | [
627
] | Validation |
1,507 | 4 | Adaptive Collaboration for Wired and Wireless Platforms - A data-centric architecture for collaboration environments uses XML to adapt shared data dynamically between devices with widely disparate capabilities. This article begins by introducing a data-centric architecture that abstracts collaborative tasks as editing of data repositories, followed by descriptions of the role of XML in managing heterogeneity and intelligent software agents in discovering network and computing environment conditions | [
2613
] | Validation |
1,508 | 0 | Information-Passing and Belief Revision in Multi-Agent Systems We define a programming language for multi-agent systems in which agents interact with a common environment and cooperate by exchanging their individual beliefs on the environment. In handling the information they acquire, the agents employ operations to expand, remove and update their individual belief bases. The overall framework, which generalizes traditional concurrent programming concepts, is parameterized by an information system of constraints. Such a system is used to represent the environment as well as the beliefs of the agents. We give the syntax of the programming language and develop an operational semantics in terms of a transition system. 1. Introduction and syntax A lot of effort has been made in the development of programming languages for multi-agent systems that cover typical agent concepts as beliefs, desires, intentions, commitments, speech acts, communication, cooperation and so on. However, in our opinion, most of the concurrency aspects of the existing multi-a... | [
937
] | Train |
1,509 | 1 | Logic-based Genetic Programming with Definite Clause Translation Grammars DCTG-GP is a genetic programming system that uses definite clause translation grammars. A DCTG is a logical version of an attribute grammar that supports the definition of context--free languages, and it allows semantic information associated with a language to be easily accomodated by the grammar. This is useful in genetic programming for defining the interpreter of a target language, or incorporating both syntactic and semantic problem--specific contraints into the evolutionary search. The DCTG-GP system improves on other grammar--based GP systems by permitting non--trivial semantic aspects of the language to be defined with the grammar. It also automatically analyzes grammar rules in order to determine their minimal depth and termination characteristics, which are required when generating random program trees of varied shapes and sizes. An application using DCTG-GP is described. 1 INTRODUCTION Genetic programming (GP) implementations have benefitted from simple program denotations.... | [
1868
] | Validation |
1,510 | 2 | An Intelligent Multi-Agent Architecture for Information Retrieval from the Internet The World Wide Web (WWW) offers an uncountable number of documents which deal with information from a neverending list of topics. Thus the question of whether to find information turned into a question of how to find relevant information. Search engines with crawler based indexes vary in recall and offer a very bad precision. Meta search engines try to overcome these lacks based upon a specialised monolithic architecture for information extraction, information filtering and integration of heterogenous information resources. Few search engines employ intelligent techniques in order to increase precision. On the other hand, user modeling techniques become more and more popular. Many personalized agent based system for web browsing are currently developed. It is a straightforward idea to incorporate the idea of user modeling with machine learning methods into web search services. We propose an abstract prototype which is being developed at the University of Osnabruck and which incorporat... | [
1053,
1847,
2393
] | Train |
1,511 | 4 | Designing StoryRooms: Interactive Storytelling Spaces for Children Limited access to space, costly props, and complicated authoring technologies are among the many reasons why children can rarely enjoy the experience of authoring roomsized interactive stories. Typically in these kinds of environments, children are restricted to being story participants, rather than story authors. Therefore, we have begun the development of "StoryRooms," room-sized immersive storytelling experiences for children. With the use of low-tech and high-tech storytelling elements, children can author physical storytelling experiences to share with other children. In the paper that follows, we will describe our design philosophy, design process with children, the current technology implementation and example StoryRooms. KEYWORDS Augmented Environments, Storytelling, Children, Educational Applications, Participatory Design, Cooperative Inquiry INTRODUCTION A child sits in a playroom. She tells a story to her dolls about her family. Another child sits at the dinner table wit... | [
466,
2322,
2640
] | Test |
1,512 | 2 | Topic-Driven Crawlers: Machine Learning Issues Topic driven crawlers are increasingly seen as a way to address the scalability limitations of universal search engines, by distributing the crawling process across users, queries, or even client computers. | [
2,
471,
488,
608,
1021,
1547,
1838,
2372,
2503,
3170
] | Train |
1,513 | 3 | Database Replication Using Epidemic Update Due to severe performance penalties associated with synchronous replication, there is an increasing interest in asynchronous replica management protocols in which database transactions are executed locally, and the effects of these transactions are incorporated asynchronously on remote database copies. However, the asynchronous protocols currently in use either do not guarantee consistency and serializability as needed by transactional semantics or they impose restrictions on placement of data and on which data objects can be updated. In this paper we investigate an epidemic update protocol that guarantees consistency and serializability in spite of a write-anywhere capability. We conducted experiments on a detailed simulation of a distributed, replicated database to evaluate this protocol. Our results establish that this epidemic approach is indeed a viable alternative to traditional eager update protocols for a distributed database environment where consistency and full seri... | [
2184
] | Test |
1,514 | 4 | Adding Generic Contextual Capabilities to Wearable Computers Context-awareness has an increasingly important role to play in the development of wearable computing systems. In order to better define this role we have identified four generic contextual capabilities: sensing, adaptation, resource discovery, and augmentation. A prototype application has been constructed to explore how some of these capabilities could be deployed in a wearable system designed to aid an ecologist's observations of giraffe in a Kenyan game reserve. However, despite the benefits of context-awareness demonstrated in this prototype, widespread innovation of these capabilities is currently stifled by the difficulty in obtaining the contextual data. To remedy this situation the Contextual Information Service (CIS) is introduced. Installed on the user's wearable computer, the CIS provides a common point of access for clients to obtain, manipulate and model contextual information independently of the underlying plethora of data formats and sensor interface mechanisms. 1. Int... | [
217,
2166,
2211,
2763
] | Train |
1,515 | 0 | Towards Resource Efficient and Scalable Routing: An Agent-based Approach Mobile Agents are being proposed for an increasing variety of applications. Agent mobility can be exploited to implement a scalable system level solutions. Network routing is one such domain that can benefit from an agent-based approach. Shortest Path Routing algorithms enjoy a widespread use in most communication networks. However, large amounts of routing data exchanged in these algorithms consume substantial bandwidth, making conventional routing schemes less scalable. | [
278,
1173
] | Validation |
1,516 | 1 | The Bivariate Marginal Distribution Algorithm The paper deals with the Bivariate Marginal Distribution Algorithm (BMDA). BMDA is an extension of the Univariate Marginal Distribution Algorithm (UMDA). It uses the pair gene dependencies in order to improve algorithms that use simple univariate marginal distributions. BMDA is a special case of the Factorization Distribution Algorithm, but without any problem specic knowledge in the initial stage. The dependencies are being discovered during the optimization process itself. In this paper BMDA is described in detail. BMDA is compared to dierent algorithms including the simple genetic algorithm with dierent crossover methods and UMDA. For some tness functions the relation between problem size and the number of tness evaluations until convergence is shown. 1. Introduction Genetic algorithms work with populations of strings of xed length. In this paper binary strings will be considered. From current population better strings are selected at the expense of worse ones. New strings ar... | [
839,
1830,
1848
] | Validation |
1,517 | 4 | Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions This article concerns the benefits of presenting abstract data in 3D. Two experiments show that motion cues combined with stereo viewing can substantially increase the size of tbe graph that can be perceived. The first experiment was designed to provide quantitative measurements of how much more (or less) can be understood in 3D than in 2D. Tbe 3D display used was configured so that the image on the monitor was coupled to the user’s actual eye positions (and it was updated in real-time as the user moved) as well as being in stereo. Thus the effect was like a local “virtual reality ” display located in the vicinity of the computer monitor. The results from this study show that head-coupled stereo viewing can increase the size of an abstract graph that can be understood by a factor of three; using stereo alone provided an increase by a factor of 1.6 and bead coupling alone produced an increase by a factor of 2.2, Tbe second experiment examined a variety of motion cues provided by head-coupled perspective (as in virtual reality displays), hand-guided motion and automatic rotation, respectively, both with and without stereo in each case. The results show that structured 3D motion and stereo viewing both help in understanding, but that the kind of motion is not particularly important; all improve performance, and all are more significant than stereo cues. These results provide strong reasons for using advanced 3D graphics for interacting with a large variety of information structures. | [
1406
] | Test |
1,518 | 1 | Individual Learning of Coordination Knowledge Social agents, both human and computational, inhabiting a world con-taining multiple active agents, need to coordinate their activities. This is because agents share resources, and without proper coordination or “rules of the road”, everybody will be interfering with the plans of others. As such, we need coordination schemes that allow agents to effectively achieve local goals without adversely affecting the problem-solving capabilities of other agents. Researchers in the field of Distributed Artificial Intelligence (DAI) have de-veloped a variety of coordination schemes under different assumptions about agent capabilities and relationships. Whereas some of these research have been motivated by human cognitive biases, others have approached it as an engineering problem of designing the most effective coordination architec-ture or protocol. We evaluate individual and concurrent learning by mul-tiple, autonomous agents as a means for acquiring coordination knowledge. We show that a uniform reinforcement learning algorithm suffices as a coor-dination mechanism in both cooperative and adversarial situations. Using a number of multiagent learning scenarios with both tight and loose coupling between agents and with immediate as well as delayed feedback, we demon-strate that agents can consistently develop effective policies to coordinate their actions without explicit information sharing. We demonstrate the vi-ability of using both the Q-learning algorithm and genetic algorithm based classifier systems with different payoff schemes, namely the bucket brigade algorithm (BBA) and the profit sharing plan (PSP), for developing agent coordination on two different multi-agent domains. In addition, we show that a semi-random scheme for action selection is preferable to the more traditional fitness proportionate selection scheme used in classifier systems. 1 1 | [
858,
978
] | Train |
1,519 | 3 | Pushing Reactive Services to XML Repositories using Active Rules Push technology, i.e., the ability of sending relevant information to clients in reaction to new events, is a fundamental aspect of modern information systems; XML is rapidly emerging as the widely adopted standard for information exchange and representation and hence, several XML-based protocols have been defined and are the object of investigation at W3C and throughout commercial organizations. In this paper, we propose the new concept of active XML rules for "pushing" reactive services to XML-enabled repositories. Rules operate on XML documents and deliver information to interested remote users in reaction to update events occurring at the repository site. The proposed mechanism assumes the availability of XML repositories supporting a standard XML query language, such as XQuery that is being developed by the W3C; for the implementation of the reactive components, it capitalizes on the use of standard DOM events and of the SOAP interchange standard to enable the remote installation of active rules. A simple protocol is proposed for subscribing and unsubscribing remote rules. | [
230,
886,
1056,
1771,
2910
] | Test |
1,520 | 3 | Lossless Regular Views If the only information we have on a certain database is through a set of views, the question arises of whether this is sufficient to answer completely a given query. We say that the set of views is lossless with respect to the query, if, no matter what the database is, we can answer the query by solely relying on the content of the views. The question of losslessness has various applications, for example in query optimization, mobile computing, data warehousing, and data integration. We study this problem in a context where the database is semistructured, and both the query and the views are expressed as regular path queries. The form of recursion present in this class prevents us from applying known results to our case. | [
1612,
2594
] | Train |
1,521 | 3 | Querying the Physical World Data Type (ADT) objects that are single attribute values encapsulating a collection of related data [S98]. Note that there are natural parallels between devices and ADTs. Both ADTs and devices provide controlled access to encapsulated data through a well-defined interface. We build upon this observation by modeling each type of device in the network as an ADT. The public interface of the ADT corresponds to the specific functions supported by the device. An actual ADT object in the database corresponds to a physical device in the real world. Let us model the database schema corresponding to the flood detection example from the introduction. We consider a simplified schema that consists of the following relations . RFSensors(Sensor, X, Y) . Areas (Name, X1, Y1, X2, Y2) A record in the RFSensors relation has three attributes. The first attribute, called Sensor, is an ADT that represents the physical rainfall sensor. The actual Sensor data is located on the rainfall sensor; the ADT ... | [
309,
2818
] | Train |
1,522 | 1 | Forming Neural Networks through Efficient and Adaptive Coevolution This article demonstrates the advantages of a cooperative, coevolutionary search in difficult control problems. The SANE system coevolves a population of neurons that cooperate to form a functioning neural network. In this process, neurons assume different but overlapping roles, resulting in a robust encoding of control behavior. SANE is shown to be more efficient, more adaptive, and maintain higher levels of diversity than the more common network-based population approaches. Further empirical studies illustrate the emergent neuron specializations and the different roles the neurons assume in the population. 1 Introduction Artificial evolution has become an increasingly popular method for forming control policies in difficult decision problems (Grefenstette, Ramsey, & Schultz, 1990; Moriarty & Miikkulainen, 1996a; Whitley, Dominic, Das, & Anderson, 1993). Such applications are very different from the function optimization tasks to which evolutionary algorithms (EA) have been tradition... | [
1288,
3093
] | Validation |
1,523 | 1 | Current State of the Art in Distributed Autonomous Mobile Robotics . As research progresses in distributed robotic systems, more and more aspects of multi-robot systems are being explored. This article surveys the current state of the art in distributed mobile robot systems. Our focus is principally on research that has been demonstrated in physical robot implementations. We have identi ed eight primary research topics within multi-robot systems | biological inspirations, communication, architectures, localization/mapping/exploration, object transport and manipulation, motion coordination, recon gurable robots, and learning { and discuss the current state of research in these areas. As we describe each research area, we identify some key open issues in multi-robot team research. We conclude by identifying several additional open research issues in distributed mobile robotic systems. 1 Introduction The eld of distributed robotics has its origins in the late-1980's, when several researchers began investigating issues in multiple mobile robot systems.... | [
346,
2620,
3094
] | Validation |
1,524 | 2 | Speech and Hand Transcribed Retrieval This paper describes the issues and preliminary work involved in the creation of an information retrieval system that will manage the retrieval from collections composed of both speech recognised and ordinary text documents. In previous work, it has been shown that because of recognition errors, ordinary documents are generally retrieved in preference to recognised ones. Means of correcting or eliminating the observed bias is the subject of this paper. Initial ideas and some preliminary results are presented. General Terms Measurement, Experimentation. Keywords Information Retrieval, Spoken Document Retrieval, Mixed Collections. 1. | [
20,
2907
] | Train |
1,525 | 2 | AdaBoost for Query-by-Example in Text This paper describes an implementation of query-by-example, or relevance feedback, for text. The implementation uses Google's search engine to perform a keyword query as requested by the user. If the user requires more information, the user may score documents in the result set as relevant or irrelevant. An implementation of the AdaBoost algorithm is then used choose words that separate the relevant documents from a random document set. Examples of negative document sets are also tested. An example query and refinements of the query is presented. The results seem promising. The system seems to propose new keywords that are sensible to the requested context. Many of the keywords prove useful in constructing new queries. However, refinement using exactly the new terms predicted by the system does not seem to return noticeably better or worse results. This may be the result of an inexact fit between the design of AdaBoost and the capabilities of Google as a back end engine. ... | [
302,
739,
1446,
2474
] | Train |
1,526 | 1 | Automated Robot Behavior Recognition Applied to Robotic Soccer Automated recognition of the behavior of robots is increasingly needed in a variety of tasks, as we develop more autonomous robots and general information processing agents. For example, in environments with multiple autonomous robots, a robot may need to make decisions based on the behavior of the other robots. As another interesting example, an intelligent narrator agent observing a robot will need to automatically identify the robot's behaviors. In this paper, we introduce a novel framework for using Hidden Markov Models (HMMs) to represent and recognize strategic behaviors of robotic agents. We first introduce and characterize the perceived signal in terms of behavioral-relevant state features. We then show how several HMMs capture different defined robot behaviors. Finally we present the HMM-based recognition algorithm which orchestrates and selects the appropriate HMMs in real time. We use the multi-robot robotic soccer domain as the substrate of our empirical validation, both in... | [
748,
3094
] | Validation |
1,527 | 2 | (LP)2, an Adaptive Algorithm for Information Extraction from Web-related Texts (LP) 2 is an algorithm for adaptive Information Extraction from Web-related text that induces symbolic rules by learning from a corpus tagged with SGML tags. Induction is performed by bottom-up generalisation of examples in a training corpus. Training is performed in two steps: initially a set of tagging rules is learned; then additional rules are induced to correct mistakes and imprecision in tagging. Shallow NLP is used to generalise rules beyond the flat word structure. Generalization allows a better coverage on unseen texts, as it limits data sparseness and overfitting in the training phase. In experiments on publicly available corpora the algorithm outperforms any other algorithm presented in literature and tested on the same corpora. Experiments also show a significant gain in using NLP in terms of (1) effectiveness (2) reduction of training time and (3) training corpus size. In this paper we present the machine learning algorithm for rule induction. In particular we focus on the NLP-based generalisation and the strategy for pruning both the search space and the final rule set. 1. | [
1623,
2068
] | Train |
1,528 | 1 | State-Based SHOSLIF for Indoor Visual Navigation In this paper, we investigate vision-based navigation using the Self-organizing Hierarchical Optimal Subspace Learning and Inference Framework (SHOSLIF) that incorporates states and a visual attention mechanism. The problem is formulated as an observation-driven Markov model (ODMM) which is realized through recursive partitioning regression. A stochastic recursive partition tree (SRPT), which maps an preprocessed current input raw image and the previous state into the current state and the next control signal, is used for efficient recursive partitioning regression. The SRPT learns incrementally: each learning sample is learned or rejected "onthe -fly". The proposed scheme has been successfully applied to indoor navigation. Keywords: Vision-based navigation, incremental learning, eigen-subspace method, content-based retrieval, observation-driven Markov model, nearest neighbor regression. 1 1 Introduction Much progress has been made in autonomous navigation of mobile robots, both ind... | [
530
] | Train |
1,529 | 2 | Learning Search Engine Specific Query Transformations for Question Answering We introduce a method for learning query transformations that improves the ability to retrieve answers to questions from an information retrieval system. During the training stage the method involves automatically learning phrase features for classifying questions into different types, automatically generating candidate query transformations from a training set of question/answer pairs, and automatically evaluating the candidate transforms on target information retrieval systems such as real-world general purpose search engines. At run time, questions are transformed into a set of queries, and re-ranking is performed on the documents retrieved. We present a prototype search engine, Tritus, that applies the method to web search engines. Blind evaluation on a set of real queries from a web search engine log shows that the method significantly outperforms the underlying web search engines as well as a commercial search engine specializing in question answering. Keywords Web search, quer... | [
1136,
1321,
2392,
2503,
2822
] | Train |
1,530 | 4 | Learning Gestures for Visually Mediated Interaction This paper reports initial research on supporting Visually Mediated Interaction (VMI) by developing person-specific and generic gesture models for the control of active cameras. We describe a time-delay variant of the Radial Basis Function (TDRBF) network and evaluate its performance on recognising simple pointing and waving hand gestures in image sequences. | [
1963
] | Test |
1,531 | 1 | A Cellular Neural Associative Array for Symbolic Vision . A system which combines the descriptional power of symbolic representations with the parallel and distributed processing model of cellular automata and the speed and robustness of connectionist symbol processing is described. Following a cellular automata based approach, the aim of the system is to transform initial symbolic descriptions of patterns to corresponding object level descriptions in order to identify patterns in complex or noisy scenes. A learning algorithm based on a hierarchical structural analysis is used to learn symbolic descriptions of objects. The underlying symbolic processing engine of the system is a neural based associative memory (AURA) which use enables the system to operate in high speed. In addition, the use of distributed representations allow both efficient inter-cellular communications and compact storage of rules. 1 Introduction One of the basic features of syntactic and structural pattern recognition systems is the use of the structure of the patterns... | [
472,
895
] | Test |
1,532 | 2 | Keyword Spices: A New Method for Building Domain-Specific Web Search Engines This paper presents a new method for building domain-specific web search engines. Previous methods eliminate irrelevant documents from the pages accessed using heuristics based on human knowledge about the domain in question. Accordingly, they are hard to build and can not be applied to other domains. The keyword spice method, in contrast, improves search performance by adding | [
759,
836,
1843,
2918
] | Train |
1,533 | 2 | Greedy strikes back: Improved Facility Location Algorithms A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well as transportation costs for distributing the commodities. We assume that the transportation costs form a metric. This problem is commonly referred to as the uncapacitated facility location (UFL) problem. Applications to bank account location and clustering, as well as many related pieces of work, are discussed by Cornuejols, Nemhauser and Wolsey [?]. Recently, the first constant factor approximation algorithm for this problem was obtained by Shmoys, Tardos and Aardal [?]. We show that a simple greedy heuristic combined with the algorithm by Shmoys, Tardos and Aardal, can be used to obtain an approximation guarantee of 2.408. We discuss a few variants of the problem, demonstrating better approximation factors for restricted versions of the... | [] | Validation |
1,534 | 0 | Transactions and Electronic Commerce . Electronic Commerce is a rapidly growing area that is gaining more and more importance not only in the interrelation of businesses (business--to--business Electronic Commerce) but also in the everyday consumption of individuals performed via the Internet (business--to-- customer Electronic Commerce). Since Electronic Commerce is a very interdisciplinary area, it has a lot of impacts to various communities. The goal of this paper is to identify and to summarize the impact of Electronic Commerce from a database transaction point of view and to highlight open problems in transaction management arising in Electronic Commerce applications by reflecting the discussions of the working group "Transactions and Electronic Commerce" held at the TDD Workshop. 1 Motivation The exchange of electronic data between companies has been an important issue in business interactions for quite a while. However, the recent proliferation of the Internet together with the rapid propagation of pers... | [
285,
1343,
2347
] | Train |
1,535 | 1 | Content-Based Video Indexing Of TV Broadcast News Using Hidden Markov Models This paper presents a new approach to content-based video indexing using Hidden Markov Models (HMMs). In this approach one feature vector is calculated for each image of the video sequence. These feature vectors are modeled and classified using HMMs. This approach has many advantages compared to other video indexing approaches. The system has automatic learning capabilities. It is trained by presenting manually indexed video sequences. To improve the system we use a video model, that allows the classification of complex video sequences. The presented approach works three times faster than real-time. We tested our system on TV broadcast news. The rate of 97.3 % correctly classified frames shows the efficiency of our system. 1. INTRODUCTION The increasing amount of digital video in multimedia databases results in a demand for techniques for automatic content-based access to video data. In the last years there have been many different approaches to content-based video indexing. A rough ... | [
17,
894
] | Train |
1,536 | 3 | Cost-based Query Scrambling for Initial Delays Remote data access from disparate sources across a wide-area network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack of knowledge about the load and potential delays at remote sites. Traditional, static, query processing approaches break down in this environment because they are unable to adapt in response to unexpected delays. Query scrambling has been proposed to address this problem. Scrambling modifies query execution plans on-the-fly when delays are encountered during runtime. In its original formulation, scrambling was based on simple heuristics, which although providing good performance in many cases, were also shown to be susceptible to problems resulting from bad scrambling decisions. In this paper we address these shortcomings by investigating ways to exploit query optimization technology to aid in making intelligent scrambling choices. We propose three different approaches to using query optimization for scramblin... | [
376,
1073,
1184,
2022,
2205,
2219
] | Train |
1,537 | 3 | Consistent Query Answers in Inconsistent Databases In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired versions of the database. A method for computing consistent answers is given and its soundness and completeness (for some classes of constraints and queries) proved. The method is based on an iterative procedure whose termination for several classes of constraints is proved as well. 1 Introduction Integrity constraints capture an important normative aspect of every database application. However, it is often the case that their satisfaction cannot be guaranteed, allowing for the existence of inconsistent database instances. In that case, it is important to know which query answers are consistent with the integrity constraints and which are not. In this paper, we provide a logical characterization of consistent query answers in relational databases that may... | [
61,
876
] | Test |
1,538 | 0 | Control States and Motivated Agency One of the challenges faced by researchers in the behaviour modelling of life-like characters is the need to develop a systematic framework in which to ask questions about the types of internal state life-like characters might possess, and how those different states interact. We propose a solution based on a cognitively inspired multi-layered agent architecture (composed of reactive, deliberative and meta-management layers), and a recursive "design-based" research methodology -- wherein each new design gradually increases our explanatory power and allows us to account for more and more of the phenomena of interest. By describing a variety of "broad but shallow" complete agents at the information-level, and showing how these designs realise mental states and processes, we aim to provide a rich and deep explanatory framework from which to explore motivated autonomous agency. Early experiments have concentrated on: (a) the requirements of goal-processing; (b) the emergence of ... | [
1965,
2536
] | Train |
1,539 | 0 | A Component-Based Approach for Integrating Mobile Agents Into the Existing Web Infrastructure Mobile agents provide a new abstraction for deploying functionality over the existing internet infrastructure. During the last two years, we have been working on a project that tries to overcome some of the limitations found in terms of programmability and usability of the mobile agent paradigm in real applications. In the M&M framework there are no agent platforms. Instead applications become agent-enabled by using simple JavaBeans components. In this paper we present an architecture that allows currently available web servers to become capable of sending and receiving agents in an easy way. By using this approach, existing web infrastructure can be maintained, while gaining a whole new potential by being able to make use of agent technology. Our approach involves wrapping the components inside a Java servlet that can be included in any web server supporting the Servlet Specification. This servlet enables the servers to receive and send agents that can query local information, and also enables the agents to behave as servlets themselves. | [
2128,
2224
] | Train |
1,540 | 4 | The influence of design techniques on user interfaces: the DigiStrips experiment for air traffic control Graphical user interfaces have limitations in terms of the information bandwidth they provide between users and systems. This can impede the redesign of systems previously based on more physical media: information may be less appropriately displayed, and shared cognition between users can be reduced. However, in parallel with research on new user interaction techniques, a more systematic use of visual design techniques can relieve those limitations. This article explores some of those techniques and how they can be applied, through a design experiment. Virtuosi and DigiStrips are two user interface prototypes developed within a research program on air traffic control workstations, which make use of touch screens and served as a basis for research on the use of graphical design techniques in user interfaces. This paper describes the lessons learnt in that experience and argues that techniques such as animation, font design, careful use of graphical design techniques can augment the p... | [
929
] | Test |
1,541 | 3 | A prediction system for multimedia pre-fetching in Internet The rapid development of Interact has resulted in more and more multimedia in Web content. However, due to the limitation in the bandwidth and huge size of the multimedia data, users always suffer from long time waiting. On the other hand, if we can predict the web object or page that the user most likely will view next while the user is viewing the current page, and pre-fetch the content, then the perceived network latency can be significantly reduced. In this paper, we present an n-gram based model to utilize path profiles of users from very large web log to predict the users ' future requests. Our model is based on a simple extension of existing point-based models for such predictions, but our results show that by sacrificing the applicability somewhat one can gain a great deal in prediction precision. Also we present an efficient method to compress the prediction model size so that it can be fitted into the main memory. Our result can potentially be applied to a wide range of applications on the web, including pre-fetehing, enhancement of recommendation systems as well as web caching policies. The experiments based on three realistic web logs have proved the effectiveness of the proposed scheme. | [
302
] | Train |
1,542 | 3 | Systematic Change Management in Dimensional Data Warehousing With the widespread and increasing use of data warehousing in industry, the design of effective data warehouses and their maintenance has become a focus of attention. Independently of this, the area of temporal databases has been an active area of research for well beyond a decade. This article identifies shortcomings of so-called star schemas, which are widely used in industrial warehousing, in their ability to handle change and subsequently studies the application of temporal techniques for solving these shortcomings. Star schemas represent a new approach to database design and have gained widespread popularity in data warehousing, but while they have many attractive properties, star schemas do not contend well with so-called slowly changing dimensions and with state-oriented data. We study the use of so-called temporal star schemas that may provide a solution to the identified problems while not fundamentally changing the database design approach. More specifically, we study the rel... | [] | Train |
1,543 | 2 | Fact or fiction: Content classification for digital libraries The World-Wide Web (WWW) is a vast repository of information, much of which is valuable but very often hidden to the user. The anarchic nature of the WWW presents unique challenges when it comes to information extraction and categorization. We view the WWW as a valuable resource for the gathering of information for Digital Libraries. In this paper we will describe the process of extracting and classifying information from the WWW for the purpose of integrating it into digital libraries. Our eorts focus on ways to automatically classify news articles according to whether they present opinions or reported facts. We describe and evaluate a system in development that automatically classies and recommends Web news articles from sports and politics domains. 1 | [
413,
759,
836,
2918
] | Train |
1,544 | 5 | Learned Models for Continuous Planning We are interested in the nature of activity -- structured behavior of nontrivial duration -- in intelligent agents. We believe that the development of activity is a continual process in which simpler activities are composed, via planning, to form more sophisticated ones in a hierarchical fashion. The success or failure of a planner depends on its models of the environment, and its ability to implement its plans in the world. We describe an approach to generating dynamical models of activity from real-world experiences and explain how they can be applied towards planning in a continuous state space. 1 Introduction We are interested in the problem of how activity emerges in an intelligent agent. We believe that activity plays a critical role in the development of many high-level cognitive structures: classes, concepts, and language, to name a few. Thus, it is our goal to derive and implement a theory of the development of activity in intelligent agents and implement it using the Pioneer... | [
2109
] | Validation |
1,545 | 2 | Interactive Query and Search in Semistructured Databases Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web users. Further, proposed query approaches do not take advantage of the interactivity of typical Web sessions---users are proficient at iteratively refining their Web explorations. In this paper we propose a new model for interactively querying and searching semistructured databases. Users can begin with a simple keyword search, dynamically browse the structure of the result, and then submit further refining queries. Enabling this model exposes new requirements of a semistructured database that are not apparent under traditional database uses. We demonstrate the importance of efficient keyword search, structural summaries of query results, and support for inverse pointers. We also describe some preliminary solutions to these technical issues. 1 Introduction Querying the Web has understandably gathered much att... | [
1422,
2439
] | Train |
1,546 | 2 | Adaptive Information Extraction and Sublanguage Analysis Introduction 1 Information extraction (IE) has made significant progress in the last decade. We have developed practical, efficient approaches to IE which have yielded modest levels of performance on general texts and quite good performance on restricted, `semi-structured' texts. More notably, over the last few years there has been a blossoming of work in adaptive IE --- the topic of this and other recent workshops --- IE systems which can be rapidly and automatically (or semi-automatically) moved to new extraction tasks. To date, these developments have been relatively little influenced by linguistic studies of the texts. In fact, the trend has been towards less linguistic analysis. Some early IE systems used full parsing and in a few cases relatively deep semantic analysis. Because of limitations of full parsing methods (particularly a decade ago) this gave way to a common methodology based on limited parsing and simple pattern matching. Adaptive IE systems have in | [
873,
2443
] | Validation |
1,547 | 2 | Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web . This paper focuses on two machine learning abstractions springing from ecological models: (i) evolutionary adaptation by local selection, and (ii) selective query expansion by internalization of environmental signals. We first outline a number of experiments pointing to the feasibility and performance of these methods on a general class of graph environments. We then describe how these methods have been applied to the intelligent retrieval of information distributed across networked environments. In particular, the paper discusses a novel distributed evolutionary algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders search on-line for information relevant to the user, by traversing hyperlinks in an autonomous and intelligent fashion. They can adapt to the spatial and temporal regularities of their local context. Our results suggest that InfoSpiders could complement current search engine technology by starting up where search engines stop... | [
2,
116,
124,
507,
553,
848,
1512,
1676,
2459,
2471,
2705,
3170
] | Train |
1,548 | 0 | A Behavioral Interface to Simulate Agent-Object Interactions in Real Time This paper shows a new approach to model and control interactive objects for simulations with virtual human agents when real time interactivity is essential. A general conceptualization is made to model objects with behaviors that can provide: information about their functionality, changes in appearance from parameterized deformations, and a complete plan for each possible interaction with a virtual human. Such behaviors are described with simple primitive commands, following the actual trend of many standard scene graph file formats that connects language with movements and events to create interactive animations. In our case, special attention is given to correctly interpret object behaviors in parallel: situation that arrives when many human agents interact at the same time with one same object. Keywords: Virtual Humans, Virtual Environments, Object Modeling, Object Interaction, Script Languages, Parameterized Deformations. 1 Introduction The necessity to have interactive obje... | [
772,
3014
] | Train |
1,549 | 3 | Charm: An I/O-Driven Execution Strategy for High-Performance Transaction Processing The performance of a transaction processing system whose database is not completely memory-resident critically depends on the amount of physical disk I/O required. This paper describes a high-performance transaction processing system called Charm, which aims to reducing the concurrency control overhead by minimizing the performance impacts of disk I/O on lock contention delay. In existing transaction processing systems, a transaction blocked by lock contention is forced to wait while the transaction currently holding the contended lock is performing physical disk I/O. A substantial portion of a transaction's lock contention delay is thus attributed to disk I/Os performed by other transactions. Charm implements a two-stage transaction execution (TSTE) strategy, which makes sure that all the data pages that a transaction needs be memory-resident before it is allowed to lock database pages. Moreover, Charm supports an optimistic version of the TSTE strategy (OTSTE), which furth... | [
432
] | Test |
1,550 | 3 | Query Processing over Device Networks In the next decade, millions of sensors and small-scale mobile devices will integrate processors, memory, and communication capabilities. Networks of devices will be widely deployed for monitoring applications. In these new applications, users need to query very large collections of devices in an ad hoc manner. Most existing systems rely on a centralized system for collecting device data. These systems lack flexibility because data is extracted in a predefined way. Also, they do not scale to a large number of devices because large volumes of raw data are transferred. In our new concept of a device database system, distributed query execution techniques are applied to leverage the computing capabilities of devices, and to reduce communication. In this article, we define an abstraction that allows us to represent a device network as a database and we describe how distributed query processing techniques are applied in this new context. Praveen Seshradi is currently on leave at Micr... | [
2377,
2818
] | Train |
1,551 | 0 | Specifying Rational Agents with Statecharts and Utility Functions Abstract. To aid the development of the robotic soccer simulation league team RoboLog-2000, a method for the specification of multi-agent teams by statecharts has been introduced. The results in the last years competitions showed that though the team was competitive, it did not behave adaptive in unknown situations. The design of adaptive agents with this method is possible, but not in a straightforward manner. The purpose of this paper is to extend the approach by a more adaptive action selection mechanism and to facilitate a more explicit representation of goals of an agent. 1 | [
403
] | Test |
1,552 | 0 | Semantics for an Agent Communication Language . We address the issue of semantics for an agent communication language. In particular, the semantics of Knowledge Query Manipulation Language (KQML) is investigated. KQML is a language and protocol to support communication between (intelligent) software agents. Based on ideas from speech act theory, we present a semantic description for KQML that associates "cognitive" states of the agent with the use of the language's primitives (performatives). We have used this approach to describe the semantics for the whole set of reserved KQML performatives. Our research offers a method for a speech act theory-based semantic description of a language of communication acts. Languages of communication acts address the issue of communication between software applications at a level of abstraction that could prove particularly useful to the emerging software agents paradigm of software design and development. 1 Introduction This research is concerned with communication between software agents [13]... | [
70,
642,
789,
1317,
1818,
2226,
2353,
2527,
2629,
2697,
3104
] | Test |
1,553 | 0 | Self-Organization in Multiagent Systems: From Agent Interaction to Agent Organization In this paper we suggest a new sociological concept to the study of (self-) organization in multiagent systems. First, we discuss concepts of (self-) organization typically used in DAI. From a sociological point of view all these concepts are missing the special quality of organizations as self-organizing social entities. Therefore we present a concept of organization based on the habitus-field theory of Pierre Bourdieu. | [
170,
245,
984
] | Validation |
1,554 | 1 | A SNoW-Based Face Detector A novel learning approach for human face detection using a network of linear units is presented. The SNoW learning architecture is a sparse network of linear functions over a pre-defined or incrementally learned feature space and is specifically tailored for learning in the presence of a very large number of features. A wide range of face images in different poses, with different expressions and under different lighting conditions are used as a training set to capture the variations of human faces. Experimental results on commonly used benchmark data sets of a wide range of face images show that the SNoW-based approach outperforms methods that use neural networks, Bayesian methods, support vector machines and others. Furthermore, learning and evaluation using the SNoW-based method are significantly more efficient than with other methods. | [
953,
1890,
2860,
2898
] | Test |
1,555 | 2 | Dynamic Modeling and Learning User Profile In Personalized News Agent Finding relevant information effectively on the Internet is a challenging task. Although the information is widely available, exploring Web sites and finding information relevant to a user's interest can be a time-consuming and tedious task. As a result, many software agents have been employed to perform autonomous information gathering and filtering on behalf of the user. One of the critical issues in such an agent is the capability of the agent to model its users and adapt itself over time to changing user interests. In this thesis, a novel scheme is proposed to learn user profile. The proposed scheme is designed to handle multiple domains of long-term and short-term users' interests simultaneously, which are learned through positive and negative user feedback. A 3-descriptor interest category representation approach is developed to achieve this objective. Using such a representation, the learning algorithm is derived by imitating human personal assistants doing the same task. Based on experimental evaluation, the scheme performs very well and adapts quickly to significant changes in user interest. | [
1857
] | Train |
1,556 | 4 | Learning Visual Models of Social Engagement We introduce a face detector for wearable computers that exploits constraints in face scale and orientation imposed by the proximity of participants in near social interactions. Using this method we describe a wearable system that perceives "social engagement," i.e., when the wearer begins to interact with other individuals. Our experimental system proved > 90% accurate when tested on wearable video data captured at a professional conference. Over 300 individuals were captured during social engagement, and the data was separated into independent training and test sets. A metric for balancing the performance of face detection, localization, and recognition in the context of a wearable interface is discussed. Recognizing social engagement with a user's wearable computer provides context data that can be useful in determining when the user is interruptible. In addition, social engagement detection may be incorporated into a user interface to improve the quality of mobile face recognition software. For example, the user may cue the face recognition system in a socially graceful way by turning slightly away and then toward a speaker when conditions for recognition are favorable. 1 | [
664,
727,
1110,
1757,
2420
] | Train |
1,557 | 4 | Detection and Tracking of Facial Features in Video Sequences . This work presents a real time system for detection and tracking of facial features in video sequences. Such system may be used in visual communication applications, such as teleconferencing, virtual reality, intelligent interfaces, humanmachine interaction, surveillance, etc. We have used a statistical skin-color model to segment face-candidate regions in the image. The presence or absence of a face in each region is verified by means of an eye detector, based on an efficient template matching scheme . Once a face is detected, the pupils, nostrils and lip corners are located and these facial features are tracked in the image sequence, performing real time processing. 1 | [
2688
] | Train |
1,558 | 2 | Extending a Multi-Agent System for Genomic Annotation . The explosive growth in genomic (and soon, expression and proteomic) data, exemplified by the Human Genome Project, is a fertile domain for the application of multi-agent information gathering technologies. Furthermore, hundreds of smaller-profile, yet still economically important organisms are being studied that require the efficient and inexpensive automated analysis tools that multiagent approaches can provide. In this paper we give a progress report on the use of the DECAF multi-agent toolkit to build reusable information gathering systems for bioinformatics. We will briefly summarize why bioinformatics is a classic application for information gathering, how DECAF supports it, and recent extensions underway to support new analysis paths for genomic information. 1 | [
2853
] | Train |
1,559 | 2 | Report on the TREC-8 Experiment: Searching on the Web and in Distributed Collections this paper verifies whether or not hyperlinks improve retrieval effectiveness. In the second chapter, we describe experiments on the ad hoc track. In this case, we acknowledge that currently it is becoming more and more difficult to store and manage the growing document collections within a single computer. Recent advances in network technology do however allow us to disseminate information sources by partitioning a single huge corpus (or distributing heterogeneous collections) over a local-area network (Intranet). Most retrieval mechanisms currently proposed however are based on conventional IR models [Salton 89], and where a centralized document collection is assumed. | [
370
] | Test |
1,560 | 5 | Reasoning with Examples: Propositional Formulae and Database Dependencies For humans, looking at how concrete examples behave is an intuitive way of deriving conclusions. The drawback with this method is that it does not necessarily give the correct results. However, under certain conditions example-based deduction can be used to obtain a correct and complete inference procedure. This is the case for Boolean formulae (reasoning with models) and for certain types of database integrity constraints (the use of Armstrong relations). We show that these approaches are closely related, and use the relationship to prove new results about the existence and sizes of Armstrong relations for Boolean dependencies. Furthermore, we exhibit close relations between the questions of finding keys in relational databases and that of finding abductive explanations. Further applications of the correspondence between these two approaches are also discussed. 1 Introduction One of the major tasks in database systems as well as artificial intelligence systems is to express some know... | [
2485,
3105
] | Train |
1,561 | 0 | Task Assignment in Multiagent Systems based on Vickrey-type Auctioning and Leveled Commitment Contracting . A key problem addressed in the area of multiagent systems is the automated assignment of multiple tasks to executing agents. The automation of multiagent task assignment requires that the individual agents (i) use a common protocol that prescribes how they have to interact in order to come to an agreement and (ii) x their nal agreement in a contract that species the commitments resulting from the assignment on which they agreed. The work reported in this paper is part of a broader research eort aiming at the design and analysis of approaches to automated multiagent task assignment that combine auction protocols and leveled commitment contracts. The primary advantage of such approaches is that they are applicable in a broad range of realistic scenarios in which knowledge-intensive negotiation among agents is not feasible and in which unforeseeable future environmental changes may require agents to breach their contracts. Examples of standard auction protocols are the... | [
827,
1418,
2170,
2568,
2602
] | Train |
1,562 | 4 | A Novel User Interface for Group Collaboration Flexible user interfaces that can be customized to meet the needs of the task at hand are particularly important for real-time group collaboration. This paper presents the user interface of the DISCIPLE (DIstributed System for Collaborative Information Processing and LEarning) system for synchronous groupware along with the multimodal human-computer interface enhancement. DISCIPLE supports sharing of JavaBeans-compliant components [17], i.e., beans and applets, which at runtime get imported into the shared workspace and can be interconnected into more complex components. As a result, importing various components allows user tailoring of the human-computer interface. We present a software architecture for customization of both grouplevel and application-level interfaces. The applicationlevel interface includes a management system for sharing multiple modalities across concurrent applications. This multimodal management system is loadable on demand yet strongly embedded in the DISCIPLE f... | [
1817,
2270,
2493
] | Test |
1,563 | 0 | Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations Combinatorial auctions, i.e. auctions where bidders can bid on com-binations of items, tend to lead to more e cient allocations than tra-ditional auctions in multi-item auctions where the agents ' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, existing approaches for tackling this problem are reviewed: exhaustive enumeration, dynamic programming, approximation algorithms, and restricting the allow-able combinations. Then we present our search algorithm for optimal winner determination. Experiments are shown on several bid distri-butions. The algorithm allows combinatorial auctions to scale up to signi cantly larger numbers of items and bids than prior approaches to optimal winner determination by capitalizing on the fact that the space of bids is necessarily sparsely populated in practice. The algo-rithm does this by provably su cient selective generation of children in the search tree, by using a secondary search for fast child genera-tion, by heuristics that are accurate and optimized for speed, and by four methods for preprocessing the search space. Patent pending. A highly optimized implementation of the algorithm is available for licensing both for research and commercial purposes. Please contact the author. 1 1 | [
2646,
2707
] | Train |
1,564 | 1 | Machine Learning in Automated Text Categorisation The automated categorisation (or classification) of texts into topical categories has a long history, dating back at least to the early ’60s. Until the late ’80s, the most effective approach to the problem seemed to be that of manually building automatic classifiers by means of knowledgeengineering techniques, i.e. manually defining a set of rules encoding expert knowledge on how to classify documents under a given set of categories. In the ’90s, with the booming production and availability of on-line documents, automated text categorisation has witnessed an increased and renewed interest, prompted by which the machine learning paradigm to automatic classifier construction has emerged and definitely superseded the knowledge-engineering approach. Within the machine learning paradigm, a general inductive process (called the learner) automatically builds a classifier (also called the rule, or the hypothesis) by “learning”, from a set of previously classified documents, the characteristics of one or more categories. The advantages of this approach are a very good effectiveness, a considerable savings in terms of expert manpower, and domain independence. In this survey we look at the main approaches that have been taken towards automatic text categorisation within the general machine learning paradigm. Issues pertaining to document indexing, classifier construction, and classifier evaluation, will be discussed in detail. A final section will be devoted to the techniques that have specifically been devised for an emerging application such as the automatic classification of Web pages into “Yahoo!-like ” hierarchically structured sets of categories. Categories and Subject Descriptors: H.3.1 [Information storage and retrieval]: Content analysis and indexing—Indexing methods; H.3.3 [Information storage and retrieval]: Information search and retrieval—Information filtering; H.3.3 [Information storage and retrieval]: Systems and software—Performance evaluation (efficiency and effectiveness); I.2.3 [Artificial | [
1215,
1440
] | Test |
1,565 | 1 | Optimal Camera Parameter Selection for State Estimation with Applications in Object Recognition In this paper we introduce a formalism for optimal camera parameter selection for iterative state estimation. We consider a framework based on Shannon 's information theory and select the camera parameters that maximize the mutual information, i.e. the information that the captured image conveys about the true state of the system. The technique explicitly takes into account the a priori probability governing the computation of the mutual information. Thus, a sequential decision process can be formed by treating the a posteriori probability at the current time step in the decision process as the a priori probability for the next time step. The convergence of the decision process can be proven. | [
793
] | Test |
1,566 | 3 | Control and Datatypes using the View Formalism . We herein deal with mixed specification formalisms, i.e. formalisms with both a static (data types) and a dynamic (behaviour) part. Our formalism is based on symbolic transition systems (STS) [9], that allow one to specify systems at an abstract level and to avoid state explosion. STS are a kind of guarded finite state/transition diagrams where states and transitions are labelled with open terms. Both dynamic and static parts of objects are specified, in a unifying approach, as formal structures that we call views. These components interpretation structures use STS, and we show how these may be derived from their view structures. The system is structured by means of collections of objects (with identities) . A temporal logic is used to glue the components altogether and expresses a generalized form of synchronous product [1]. We then show how a view structure and its interpretation structure may be obtained. The formalism is explained using a simplified phone service example. Keywor... | [] | Train |
1,567 | 2 | Power to the people: End-user building of digital library collections Naturally, digital library systems focus principally on the reader: the consumer of the material that constitutes the library. In contrast, this paper describes an interface that makes it easy for people to build their own library collections. Collections may be built and served locally from the user's own web server, or (given appropriate permissions) remotely on a shared digital library host. End users can easily build new collections styled after existing ones from material on the Web or from their local files---or both, and collections can be updated and new ones brought on-line at any time. The interface, which is intended for non-professional end users, is modeled after widely used commercial software installation packages. Lest one quail at the prospect of end users building their own collections on a shared system, we also describe an interface for the administrative user who is responsible for maintaining a digital library installation. | [
507,
1746,
2471
] | Test |
1,568 | 5 | Complexity and Expressive Power of Logic Programming . This paper surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. 1 Computing Science Department, Uppsala University, Box 311, S 751 05 Uppsala, Sweden. Email: dantsin@pdmi.ras.ru 2 Institut und Ludwig Wittgenstein Labor fur Informationssysteme, Technische Universitat Wien, Treitlstraße 3, A-1040 Wien, Austria. E-mail: eiter@kr.tuwien.ac.at 3 Institut und Ludwig Wittgenstein Labor fur Informationssysteme, Technische Universitat ... | [
1150,
1907,
2144,
2772
] | Train |
1,569 | 1 | Relational Learning Techniques for Natural Language Information Extraction The recent growth of online information available in the form of natural language documents creates a greater need for computing systems with the ability to process those documents to simplify access to the information. One type of processing appropriate for many tasks is information extraction, a type of text skimming that retrieves specific types of information from text. Although information extraction systems have existed for two decades, these systems have generally been built by hand and contain domain specific information, making them difficult to port to other domains. A few researchers have begun to apply machine learning to information extraction tasks, but most of this work has involved applying learning to pieces of a much larger system. This paper presents a novel rule representation specific to natural language and a learning system, Rapier, which learns information extraction rules. Rapier takes pairs of documents and filled templates indicating the information to be ext... | [
786,
1171,
1287,
3098
] | Test |
1,570 | 1 | The Global Dimensionality of Face Space Low-dimensional representations of sensory signals are key to solving many of the computational problems encountered in high-level vision. Principal Component Analysis (PCA) has been used in the past to derive such compact representations for the object class of human faces. Here, with an interpretation of PCA as a probabilistic model, we employ two objective criteria to study its generalization properties in the context of large frontal-pose face databases. We find that the eigenfaces, the eigenspectrum, and the generalization depend strongly on the ensemble composition and size, with statistics for populations as large as 5500, still not stationary. Further, the assumption of mirror symmetry of the ensemble improves the quality of the results substantially in the low-statistics regime, and is also essential in the high-statistics regime. We employ a perceptual criterion and argue that, even with large statistics, the dimensionality of the PCA subspace necessary for adequate represent... | [
2724
] | Validation |
1,571 | 1 | Hierarchical Memory-Based Reinforcement Learning A key challenge for reinforcement learning is scaling up to large partially observable domains. In this paper, we show how a hierarchy of behaviors can be used to create and select among variable length short-term memories appropriate for a task. At higher levels in the hierarchy, the agent abstracts over lower-level details and looks back over a variable number of high-level decisions in time. We formalize this idea in a framework called Hierarchical Sux Memory (HSM). HSM uses a memory-based SMDP learning method to rapidly propagate delayed reward across long decision sequences. We describe a detailed experimental study comparing memory vs. hierarchy using the HSM framework on a realistic corridor navigation task. 1 Introduction Reinforcement learning encompasses a class of machine learning problems in which an agent learns from experience as it interacts with its environment. One fundamental challenge faced by reinforcement learning agents in real-world problems is that ... | [
833,
1765,
1788
] | Validation |
1,572 | 2 | Using Information Extraction Rules for Extending Domain Ontologies - nt, we lay special emphasis on considerations and methods which are necessary to realize such a scenario in industrial practice. In each industrial environment, besides the questions of smooth introduction of new technology regarding human factors and organizational processes, and besides the question of modeling tools and method support for knowledge (in particular ontologies for structuring OMs or parts of OMs) acquisition, at least two other factors are of utmost importance: One is the predominance of informal, i.e. essentially textbased, representations of knowledge. This is not only just a matter of fact, but really useful, because the cost of formalization is often not in the right relation to the potential benefits such that many informal parts of the scenario are economically reasonable [5]. One implication is that also methods for building formal models must be affordable. The other is the fact that ontologies are not a stand-alone component built once and then remaining unt | [
318,
1741
] | Train |
1,573 | 5 | The CMUnited-98 Champion Small-Robot Team Abstract. In this chapter, we present the main research contributions of our champion CMUnited-98 small robot team. The team is a multiagent robotic system with global perception, and distributed cognition and action. We describe the main features of the hardware design of the physical robots, including di erential drive, robust mechanical structure, and a kicking device. We brie y review the CMUnited-98 global vision processing algorithm, which is the same as the one used by the previous champion CMUnited-97 team. We introduce our new robot motion algorithm which reactively generates motion control to account for the target point, the desired robot orientation, and obstacle avoidance. Our robots exhibit successful collision-free motion in the highly dynamic robotic soccer environment. At the strategic and decision-making level, we present the role-based behaviors of the CMUnited-98 robotic agents. Team collaboration is remarkably achieved through a new algorithm that allows for team agents to anticipate possible collaboration opportunities. Robots position themselves strategically in open positions that increase passing opportunities. The chapter terminates with a summary of the results of the RoboCup-98 games in which the CMUnited-98 small robot team scored a total of 25 goals and su ered 6 goals in the 5 games that it played. 1 | [
287,
962,
1630
] | Test |
1,574 | 0 | Learning Network Designs for Asynchronous Teams . An asynchronous team (A-Team) is a network of agents (workers) and memories (repositories for the results of work). It is possible to design A-Teams to be effective in solving difficult computational problems. The main design issues are: "What structure should the network have?" and "What should be the complement of agents?" In the past, the structure-issue was resolved by intuition and experiment. This paper describes a procedure by which good structures can be learned from experience. The procedure is based on the use of regular expressions for encoding the capabilities of networks. 1 Introduction An Asynchronous Team (A-Team) is a problem solving architecture consisting of collections of agents and memories connected into a strongly cyclic directed network. The memories form the nodes of the network, the agents form the arcs. Figure 1 below shows such a network. Each memory holds a population of trial solutions. The solutions are not necessarily solutions to the overall problem t... | [
1985,
2841
] | Test |
1,575 | 3 | Relational Transducers for Electronic Commerce Electronic commerce is emerging as one of the major Websupported applications requiring database support. We introduce and study high-level declarative specifications of business models, using an approach in the spirit of active databases. More precisely, business models are specified as relational transducers that map sequences of input relations into sequences of output relations. The semantically meaningful trace of an input-output exchange is kept as a sequence of log relations. We consider problems motivated by electronic commerce applications, such as log validation, verifying temporal properties of transducers, and comparing two relational transducers. Positive results are obtained for a restricted class of relational transducers called Spocus transducers (for semi-positive outputs and cumulative state). We argue that despite the restrictions, these capture a wide range of practically significant business models. 1 Introduction Electronic commerce is emerging as a major Web-s... | [
886,
1318,
1771,
2120
] | Train |
1,576 | 3 | Graph Structured Views and Their Incremental Maintenance We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identifiers of other records. The data could represent traditional objects (with methods, attributes, and a class hierarchy), but it could also represent a lower level data structure. We define simple views and materialized views for such graph structured data, analyzing options for representing record identity and references in the view. We develop incremental maintenance algorithms for these views. 1 Introduction Relational views are useful for controlling data access, specifying contents of caches (or remote copies), and other data management tasks. In this paper we study how to extend this view concept and the associated maintenance algorithms to what we call a graph structured database (GSDB). Informally, a GSDB is a collection of "objects" that may contain "pointers" (graph edges) to other objects. A GSDB can represent Web pages, Lotus Notes documents, o... | [
1373,
1667
] | Train |
1,577 | 2 | Boosting for Document Routing RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe the algorithm and present initial experimental results on applying it to the document routing problem. The first set of results applies RankBoost to a text representation produced using modern term weighting methods. Performance of RankBoost is somewhat inferior to that of a state-of-the-art routing algorithm which is, however, more complex and less theoretically justified than RankBoost. RankBoost achieves comparable performance to the state-of-the-art algorithm when combined with feature or example selection heuristics. Our second set of results examines the behavior of RankBoost when it has to learn not only a ranking function but also all aspects of term weighting from raw data. Performance is usually, though not always, less good here, but the term weighting functions implicit in the resulting ranking fun... | [
147,
186,
739,
1446,
2475,
2847,
3004
] | Train |
1,578 | 4 | sView - Architecture Overview and System Description This report presents an architecture overview and a system description of the sView system. The system provides developers, service providers, and users of electronic services with an open and extendible service infrastructure that allows far-reaching user control. This is accomplished by collecting the services of an individual user in a virtual briefcase. Services come in the form of self-contained service components (i.e. including both logic and data), and the briefcase is mobile to allow it to follow as the user moves between different hosts and terminals. A specification of how to build such service components and the infrastructure for handling briefcases is presented. A reference implementation of the specification as well as extensions in the form of service components is also described. The purpose of the report is to serve as a technical reference for developers of sView services and software infrastructure that builds on sView technology. Keywords. Electronic services, personal service environments, user interfaces, mobility, personalization, service collaboration, component-based software engineering. May 2001 SICS Technical Report T2001/06 ISSN 1100-3154 ISRN: SICS-T--2001/06-SE 2 Bylund 1. | [
1035
] | Validation |
1,579 | 2 | Toward Optimal Active Learning through Sampling Estimation of Error Reduction This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce version space size. These other methods are popular because for many learning models, closed form calculation of the expected future error is intractable. Our approach is made feasible by taking a sampling approach to estimating the expected reduction in error due to the labeling of a query. In experimental results on two real-world data sets we reach high accuracy very quickly, sometimes with four times fewer labeled examples than competing methods. 1. | [
1601,
2749,
2765
] | Validation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.