node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
2,580 | 2 | Document Categorization and Query Generation on the World Wide Web Using WebACE We present WebACE, an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an unsupervised categorization of a set of documents, combined with a process for generating new queries that is used to search for new related documents and for filtering the resulting documents to extract the ones most closely related to the starting set. The document categories are not given a priori. We present the overall architecture and describe two novel algorithms which provide significant improvement over Hierarchical Agglomeration Clustering and AutoClass algorithms and form the basis for the query generation and search component of the agent. We report on the results of our experiments comparing these new algorithms with more traditional clustering algorithms and we show that our algorithms are fast and scalable. y Authors are listed alphabetically. 1 Introduction The World Wide Web is a vast resource of information and services t... | [
630,
1361,
1405,
2179,
2259,
2324,
2780,
2839
] | Train |
2,581 | 1 | Improving Performance Of Case-Based Classification Using Context-Based Relevance Classification involves associating instances with particular classes by maximizing intra-class similarities and minimizing inter-class similarities. Thus, the way similarity among instances is measured is crucial for the success of the system. In case-based reasoning, it is assumed that similar problems have similar solutions. The case-based approach to classification is founded on retrieving cases from the case base that are similar to a given problem, and associating the problem with the class containing the most similar cases. Similarity-based retrieval tools can advantageously be used in building flexible retrieval and classification systems. Case-based classification uses previously classified instances to label unknown instances with proper classes. Classification accuracy is affected by the retrieval process -- the more relevant the instances used for classification, the greater the accuracy. The paper presents a novel approach to case-based classification. The algorithm is bas... | [
623,
966,
1284,
1438,
2878
] | Validation |
2,582 | 3 | Query Formulation from High-level Concepts for Relational Databases A new query formulation system based on a semantic graph model is presented. The graph provides a semantic model for the data in the database with userdefined relationships. The query formulator allows users to specify their requests and constraints in highlevel concepts. The query candidates are formulated based on the user input by a graph search algorithm and ranked according to a probabilistic information measure. English-like query descriptions can also be provided for users to resolve ambiguity when multiple queries are formulated from a user input. For complex queries, we introduce an incremental approach, which assists users to achieve a complex query goal by formulating a series of simple queries. A prototype system with a multimodal interface using the high-level query formulation techniques has been implemented on top of a cooperative database system (CoBase) at UCLA. 1 Introduction Many database applications require users to formulate ad-hoc queries instead of invocation ... | [
1341
] | Test |
2,583 | 3 | Storing and Querying Multiversion XML Documents using Durable Node Numbers Managing multiple versions of XML documents represents an important problem for many traditional applications, such as software configuration control, as well as new ones, such as link permanence of web documents. Research on managing multiversion XML documents seeks to provide efficient and robust techniques for storing, retrieving and querying such documents. In this paper, we present a novel approach to version management that achieves these objectives by a scheme based on Durable Node Numbers and timestamps for the elements of XML documents. We first present efficient storage and retrieval techniques for multiversion documents. Then, we explore the indexing and clustering strategies needed to assure efficient support for complex queries on content and on document evolution. | [
2172,
2524,
2910
] | Validation |
2,584 | 5 | A Hybrid Model For Sharing Information Between Fuzzy, Uncertain And Default Reasoning Models In Multi-Agent Systems This paper develops a hybrid model which provides a unified framework for the fol- lowing four kinds of reasoning: 1) Zadeh's fuzzy approximate reasoning; 2) truthqualification uncertain reasoning with respect to fuzzy propositions; 3) fuzzy default reasoning (proposed, in this paper, as an extension of Reiter's default reasoning); and 4) truth-qualification uncertain default reasoning associated with fuzzy statements (developed in this paper to enrich fuzzy default reasoning with uncertain information). Our hybrid model has the following characteristics: 1) basic uncertainty is estimated in terms of words or phrases in natural language and basic propositions are fuzzy; 2) uncertainty, linguistically expressed, can be handled in default reasoning; and 3) the four kinds of rea- soning models mentioned above and their combination models will be the special cases of our hybrid model. Moreover, our model allows the reasoning to be performed in the case in which the information is fuzzy, uncertain and partial. More importantly, the problems of sharing the information among heterogeneous fuzzy, uncertain and default reasoning models can be solved efficiently by using our model. Given this, our framework can be used as a basis for information sharing and exchange in knowledge-based multi-agent systems for practical applications such as automated group negotiations. Actually, to build such a foundation is the motivation of this paper | [
566,
642,
699,
1260,
1810,
2364,
2994
] | Train |
2,585 | 3 | An Evolutionary Approach to Materialized Views Selection in a Data Warehouse Environment A data warehouse contains multiple views accessed by queries. One of the most important decisions in designing a data warehouse is selecting views to materialize for the purpose of eciently supporting decision making. The search space for possible materialized views is exponentially large. Therefore heuristics have been used to search for a near optimal solution. In this paper, we explore the use of an evolutionary algorithm for materialized view selection based on multiple global processing plans for queries. We apply a hybrid evolutionary algorithm to solve three related problems. The rst is to optimize queries. The second is to choose the best global processing plan from multiple global processing plans. The third is to select materialized views from a given global processing plan. Our experiment shows that the hybrid evolutionary algorithm delivers better performance than either the evolutionary algorithm or heuristics used alone in terms of the minimal query and maintenance cost and the evaluation cost to obtain the minimal cost. Keywords Evolutionary algorithms, Materialised view selection, Data warehousing, Data mining. I. | [
2491
] | Train |
2,586 | 2 | Scalable Information Organization We present three scalable extensions of the star algorithm for information organization that use sampling. The star algorithm organizes a document collection into clusters that are naturally induced by the topic structure of collection, via a computationally efficient cover by dense subgraphs. We also provide supporting data from extensive experiments. 1 Introduction Our goal is to develop a completely automated information organization system for digital libraries, automated tools for librarians to classify this information, automatic tools to create reference pointers into such collections, and automated tools that allow users to locate information effectively. We focus on static and dynamic digital collections of unstructured text. We consider the problem of determining the topic structure of text data, without a priori knowledge of the number of topics in the data or any other information about their composition. We assume that the collections may be static (for example, digi... | [
1351
] | Train |
2,587 | 5 | Placing a Robot Manipulator Amid Obstacles for Optimized Execution This paper presents an efficient algorithm for optimizing the base location of a robot manipulator in an environment cluttered with obstacles, in order to execute specified tasks as fast as possible. The algorithm uses randomized motion planning techniques and exploits geometric "coherence " in configuration space to achieve fast computation. The performance of the algorithm is demonstrated on both synthetic examples and real-life CAD data from the automotive industry. The computation time ranges from under a minute for simple problems to a few minutes for more complex ones. 1 Introduction The base placement of a robot manipulator is an important issue in many robotics applications. Given a description of a robot manipulator and its environment, the goal is to find a base location for the manipulator so that specified tasks are executed as efficiently as possible. In this paper, we present an algorithm that makes use of randomized motion planning techniques to compute simultaneously ... | [
1003
] | Train |
2,588 | 3 | Introduction to the Relationlog System Advanced applications require construction, efficient access and management of large databases with rich data structures and inference mechanisms. However, such capabilities are not directly supported by the existing database systems. In this paper, we describe Relationlog, a persistent deductive database system that is able to directly support the storage, efficient access and inference of data with complex structures. 1 Introduction Advanced applications require construction, efficient access and management of large databases with rich data structures and inference mechanisms. However, such capabilities are not directly supported by the existing database systems. Deductive databases have the potential to meet the demands of advanced applications. They grew out of the integration of logic programming and relational database technologies. They are intended to combine the best of the two approaches, such as representational and operational uniformity, inference capabilities, recursion,... | [
2083,
2618
] | Train |
2,589 | 2 | In-Context Information Management through Adaptive Collaboration of Intelligent Agents Although the number and availability of electronic information sources are increasing, current information technology requires manual manipulation and userspecification of all details. Once accessed, information must be filtered in the context of the user's task. Current systems lack the ability to get contextual information or use it to automate filtering. At Carnegie Mellon University, we have been engaged in the RETSINA project, which aims to develop a reusable multiagent software infrastructure that allows heterogeneous agents on the Internet, possibly developed by different designers, to collaborate with each other to manage information in the context of user-specified tasks. In this chapter, we will provide a brief overview of the whole system and then focus on its capability for in-context information management. This research has been supported in part by DARPA contract F30602-98-2-0138, and by ONR Grant N00014-96-1222. 1 Introduction The Web is full of information resourc... | [
1857
] | Train |
2,590 | 4 | Places to stay on the move: Software architectures for mobile user interfaces Architectural design has an important effect on usability, most notably on temporal properties. This paper investigates software architecture options for mobile user-interfaces, in particular those for collaborative systems. One of the new features of mobile systems as compared with fixed networks is the connection point to the physical network, the point of presence (PoP), which forms an additional location for code and data. This allows architectures that bring computation closer to the users hence reducing feedback and feedthrough delays. A consequence of using PoPs is that code and data have to be mobile within the network leading to potential security problems. Keywords: mobile computing, collaborative work, CSCW, software architecture, clientserver Introduction At first sight it seems that software architectures are about the internals of system design and not a necessary concern for the user interface. However, the merging of computing and communication systems and the maturin... | [
293
] | Train |
2,591 | 0 | Case-Based BDI Agents: an Effective Approach for Intelligent Search on the World Wide Web We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 2 2 d n); e 2 p d ln(n= p d )+O( p d+ln n) g time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise, the algorithm computes the lexicographically smallest nonnegative point satisfying n given linear inequalities in d variables. The expectation is over the internal randomizations Work by the first author has been supported by a Humboldt Research Fellowship. Work by the second and third authors has been supported by the German-Israeli Foundation for Scientific Research and Development (G.I.F.). Work by the second author has been supported by Office of Naval Research Grant N00014-90-J-1284, by National Science Foundation Grants CCR-89-01484 and CCR-90-22103, and by grants from the U.S.-Israeli Binational Science Foundation, and the Fund for Basic Research administered by the Israeli... | [
2364
] | Test |
2,592 | 3 | A Framework for Automated Construction and Transformation of Case-Based Reasoning Systems Case Based Reasoning systems have gained immense popularity over the recent years as problem-solving tools. Most case based reasoning systems, however, are developed essentially from scratch using proprietary systems and applications on a limited number of platforms. Although methods have been proposed to describe the structure of a case based reasoner, none of these have been very successful outside their application domains. In this paper, we #rst describe common methods for automating CBR system construction. We then describe a general model for common CBR implementation, and describe in detail a framework of platform-independent construction of systems based on this model. We discuss an implementation of such a system using Java, and #nally describe ways systems can be developed using this framework. 1 Introduction Achieving widespread case-based reasoning support for corporate memories will require #exibility in integrating implementations with existing organizational i... | [
861,
987,
2208
] | Train |
2,593 | 0 | Agent Factory: Generative Migration of Mobile Agents in Heterogeneous Environments In most of today's agent systems migration of agents requires homogeneity in the programming language and/or agent platform in which an agent has been designed. In this paper an approach is presented with which heterogeneity is possible: agents can migrate between non-identical platforms, and need not be written in the same language. Instead of migrating the "code" (including data and state) of an agent, a blueprint of an agent's functionality is transferred. An agent factory generates new code on the basis of this blueprint. This approach of generative mobility not only has implications for interoperability but also for security, as discussed in this paper. | [
725,
1223,
2313,
3089
] | Validation |
2,594 | 3 | View-based Query Processing and Constraint Satisfaction View-based query processing requires to answer a query posed to a database only on the basis of the information on a set of views, which are again queries over the same database. This problem is relevant in many aspects of database management, and has been addressed by means of two basic approaches, namely, query rewriting and query answering. In the former approach, one tries to compute a rewriting of the query in terms of the views, whereas in the latter, one aims at directly answering the query based on the view extensions. We study view-based query processing for the case of regular-path queries, which are the basic querying mechanisms for the emergent field of semistructured data. Based on recent results, we first show that a rewriting is in general a co-NP function wrt to the size of view extensions. Hence, the problem arises of characterizing which instances of the problem admit a rewriting that is PTIME. A second contribution of the work is to establish a tight connection between view-based query answering and constraint-satisfaction problems, which allows us to show that the above characterization is going to be difficult. As a third contribution of our work, we present two methods for computing PTIME rewritings of specific forms. The first method, which is based on the established connection with constraint-satisfaction problems, gives us rewritings expressed in Datalog with a fixed number of variables. The second method, based on automata-theoretic techniques, gives us rewritings that are formulated as unions of conjunctive regular-path queries with a fixed number of variables. | [
211,
936,
948,
1318,
1520,
1643,
2235,
2721,
2962,
2981
] | Test |
2,595 | 2 | Learning to Create Customized Authority Lists The proliferation of hypertext and the popularity of Kleinberg's HITS algorithm have brought about an increased interest in link analysis. While HITS and its older relatives from the Bibliometrics provide a method for finding authoritative sources on a particular topic, they do not allow individual users to inject their own opinions on what sources are authoritative. This paper presents a technique for learning a user's internal model of authority. We present experimental results based on Cora on-line index, a database of approximately one million on-line computer science literature references. 1. Introduction Bibliometrics (White & McCain, 1989; Small, 1973) involves studying the structure that emerges from sets of linked documents. Traditionally, these links have taken the form of citations among journal articles, although Kleinberg (1997) and others (e.g., Brin & Page, 1998) have found that they adapt well to sets of hyperlinked documents. Bibliometric techniques exis... | [
1838,
2371,
2503,
2847
] | Train |
2,596 | 3 | A Framework for Workflow Management Systems Based on Objects, Rules and Roles : The goal of this paper is to present an approach for the development of workflow management systems supporting both reusability and adaptability, i.e., customization due to frequently changing requirements in an organization. The principal contribution is the introduction of an object-oriented application framework for constructing such workflow management systems balancing between reusability and adaptability. The underlying techniques are an object-oriented workflow model, object evolution via an integrated role model, and the support of business policies via an integrated rule model. Categories and Subject Descriptors: H.4.1 [Office Automation]: Workflow Management; D.2.11 [Software Architectures]: Domain-specific architectures General Terms: Design Additional Key Words and Phrases: Object-Oriented Frameworks, Event/Condition/Action Rule, Role Modeling, Context Dependent Behavior INTRODUCTION This paper examines the application of the framework idea to the development of workflo... | [
2844
] | Train |
2,597 | 2 | A Comparative Study on Chinese Text Categorization Methods This paper reports our comparative evaluation of three machine learning methods on Chinese text categorization. Whereas a wide range of methods have been applied to English text categorization, relatively few studies have been done on Chinese text categorization. Based on a re-constructed People's Daily corpus, a series of controlled experiments evaluate three machine learning methods, namely k Nearest Neighbor (kNN) algorithm, Support Vector Machines (SVM), and Adaptive Resonance Associative Map (ARAM), in terms of their capabilities in mining categorization knowledge from high dimensional, sparse, and relatively noisy document feature vectors. Experiments reveal that all three methods produce satisfactory performance on the test corpus while ARAM exhibits a marginally better generalization capability, especially from relatively small and noisy training sets. Keywords: Chinese text categorization, supervised learning. 2 1 Introduction Text categorization refers to the task of auto... | [
2663
] | Test |
2,598 | 0 | Practical Reasoning with Procedural Knowledge (A Logic of BDI Agents with Know-How) . In this paper, we present a new logic for specifying the behaviour of multi-agent systems. In this logic, agents are viewed as BDI systems, in that their state is characterised in terms of beliefs, desires, and intentions: the semantics of the BDI component of the logic are based on the well-known system of Rao and Georgeff. In addition, agents have available to them a library of plans, representing their `know-how': procedural knowledge about how to achieve their intentions. These plans are, in effect, programs, that specify how a group of agents can work in parallel to achieve certain ends. The logic provides a rich set of constructs for describing the structure and execution of plans. Some properties of the logic are investigated, (in particular, those relating to plans), and some comments on future work are presented. 1 Introduction There is currently much international interest in computer systems that go under the banner of intelligent agents [16]. Crudely, an intel... | [
2338,
2364
] | Test |
2,599 | 2 | WWW Robots and Search Engines The Web robots are programs that automatically traverse through networks. Currently, their most visible and familiar application is to provide indices for search engines, such as Lycos and Alta Vista, and semiautomatically maintained topic references or subject directories. In this article, we survey the state-of-art of the Web robots, and the search engines that utilize the results of robot searches. We also present notions about robot ethics and distributed Web robots. | [
3061
] | Train |
2,600 | 3 | On the Integration of IR and Databases : Integration of information retrieval (IR) in database management systems (DBMSs) has proven di#cult. Previous attempts to integration su#ered from inherent performance problems, or lacked desirable separation between logical and physical data models. To overcome these problems, we discuss a database approach based on structural object-orientation. We implement IR techniques using extensions in an object algebra called MOA. MOA has been implemented on top of the database backend Monet, a state-of-the-art highperformance database kernel with a binary relational interface. Our prototype implementation of the inference network retrieval model using MOA and Monet demonstrates the feasibility of this approach. We conclude with a discussion of the advantages of our database design. INTRODUCTION Information retrieval (IR) is concerned with the retrieval of (usually text) documents that are likely to be relevant to the user's information need as expressed by his request (van Rijsb... | [
176,
1794,
2797
] | Test |
2,601 | 2 | A Comparison of Mobile Agent and Client-Server Paradigms for Information Retrieval Tasks in Virtual Enterprises In next-generation enterprises it will become increasingly important to retrieve information efficiently and rapidly from widely dispersed sites in a virtual enterprise, and the number of users who wish to do using wireless and portable devices will increase significantly. This paper considers the use of mobile agent technology rather than traditional clientserver computing for information retrieval by mobile and wireless users in a virtual enterprise. We argue that to be successful mobile agent platforms must coexist with, and be presented to the applications programmer sideby -side with, traditional client-server middleware like CORBA and DCOM, and we sketch a middleware architecture for doing so. We then develop an analytical model that examines the claimed performance benefits of mobile agents over client-server computing for a mobile information retrieval scenario. Our evaluation of the model shows that mobile agents are not always better than client-server calls in terms of average response times; they are only beneficial if the space overhead of the mobile agent code is not too large or if the wireless link connecting the mobile user to the fixed servers of the virtual enterprise is error-prone. | [
2553
] | Train |
2,602 | 0 | Cryptographic Protocols for Secure Second-Price Auctions In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation, task assignment and last but not least electronic commerce. In many cases the Vickrey (second-price sealed-bid) auction is used as a protocol that prescribes how the individual agents have to interact in order to come to an agreement. The main reasons for choosing the Vickrey auction are the existence of a dominant strategy equilibrium, the low bandwidth and time consumption due to just one round of bidding and the (theoretical) privacy of bids. This paper specifies properties that are needed to ensure the accurate and secret execution of Vickrey auctions and provides a classification of different forms of collusion. We approach the two major security concerns of the Vickrey auction: the vulnerability to a lying auctioneer and the reluctance of bidders to reveal their private valuations. We then propose a novel technique that allows to securely perform second-price auctions. This is achieved using the announcement of encrypted binary bidding lists on a blackboard. Top-down, bottom-up and binary search techniques are used to interactively find the second highest bid step by step without revealing unnecessary information. 1 | [
827,
1561,
2231
] | Validation |
2,603 | 1 | Version Space Algebra and its Application to Programming by Demonstration Machine learning research has been very successful at producing powerful, broadlyapplicable classification learners. However, many practical learning problems do not fit the classification framework well, and as a result the initial phase of suitably formulating the problem and incorporating the relevant domain knowledge can be very di#cult and typically consumes the majority of the project time. Here we propose a framework to systematize and speed this process, based on the notion of version space algebra. We extend the notion of version spaces beyond concept learning, and propose that carefullytailored version spaces for complex applications can be built by composing simpler, restricted version spaces. We illustrate our approach with SMARTedit, a programming by demonstration application for repetitive text-editing that uses version space algebra to guide a search over text-editing action sequences. We demonstrate the system on a suite of repetitive text-editing ... | [
998,
2345
] | Train |
2,604 | 2 | A Multi-Agent Architecture for Distributed Corporate Memories This paper presents an approach to design a multi-agent system managing a corporate memory in the form of a distributed semantic web and describes the resulting architecture. | [
404,
984,
3184
] | Train |
2,605 | 5 | Concurrency in Prolog Using Threads and a Shared Database Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the standard implementations, and/or the communication and synchronization facilities provided do not fit as naturally within the language model as we feel is possible. In this paper we propose a new mechanism for implementing synchronization and communication for concurrency, based on atomic accesses to designated facts in the (shared) database. We argue that this model is comparatively easy to implement and harmonizes better than previous proposals within the Prolog control model and standard set of built-ins. We show how in the proposed model it is easy to express classical concurrency algorithms and to subsume other mechanisms such as Linda, variable-based communication, or classical parallelism-oriented primitives. We also report on an implementation of the model and provide performance and resource consumption data. 1 | [
1143,
1192
] | Train |
2,606 | 3 | Handling Temporal Grouping and Pattern-Matching Queries in a Temporal Object Model This paper presents a language for expressing temporal pattern-matching queries, and a set of temporal grouping operators for structuring histories following calendar-based criteria. Pattern-matching queries are shown to be useful for reasoning about successive events in time while temporal grouping may be either used to aggregate data along the time dimension or to display histories. The combination of these capabilities allows to express complex queries involving succession in time and calendar-based conditions simultaneously. These operators are embedded into the TEMPOS temporal data model and their use is illustrated through examples taken from a geographical application. The proposal has been validated by a prototype on top of the O 2 DBMS. Keywords: temporal databases, temporal object model, temporal query language, pattern-matching queries, temporal grouping, calendar, granularity, O 2 . 1 Introduction In most modern DBMS, time is one of the primitive datatypes provided for d... | [
216,
1144,
1200,
1255,
2837,
3123,
3142
] | Train |
2,607 | 1 | Minimal Simulations For Evolutionary Robotics this paper, the line is drawn between controller and environment. 3.1.1 Drawing the line between controller and environment | [
335,
2557
] | Train |
2,608 | 2 | Clustering Categorical Data: An Approach Based on Dynamical Systems We describe a novel approach for clustering collections of sets, and its application to the analysis and mining of categorical data. By "categorical data," we mean tables with fields that cannot be naturally ordered by a metric --- e.g., the names of producers of automobiles, or the names of products offered by a manufacturer. Our approach is based on an iterative method for assigning and propagating weights on the categorical values in a table; this facilitates a type of similarity measure arising from the cooccurrence of values in the dataset. Our techniques can be studied analytically in terms of certain types of non-linear dynamical systems. We discuss experiments on a variety of tables of synthetic and real data; we find that our iterative methods converge quickly to prominently correlated values of various categorical fields. 1 Introduction Much of the data in databases is categorical: fields in tables whose attributes cannot naturally be ordered as numerical values can. The pro... | [
2503
] | Train |
2,609 | 2 | Effective Resource Discovery on the World Wide Web this paper, we present USEwebNET, a resource discovery tool built on top of traditional search engines. USEwebNET registers each user's interests and repeatedly queries several search engines for URLs matching a user's registered interests. USEwebNET keeps track of which URLs have been visited by each user. Thus, when a user invokes USEwebNET, (s)he is presented only with new or "unvisited" URLs. We view USEwebNET as a value-added service on top of existing search engines and information providers, which helps users effectively find "what's new" in the rapidly evolving web of our world. Introduction | [
711
] | Train |
2,610 | 2 | Accelerated Focused Crawling through Online Relevance Feedback The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate and click on links that best satisfy their information need. Can an automatic program emulate this human behavior and thereby learn to predict the relevance of an unseen HREF target page w.r.t. an information need, based on information limited to the HREF source page? Such a capability would be of great interest in focused crawling and resource discovery, because it can fine-tune the priority of unvisited URLs in the crawl frontier, and reduce the number of irrelevant pages which are fetched and discarded. | [
608,
825,
1021,
1290,
1966,
2459,
2705
] | Train |
2,611 | 0 | X-Klaim and Klava: Programming Mobile Code Highly distributed networks have now become a common infrastructure for a new kind of wide-area distributed applications whose key design principle is network awareness, namely the ability to deal with dynamic changes of the network environment. Network-aware computing has called for new programming languages that exploit the mobility paradigm as the basic interaction mechanism. In this paper we present the Klaim (Kernel Language for Agent Interaction and Mobility) framework for programming mobile code applications, namely the X-Klaim programming language and the Java-based run-time system Klava. In particular, we illustrate how Klava handles mobile code. Finally, an example is shown that is implemented using this framework. | [
686
] | Train |
2,612 | 1 | Support Vector Machines for Face Authentication The paper studies Support Vector Machines (SVMs) in the context of face authentication. Our study supports the hypothesis that the SVM approach is able to extract the relevant discriminatory information from the training data. We believe this is the main reason for its superior performance over benchmark methods. When the representation space already captures and emphasises the discriminatory information content as in the case of Fisherfaces, SVMs loose their superiority. SVMs can also cope with illumination changes, provided these are adequately represented in the training data. However, on data which has been sanitised by feature extraction (Fisherfaces) and/or normalisation, SVMs can get over-trained, resulting in the loss of the ability to generalise. SVMs involve many parameters and can employ different kernels. This makes the optimisation space rather extensive, without the guarantee that it has been fully explored to find the best solution. 1 Introduction Verificat... | [
8,
2724
] | Validation |
2,613 | 4 | An Architecture for Building Multi-Device Thin-Client Web User Interfaces We describe a new approach to providing adaptable thin client interfaces for web-based information systems. Developers specify web-based interfaces using a high-level mark-up language based on the logical structure of the user interface. At run-time this single interface description is used to automatically provide an interface for multiple web devices e.g. desk-top HTML and mobile WML-based systems, as well as highlight, hide or disable interface elements depending on the current user and user task. Our approach allows developers to much more easily construct and maintain adaptable webbased user interfaces than other current approaches. | [
1507,
3042
] | Train |
2,614 | 1 | Genetic Programming and Multi-Agent Layered Learning by Reinforcements We present an adaptation of the standard genetic program (GP) to hierarchically decomposable, multi-agent learning problems. To break down a problem that requires cooperation of multiple agents, we use the team objective function to derive a simpler, intermediate objective function for pairs of cooperating agents. We apply GP to optimize first for the intermediate, then for the team objective function, using the final population from the earlier GP as the initial seed population for the next. This layered learning approach facilitates the discovery of primitive behaviors that can be reused and adapted towards complex objectives based on a shared team goal. | [
346,
1350,
2388,
3173
] | Train |
2,615 | 2 | Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach Recent trends in information management involve the periodic transcription of data onto secondary devices in a networked environment, and the proper scheduling of these transcriptions is critical for efficient data management. To assist in the scheduling process, we are interested in modeling data obsolescence, that is, the reduction of consistency over time between a relation and its replica. The modeling is based on techniques from the field of stochastic processes, and provides several stochastic models for content evolution in the base relations of a database, taking referential integrity constraints into account. These models are general enough to accommodate most of the common scenarios in databases, including batch insertions and life spans both with and without memory. As an initial "proof of concept" of the applicability of our approach, we validate the insertion portion of our model framework via experiments with real data feeds. We also discuss a set of transcription protocols which make use of the proposed stochastic model. | [
806
] | Train |
2,616 | 2 | On the Integration of Technologies for Capturing and Navigating Knowledge With Ontology-Driven Services Nowadays, many distinct communities are researching on technologies for knowledge capturing, modelling, and navigation. Moreover, advances in Internet technology makes it possible to perform most of these tasks on heterogeneous and distributed environments such as the Web. These advances though, have raise the need for knowledge services to accommodate the ever increasing number of Web users. To provide such a service one needs to combine key technologies for different aspects of knowledge management: capturing, modelling, navigating. This should be tightly integrated with the intended service. We describe such an integration effort in this paper. Our domain is a Web-based news repository and we aimed to provide personalised ontology-driven services on the top of it. We used knowledge capturing technologies to populate the underlying ontologies, knowledge modelling techniques to provide reasoning capabilities for the ontology-driven service, and navigating technologies to overlay Web-pages with the ontology-driven service. Keywords Knowledge capture, ontology-driven services, knowledge navigation 1. | [
994,
1485
] | Train |
2,617 | 4 | An Event-Driven Sensor Architecture for Low Power Wearables In this paper we define a software architecture for low power wearable computers. The architecture is event driven, and is designed so that application programs have access to sensor data without the need for polling. The software architecture is designed to allow for an underlying hardware architecture that can achieve maximal power efficiency by switching off parts of the hardware that are known not to be required. INTRODUCTION Wearable Computing places particular demands on software. It is characterised by having to accommodate a potentially large number of input devices which are simultaneously providing contextual data; a need to minimise processor activity to reduce battery consumption [1]; and the requirement for simplicity to aid debugging applications which may be used in adverse conditions. As a result of our experiences with software which had none of the above features, we have developed an eventdriven sensor architecture and used it successfully for several applications... | [
21,
1500,
2855,
2996
] | Train |
2,618 | 3 | Overview of Datalog Extensions with Tuples and Sets Datalog (with negation) is the most powerful query language for relational database with a well-defined declarative semantics based on the work in logic programming. However, Datalog only allows inexpressive flat structures and cannot directly support complex values such as nested tuples and sets common in novel database applications. For these reasons, Datalog has been extended in the past several years to incorporate tuple and set constructors. In this paper, we examine four different Datalog extensions: LDL, COL, Hilog and Relationlog. 1 Introduction Databases and logic programming are two independently developed areas in computer science. Database technology has evolved in order to effectively and efficiently organize, manage and maintain large volumes of ever increasingly complex data reliably in various memory devices. The underlying structure of databases has been the primary focus of research which leads to the development of data models. The most well-known and widely used da... | [
2083,
2588
] | Train |
2,619 | 0 | Composition of Services with Mobile Code Mobile code is slowly gaining acceptance but it is still not clear where it is really useful. If not used judiciously it may incur greater complexity of programming and degradation of performances. The goal of this paper is to show that mobile code is particularly well suited as a glue for the composition of immobile services, where flexibility and extensibility are necessary. To support our claim we describe two services and one application that have been programmed with mobile code in the context of active networking. We study the impact on the flexibility, complexity and performances of the resulting systems. We observe positive effects on flexibility and complexity and acceptable performance penalties. 1. Introduction The main idea of active networking is to make mobile code a core functionality of the network. Traditionally network elements like routers only transport packets and do not try to decode or modify the enclosed payload. In an Active Network, the nodes can perform cus... | [
776
] | Train |
2,620 | 1 | Multi-Robot Learning in a Cooperative Observation Task . An important need in multi-robot systems is the development of mechanisms that enable robot teams to autonomously generate cooperative behaviors. This paper rst briey presents the Cooperative Multi-robot Observation of Multiple Moving Targets (CMOMMT) application as a rich domain for studying the issues of multi-robot learning of new behaviors. We discuss the results of our handgenerated algorithm for CMOMMT, and then describe our research in generating multi-robot learning techniques for the CMOMMT application, comparing the results to the hand-generated solutions. Our results show that, while the learning approach performs better than random, naive approaches, much room still remains to match the results obtained from the hand-generated approach. The ultimate goal of this research is to develop techniques for multi-robot learning and adaptation that will generalize to cooperative robot applications in many domains, thus facilitating the practical use of multi-robot teams in a wid... | [
346,
1523
] | Train |
2,621 | 3 | On Wrapping Query Languages and Efficient XML Integration Modern applications/portals, e-commerce, digital libraries, etc.) require integrated access to various information sources (from traditional RDBMS to semistructured Web repositories), fast deployment and low maintenance cost in a rapidly evolving environment. Because of its flexibility, there is an increasing interest in using XML as a middleware model for such applications. XML enables fast wrapping and declarative integration. However, query processing in XML-based integration systems is still penalized by the lack of an algebra with adequate optimization properties and the difficulty to understand source query capabilities. In this paper, we propose an algebraic approach to support efficient query evaluation in XML integration systems. We define a general purpose algebra suitable for semistructured or XML query languages. We showhow this algebra can be used, with appropriate type information, to also wrap more structured query languages such as OQL or SQL. Finally,we develop new optimizat... | [
754
] | Train |
2,622 | 2 | XML Conceptual Modeling using UML . The eXtensible Markup Language (XML) is increasingly finding acceptance as a standard for storing and exchanging structured and semi-structured information. With its expressive power, XML enables a great variety of applications relying on such structures - notably product catalogs, digital libraries, and electronic data interchange (EDI). As the data schema, an XML Document Type Definition (DTD) is a means by which documents and objects can be structured. Currently, there is no suitable way to model DTDs conceptually. Our approach is to model DTDs and thus classes of documents on the basis of UML (Unified Modeling Language). We consider UML to be the connecting link between software engineering and document design, i.e., it is possible to design object-oriented software together with the necessary XML structures. For this reason, we describe how to transform the static part of UML, i.e. class diagrams, into XML DTDs. The major challenge for the transformation is to defi... | [] | Test |
2,623 | 3 | Overview of the ROL2 Deductive Object-Oriented Database System This paper presents an overview of ROL2, a novel deductive object-oriented database system developed at the University of Regina. ROL2 supports in a rule-based framework nearly all important object-oriented features such as object identity, complex objects, typing, information hiding, rule-based methods, encapsulation of such methods, overloading, late binding, polymorphism, class hierarchies, multiple structural and behavioral inheritance with overriding, blocking, and conflict handling. It is so far the only deductive system that supports all these features in a pure rule-based framework. | [
764,
2832
] | Train |
2,624 | 2 | Multiagent Architecture for D-Sifter -- A modern approach to flexible information filtering in dynamic environments | [
3167
] | Train |
2,625 | 1 | Initialization of Iterative Refinement Clustering Algorithms Iterative refinement clustering algorithms (e.g. K-Means, EM) converge to one of numerous local minima. It is known that they are especially sensitive to initial conditions. We present a procedure for computing a refined starting condition from a given initial one that is based on an efficient technique for estimating the modes of a distribution. The refined initial starting condition leads to convergence to "better" local minima. The procedure is applicable to a wide class of clustering algorithms for both discrete and continuous data. We demonstrate the application of this method to the Expectation Maximization (EM) clustering algorithm and show that refined initial points indeed lead to improved solutions. Refinement run time is considerably lower than the time required to cluster the full database. The method is scalable and can be coupled with a scalable clustering algorithm to address the large-scale clustering in data mining. 1 Background Clustering has been formulated in var... | [
1405,
3116
] | Test |
2,626 | 0 | Reliable Communication for Highly Mobile Agents . The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which complicates the problem of ensuring the delivery of information even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for the aforementioned problem, because they were not designed with mobility in mind, or enforce continuous connectivity with the message source, which in many cases defeats the very purpose of using mobile agents. In this paper, we propose an algorithm that guarantees delivery to highly mobile agents using a technique similar to a distributed snapshot. A numbe... | [
532,
580,
1457,
2715,
3089
] | Train |
2,627 | 2 | Recommending Web Documents Based on User Preferences Making recommendations requires treating users as individuals. In this paper, we describe a metasearch engine available at NEC Research Institute that allows individual search strategies to be used. Each search strategy consists of a different set of sources, different query modification rules and a personalized ordering policy. We combine these three features with a dynamic interface that allows users to see the "current best" recommendations displayed at all times, and allows results to be displayed immediately upon retrieval. We present several examples where a single query produces different results, ordered based on different factors, accomplished without the use of training, or a local database. | [
130,
488,
1048,
1321,
2188
] | Train |
2,628 | 0 | Towards a Distributed, Environment-Centered Agent Framework . This paper will discuss the internal architecture for an agent framework called DECAF (Distributed Environment Centered Agent Framework). DECAF is a software toolkit for the rapid design, development, and execution of "intelligent" agents to achieve solutions in complex software systems. From a research community perspective, DECAF provides a modular platform for evaluating and disseminating results in agent architectures, including communication, planning, scheduling, execution monitoring, coordination, diagnosis, and learning. From a user/programmer perspective, DECAF distinguishes itself by removing the focus from the underlying components of agent building such as socket creation, message formatting, and agent communication. Instead, users may quickly prototype agent systems by focusing on the domain-specific parts of the problem via a graphical plan editor, reusable generic behaviors [9], and various supporting middle-agents [10]. This paper will briefly describe the... | [
2249,
2321,
2364
] | Test |
2,629 | 0 | Agent Communication Languages: The Current Landscape this article--- suggest a paradigm for software development that emphasizes autonomy both at design time and runtime, adaptivity, and cooperation. This approach seems appealing in a world of distributed, heterogeneous systems. Languages for communicating agents promise to play the role that natural languages played for their human counterparts. An agent communication language that allows agents to interact while hiding the details of their internal workings will result in agent communities that tackle problems no individual agent could. | [
459,
666,
789,
1157,
1552,
1865,
2337,
2341,
2861,
3038,
3108
] | Test |
2,630 | 3 | Corpus-Based Stemming using Co-occurrence of Word Variants Stemming is used in many information retrieval (IR) systems to reduce variant word forms to common roots. It is one of the simplest applications of natural language processing to IR, and one of the most effective in terms of user acceptance and consistent, though small, retrieval improvements. Current stemming techniques do not, however, reflect the language use in specific corpora and this can lead to occasional serious retrieval failures. We propose a technique for using corpus-based word variant co-occurrence statistics to modify or create a stemmer. The experimental results generated using English newspaper and legal text and Spanish text demonstrate the viability of this technique and its advantages relative to conventional approaches. Categories and Subject Descriptors: H.3.1. [Information Storage and Retrieval]: Content Analysis and Indexing -- indexing methods; linguistic processing; H.3.3. [Information Storage and Retrieval]: Information Search and Retrieval -- query f... | [
1471
] | Train |
2,631 | 2 | Probabilistic Models for Unified Collaborative and Content-Based Recommendation in Sparse-Data Environments Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and a few hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recommendations. We extend Hofmann's (1999) aspect model to incorporate three-way co-occurrence data among users, items, and item content. The relative influence of collaboration data versus content data is not imposed as an exogenous parameter, but rather emerges naturally from the given data sources. However, global probabilistic models coupled with standard EM learning algorithms tend to drastically overfit in the sparsedata situations typical of recommendation applications. We show that secondary content information can often be used to overcome sparsity. Experiments on data from the ResearchIndex library of Computer Science publications show that appropriate mixture models incorporating secondary data produce significantly better quality recommenders than k-nearest neighbors (k-NN). Global probabilistic models also allow more general inferences than local methods like k-NN. | [
147,
220,
949,
1161,
1591,
1718,
2033,
2096,
2300,
2475,
2847,
2903
] | Train |
2,632 | 3 | Representing and Querying Changes in Semistructured Data Semistructured data may be irregular and incomplete and does not necessarily conform to a fixed schema. As with structured data, it is often desirable to maintain a history of changes to data, and to query over both the data and the changes. Representing and querying changes in semistructured data is more difficult than in structured data due to the irregularity and lack of schema. We present a model for representing changes in semistructured data and a language for querying over these changes. We discuss implementation strategies for our model and query language. We also describe the design and implementation of a "query subscription service" that permits standing queries over changes in semistructured information sources. 1 Introduction Semistructured data is data that has some structure, but it may be irregular and incomplete and does not necessarily conform to a fixed schema (e.g, HTML documents). Recently, there has been increased interest in data models and query languages for s... | [
731,
877,
1660,
2232,
3141
] | Train |
2,633 | 3 | Navigational Plans For Data Integration We consider the problem of building data integration systems when the data sources are webs of data, rather than sets of relations. Previous approaches to modeling data sources are inappropriate in this context because they do not capture the relationships between linked data and the need to navigate through paths in the data source in order to obtain the data. We describe a language for modeling data sources in this new context. We show that our language has the required expressive power, and that minor extensions to it would make query answering intractable. We provide a sound and complete algorithm for reformulating a user query into a query over the data sources, and we show how to create query execution plans that both query and navigate the data sources. Introduction The purpose of data integration is to provide a uniform interface to a multitude of data sources. Data integration applications arise frequently as corporations attempt to provide their customers and employees wit... | [
1843,
2139
] | Test |
2,634 | 1 | Heterogeneity in the Coevolved Behaviors of Mobile Robots: The Emergence of Specialists Many mobile robot tasks can be most efficiently solved when a group of robots is utilized. The type of organization, and the level of coordination and communication within a team of robots affects the type of tasks that can be solved. This paper examines the tradeoff of homogeneity versus heterogeneity in the control systems by allowing a team of robots to coevolve their high-level controllers given different levels of difficulty of the task. Our hypothesis is that simply increasing the difficulty of a task is not enough to induce a team of robots to create specialists. The key factor is not difficulty per se, but the number of skill sets necessary to successfully solve the task. As the number of skills needed increases, the more beneficial and necessary heterogeneity becomes. We demonstrate this in the task domain of herding, where one or more robots must herd another robot into a confined space. 1 | [
462,
1855,
2778
] | Test |
2,635 | 0 | Coordinating Mutually Exclusive Resources using GPGP Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associated tests and treatments have become interrelated, the current ad hoc patient scheduling solutions have been observed to break down. We propose a multi-agent solution using the Generalized Partial Global Planning (GPGP) approach that preserves the existing human organization and authority structures, while providing better system-level performance (increased hospital unit throughput and decreased patient stay time). To do this, we extend GPGP with a new coordination mechanism to handle mutually exclusive resource relationships. Like the other GPGP mechanisms, the new mechanism can be applied to any problem with the appropriate resource relationship. We evaluate this new mechanism in the context of the hospital patient scheduling problem, and examine the effect of increasing interrelations between tasks performed... | [
978,
1107
] | Test |
2,636 | 1 | Learning Motor Skills By Imitation: A Biologically Inspired Robotic Model. This article presents a biologically inspired model for motor skills imitation. The model is composed of modules whose functinalities are inspired by corresponding brain regions responsible for the control of movement in primates. These modules are high-level abstractions of the spinal cord, the primary and premotor cortexes (M1 and PM), the cerebellum, and the temporal cortex. Each module is modeled at a connectionist level. Neurons in PM respond both to visual observation of movements and to corresponding motor commands produced by the cerebellum. As such, they give an abstract representation of mirror neurons. Learning of new combinations of movements is done in PM and in the cerebellum. Premotor cortexes and cerebellum are modeled by the DRAMA neural architecture which allows learning of times series and of spatio-temporal invariance in multimodal inputs. The model is implemented in a mechanical simulation of two humanoid avatars, the imitator and the imitatee. Three types of sequences learning are presented: (1) learning of repetitive patterns of arm and leg movements; (2) learning of oscillatory movements of shoulders and elbows, using video data of a human demonstration; 3) learning of precise movements of the extremities for grasp and reach | [
926,
1132
] | Validation |
2,637 | 3 | Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints Based on F-logic, we specify an advanced data model with object-oriented and logic-oriented features that substantially extend the relational approach. For this model we exhibit and study the counterpart to the well-known decomposition of a relation scheme according to a nontrivial nonkey functional dependency. For decomposing a class of a database schema the transformation of pivoting is used. Pivoting separates apart some attributes of the class into a newly generated class. This new class is declared to be a subclass of the result class of the so-called pivot attribute. Moreover the pivot attribute provides the link between the original class and the new subclass. We identify the conditions for the result of pivoting being equivalent with its input: the expressive power of path functional dependencies, the validity of the path functional dependency between the pivot attribute and the transplanted attributes, and the validity of the onto-constraint guaranteeing that value... | [
174,
1837
] | Train |
2,638 | 4 | A Reference Model for Situation-Aware Assistance As computers are becoming more and more ubiquitous, moving from the desktop into the infrastructure of our everyday life, they begin to influence the way we interact with this environment -- the (physical) entities that we operate upon in order to achieve our daily goals. The most important aspect of future human-computer interaction therefore is the way, computers support us in efficiently managing our personal environment. Conventionally, human-computer interaction looks at a process, where only two partners are involved: the human and the computer. However, looking at the computer as a mediator between the user and his environment, we have to acknowledge a more complex communication process. This paper proposes a reference model that identifies the fundamental components which are involved in human-computer-environment interaction. | [] | Train |
2,639 | 0 | Cyberoos2000: Experiments with Emergent Tactical Behaviour this paper is that, rather than defining situated or tactical reasoning ad hoc, it is desirable to categorise agents according to their functionality and reactions to the environment, and identify corresponding classes of action theories and agent architectures. Then, the reasoning exhibited by agents of a certain type (and validated by particular action theories) can be declared to be situated, tactical, strategic, social and so on. In other words, the principal target is a systematic description of increasing levels of agent reasoning abilities. The results reported in [8, 9, 10] demonstrated that this is achievable at the situated level. Preliminary results on the systematic models for basic tactical behaviour were obtained as well [11]. This work intends to use this framework in experimenting with emergent tactical teamwork; and thus build up empirical results and intuition necessary to advance the systematic methodology towards collaborative goal-oriented agents. | [
3173
] | Validation |
2,640 | 4 | Designing PETS: A Personal Electronic Teller of Stories in Robots For Kids, Morgan Kaufmann, San Francisco, CA. Druin, A. and Hendler J. (eds.) Page 2 Who, or What, Is PETS? Figure 1: PETS, Spaceship, and MyPETS software What Does PETS Do? PETS is a Personal Electronic Teller of Stories, a robotic story telling environment for elementary school age children (Druin et al. 1999a). The PETS kit contains a box of fuzzy stuffed animal parts and an authoring application on a personal computer (Figures 1 and 3). Children can build a robotic animal, or pet, by connecting animal parts such as torso, head, paws, ears, and wings. After they construct their pet, they can write and tell stories using the My PETS software. Just as the robotic animal is constructed from discrete components, My PETS is also constructive. This application enables children to create emotions, draw emotive facial expressions, name their robotic companion, and compile a library of stori | [
1511,
1932,
2322
] | Train |
2,641 | 1 | Using Decision Trees to Improve Case-Based Learning This paper shows that decision trees can be used to improve the performance of casebased learning (CBL) systems. We introduce a performance task for machine learning systems called semi-flexible prediction that lies between the classification task performed by decision tree algorithms and the flexible prediction task performed by conceptual clustering systems. In semi-flexible prediction, learning should improve prediction of a specific set of features known a priori rather than a single known feature (as in classification) or an arbitrary set of features (as in conceptual clustering). We describe one such task from natural language processing and present experiments that compare solutions to the problem using decision trees, CBL, and a hybrid approach that combines the two. In the hybrid approach, decision trees are used to specify the features to be included in k-nearest neighbor case retrieval. Results from the experiments show that the hybrid approach outperforms both the decision ... | [
402,
839,
1389,
1737,
2117,
2469,
2572,
2676,
2823,
2835
] | Train |
2,642 | 4 | Evaluating Look-to-Talk: A Gaze-Aware Interface in a Collaborative Environment We present “look-to-talk”, a gaze-aware interface for directing a spoken utterance to a software agent in a multiuser collaborative environment. Through a prototype and a Wizard-of-Oz (WOz) experiment, we show that "look-totalk” is indeed a natural alternative to speech and other paradigms. | [
1488
] | Train |
2,643 | 0 | Formal Analysis of Models for the Dynamics of Trust based on Experiences . The aim of this paper is to analyse and formalise the dynamics of trust in the light of experiences. A formal framework is introduced for the analysis and specification of models for trust evolution and trust update. Different properties of these models are formally defined. 1 Introduction Trust is the attitude an agent has with respect to the dependability/capabilities of some other agent (maybe itself) or with respect to the turn of events. The agent might for example trust that the statements made by another agent are true. The agent might trust the commitment of another agent with respect to a certain (joint) goal. The agent might trust that another agent is capable of performing certain tasks. The agent might trust itself to be able to perform some tasks. The agent might trust that the current state of affairs will lead to a state of affairs that is agreeable to its own intentions, goals, commitments, or desires. In [1], [2] the importance of the notion trust is shown for agent... | [
2209
] | Validation |
2,644 | 2 | Comparing Statistical and Content-Based Techniques for Answer Validation on the Web Answer Validation is an emerging topic in Question Answering, where open domain systems are often required to rank huge amounts of candidate answers. We present a novel approach to answer validation based on the intuition that the amount of implicit knowledge which connects an answer to a question can be estimated by exploiting the redundancy of Web information. Two techniques are considered in this paper: a statistical approach, which uses the Web to obtain a large amount of pages, and a content-based approach, which analyses text snippets retrieved by the search engine. Both the approaches do not require to download the documents. Experiments carried out on the TREC-2001 judged-answer collection show that a combination of the two approaches achieves a high level of performance (i.e. about 88% success rate). | [
2503
] | Train |
2,645 | 1 | Personalized Web-Document Filtering Using Reinforcement Learning Abstract- Document filtering is increasingly deployed in Web environments to reduce information overload of users. We formulate online information filtering as a reinforcement learning problem, i.e. TD(0). The goal is to learn user profiles that best represent his information needs and thus maximize the expected value of user relevance feedback. A method is then presented that acquires reinforcement signals automatically by estimating user’s implicit feedback from direct observations of browsing behaviors. This “learning by observation ” approach is contrasted with conventional relevance feedback methods which require explicit user feedbacks. Field tests have been performed which involved 10 users reading a total of 18,750 HTML documents during 45 days. Compared to the existing document filtering techniques, the proposed learning method showed superior performance in information quality and adaptation speed to user preferences in online filtering. 1 | [
1194
] | Validation |
2,646 | 0 | Market Clearability Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly cleared with sellers, and thus do not require an external liquidity provider, are highly desirable for electronic marketplaces for several reasons. In this paper we study the inherent complexity of, and design algorithms for, clearing auctions and reverse auctions with multiple indistinguishable units for sale. We consider settings where bidders express their preferences via price-quantity curves, and settings where the bids are price-quantity pairs. We show that markets with piecewise linear supply/demand curves and non-discriminatory pricing can always be cleared in polynomial time. Surprisingly, if discriminatory pricing is used to clear the market, the problem becomes NP-Complete (even for step function curves). If the price-quantity curves are all linear, then, in most variants, the problem admits a poly-time solution even for discriminatory pricing. When bidders express their preferences with price-quantity pairs, the problem is NP-Complete, but solvable in pseudo-polynomial time. With free disposal, the problem admits a poly-time approximation scheme, but no such approximation scheme is possible without free disposal. We also present pseudo-polynomial algorithms for XOR bids and or-of-xors bids, and analyze the approximability. 1 | [
1337,
1563
] | Validation |
2,647 | 2 | Image Recognition and Neuronal Networks: Intelligent Systems for the Improvement of Imaging Information this paper we have concentrated on describing issues related to the development and use of artificial neural network-based intelligent systems for medical image interpretation. Research in intelligent systems to-date remains centred on technological issues and is mostly application driven. However, previous research and experience suggests that the successful implementation of computerised systems (e.g., [34] [35]), and decision support systems in particular (e.g., [36]), in the area of healthcare relies on the successful integration of the technology with the organisational and social context within which it is applied. Therefore, the successful implementation of intelligent medical image interpretation systems 9 should not only rely on their technical feasibility and effectiveness but also on organisational and social aspects that may rise from their applications, as clinical information is acquired, processed, used and exchanged between professionals. All these issues are critical in healthcare applications because they ultimately reflect on the quality of care provided. | [
1213,
2428
] | Train |
2,648 | 3 | Hybrid Shipping Architectures: A Survey Recent advances in relational database systems include distributed systems that can choose to execute portions of query processing functionality at server or client sites. A symmetric problem that has received little attention is the partitioning of client application functionality between client and server. This report presents a survey of the literature related to both of these partitioning problems. | [
104
] | Train |
2,649 | 4 | Evaluating Guidelines for Reducing User Disorientation When Navigating in Virtual Environments Navigation in virtual environments can be difficult. One contributing factor is user disorientation. | [
810,
1870,
2276,
2717
] | Train |
2,650 | 2 | Improving Multi-class Text Classification with Naive Bayes The Problem: There are billions of text documents available in electronic form. More and more are becoming available every day. The Web itself contains over a billion documents. Millions of people send e-mail every day. Academic publications and journals are becoming available inelectronicform. Thesecollections and many others represent a massive amount of information that is easily accessible. However, seeking value in this huge collection requires organization. Many web sites offer a hierarchically-organized view of the Web. E-mail clients offer a systems for filtering e-mail. Numerous academic communities have a Web site that allows searching on papers and shows an organization of papers. However, organizing documents by hand or creating rules for filtering is painstaking and labor-intensive. This can be greatly aided by automated classifier systems. The accuracy of such systems determines their usefulness. We propose to use the Support Vector Machine (SVM) in conjunction with Error-Correcting Output Codes (ECOC) to improve the state-of-the-art in text classification. Motivation & Previous Work: In 1998, Joachims published results on a set of binary text classification experiments using the SVM [4]. The SVM yielded lower error than many other classification techniques. Yang followed later with experiments of her own on the same data set [5]. She used improved versions of Naive Bayes (NB) and kNN but still found that the SVM performed at least as well as all other classifiers she tried. She also found that the linear SVM performed as well as polynomial and RBF versions. Both papers used the SVM for binary text classification, | [
825,
993
] | Test |
2,651 | 5 | An Autonomous Spacecraft Agent Prototype . This paper describes the New Millennium Remote Agent (NMRA) architecture for autonomous spacecraft control systems. The architecture supports challenging requirements of the autonomous spacecraft domain not usually addressed in mobile robot architectures, including highly reliable autonomous operations over extended time periods in the presence of tight resource constraints, hard deadlines, limited observability, and concurrent activity. A hybrid architecture, NMRA integrates traditional real-time monitoring and control with heterogeneous components for constraint-based planning and scheduling, robust multi-threaded execution, and model-based diagnosis and reconfiguration. Novel features of this integrated architecture include support for robust closed-loop generation and execution of concurrent temporal plans and a hybrid procedural/deductive executive. We implemented a prototype autonomous spacecraft agent within the architecture and successfully demonstrated the prototype in the c... | [] | Validation |
2,652 | 4 | The Conceptual Basis for Mediation Services Mediator modules comprise a layer of intelligent middleware services in information systems, linking data resources and application programs. Earlier programs that led to the concept of mediation were either constructed to support specific applications or provided extended services from databases. Intelligent mediators are being built now by careful domain knowledge acquisition and hand crafting the required code. In this paper we present the conceptual underpinning for automating the mediation process. Automation does not extend to fully automatic code generation, since additional knowledge is necessary to provide added value. The generation concept is based on the extraction of a hierarchical domain model out of the general network representing the available resources. Associated with the method are domain ontologies. Ontologies list the terms used by the models, and document their relationships. These terms provide the semantic foundation needed to perform the generation. This paper... | [
406,
1609,
1808
] | Test |
2,653 | 4 | Mixed-Initiative Interaction spect of effective multiagent collaboration to solve problems or perform tasks. In our minimal human-computer configuration, such tasks could include systems designed to interact with a user to design a kitchen, find the best airfare, coordinate an emergency relief mission, or teach the user how to use new equipment. Mixed-initiative refers to a flexible interaction strategy, where each agent can contribute to the task what it does best. Furthermore, in the most general cases, the agents' roles are not determined in advance, but opportunistically negotiated between them as the problem is being solved. At any one time, one agent might have the initiative---controlling the interaction---while the other works to assist it, contributing to the interaction as required. At other times, the roles are reversed, and at other times again the agents might be working independently, assisting each other only when specifically asked. The agents dynamically adapt their interaction st | [
2261
] | Train |
2,654 | 3 | Extracting Structures of HTML Documents Using a High-Level Stack Machine Information on the Web, which are conglomeration of heterogeneous data such as texts, images and audio clips, are often accessed through documents written according to the HTML specification [7]. According to the HTML specification, HTML documents are semistructured in nature. We propose a high-level stack machine (HSM) which accesses an HTML document through its URL and constructs a semistructured data graph (SDG) of the document. The SDG of an HTML document H precisely captures the structure of the semistructured data embedded in H based on the dependency relationship [11] among the data objects in H . HSM is configurable to accommodate a user's interest with respect to the HTML elements in H to be considered during the construction process of the SDG of H . 1 Introduction During the early days of the World-Wide Web (WWW or Web), users heavily relied on the mouse-button-click navigation method through hyperlinks provided by Web browsers to retrieve information of interest and soon ... | [
1394
] | Train |
2,655 | 1 | A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-three Old and New Classification Algorithms Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the case of trees) number of leaves. Classification accuracy is measured by mean error rate and mean rank of error rate. Both criteria place a statistical, spline-based, algorithm called POLYCLASS at the top, although it is not statistically significantly different from twenty other algorithms. Another statistical algorithm, logistic regression, is second and third with respect to the two accuracy criteria. The most accurate decision tree algorithm is QUEST with linear splits, which ranks fourth and fifth, respectively. Although spline-based statistical algorithms tend to have good accuracy, they also require relatively long training times. POLYCLASS, for example, is third last in terms of median training time. It often requires hours of training compared to seconds for other algorithms. The QUEST and logistic re... | [
1385
] | Train |
2,656 | 4 | Recognizing User's Context from Wearable Sensors: Baseline System INTRODUCTION We describe a baseline system for training and classifying natural situations. It is a baseline system because it will provide the reference implementation of the context classifier against which we can compare more sophisticated machine learning techniques. It should be understood that this system is a precursor to a system for understanding all types of observable context not just location. We are less interested in obtaining high precision and recall rates than we are in obtaining appropriate model structures for doing higher order tasks like clustering and prediction on a user's life activities. II. BACKGROUND There has been some excellent work on recognizing various kinds of user situations via wearable sensors. Starner [6] uses HMMs and omnidirectional and directional cameras to determine the user's location in a building and current action during a physical game. Aoki also uses a head mounted directional camera to d | [
217,
664,
1186,
1757
] | Train |
2,657 | 4 | Using Events for the Scalable Federation of Heterogeneous Components The thesis of this paper is that, using our eventbased development principles, components that were not designed to interoperate, can be made to work together quickly and easily. The only requirement is that each component must be made event-based by adding an interface for registering interest in events and an interface for injecting actions. A component notifies an event to a distributed client if the parameters of an event, internal to the component, match the parameters of a particular registration. Heterogeneous components can be federated using event-based rules; rules can respond to events from any component by injecting actions into any other component. We show that the event paradigm is scalable by illustrating how event-based components can be located worldwide, using a federation of event brokers. Additionally, we illustrate with 3 event-based systems we have developed: a component-based multimedia system, a multi-user virtual worlds system and an augmented reality system for mobile users. Finally, we show how the event paradigm is also scalable enough to allow event federation of entire systems, not just single components. We illustrate by showing how we have federated the operation of the 3 featured eventbased systems. This enables, for example, real-world mobile users to appear as avatars in the appropriate locations in the VR world, and for these avatars to move in response to actual user movements. | [
27,
1893
] | Train |
2,658 | 2 | Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data We present conditional random elds, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hidden Markov models and stochastic grammars for such tasks, including the ability to relax strong independence assumptions made in those models. Conditional random fields also avoid a fundamental limitation of maximum entropy Markov models (MEMMs) and other discriminative Markov models based on directed graphical models, which can be biased towards states with few successor states. We present iterative parameter estimation algorithms for conditional random fields and compare the performance of the resulting models to HMMs and MEMMs on synthetic data. 1. Introduction The need to segment and label sequences arises in many different problems in several scientific fields. Hidden Markov models (HMMs) and stochastic grammars are well understood and widely used probabilistic models for such problems. I... | [
932,
2446,
2522,
2898
] | Train |
2,659 | 0 | UML for Behavior-Oriented Multi-Agent Simulations Developing multi-agent simulations seems to be rather straight forward, as active entities in the original correspond to active agents in the model. Thus plausible behaviors can be produced rather easily. However, for real world applications they must satisfy some requirements concerning verification, validation and reproducibility. Using a standard framework for designing a multi-agent model one can gain further advantages like fast learnability, wide understandability and possible transfer. | [
1297,
2309
] | Train |
2,660 | 2 | Node Similarity in Networked Information Spaces Netvorked information spaces contain information entities, corresponding to nodes, vhich are (:orlrle(:l.ed [)y associm.i(ms, (:or'r'esporldirlg 1.o links irl (.he nel.wor'k. Exarrq)les of nel.wor'ked information spaces are: the World Wide Web, vhere information entities are veb pages, and associations are hyperlinks; the scientific literature, vhere information entities are articles and associations are references to other articles. SimilariW betveen information entities in a net- vorked information space can be defined not only based on the content of the information entities, but also based on the connectivity established by the associations present. This paper explores the definition of similariW based on connectivity only, and proposes several algorithms [)r' I, his [mr'pose. Our' rrlei, r'i(:s I,ake mJvard,age o[' I, he local rleigh[)or'hoo(ts o[' I, he rmcJes irl I, he rlel,- is no required, as long as a query engine is available for fo]]oving ]inks and extracting he necessary local neighbourhoods for similarity estimation. Tvo variations of similarity estimation beveen vo nodes are described, one based on he separate local neighbourhoods of he nodes, and another based on he join local neighbourhood expanded from boh nodes a he same ime. The algorithms are imp]emened and evaluated on he citation graph of computer science. The immediate application of his vork is in finding papers similar o a given paper [he Web. | [
2503
] | Train |
2,661 | 2 | Visual Web Information Extraction with Lixto We present new techniques for supervised wrapper generation and automated web information extraction, and a system called Lixto implementing these techniques. Our system can generate wrappers which translate relevant pieces of HTML pages into XML. Lixto, of which a working prototype has been implemented, assists the user to semi-automatically create wrapper programs by providing a fully visual and interactive user interface. In this convenient user-interface very expressive extraction programs can be created. Internally, this functionality is reflected by the new logicbased declarative language Elog. Users never have to deal with Elog and even familiarity with HTML is not required. Lixto can be used to create an "XML-Companion" for an HTML web page with changing content, containing the continually updated XML translation of the relevant information. 1 | [
118,
1150,
1393,
2772,
2857,
3053
] | Validation |
2,662 | 2 | Recent Publications of the "Multimedia Information Access" Research Group elligence, pages 7--35, Buenos Aires, AR, 1999. [ Straccia, 1997a ] Umberto Straccia. A four-valued fuzzy propositional logic. In Proceedings of IJCAI-97, 15th International Joint Conference on Artificial Intelligence, pages 128--133, Nagoya, JP, 1997. [ Straccia, 1997b ] Umberto Straccia. A sequent calculus for reasoning in four-valued description logics. In Proceedings of TABLEAUX-97, International Conference on Analytic Tableaux and Related Methods, pages 343--357, Pont-a-Mousson, FR, 1997. Published in the "Lecture Notes in Computer Science" series, number 1227, Springer Verlag, Heidelberg, DE. [ Straccia, 1998 ] Umberto Straccia. A fuzzy description logic. In Proceedings of AAAI-98, 15th Conference of the American Association for Artificial Intelligence, pages 594--599, Madison, US, 1998. [ Straccia, 1999 ] Umberto Straccia. Four-valued fuzzy description logics for representing multimedia objects content. In Fabio Crestani and Ga | [
1715,
2454
] | Train |
2,663 | 2 | An Evaluation of Statistical Approaches to Text Categorization Abstract. This paper focuses on a comparative evaluation of a wide-range of text categorization methods, including previously published results on the Reuters corpus and new results of additional experiments. A controlled study using three classifiers, kNN, LLSF and WORD, was conducted to examine the impact of configuration variations in five versions of Reuters on the observed performance of classifiers. Analysis and empirical evidence suggest that the evaluation results on some versions of Reuters were significantly affected by the inclusion of a large portion of unlabelled documents, mading those results difficult to interpret and leading to considerable confusions in the literature. Using the results evaluated on the other versions of Reuters which exclude the unlabelled documents, the performance of twelve methods are compared directly or indirectly. For indirect compararions, kNN, LLSF and WORD were used as baselines, since they were evaluated on all versions of Reuters that exclude the unlabelled documents. As a global observation, kNN, LLSF and a neural network method had the best performance; except for a Naive Bayes approach, the other learning algorithms also performed relatively well. | [
760,
1085,
1295,
2424,
2597,
2676,
3115
] | Train |
2,664 | 5 | Simulated Annealing Algorithms For Continuous Global Optimization INTRODUCTION In this paper we consider Simulated Annealing algorithms (SA in what follows) applied to continuous global optimization problems, i.e. problems with the following form f = min x2X f(x); (1.1) where X ` ! n is a continuous domain, often assumed to be compact, which, combined with the continuity or lower semicontinuity of f , guarantees the existence of the minimum value f . SA algorithms are based on an analogy with a physical phenomenon: while at high temperatures the molecules in a liquid move freely, if the temperature is slowly decreased the thermal mobility of the molecules is lost and they form a pure crystal which also corresponds to a state of minimum energy. If the temperature is decreased too quickly (the so called quenching) a liquid metal rather ends up in a polycrystalline or amorphous state with | [] | Train |
2,665 | 2 | Ontobroker: Or How to Enable Intelligent Access to the WWW . The World Wide Web (WWW) is currently one of the most important electronic information sources. However, its query interfaces and the provided reasoning services are rather limited. Ontobroker consists of a number of languages and tools that enhance query access and inference service in the WWW. It provides languages to annotate web documents with ontological information, to represent ontologies, and to formulate queries. The tool set of Ontobroker allows us to access information and knowledge from the web and to infer new knowledge with an inference engine based on techniques from logic programming. This article provides several examples that illustrate these languages and tools and the kind of service that is provided. We also discuss the bottlenecks of our approach that stem from the fact that the applicability of Ontobroker requires two time-consuming activities: (1) developing shared ontologies that reflect the consensus of a group of web users and (2) annotating we... | [
728,
1019,
1683,
1821,
2054
] | Validation |
2,666 | 2 | Semantic Web Services hose properties, capabilities, interfaces, and effects are encoded in an unambiguous, machine-understandable form. The realization of the Semantic Web is underway with the development of new AI-inspired content markup languages, such as OIL, 3 DAML+OIL (www.daml.org/2000/10/daml-oil), and DAML-L (the last two are members of the DARPA Agent Markup Language (DAML) family of languages). 4 These languages have a well-defined semantics and enable the markup and manipulation of complex taxonomic and logical relations between entities on the Web. A fundamental component of the Semantic Web will be the markup of Web services to make them computer-interpretable, use-apparent, and agent-ready. This article addresses precisely this component. We present an approach to Web service markup that provides an agent-independent declarative API capturing the data and metadata associated with a service together with specifications of its pro | [
249,
697,
2236
] | Train |
2,667 | 0 | Secure Meeting Scheduling with Agenta When people want to schedule a meeting, the agendas of the participants must be compared to nd a time suitable for all of them. However, at the same time participants want to keep their agendas private. This paper presents a negotiation protocol which tries to solve this contradiction. The protocol is implemented in the agenTa system using mobile software agents, hereby alleviating communication overhead and allowing disconnected operation. Keywords: mobile agents, secure distributed computation, meeting scheduling 1. | [
1166
] | Train |
2,668 | 5 | Damasio, Descartes, Alarms and Meta-management This paper discusses some of the requirements for the control architecture of an intelligent human-like agent with multiple independent dynamically changing motives in a dynamically changing only partly predictable world. The architecture proposed includes a combination of reactive, deliberative and meta-management mechanisms along with one or more global "alarm" systems. The engineering design requirements are discussed in relation our evolutionary history, evidence of brain function and recent theories of Damasio and others about the relationships between intelligence and emotions. 1. INTRODUCTION Stan Franklin, the organiser of this symposium, wrote "Minds are the control structures of autonomous agents" [5, p 412]. The claim that minds are essentially concerned with control, echoing the seminal ideas of Norbert Wiener [16] is one with which I strongly concur though as argued in [11], we need to go far beyond the early idea of control systems with fixed architecture and changes on... | [
1996
] | Train |
2,669 | 0 | A Framework for Linking Distributed Simulations Using Software Agents This paper presents the basic ideas behind the use of software agent technology for distributed simulation and data assimilation. A software agent is an autonomous computer program that operates on behalf of someone or something. A mobile agent has the ability to migrate during execution from machine to machine in a heterogeneous network, while a stationary agent executes only on the system on which it began execution. | [
2310,
2553
] | Train |
2,670 | 2 | ScholOnto: An Ontology-Based Digital Library Server for Research Documents and Discourse . The internet is rapidly becoming the first place for researchers to publish documents, but at present they receive little support in searching, tracking, analyzing or debating concepts in a literature from scholarly perspectives. This paper describes the design rationale and implementation of ScholOnto, an ontology-based digital library server to support scholarly interpretation and discourse. It enables researchers to describe and debate via a semantic network the contributions a document makes, and its relationship to the literature. The paper discusses the computational services that an ontology-based server supports, alternative user interfaces to support interaction with a large semantic network, usability issues associated with knowledge formalization, new work practices that could emerge, and related work. 2 1 Introduction It is becoming standard practice for researchers to publish their documents on the internet (or intranets), via personal, institutional and discipline-spe... | [
356,
1736
] | Train |
2,671 | 0 | Alarms: An implementation of motivated agency . Autonomous agents in the real world must be capable of asynchronous goal generation. However, one consequence of this ability is that the agent may generate a substantial number of goals, but only a small number of these will be relevant at any one time. Therefore, there is a need for tractable mechanisms to manage a changing and potentially large number of goals. This paper presents both a framework for the design of agents that have the capability to generate and manage their own top level goals, "motivated agency", and an implementation of part of this agent architecture, "alarms". The alarm-processing machinery serves to focus the attention of an agent on a limited number of the most salient goals regardless of the number of possible goals that the agent can pursue or their distribution in time. In this way, a resource-bounded autonomous agent can employ modern planning methods to greater effect. 1 Introduction If an autonomous agent is required to interact with an environment t... | [
491
] | Train |
2,672 | 4 | Forms/3: A First-Order Visual Language to Explore the Boundaries of the Spreadsheet Paradigm Although detractors of functional programming sometimes claim that functional programming is too difficult or counterintuitive for most programmers to understand and use, evidence to the contrary can be found by looking at the popularity of spreadsheets. The spreadsheet paradigm, a first-order subset of the functional programming paradigm, has found wide acceptance among both programmers and end users. Still, there are many limitations with most spreadsheet systems. In this paper, we discuss language features that eliminate several of these limitations without deviating from the first-order, declarative evaluation model. The language used to illustrate these features is a research language called Forms/3. Using Forms/3, we show that procedural abstraction, data abstraction, and graphics output can be supported in the spreadsheet paradigm. We show that, with the addition of a simple model of time, animated output and GUI I/O also become viable. To demonstrate generality, we also presen... | [
1918,
2975
] | Train |
2,673 | 4 | Is Paper Safer? The Role of Paper Flight Strips in Air Traffic Control Air traffic control is a complex, safety-critical activity, with well-established and successful work practices. Yet many attempts to automate the existing system have failed because controllers remain attached to a key work artifact: the paper flight strip. This article describes a four-month intensive study of a team of Paris en route controllers in order to understand their use of paper flight strips. The article also describes a comparison study of eight different control rooms in France and the Netherlands. Our observations have convinced us that we do not know enough to simply get rid of paper strips, nor can we easily replace the physical interaction between controllers and paper strips. These observations highlight the benefits of strips, including qualities difficult to quantify and replicate in new computer systems. Current thinking offers two basic alternatives: maintaining the existing strips without computer support and bearing the financial cost of limiting the air traff... | [
1832,
2147
] | Validation |
2,674 | 5 | A Probabilistic Formulation for Hausdorff Matching Matching images based on a Hausdorff measure has become popular for computer vision applications. However, no probabilistic model has been used in these applications. This limits the formal treatment of several issues, such as feature uncertainties and prior knowledge. In this paper, we develop a probabilistic formulation of image matching in terms of maximum likelihood estimation that generalizes a version of Hausdorff matching. This formulation yields several benefits with respect to previous Hausdorff matching formulations. In addition, we show that the optimal model position in a discretized pose space can be located efficiently in this formation and we apply these techniques to a mobile robot self-localization problem. 1 Introduction The use of variants of the Hausdorff distance has recently become popular for image matching applications (see, for example, [6, 9, 11, 16, 18, 19]). While these methods have been largely successful, they have lacked a probabilistic formulation of th... | [
1330,
2253
] | Validation |
2,675 | 2 | Learning Similarity for Texture Image Retrieval A novel algorithm is proposed to learn pattern similarities for texture image retrieval. Similar patterns in different texture classes are grouped into a cluster in the feature space. Each cluster is isolated from others by an enclosed boundary, which is represented by several support vectors and their weights obtained from a statistical learning algorithm called support vector machine (SVM). The signed distance of a pattern to the boundary is used to measure its similarity. Furthermore, the patterns of different classes within each cluster are separated by several sub-boundaries, which are also learned by the SVMs. The signed distances of the similar patterns to a particular sub-boundary associated with the query image are used for ranking these patterns. Experimental results on the Brodatz texture database indicate that the new method performs significantly better than the traditional Euclidean distance based approach. | [
832,
1119
] | Train |
2,676 | 1 | Machine Learning and Natural Language Processing In this report, some collaborative work between the fields of Machine Learning (ML) and Natural Language Processing (NLP) is presented. The document is structured in two parts. The first part includes a superficial but comprehensive survey covering the state--of--the--art of machine learning techniques applied to natural language learning tasks. In the second part, a particular problem, namely Word Sense Disambiguation (WSD), is studied in more detail. In doing so, four algorithms for supervised learning, which belong to different families, are compared in a benchmark corpus for the WSD task. Both qualitative and quantitative conclusions are drawn. This document stands for the complementary documentation for the conference "Aprendizaje autom 'atico aplicado al procesamiento del lenguaje natural", given by the author within the course: "Curso de Industrias de la Lengua: La Ingenier'ia Lingu'istica en la Sociedad de la Informaci'on", Fundaci'on Duques de Soria. Soria. July 2000. 1 Con... | [
16,
739,
751,
759,
784,
1066,
1279,
1386,
1446,
1836,
2068,
2100,
2469,
2513,
2641,
2663,
2808,
2898,
2961
] | Train |
2,677 | 3 | On the Expressivity and Complexity of Temporal Conceptual Modelling The contribution of this paper is twofold. On the one hand, it introduces T DLR, a novel temporal logic for temporal conceptual modelling, motivated as the obvious generalisation of the successful DLR Description Logic. Tight decidability and complexity results are proved for T DLR and the monodic fragment of it (T DLR ). Moreover, the decidability of conjunctive query containment under T DLR constraints is proved. On the other hand, the paper provides a formal semantic characterisation of all the important temporal conceptual modelling constructs (for valid time representation) as found in the literature. To the best of our knowledge, this is the first systematic formalisation of the constructs present in most temporal conceptual modelling systems. This systematic characterisation as T DLR theories is an evidence of the adequacy of the T DLR temporal Description Logic for temporal conceptual modelling. 1 Introduction In this paper the novel T DLR temporal logic is introduced... | [
262,
2289,
2789,
2888
] | Test |
2,678 | 3 | Abduction with Negation as Failure for Active and Reactive Rules . Recent work has suggested abductive logic programming as a suitable formalism to represent active databases and intelligent agents. In particular, abducibles in abductive logic programs can be used to represent actions, and integrity constaints in abductive logic programs can be used to represent active rules of the kind encountered in active databases and reactive rules incorporating reactive behaviour in agents. One would expect that, in this approach, abductive proof procedures could provide the engine underlying active database management systems and the behaviour of agents. We analyse existing abductive proof procedures and argue that they are inadequate in handling these applications. The inadequacy is due to the inappropriate treatment of negative literals in integrity constraints. We propose a new abductive proof procedure and give examples of how this proof procedure can be used to achieve active behaviour in (deductive) databases and reactivity in agents. Final... | [
872,
1325
] | Test |
2,679 | 4 | Smart Playing Cards: A Ubiquitous Computing Game Abstract. Recent technological advances allow for turning parts of our everyday environment into so–called smart environments. In this paper we present the “Smart Playing Cards ” application, a ubiquitous computing game that augments a classical card game with information–technological functionality, in contrast to developing new games around the abilities of available technology. Furthermore, we present the requirements such an application makes on a supporting software infrastructure for ubiquitous computing. | [
1464,
2137
] | Train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.