By Topic

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
  • Fast and efficient searching of multimedia databases using holographic memory

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

    With the ever-expanding size of multimedia databases it is important to seek new technologies that improve the performance of systems that manage these databases. One such technology is holographic memory which has some very interesting attributes such as massive parallelism, high speed, and content searching. A volume holographic database system (VHDS) serves as a building block for a postulated ... 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 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.
  • Search strategies for hybrid search spaces

    Publication Year: 1999, Page(s):359 - 364
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource constraints and probabilistic information into account. The mixed integer programming (MIP) paradigm from operations research provides a natural tool for solving optimization problems that combine such numeric and non-nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamical cognitive network-an extension of fuzzy cognitive map

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

    We present a dynamic cognitive network (DCN) which is a systematic extension of the fuzzy cognitive map (FCM). Each concept in a dynamic cognitive network can have its own value set, depending on how precisely it needs to be described in the network. This enables the dynamic cognitive network to describe the strength of the cause and the degree of the effect. This ability also enables DCN to carry... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SAMON: communication, cooperation and learning of mobile autonomous robotic agents

    Publication Year: 1999, Page(s):229 - 236
    Cited by:  Papers (5)
    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.
  • Efficiently detecting arbitrary shaped clusters in image databases

    Publication Year: 1999, Page(s):187 - 194
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Image databases contain data with high dimensions. Finding interesting patterns in these databases poses a very challenging problem because of the scalability, lack of domain knowledge and complex structures of the embedded clusters. High dimensionality adds severely to the scalability problem. In this paper, we introduce WaveCluster+, a novel approach to apply wavelet-based techniques ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining typhoon knowledge with neural networks

    Publication Year: 1999, Page(s):325 - 326
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    Neural network technology has not been fully utilised in data mining. There are two reasons for this. Firstly, most neural algorithms need long-term training, and cannot perform incremental learning. Secondly, the knowledge learned by neural networks is concealed within a large quantity of connections. We have develop a neural network method to mine typhoon knowledge which overcomes those two obst... 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.
  • Examplar-based prototype selection for a multi-strategy learning system

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

    Multistrategy learning (MSL) consists of combining at least two different learning strategies to bring out a powerful system, where the drawbacks of the basic algorithms are avoided. In this scope, instance-based learning (IBL) techniques are often used as the basic component. However, one of the major drawbacks of IBL is the prototype selection problem which consists in selecting a subset of repr... 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.
  • A new study on using HTML structures to improve retrieval

    Publication Year: 1999, Page(s):406 - 409
    Cited by:  Papers (8)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    Locating useful information effectively form the World Wide Web (WWW) is of wide interest. This paper presents new results on a methodology of using the structures and hyperlinks of HTML documents to improve the effectiveness of retrieving HTML documents. This methodology partitions the occurrences of terms in a document collection into classes according to the tags in which a particular term appe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autonomous filter engine based on knowledge acquisition from the Web

    Publication Year: 1999, Page(s):343 - 344
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    For a long time filtering data has been a very important matter. With the growth of the Internet this question has become more and more pressing. Everyone knows that finding information is not always very easy, because of the large amount of data that the network contains. More generally, our concern here is not only to find what is interesting to download but also to avoid what is unsuitable. One... 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.
  • An architecture for designing distributed spoken dialogue interfaces

    Publication Year: 1999, Page(s):245 - 252
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    A spoken dialogue interface allows a user to interact with a computer application using speech. The user engages in a conversation with the application to achieve some goal, for example to obtain travel information or to book theatre tickets. In this paper, we describe an architecture and development environment for designing distributed spoken dialogue interfaces. A distributed spoken dialogue in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic scheduling benchmark: design, implementation and performance evaluation

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

    Puzzles have traditionally been used as popular benchmarks for evaluating different problem solving strategies. Many of the game benchmarks are suitable for evaluating static scheduling techniques. In such benchmarks, the scheduling phase and the execution phase (i.e. when the schedule is executed to play the game) are disjoint. The scheduling technique can be executed to compute a complete schedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial color histograms for content-based image retrieval

    Publication Year: 1999, Page(s):183 - 186
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    The color histogram is an important technique for color image database indexing and retrieval. In this paper, the traditional color histogram is modified to capture the spatial layout information of each color, and three types of spatial color histograms are introduced: annular, angular and hybrid color histograms. Experiments show that, with a proper trade-off between the granularity in the color... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using knowledge-based system with hierarchical architecture to guide the search of evolutionary computation

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

    Regional knowledge is determined by function's fitness landscape patterns, such as basins, valleys and multi-modality. Furthermore, for constrained optimization problems, the knowledge of feasible/infeasible regions can also be regards as regional knowledge. Therefore, it would be very helpful if there were a general tool to allow for the representation of regional knowledge, which can be acquired... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a deductive reasoning model and method for uncertainty

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

    Discusses a problem of deduction with uncertainty that has been dealt with by various diagnostic expert systems. First, we propose a mathematical framework of deductive reasoning with uncertainty. The subject of the reasoning is the calculation of conditional probabilities. Second, we establish a new reasoning method. Our deduction algorithm can compute the conditional probabilities precisely. To ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An expert system for multiple emotional classification of facial expressions

    Publication Year: 1999, Page(s):113 - 120
    Cited by:  Papers (16)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    This paper discusses the Integrated System for Facial Expression Recognition (ISFER), which performs facial expression analysis from a still dual facial view image. The system consists of three major parts: a facial data generator, a facial data evaluator and a facial data analyser. While the facial data generator applies fairly conventional techniques for facial feature extraction, the rest of th... 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.
  • Dynamic email organization via relevance categories

    Publication Year: 1999, Page(s):399 - 405
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    Many researchers have proposed classification systems that automatically classify email in order to reduce information overload. However, none of these systems are in use today. This paper examines some of the problems with classification technologies and proposes Relevance Categories as a method to avoid some of these problems. In particular, the dynamic nature of email categories, the cognitive ... View full abstract»

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