By Topic

Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on

Date 3-5 Nov. 2003

Filter Results

Displaying Results 1 - 25 of 91
  • A biology inspired neural learning algorithm for analysing protein sequences

    Publication Year: 2003, Page(s):18 - 25
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB) | HTML iconHTML

    This paper presents a biology inspired neural learning algorithm called bio-basis function neural network (BBFNN) for analysing protein sequences. The basic principle is to replace radial basis functions of conventional radial basis function neural networks with amino acid similarity measurement matrices. From this, model complexity can be significantly reduced and hence model robustness can be en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating redundancies in SAT search trees

    Publication Year: 2003, Page(s):100 - 104
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most recent Boolean satisfiability solvers implement forms of conflict analysis, at least to some extent. In this paper, a branching criterion initially introduced by Purdom is revisited and extended. Contrary to the author's a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate discrete probability distribution representation using a multi-resolution binary tree

    Publication Year: 2003, Page(s):498 - 503
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representation of probability distributions is central in term of computational efficiency in the field of probabilistic reasoning. The main problem arises when dealing with joint probability distributions over a set of random variabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning of mediation strategies for heterogeneous agents cooperation

    Publication Year: 2003, Page(s):330 - 337
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    Making heterogeneous agents cooperate is still an open problem. We have studied the interaction between a human agent and an information service agent. Our approach is to introduce a mediator agent to formalize the requests of the users, according to their profile and then to give the relevant answers. The mediator must find the best mediation strategy (a sequence of interactions) with a Markov de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting conserved hairpin motifs in unaligned RNA sequences

    Publication Year: 2003, Page(s):10 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    Several experiments and observations have revealed the fact that small local distinct structural features in RNA molecules are correlated with their biological function, for example in post-transcriptional regulation of gene expression. Thus, finding similar structural features in a set of RNA sequences known to play the same biological function could provide substantial information concerning whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalization of classification rules

    Publication Year: 2003, Page(s):522 - 529
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    Traditional classification rules are in the form of production rules. Recent works in hybrid classification algorithms have proposed the generation of contextual rules, whereby the right-hand side of the production rule is replaced by a classifier, to achieve higher accuracy. In this work, we present a framework to further generalize classification rules such that the left-hand side of a productio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving nogood recording using 2SAT

    Publication Year: 2003, Page(s):94 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    Nogood recording is a dynamic learning technique widely applied to solve CSP (constraint satisfaction problems). It is highly effective in reducing the search space for SAT (satisfiability) problems. While SAT is NP-complete, the problem restricted to binary clauses (2SAT) is solvable in linear time. We can improve SAT solving by incorporating 2SAT solving techniques. In this paper we investigate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DOSE: a distributed open semantic elaboration platform

    Publication Year: 2003, Page(s):580 - 588
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (463 KB) | HTML iconHTML

    The paper proposes a distributed open semantic elaboration platform based on a modular multilingual enabled architecture, which includes ontology, annotations, lexical entities and search functions. The platform is implemented as a distributed set of services including: semantic annotations for document substructures (e.g. chapters, sections, paragraphs), an external annotation repository (based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive modeling of biochemical pathways

    Publication Year: 2003, Page(s):62 - 68
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    In bioinformatics, biochemical pathways can be modeled by many differential equations. It is still an open problem how to fit the huge amount of parameters of the equations to the available data. Here, the approach of systematically learning the parameters is necessary. In this paper, for the small, important example of inflammation modeling a network is constructed and different learning algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-layer protein structure comparison

    Publication Year: 2003, Page(s):435 - 440
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2117 KB) | HTML iconHTML

    Extracting biological importance from protein structures is extremely helpful to understand the molecular nature. Although methods for protein structure-based alignment have been hitherto proposed in a number of ways, each method focuses on a part of alignment possibility. We have developed a generic method for pair wise structure-based alignment utilizing the population search ability of a real-c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining the min-conflicts and look-forward heuristics to effectively solve a set of hard university timetabling problems

    Publication Year: 2003, Page(s):492 - 496
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    University timetabling problems (UTPs) represent a class of challenging, high-dimensional and multi-objectives combinatorial optimization problems that are commonly solved by constructive search, local search methods or their hybrids. In this paper, we proposed to combine the min-conflicts and look-forward heuristics used in local search methods to effectively solve general university timetabling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reinforcement learning with extended spatial and temporal learning scale

    Publication Year: 2003, Page(s):324 - 328
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    In this paper, extended learning scale is proposed to improve the efficiency of reinforcement learning. The learning scale is defined and its impact on the performance of learning is investigated. Based on the correlation of the spatial or temporal neighboring states, fuzzy state and ant colony optimization are incorporated into reinforcement learning for the extension of learning scale. In the si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pairwise protein structure alignment based on an orientation-independent representation of the backbone geometry

    Publication Year: 2003, Page(s):2 - 9
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    Determining structural similarities between proteins is an important problem since it can help identify functional and evolutionary relationships. In this paper, an algorithm is proposed to align two protein structures. Given the protein backbones, the algorithm finds a rigid motion of one backbone onto the other such that large substructures are matched. The algorithm uses a representation of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm calibration of probabilistic cellular automata for modeling mining permit activity

    Publication Year: 2003, Page(s):515 - 519
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and Western Montana. The genetic algorithm searches through a space of transition rule parameters of a two dimensional cellular automata model to find rule parameters that fit observed mining activity data. Previous work by one of the authors in calibrating... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MFSAT: a SAT solver using multi-flip local search

    Publication Year: 2003, Page(s):84 - 93
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (365 KB) | HTML iconHTML

    Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping the value of only one variable. Simultaneously flipping values of multiple variables on an iteration can allow a local search-based solver to take long leaps in the search space. We report on SAT solver MFSAT, which has nine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iCare - a user centric approach to the development of assistive devices for the blind and visually impaired

    Publication Year: 2003, Page(s):641 - 648
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1762 KB) | HTML iconHTML

    There are approximately 10 million blind and visually-impaired persons in the United States. As the information economy accounts for a larger percent of jobs, people who are blind face barriers when competing for jobs that require vision to access, absorb, and use information. While much research effort has been expended toward developing assistive devices for the blind, many of the technological ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of techniques for intrusion detection

    Publication Year: 2003, Page(s):570 - 577
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (287 KB) | HTML iconHTML

    Due to increasing incidents of cyber attacks and heightened concerns for cyber terrorism, implementing effective intrusion detection systems (IDSs) is an essential task for protecting cyber security--as well as physical security because of the great dependence on networked computers for the operational control of various infrastructures. Building effective IDSs, unfortunately, has remained an elus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a test-to-speech synthesizer to generate a reverse Turing test

    Publication Year: 2003, Page(s):226 - 232
    Cited by:  Papers (32)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    Recognition of synthesized speech by a diphone synthesizer is thought to be easy for a machine due to the small variation of the synthesized speech. In this paper, we report the recognition rate of synthesized utterances in a noisy environment. Our experiments show that the performance of a HMM recognizer is not too bad even in the presence of background noise. These recognition results nearly app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of software maintenance data using multi-technique approach

    Publication Year: 2003, Page(s):53 - 59
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    Amount of software engineering data that is accumulated by software companies grows with enormous speed. This data is a source of knowledge about different activities related to software development and maintenance. Many different techniques and tools have been developed and proposed for extracting knowledge and representing it in forms understandable by people. These techniques are based on diffe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object recognition using local-global graphs

    Publication Year: 2003, Page(s):616 - 627
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (482 KB) | HTML iconHTML

    This paper presents a methodology for object recognition using the local-global (L-G) graph approach. In particular, the L-G graph approach based on an image segmentation approach and synthesis of the regions that compose an object. The synthesis of regions is based on the L-G modeling that compares a set of L-G based object models sitting in an L-G Database. The methodology accurate for objects e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic programming-based decision trees for software quality classification

    Publication Year: 2003, Page(s):374 - 383
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (951 KB) | HTML iconHTML

    The knowledge of the likely problematic areas of a software system is very useful for improving its overall quality. Based on such information, a more focused software testing and inspection plan can be devised. Decision trees are attractive for a software quality classification problem which predicts the quality of program modules in terms of risk-based classes. They provide a comprehensible clas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sweep A: space-efficient heuristic search in partially ordered graphs

    Publication Year: 2003, Page(s):427 - 434
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    We describe a novel heuristic search algorithm, called Sweep A*, that exploits the regular structure of partially ordered graphs to substantially reduce the memory requirements of search. We show that it outperforms previous search algorithms in optimally aligning multiple protein or DNA sequences, an important problem in bioinformatics. Sweep A* also promises to be effective for other search prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query expansion and query reduction in document retrieval

    Publication Year: 2003, Page(s):552 - 559
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    We investigate two seemingly incompatible approaches for improving document retrieval performance in the context of question answering: query expansion and query reduction. Queries are expanded by generating lexical paraphrases. Syntactic, semantic and corpus-based frequency information is used in this process. Queries are reduced by removing words that may detract from retrieval performance. Feat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive stochastic search for solving constraint satisfaction problems

    Publication Year: 2003, Page(s):487 - 491
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    Stochastic search methods have attracted much attention of the constraint satisfaction problem (CSP) research community. Traditionally, a stochastic solver escapes from local optima or leaves plateaus by random restart or heuristic learning. In this paper, we propose the progressive stochastic search (PSS) and its variants for solving binary CSPs, in which a variable always has to choose a new val... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • All from one, one for all, failure diagnosis of discrete event system using representatives

    Publication Year: 2003, Page(s):208 - 212
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 KB) | HTML iconHTML

    Failure diagnosis in large and complex systems is a critical and challenging task. In the realm of model based diagnosis on discrete event systems, computing a failure diagnosis means computing the set of system behaviours that could explain observations. Depending on the diagnosed system, such behaviours can be numerous, so that a problem of representing them is induced. The paper discusses about... View full abstract»

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