Proceedings 11th International Conference on Tools with Artificial Intelligence

9-11 Nov. 1999

Filter Results

Displaying Results 1 - 25 of 66
  • Proceedings 11th International Conference on Tools with Artificial Intelligence

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1999, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s): 445
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • SAMON: communication, cooperation and learning of mobile autonomous robotic agents

    Publication Year: 1999, Page(s):229 - 236
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    The Applied Research Laboratory Penn State University “Ocean SAmpling MObile network” (SAMON) Project is developing the simulation testbed for the oceanographic communities interactions through the Web interface and the simulation based design of Autonomous Ocean Sampling Program missions. In this paper, a current implementation of the SAMON is presented, and a formal model based on in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal basis for consistency, evolution and rationale management in requirements engineering

    Publication Year: 1999, Page(s):77 - 84
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    This paper presents a formal framework that addresses the twin problems of inconsistencies in requirements specifications and requirements evolution. It presents techniques (building on results from the areas of default reasoning and belief revision) for identifying maximal consistent subsets of a specification rendered inconsistent by a change step, with provision for retaining requirements that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Removing node and edge overlapping in graph layouts by a modified EGENET solver

    Publication Year: 1999, Page(s):218 - 223
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Graph layout problems, such as node and edge overlapping, occur widely in many industrial computer-aided design applications. Usually, these problems are handled in an ad-hoc manner by some specially designed algorithms. GENET and its extended model EGENET are local search models that are used to efficiently solve constraint satisfaction problems such as the car-sequencing problems. Both models us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new GA approach for the vehicle routing problem

    Publication Year: 1999, Page(s):307 - 310
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    This paper focuses on the study of a hybrid of two search heuristics, tabu search (TS) and genetic algorithms (GA) in the vehicle routing problem with time-windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, a GA which is capable of searching multiple search areas in a search space is good for diversification. We inves... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using an artificial intelligence approach to build an automated program understanding/fault localization tool

    Publication Year: 1999, Page(s):69 - 76
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Artificial intelligence techniques and architectures have played a large role in the design of a blackboard-based program understanding/fault localization tool we have been developing. We focus on a system knowledge source called the plan processor which will have artificial intelligence support for two of its major tasks. One task is to retrieve a set of program plans from a plan library using in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VERITAS-an application for knowledge verification

    Publication Year: 1999, Page(s):441 - 444
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Knowledge management is one of the most important goals of any organization. Therefore, several automatic tools are used for that purpose, e.g. Knowledge Based Systems (KBS), Experts Systems, Data Mining Applications and Computer Aided Decision Systems. The validation and verification (V&V) process is fundamental in order to ensure the quality of used knowledge. The usage of automatic verifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the fine structure of large search spaces

    Publication Year: 1999, Page(s):197 - 201
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    Recently, there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, often outperform deterministic strategies. In this paper, we relate the performance of randomized methods to the geometric properties of the underlying search space. In particular, our study reveals the inherent fractal n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal trend identification with fuzzy methods

    Publication Year: 1999, Page(s):332 - 335
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    A fuzzy logic-based methodology for online signal trend identification is introduced. Although signal trend identification is complicated by the presence of noise, fuzzy logic can help capture important features of online signals and classify incoming power plant signals into increasing, decreasing and steady-state trend categories. In order to verify the methodology, a code named PROTREN is devel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neurules: improving the performance of symbolic rules

    Publication Year: 1999, Page(s):417 - 424
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    In this paper, we present a method for improving the performance of classical symbolic rules. This is achieved by introducing a type of hybrid rules, called neurules, which integrate neurocomputing into the symbolic framework of production rules. Neurules are produced by converting existing symbolic rules. Each neurule is considered as an adaline unit, where weights are considered as significance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge representation and reasoning support for modeling and querying video data

    Publication Year: 1999, Page(s):167 - 174
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    Describes a knowledge-based approach for modelling and retrieving video data. Selected objects of interest in a video sequence are described and stored in a database. This database forms the object layer. On top of this layer, we define the schema layer that is used to capture the structured abstractions of the objects stored in the object layer. We propose two abstract languages on the basis of d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring of aircraft operation using statistics and machine learning

    Publication Year: 1999, Page(s):279 - 286
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    This paper describes the use of statistics and machine learning techniques to monitor the performance of commercial aircraft operation. The purpose of this research is to develop methods that can be used to generate reliable and timely alerts so that engineers and fleet specialists become aware of abnormal situations in a large fleet of commercial aircraft that they manage. We introduce three appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based approach for interpreting medical images

    Publication Year: 1999, Page(s):129 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    We present an agent-based approach for medical image interpretation. The system is based on the concept of active fusion for image recognition and is composed of two major types of intelligent agents: radiologist agents and patient representative agents. A patient representative agent takes images from the patient through a Web-based interface, asks for multiple opinions from radiologist agents in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HOT: heuristics for oblique trees

    Publication Year: 1999, Page(s):91 - 98
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    This paper presents a new method (HOT) of generating oblique decision trees. Oblique trees have been shown to be useful tools for classification in some problem domains, producing accurate and intuitive solutions. The method can be incorporated into a variety of existing decision tree tools and the paper illustrates this with two very distinct tree generators. The key idea is a method of learning ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the use of genetic algorithms in database client clustering

    Publication Year: 1999, Page(s):339 - 342
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    In conventional two-tier client-server databases, clients access and modify shared data resident in a common server. As the number of clients increases, the centralized database server can become a performance bottleneck. In order to overcome this scalability problem, a three-tier client-server configuration has been proposed that features the partitioning of clients into logical clusters. Here, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving hard satisfiability problems: a unified algorithm based on discrete Lagrange multipliers

    Publication Year: 1999, Page(s):210 - 217
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    Presents improved strategies in DLM-99-SAT (Discrete Lagrange Multipliers 1999, Satisfiability) to escape from traps and to select proper parameter sets to use when applied to solve some difficult but satisfiable SAT problems. One of the main issues in DLM-99-SAT is that it has a large number of tunable parameters, making it difficult to determine the best parameters to use when given a new instan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controlled flux results in stable decision trees

    Publication Year: 1999, Page(s):287 - 295
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillations between similar concepts decrease learning speed. We introduce a heuristic and an algorithm with theoretical and experimental backing to tackle this problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capturing user access patterns in the Web for data mining

    Publication Year: 1999, Page(s):345 - 348
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    Existing methods for knowledge discovery in the Web are mostly server-oriented and approaches taken are affected by the use of proxy servers. As a result, it is difficult to capture individual Web user behavior from the current log mechanism. As an effort to remedy this problem, we develop methods for design and implementation of an access pattern collection server to conduct data mining in the We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile robotics planning using abstract Markov decision processes

    Publication Year: 1999, Page(s):299 - 306
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Markov decision processes have been successfully used in robotics for indoor robot navigation problems. They allow the computation of optimal sequences of actions in order to achieve a given goal, accounting for actuator uncertainties. However, MDPs are unsatisfactory at avoiding unknown obstacles. On the other hand, reactive navigators are particularly adapted to that, and don't need any prior kn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring requirements specifications through goals interactions

    Publication Year: 1999, Page(s):61 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    One of the foci of the recent developments in requirements engineering has been the study of conflicting requirements. However, there is no systematic way in the existing approaches to handling the interactions among requirements and their impact on the structuring of requirement specifications. In this paper, a new approach is proposed to formulate the requirement specifications based on goal int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained simulated annealing with applications in nonlinear continuous constrained global optimization

    Publication Year: 1999, Page(s):381 - 388
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    This paper improves constrained simulated annealing (CSA), a discrete global minimization algorithm with asymptotic convergence to discrete constrained global minima with probability one. The algorithm is based on the necessary and sufficient conditions for discrete constrained local minima in the theory of discrete Lagrange multipliers. We extend CSA to solve nonlinear continuous constrained opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cognitive packet networks

    Publication Year: 1999, Page(s):47 - 54
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    We propose cognitive packet networks (CPN) in which intelligent capabilities for routing and flow control are concentrated in the packets, rather than in the nodes and protocols. Cognitive packets within a CPN route themselves. They are assigned goals before entering the network and pursue these goals adaptively. Cognitive packets learn from their own observations about the network and from the ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the sufficiency of limited testing for knowledge based systems

    Publication Year: 1999, Page(s):431 - 440
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration missions. Yet, if one is concerned with the reliability of knowledge based systems, studies indicate significant disagreement regarding the amount of testing needed for system assessment. The sizes of standard black-box tes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.