By Topic

Intelligent Systems Design and Applications, 2007. ISDA 2007. Seventh International Conference on

Date 20-24 Oct. 2007

Filter Results

Displaying Results 1 - 25 of 166
  • Seventh International Conference on Intelligent Systems Design and Applications - Cover

    Save to Project icon | Request Permissions | PDF file iconPDF (219 KB)  
    Freely Available from IEEE
  • Seventh International Conference on Intelligent Systems Design and Applications - Title page

    Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (103 KB)  
    Freely Available from IEEE
  • Seventh International Conference on Intelligent Systems Design and Applications - Copyright

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • Seventh International Conference on Intelligent Systems Design and Applications - Table of contents

    Page(s): v - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • Welcome from the General Co-Chairs

    Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • Welcome from the Program Co-chairs

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (31 KB)  
    Freely Available from IEEE
  • Conference Committees

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (34 KB)  
    Freely Available from IEEE
  • Program Committee

    Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (36 KB)  
    Freely Available from IEEE
  • list-reviewer

    Page(s): xix
    Save to Project icon | Request Permissions | PDF file iconPDF (29 KB)  
    Freely Available from IEEE
  • Parallel Workshops

    Page(s): xx
    Save to Project icon | Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • Toward a Theory of Problem Solving Based on Resource Bounded Computation and Process Algebras

    Page(s): 3 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (138 KB) |  | HTML iconHTML  

    In 1995 Russell and Norvig presented a unified approach to AI as the area based on bounded rational agents using utilities to direct search for problem solving under bounded resources. This paper extends this work further in the direction of the computational theory targeting intractable and undecidable problems and based on resource bounded computation and process algebras. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Multi-agent System for Cooperative Dynamic Scheduling Through Meta-Heuristics

    Page(s): 9 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (189 KB) |  | HTML iconHTML  

    This paper describes a Hybrid Multi-agent Scheduling System that assumes the existence of several Agents (which are decision-making entities) distributed inside the Manufacturing System. To solve the scheduling problem, Machine Agents and Task Agents must interact and cooperate with other agents in order to obtain optimal or near-optimal global performances trough Meta-heuristics. The idea is that from local, autonomous and often conflicting agent's objectives, a global solution emerges from a community of machine agents solving locally their schedules while cooperating with other machine agents. Agents have to manage their internal behaviors and their relationships with other agents via cooperative negotiation in accordance with business policies defined by the user manager. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Deliberative Agents Using Object Oriented Petri Nets

    Page(s): 15 - 20
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (320 KB) |  | HTML iconHTML  

    Multi-agent systems are one of the prospect approaches to simplification of complex system development. They introduce a natural abstraction layer on top of autonomous actors. Since multi-agent systems are strongly parallel the appropriate paradigms or tools have to be used. This article will demonstrate the application of our developed kind of high-level Petri nets to the deliberative agent modeling and simulation. This formalism is called Object Oriented Petri Nets (OOPN). It introduces a powerful means for description of concurrency and a high level of system dynamism. Moreover, OOPNs are a part of a framework intended for simulation based design featuring model continuity. It means that a model developed incrementally in a simulated environment can become a part of target applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Intelligent System for Active Video Surveillance

    Page(s): 21 - 26
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (621 KB) |  | HTML iconHTML  

    In this paper we propose a new approach to active video surveillance intelligence systems based on the integration of artificial neural networks (ANN) and symbolic Artificial Intelligence (AI). In particular, the neurosymbolic hybrid system here presented is formed by virtual neural sensors (WiSARD-like systems) and BDI agents. The coupling of virtual neural sensors with symbolic reasoning for interpreting their outputs, makes this approach both very light from the computational and hardware point of view and quite robust in performances. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using an Evolutionary Agent-Based System for Classification Tasks

    Page(s): 27 - 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (129 KB) |  | HTML iconHTML  

    The ClassAge system is a multi-agent system for classification tasks. This system was proposed as an attempt to include the idea of intelligent agents in the structure of multi-classifier systems (MCSs). Also, it is aimed to overcome some drawbacks of MCSs and, as a consequence, to improve the performance of such systems. In this paper, an extension of ClassAge is presented. Basically, an optimization technique is used to optimize the functioning of ClassAge. Also, each ClassAge agent is composed of a group of classifiers, instead of one classifier that was used in the original version. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intention Structures Modelling Using Object Oriented Petri Nets

    Page(s): 33 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3966 KB)  

    This paper describes an approach to the object- oriented Petri nets usage in the area of intention-based systems. We would like to contribute in the field of intention based system with a formal model approach that would bring new capabilities of simulation, analysis and verification to the area of intelligent agents and multiagent systems. It is described here how intention structures could be made if they are built as a dynamic object-oriented Petri nets model and how execution of the agent's intention is performed in such models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Distributed-Shared Memory Mechanisms for Agents Communication in a Distributed System

    Page(s): 39 - 46
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (131 KB) |  | HTML iconHTML  

    In multi-agent systems, blackboard communication provides an easy way for agents to communicate. However, in a distributed architecture, the blackboard is commonly implemented in a single node, that is the "blackboard server". This approach may work well for a small number of agents. Nevertheless, when the number of agents increases, the blackboard server becomes the bottleneck for the system scalability. In this work we propose a novel agent communication system based on distributed-shared mechanisms that allows the implementation of a shared address space on a distributed system, without centralizing the blackboard. Our idea is to distribute the shared data over the nodes and use a message passing sub-system, totally transparent to the agents. We implemented this idea in a multi-agent system based on social laws, and used a distributed-shared memory system to handle the messaging. We created a conflict simulator, and showed that the distributed-shared mechanisms easy the implementation of a truly distributed blackboard. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Approach of Test for DAC Using Fuzzy Neural Networks

    Page(s): 47 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (124 KB)  

    Due to the existence of analogue signals, testing the mixed signal circuits is a complex and complicated one. D/A converters are one of the most important types of these circuits. In this paper, a method is presented to determine the points where faults are occurred in a 4-bit resistive ladder D/A converter, using fuzzy rules. For the purpose of implementing fuzzy rules, neural networks have been utilized. Also for improvement the fault coverage of this test method the LVQ neural network has been used. Firstly, the circuit has been simulated using ORCAD9 and then training patterns have been elicited. Continually, network simulation and training have been implemented via MATLAB6.1trade. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Constructive Self-Organizing Network Applied to a Discrete Optimization Problem

    Page(s): 52 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (135 KB) |  | HTML iconHTML  

    Most discrete optimization problems belong to the NP-complete or NP-hard classes. A benchmark problem to assess the performance of new heuristics to solve these classes of problems is the traveling salesman problem (TSP). This paper proposes some modifications on a self-organizing network, named RABNET- TSP, to solve TSP problems. The modified algorithm is compared, with encouraging results, to other proposals from the literature on a number of different TSP instances. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Hopfield Network-Simulated Annealing approach to Optimize Routing Processes in Telecommunications Networks

    Page(s): 58 - 63
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (171 KB) |  | HTML iconHTML  

    This article proposes a new hybrid technique to optimize an intelligent routing algorithm in telecommunications based on Hopfield Neural Networks (HNN) and Simulated Annealing (SA). The SA obtains the optimal parameters for Hopfield Neural Networks. The optimization was carried out considering as performance criterion a combination of (1) the error of the HNN routing algorithm as applied to find the shortest path between two nodes, and (2) the number of iterations employed by the HNN algorithm to find the shortest path. By using this approach better results have been achieved, with lower number of iterations and smaller error rates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pruning the Multilayer Perceptron through the Correlation of Backpropagated Errors

    Page(s): 64 - 69
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (185 KB) |  | HTML iconHTML  

    In this paper we introduce an efficient methodology for pruning unnecessary weights of a trained multilayer Perceptron (MLP). The proposed method is based on the correlation analysis of the errors produced by the output neurons and the backpropagated errors associated with the hidden neurons. Weight connections for which the correlations are smaller than a user-defined error tolerance are discarded. The successive application of this weight pruning methodology leads eventually to the complete elimination of all connections of a neuron. Extensive computer simulations using synthetic and real-world data indicate that the proposed method present better or equivalent results than standard pruning techniques, such as the Optimal Brain Surgeon (OBS) and Weight Decay and Elimination (WDE), with much lower computational costs. We also show that the resulting optimal architecture matches that provided by Akaike's Information Criterion (AIC). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploration of Relations between Symbolic and Conexionist Techniques of Computational Intelligence

    Page(s): 70 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (254 KB) |  | HTML iconHTML  

    This work addressed a contribution to the Computational Intelligence field, focused on two of its main techniques: Fuzzy and Neural Computing. An exploration of the techniques relations was performed. A framework for simulations and data collecting was specified and implemented. Computational simulations of transformations between fuzzy and neural models were realized and the results analyzed are presented in this paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Agile Infrastructure for Manufacturing System with FNN Based Web-Enabled Technology Solutions

    Page(s): 79 - 83
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (238 KB) |  | HTML iconHTML  

    The Agile Manufacturing and Agile Supply Chain Management can input the vigor into Manufacturing Industry, i.e. Garments Industry, and help to increase its ability for the good return, can promote the level of technology and management of the industry fiom a labor intensive industry, and can move it toward the accurate and agile management. But before that, you have to be an Agile Manufacturing Enterprise. So it's very necessary to construct an Agile Infrastructure for Manufacturing System (AIMS), which can help its members changing to be an Agile Enterprise, a platform that named Comprehensive Information Platform by our research team. In this paper, we discuss some of the details of Comprehensive Information Platform (CIP) including relationship of its Main Functions, structure of CIP, and Some Key Enabled Technology of Agile Infrastructure, such as, Load Balance Scheduling Model and Intrusion Detection System (IDS) Model. All technical details touched upon obtained satisfying performance in practically. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing Intelligence Augmentation System with a Semiotic-Oriented Software Development Process

    Page(s): 84 - 89
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (333 KB)  

    In this paper, the authors describe the first steps of a semiotic-oriented software development process called "Brainmerge" [1], and present a case study where the process is used to coordinate the steps required for the design of a locomotive and car assignment system, modeled as an Intelligence Augmentation Systems (IAS). IAS represent an extension of Decision Support Systems (DSS) [2] with the use of Peircean semiotics [4], intelligence augmentation techniques [3], computational agents [5] and usually dynamic decision making processes (DDMP). IAS are suitable for DDMP Traditional software methodologies are usually inefficient when dealing with IAS, and our methodology aims at fulfilling these shortcomings. This work considers the resolution of a real world problem of tactical planning in railroads where such DDMP play a key role. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-Based Price Negotiation System for Electronic Commerce

    Page(s): 90 - 93
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (133 KB) |  | HTML iconHTML  

    With the rapid development of electronic commerce, more and more people begin to go shopping on the Internet at present. Price negotiation has become increasingly important for two reasons. One is from a consumer's view price negotiation provides an opportunity to debate the price, the other is from a vendor's view the ability to price negotiation allows for flexibility in pricing that a rigidly fixed price cannot offer. An obstacle of hindering the development of electronic commerce is that price negotiation on the Internet is not different like shopping in store. In this paper, the author wants to design an agent-based price negotiation system for electronic commerce. It can replace the seller to negotiate with the buyers on the Internet. Firstly we put forward a framework of agent- based price negotiation, then we propose a price negotiation model based on equilibrium theory of game theory. Finally, the paper describes the behavior definition of agent and explains the rules how to communicate between agents. View full abstract»

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