By Topic

Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on

Date 26-28 Nov. 2008

Go

Filter Results

Displaying Results 1 - 25 of 129
  • [Front cover - Vol 3]

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (886 KB)  
    Freely Available from IEEE
  • [Title Page i - Volume 3]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (17 KB)  
    Freely Available from IEEE
  • [Title page iii - Volume 3]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (90 KB)  
    Freely Available from IEEE
  • [Copyright notice - Volume 3]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (108 KB)  
    Freely Available from IEEE
  • Table of contents - Volume 3

    Page(s): v - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (128 KB)  
    Freely Available from IEEE
  • Preface - Volume 3

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (61 KB)  
    Freely Available from IEEE
  • Committees - Volume 3

    Page(s): xv - xx
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • Cryptanalysis of ID-Based Digital Signature Scheme on Elliptic Curve Cryptosystem

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

    Nowadays, digital signature schemes are widely used in electronic commerce. Thus, various digital signature schemes are proposed to make the electronic transactions more convenient. In 2007, Chung et al. proposed an ID-based digital signature scheme on elliptic curve cryptosystem (ECC). They claimed that their scheme is secure because it is based upon the difficulty of elliptic curve discrete logarithm problem (ECDLP). However, we find that their scheme has a security flaw, and thus we propose a feasible attack on Chung et al.psilas scheme in this paper. The proposed attack is based on the technique for solving the linear Diophantine equation. Using the proposed technique, an attacker can easily obtain the signer's secret key without facing the difficulty of ECDLP. Therefore, Chung et al.'s scheme cannot prevent from our attack such that it is not secure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Customer Privacy Protection Protocol on Agent-Based Electronic Commerce Transaction

    Page(s): 6 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (333 KB) |  | HTML iconHTML  

    Mobile agent technology is going to play an important role in the future electronic commerce due to the characteristics of mobility and autonomy of the agents. Therefore, security issues should be solved before we use this new technology. However, privacy protection of customers is seldom considered. In this paper, we focus on the privacy protection of customers. Moreover, we improve our scheme more feasible to the modern world. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fair-Use DRM System Based on Web Service

    Page(s): 11 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (510 KB) |  | HTML iconHTML  

    The National Institute of Standards and Technology give the following definition: "Digital rights management is a system of information technology components and services along with corresponding law, policies and business models which strives to distribute and control intellectual property and its right." However, most existing DRM systems are designed for powerful protection. The portability of rights is restricted by close confinement of the DRM protection mechanism. The user's fair use rights are being violated. In this paper we propose a protocol to achieve the fair use by using virtual software token. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Proxy Signature in ECDSA

    Page(s): 17 - 22
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (175 KB) |  | HTML iconHTML  

    DSA and ECDSA are two standard signatures, which have been fully discussed and well accepted. However, they both lack functionality of proxy signature. On the other hand, most of the proxy signature schemes, which have been proposed prior to this date, are seldom based on standard signatures. Consequently, most proxy signature schemes have been considered infeasible due to obvious security weaknesses. In this work, we propose a proxy-protected signature scheme based on ECDSA to satisfy the basic properties of partial delegation proxy signature described by Mambo et al. as well as strong proxy signature properties defined by Lee et al. Moreover, an example of practical usage of the proposed schemes is offered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lock-Based Protocol for XML Metadata Knowledge Bases

    Page(s): 23 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (166 KB) |  | HTML iconHTML  

    Enhancing transactional performance for XML metadata knowledge bases (XMKBs) is crucial, as XML is widely used to describe metadata in knowledge bases for data integration. In XMKBs, XML elements, attributes, and texts illustrate knowledge entities' types and contents, while the parent/child and ID/IDREF(s) relationships state the associations among knowledge entities. XML documents in XMKBs exhibit graphical structures, and yield knowledge entities which can be accessed via multiple paths. Several XML concurrency control protocols have been proposed for accessing XML documents. However, they treat XML documents as trees with no regard to the ID/IDREF(s) relationships used in the documents. These existing protocols are thus not applicable to XMKBs. In this paper, a new XML concurrency control protocol, namely XMP, is proposed for XMKBs. The novel feature of XMP is to model XML documents as XML graphs, where both graphical structures and operation access behaviors in XMKBs are considered. Our simulation results show the high concurrency of XMP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Key-Dependent Compressed Domain Audio Hashing

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

    Perceptual audio hashing has been applied in audio content identification, retrieval and indexing for its accuracy and perceptual robustness. Security issue becomes important when perceptual hashing is applied in audio content authentication. A key-dependent compressed domain perceptual audio hashing algorithm for audio content authentication is proposed. A randomization scheme controlled by a random seed is applied in hash generation for random feature selection and post randomization. The hash function is key-dependent and collision free. Meanwhile, the randomization has little effect on robustness. The hash value is invariant to content preserving operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LMSS: A Location-Based Multimedia Service System Using Wireless Networks

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

    With the development of pervasive computing, location information remains a crucial component of context-aware. The ability to provide multimedia service according to users' locations would be attractive for intelligent tourism, shopping guide, etc. In this paper, we present a prototype system for location-based multimedia service as a guideline to design such application systems. Based on this prototype system, we implement a location-based multimedia service system called LMSS in real world, which is able to provide individualized multimedia service according to mobile users' locations. We describe the overall system architecture of LMSS and interpret its different components. The performance of our system are evaluated in Wi-Fi wireless environment to show its effectivity. LMSS realizes precise location estimation algorithms which can achieve an accuracy within 1-5 m and supplies mobile users with intelligent video service by utilizing the location information. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency Spectrum Prediction Method Based on EMD and SVR

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

    Support vector regression (SVR) is now a well-established method for non-stationary series forecasting, because of its good generalization ability and guaranteeing global minima. However, only using SVR hardly get satisfied accuracy for complicated frequency spectrum prediction in frequency monitor system (FMS) of high frequency radar. Empirical mode decomposition (EMD) is perfectly suitable for nonlinear and non-stationary signal analysis. By using EMD, any complicated signal can be decomposed into several time series that have simpler frequency components and thus are easier and more accuracy to be forecasted. Therefore, in this paper, a novel prediction algorithm called EMD-SVR is proposed. Experiment results illustrate that EMD-SVR model significantly outperform conventional AR model and common SVR model in FMS frequency spectrum series prediction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Synchronous Drive System in Gantry-Moving Milling Machine Based on Dynamic Compensation and Fuzzy Control

    Page(s): 45 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (194 KB) |  | HTML iconHTML  

    The problem of the synchronous drive for gantry-moving milling machines is researched in the paper. Two same linear motors are used as drive mechanisms of synchronous feed. The dynamic compensated method is adopted, effectively limiting the falling of the system's performance which is produced by the changing of the equivalent inertia. At the same time, puting the fuzzy PID controller in the velocity loop of the system, effectively applying that fuzzy control is independent on the plant model and has the characteristic of the control fast and stronger robustness. The synchronous control precision is enhanced. The simulation results show that the performance of the system is better and the fast synchronous feed is implemented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced Self-Adaptive Search Capability Particle Swarm Optimization

    Page(s): 49 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (768 KB) |  | HTML iconHTML  

    A new particle swarm optimization characterized by sensation is presented to improve the limited capability of regular particle swarm optimization in exploiting history experience (iwPSO). It guides individuals to behave reasonably with the capability of self-adaptation in activities of self-cognition according to the sensation model. Considering the complexity of a swarm intelligent system at the level of sensation brings about optimization of the comprehensive capability of global, local searching and cooperating with each other. It is compared with the regular particle swarm optimizer (PSO) invented by Kennedy and Eberhart in 1995 based on three different benchmark functions. In the iwPSO proposed here, each particle adjusting the inertia weight omega value when its position changes, it enhances the search capability of single particle. The strategy here is to avoid the local minimum problems of PSO algorithm. Under all test cases, simulation shows that the iwPSO always finds better solutions than PSO. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of Permutations Based Upon Factorial Numbers

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

    In this paper, a new class of factorial calculus systems is proposed. Based upon the latter, simpler algorithms and electronic systems aiming at permutations generation, are developed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Bilevel Toll Assignment Problem by Penalty Function Algorithm

    Page(s): 62 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (219 KB) |  | HTML iconHTML  

    The paper develops an inexact penalty function method to solve a bi-level multi-commodity optimal tolls problem. After reducing the original problem to a single-level one by solving an auxiliary linear or quadratic programming problem, the said mathematical program's objective function is penalized and treated as an unconstrained minimization problem. Convergence of the proposed algorithm is also established. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inexact Newton Algorithm to Solve Nonlinear Complementarity Problems

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

    The paper describes a version of the inexact Newton algorithm to solve nonlinear complementarity problems (NCP). New classes of NCP are specified for which the inexact Newton method globally converges at the superlinear rate. Moreover, an inner step accuracy control technique is developed and applied to the inexact Newton method to optimize the total computational cost. Finally, two forms of implementation of the numerical procedure of the said algorithm are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Liberalization of Mexican Electricity Market: Various Modeling Approaches with Numerical Simulation Results

    Page(s): 72 - 76
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (212 KB) |  | HTML iconHTML  

    In this paper, we propose and analyze numerical experiments based upon the oligopolistic model of Mexican electricity market. Presently, the Mexican electricity market is presented by state regulated monopoly, so that a competition market is not yet established. Nevertheless, around 25% of the electricity is being produced by private firms. If they get the ability to offer it to the customers directly, we will find ourselves in oligopolistic-kind competition, various scenarios of which we will investigate in the paper, applying theoretical results previously obtained in. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fuzzy Temporal Model and Query Language for FTER Databases

    Page(s): 77 - 82
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (134 KB) |  | HTML iconHTML  

    In this paper, we propose a temporal extension to an extended ERT model and extend database temporal models to handle the fuzzy numbers. The concept of lifespan for entities and relationships is incorporated in the FTER model. We specify a fuzzy temporal query and update temporal language which is an extension from the TQuel language. The concepts of fuzzy temporal expressions, fuzzy temporal selection, fuzzy temporal join and fuzzy temporal projection are introduced, and their use in the query language is illustrated. We also discuss reducibility of the semantics to the language when applied to a static database and define the semantics of update operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Support Vector Machine with Fuzzy Hyper-Plane and Its Application to Evaluate Credit Risk

    Page(s): 83 - 88
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 KB)  

    Due to recent financial crises and regulatory concerns, financial intermediaries' credit risk assessment is an area of renewed interest in both the academic world and business community. Because in credit scoring areas we usually cannot label on customer as absolutely good who is sure to repay in time, or absolutely bad who will default certainly, in this paper, we apply a fuzzy membership to each input point and reformulate the optimization problem of SVM such that different input points can make different contributions to the learning of decision surface. Besides, the parameters to be identified in the SVM, such as the components within the weight vector and the bias term, are fuzzy numbers. This integration preserves the benefits of SVM learning theory and fuzzy set theory, where the SVM learning theory characterizes the properties of learning machines which enable them to effectively generalize the unseen data and the fuzzy set theory might be very useful for finding a fuzzy structure in an evaluation system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FPGA-Realization of Adaptive Fuzzy Controller for the Linear X-Y Table

    Page(s): 89 - 94
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (666 KB) |  | HTML iconHTML  

    This study presents an adaptive fuzzy controller for linear X-Y table based on FPGA (Field Programmable Gate Array) technology. The linear X-Y table is driven by two PMLSMs (Permanent Magnet Linear Synchronous Motors). Firstly, a mathematic modeled for PMLSM drive is defined. Secondly, to increase the performance of the PMLSM drive system, an AFC (Adaptive Fuzzy Controller) constructed by a fuzzy basis function and a parameter adjustable mechanism is derived and applied to the position control loop of drive system in x-axis table and y-axis table to cope with the effect of the system dynamic uncertainty and external load. Thirdly, the overall AFC and other circuits for the motion controller of linear X-Y table are implemented by a single FPGA. Finally, an experimental system is set up to evaluate the performance of the controller system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Self-Organizing Map Applying the "Survival of the Fittest Type" Learning Algorithm

    Page(s): 95 - 100
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (158 KB) |  | HTML iconHTML  

    The self-organizing map that Kohonen has proposed maps high-dimensional vector data to low-dimensional space by phase conservation. And, it generates the feature map that visually catches the similarity among data. In addition, the reference vector where the unit in a competitive layer of SOM is achieved can interpolate an intermediate vector of the input vector data. In the pattern recognition of the class label, SOM that adds the class label to the element of the pattern and learns is especially called to be the supervised SOM. We propose SOM based on the survival of the fittest type learning algorithm to solve the problem of the delay and the over-training. As a result, the learning of the survival of the fittest type becomes possible, a needless node is excluded, and the probability density function can be presumed by the optimal number of nodes. View full abstract»

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