By Topic

Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294)

10-12 Nov. 1998

Filter Results

Displaying Results 1 - 25 of 62
  • Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (465 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1998, Page(s):482 - 483
    Request permission for commercial reuse | PDF file iconPDF (108 KB)
    Freely Available from IEEE
  • Diagnostics of dynamical systems by recognizing the default and abnormal pattern

    Publication Year: 1998, Page(s):354 - 358
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    Diagnostic problems are proposed to be solved via the pattern recognition approach. The main example has been motivated by economic macro modelling, hence a reference model approach is adopted. The dynamic systems under consideration are assumed to be linear in three case studies and nonlinear in one case study. All four case studies illustrate the basic concept of this approach. Since the state v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet-based signal approximation with multilevel learning algorithms using genetic neuron selection

    Publication Year: 1998, Page(s):344 - 351
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    Neural networks based on wavelets are constructed to study the function learning problems. Two types of learning algorithms, the overall multilevel learning (OML) and the pyramidal multilevel learning (PML) with genetic neuron selection are comparatively studied for the convergence rate and accuracy using data samples of a piecewise defined signal. Moreover, the two algorithms are examined using o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image segmentation using a generic, fast and non-parametric approach

    Publication Year: 1998, Page(s):450 - 458
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    We investigate image segmentation by region merging. Given any similarity measure between regions, satisfying some weak constraints, we give a general predicate for answering if two regions are to be merged or not during the segmentation process. Our predicate is generic and has six properties. The first one is its independence with respect to the similarity measure, that leads to a user-independe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lagrangian reconstruction of a class of local search methods

    Publication Year: 1998, Page(s):166 - 175
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    Heuristic repair algorithms, a class of local search methods, demonstrate impressive efficiency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). We draw a surprising connection between heuristic repair techniques and the discrete Lagrange multiplier methods by transforming CSPs into zero-one constrained optimization problems. A Lagrangian-based search sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KJ3-a tool for proving formal specifications of rule-based expert systems

    Publication Year: 1998, Page(s):310 - 317
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    KJ3 is the first system which incorporates theorem proving techniques with the Petri Net description scheme for knowledge validation of rule based systems (RBSs). By converting the validation tasks of RBSs to reachability problems of Enhanced High-level Petri Net (EHLPN), KJ3 performs validation by proving if the hypothetical reachability problem is true. The establishment of the hypothesis corres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast similarity search in databases of 3D objects

    Publication Year: 1998, Page(s):16 - 23
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Given a database D of three dimensional (3D) objects and a target object Q, the similarity search problem (also known as good-match retrieval) is defined as finding the objects D in D that approximately match Q, possibly in the presence of rotation, translation, node insert, delete and relabeling in D or Q. This type of query arises in many AI applications. We study the similarity search problem a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building a hierarchical representation of membership functions

    Publication Year: 1998, Page(s):236 - 241
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Deriving inference rules from training examples is one of the most common machine-learning approaches. Fuzzy systems that can automatically derive fuzzy if-then rules and membership functions from numeric data have recently been developed. In this paper, we propose a new hierarchical representation for membership functions, and design a procedure to derive them. Experimental results on the Iris da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The guided genetic algorithm and its application to the generalized assignment problem

    Publication Year: 1998, Page(s):336 - 343
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The Guided Genetic Algorithm (GGA) is a hybrid of genetic algorithm (GA) and meta-heuristic search algorithm, Guided Local Search (GLS). It builds on the framework and robustness of GA, and integrating GLS's conceptual simplicity and effectiveness to arrive at a flexible algorithm well meant for constraint optimization problems. GGA adds to the canonical GA the concepts of a penalty operator and f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Saving space: a unified approach for representing and reasoning over different qualitative spatial relations

    Publication Year: 1998, Page(s):440 - 447
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A unified framework is presented for representation and reasoning over qualitative spatial relations. The approach builds on our earlier formalism for handling topological relations (B. El-Geresy, 1997; B. El-Geresy and A. Abdelmoty, 1997). It is shown how the formalism proposed is expressive enough to represent different types of relations in the orientation space, namely, extrinsic and intrinsic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FPNES: fuzzy Petri net based expert system for bridges damage assessment

    Publication Year: 1998, Page(s):302 - 309
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    A framework of integrated expert systems based on fuzzy Petri net, called fuzzy Petri net based expert system (FPNES) are proposed for bridge damage assessment. Major features of FPNES include: reasoning for uncertain and imprecise information; knowledge representation through the use of hierarchical fuzzy Petri nets; reasoning mechanism based on fuzzy Petri nets; and explanation of reasoning proc... View full abstract»

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

    Publication Year: 1998, Page(s):423 - 430
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Default logic is a prominent rigorous method of reasoning with incomplete information based on assumptions. It is a static reasoning approach, in the sense that it doesn't reason about changes and their consequences. On the other hand, its nonmonotonic behaviour appears when a change to a default theory is made. This paper studies the dynamic behaviour of default logic in the face of changes, a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining cellular genetic algorithms and local search for solving satisfiability problems

    Publication Year: 1998, Page(s):192 - 198
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    A new parallel hybrid method for solving the satisfiability problem that combines cellular genetic algorithms and the random walk (WSAT) strategy of GSAT is presented. The method, called CGWSAT, uses a cellular genetic algorithm to perform a global search on a random initial population of candidate solutions and a local selective generation of new strings. Global search is specialized in local sea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic and distributed anytime task scheduling

    Publication Year: 1998, Page(s):280 - 287
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Scheduling techniques have been intensively studied by several research communities and have been applied to a wide range of applications in computer and manufacturing environments. Most of the scheduling problems are NP-hard. Therefore, heuristics and approximation algorithms must be used for large problems. Obviously these methods are of interest when they provide near optimal solutions and when... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis improvement of Takagi-Sugeno fuzzy rules using convexity constraints

    Publication Year: 1998, Page(s):232 - 235
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    We present a modification of the GTS (Generalized Takagi-Sugeno) model (Fiordaliso, 1996). The key idea is to constrain the conclusions of each rule to perform a convex combination of the input patterns. This constraint allows to interpret each rule as an input patterns mixer and therefore contributes to a better understanding of the system inference View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical study of Mandarin Chinese discourse analysis: an event-based approach

    Publication Year: 1998, Page(s):466 - 473
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Discourse analysis plays an important role in natural language understanding. Mandarin Chinese discourse, which has many different properties compared with English discourse, is still far behind in the construction of a basic computational model. We propose an event model to elucidate anaphora and ellipsis in Mandarin Chinese. An event based approach (EBA) based on the model is designed to resolve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Molecular binding in structure-based drug design: a case study of the population-based annealing genetic algorithms

    Publication Year: 1998, Page(s):328 - 335
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The molecular binding problem, one of the most important problems in structure based drug design, can be formulated as a global energy optimization problem by using molecular mechanics. A novel computational algorithm is proposed to address the molecular binding problem. The algorithm is derived from genetic algorithms (GA) plus simulated annealing (SA) hybrid techniques, namely population based a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic-fuzzy knowledge-integration strategies

    Publication Year: 1998, Page(s):250 - 255
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    We propose a GA based fuzzy knowledge integration framework that can simultaneously integrate multiple fuzzy rule sets and their membership function sets. The proposed approach includes fuzzy knowledge encoding and fuzzy knowledge integration. In the encoding phase, each fuzzy rule set with its associated membership functions is first transformed into an intermediary representation, and further en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PHYSIMC: an intelligent assistant for case-based learning

    Publication Year: 1998, Page(s):296 - 301
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The paper presents the design and implementation of PHYSIMC, which supports case based learning of elementary physics in a computer assisted simulation environment. The PHYSIMC system facilitates physics problem solving by providing: 1) a user friendly interface for problem specification via direct manipulation of physical objects; 2) 2D motion simulation of primitive physical objects; 3) a case l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fuzzy information retrieval method using fuzzy-valued concept networks

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

    We present a fuzzy information retrieval method based on fuzzy-valued concept networks, where the relevant degree between any two concepts in a fuzzy-valued concept network is represented by arbitrary shapes of fuzzy numbers. There are two kinds of relevant relationships between any two concepts in a fuzzy-valued concept network (i.e., fuzzy positive association and fuzzy negative association). In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Search strategies for reasoning about spatial ontologies

    Publication Year: 1998, Page(s):418 - 422
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The utilization of spatial ontologies to representing and reasoning about real-world problems exhibits some advantages when compared with traditional approaches. Namely reification, flexibility, efficiency and process understanding are considerably improved. However, the search mechanism, which underlies the reasoning process, always has exponential complexity, mainly because real-world problems p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-level learning algorithm for multilayer neural networks

    Publication Year: 1998, Page(s):97 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    A two-level learning algorithm that decomposes multilayer neural networks into a set of sub-networks is presented. Many popular optimization methods, such as conjugate-gradient and quasi-Newton methods, can be utilized to train these sub-networks. In addition, if the activation functions are hard-limiting functions, the multilayer neural networks can be trained by the perceptron learning rule in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A weight analysis-based wrapper approach to neural nets feature subset selection

    Publication Year: 1998, Page(s):89 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    This paper presents a novel attribute selection approach for backprop neural networks. Previously, an attribute selection technique known as the wrapper model was shown effective for decision tree induction. However, it is prohibitively expensive when applied to real-world neural net training characterized by large volumes of data and many attribute choices. Our approach incorporates a weight anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool based on concepts used in knowledge representation, to facilitate application design

    Publication Year: 1998, Page(s):375 - 382
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    This work is at the boundary between knowledge representation and application design. We want to define a method to design an object schema from examples. We had to improve clustering algorithms used in knowledge representation (they build a hierarchy of classes from examples), so that they can manage additional problems encountered in application design. We have carried out four main improvements... View full abstract»

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