By Topic

Computational Intelligence and Design (ISCID), 2011 Fourth International Symposium on

Date 28-30 Oct. 2011

Go

Filter Results

Displaying Results 1 - 25 of 107
  • [Front cover - Vol 2]

    Publication Year: 2011 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (745 KB)  
    Freely Available from IEEE
  • [Title page i - Volume 2]

    Publication Year: 2011 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (33 KB)  
    Freely Available from IEEE
  • [Title page iii - Volume 2]

    Publication Year: 2011 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (397 KB)  
    Freely Available from IEEE
  • [Copyright notice - Volume 2]

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

    Publication Year: 2011 , Page(s): v - xi
    Save to Project icon | Request Permissions | PDF file iconPDF (158 KB)  
    Freely Available from IEEE
  • Preface - Volume 2

    Publication Year: 2011 , Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Conference Committees - Volume 2

    Publication Year: 2011 , Page(s): xiii - xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (71 KB)  
    Freely Available from IEEE
  • Reviewers - Volume 2

    Publication Year: 2011 , Page(s): xv - xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (129 KB)  
    Freely Available from IEEE
  • Sponsors - Volume 2

    Publication Year: 2011 , Page(s): xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (50 KB)  
    Freely Available from IEEE
  • A Novel MPPT Control Technology Based on Cloud Model for Photovoltaic Power Generation

    Publication Year: 2011 , Page(s): 3 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (202 KB) |  | HTML iconHTML  

    The cloud model is a mathematical representation to fuzziness and randomness in linguistic concepts, and integrates the fuzziness and randomness of a linguistic concept in a unified way. This model is a new method for transformation between qualitative and quantitative in the knowledge. In this paper, through analysis of the output of the nonlinear characteristics of PV cells the cloud model will applies to photovoltaic system maximum power point tracking control. The article is designed solar photovoltaic maximum power point tracking (MPPT) method based on cloud model. Simulation result shows that the cloud controller is simple and easy, directly perceived through the senses, and has strong robustness, better control performance, and good application. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast Dynamic Invulnerability Algorithm

    Publication Year: 2011 , Page(s): 7 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (427 KB) |  | HTML iconHTML  

    This paper outlines a multicast dynamic invulnerability algorithm, which is implemented and be combined by dynamic calculation and FRR (Fast Rerouting).The global network topology information is immediately acquired and the corresponding backup is established to protect the fault tree branches, when the current routing is fault. This algorithm can realize real-time protection for dynamic path and it will save a lot of routing resources in the small failure probability network topology. This paper mainly analyzes and designs the realizing process, invulnerability link failures protection and node failure protection of multicast dynamic invulnerability algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design and Building of Metadata Model in XBRL Taxonomy Engineering

    Publication Year: 2011 , Page(s): 11 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (244 KB) |  | HTML iconHTML  

    XBRL is the latest technology used in processing accounting information. The core part of XBRL is the creation and application of taxonomy. XBRL taxonomy engineering is a special case of software engineering. From the software engineering perspective, the result of the design phase in XBRL taxonomy is the metadata model and the result of the building phase is XBRL element definition converted from the metadata model. In this paper, the main tasks and implementation steps of both phases are detailed, which will provide theoretical guidance for the standardization of taxonomy creation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bifurcation of Limit Cycles of a Perturbed Quadratic Reversible System

    Publication Year: 2011 , Page(s): 15 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (283 KB) |  | HTML iconHTML  

    Bifurcation of limit cycles of a perturbed quadratic reversible system is investigated by using both qualitative analysis and numerical exploration. The investigation is based on detection functions which are particularly effective for the perturbed quadratic reversible system. The study reveals that, the system has 3 limit cycles. By using method of numerical simulation, the distributed orderliness of the 3 limit cycles is observed, and their nicety places are determined. The study also indicates that each of the 3 limit cycles passes the corresponding nicety point. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Lithographic Accuracy Using Image Registration Technology

    Publication Year: 2011 , Page(s): 19 - 22
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (389 KB) |  | HTML iconHTML  

    In order to improve lithographic accuracy, an image registration method based on spatial moments is suggested in this paper. First, match the reference image and the floating one using Fourier descriptors. This step is coarse matching. Second, locate edge accurately using spatial moments method and extract corner points. Finally, match the tow images according to the corner points extracted. This step is refine match. Experimental results show that accuracy of sub-pixel edge location can reach to 0.09 pixel and that of image registration can reach to 0.1 pixel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method of Combining HSSE-tree and Binary Label to Compute All Minimal Hitting Sets

    Publication Year: 2011 , Page(s): 23 - 26
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (203 KB) |  | HTML iconHTML  

    Computing all minimal hitting sets (MHSs) is a key step of model-based diagnosis. A novel method to compute all MHSs called Binary-label HSSE is put forward, which combines HSSE-tree and binary label. In the method, binary digits is used to mark the real elements of the nodes, and effective pruning and expanding strategies are used to avoid the main problem of HSSE-tree, the explosive growth of the expanded nodes and supersets of MHSs along with the dimension of the problems. Additionally, computing between binary digits can avoid the traverse of every element in a node when judging whether the node is a MHS, which also contributes to the significant decrease of the run time. At last, the data structure of Binary-label HSSE is changed to dynamic array from dynamic linked list, which further decreases the run time of the method. Simulation results show that Binary-label HSSE method costs much less space and time than HSSE-tree method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Identity-Based Parallel Key-Insulated Signature Scheme without Random Oracles

    Publication Year: 2011 , Page(s): 27 - 30
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (182 KB) |  | HTML iconHTML  

    To allow frequent key-updates without increasing the risk of helper key-exposure, Hanaoka et al. proposed parallel key-insulated mechanism where distinct helpers are independently used in key updates. In this paper, we propose a new identity-based parallel key-insulated signature scheme which is provably secure without resorting to the random oracle methodology. Compared with the known identity-based parallel key-insulated signature (IBPKIS) scheme secure in the standard model, our scheme enjoys more efficient verification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Color Transfer Algorithm Based on Neighborhood Correlation and Optimization Techniques

    Publication Year: 2011 , Page(s): 31 - 34
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (387 KB) |  | HTML iconHTML  

    The traditional Welsh's grayscale image colorization method for color transferring is based on pixel's luminance information only. The method generally cannot ensure the continuity of image transferring effect in space. This paper presents a color transfer algorithm based on neighborhood correlation and optimization techniques, which not only considers neighborhood's luminance information but also makes full use of colored pixel's color information. The algorithm automatically produces the initial colorized image via a color transfer method, removes the color information of pixel that is completely different from neighborhood pixels to form the regions of color seed and then use some optimization techniques to complete the colorization process by diffusing the distribution of color seed to the corresponding regions of image. Experimental results show that the new algorithm improves the drawback of the Welsh's algorithm, and the color of the result image is more natural and delicate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Study of Data Collecting Based on Kprobe

    Publication Year: 2011 , Page(s): 35 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (283 KB) |  | HTML iconHTML  

    API traces have been used to analyze user behaviour and system software behaviour for years, which lead to advances in file system and storage technologies. We describe the implementation of a lightweight and dynamic API collecting tool which calls Trace_probe in this paper. Trace_probe can trace information of the kernels. It based on kprobe mechanism which is implemented in the 2.6 linux kernel and later versions. This tool is designed to be a mount/unmount module, and its characteristics are simple and lightweight. While it works, it will not affect the normal operations of the users. Further experiments show Trace_probe has some advantags in terms of application limitationen and performance degradation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Fault Diagnosis of Civil Aircraft Based on AFPN

    Publication Year: 2011 , Page(s): 39 - 42
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (258 KB) |  | HTML iconHTML  

    As the knowledge in the fault diagnosis of civil aircraft is dynamic and uncertain, a method based on the Adaptive Fuzzy Petri Net(APFN) is proposed to solve the problem. AFPN not only takes the descriptive advantages of fuzzy Petri net, but also has learning ability like neural network. By this mean, firstly set up a fuzzy Petri net using the fuzzy production rule. Then the parameters of the fuzzy Petri net are trained by BP learning algorithm. At last, when the weights of the fuzzy Petri net are fixed, the fault origin can be found through the fault inference. At the end of the paper, an experiment is designed to demonstrate that the approach is feasible and effective in fuzzy reasoning. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of an Improved Neural Network to Flood Forecasting of the Lower Yellow River

    Publication Year: 2011 , Page(s): 43 - 46
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (363 KB) |  | HTML iconHTML  

    Considering seasonal feature of the flood events, a nonlinear perturbation model based on Artificial Neural Network is developed. The model structure is similar to that of the Linear Perturbation Model. The deference is that ANN, instead of linear response function, was used to simulate the unknown relationship between the input perturbing terms and the output perturbing terms. The reach from Huayuankou to Sunkou, located in the lower yellow river, is selected to test flood forecasting with this model. The proposed model was also compared with the LPM model and ANN model. It was found that the NLPM-ANN model was significantly more efficient than the original linear perturbation model. The results demonstrate that the relationship between the perturbations is high nonlinearity though subtracting the seasonal means and ANN is capable to simulate the relationship. The results also indicate that considering the seasonal information can improve the model efficiency. Subtracting the seasonal means, which adopted in the LPM, is also a feasible way to reduce the system complexity and improve the model efficiency of ANN models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding Method and Application for Complicated River Network Based on Surveyed River Network

    Publication Year: 2011 , Page(s): 47 - 50
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (316 KB) |  | HTML iconHTML  

    The paper takes National Topographic Database by assuming vector diagram water system with 1:250,000 scale as a data source. A reasonable and efficient coding method for river network is presented, which can solve the coding problem of converged river network, bifurcate river network, crossed river network and water of lake and reservoir. The coding method can reflect the topology of river network and can locate any stream segment of river network directly and operate the topology of river network effectively. At the last, this coding method is applied to parts of stream segments in Taihu Lake basin. As the results, the coding method is made by the paper can solve the coding problem of complicated river network, the upstream-downstream relationship can be easily identified through the coding of stream segment, the self-replicating coding has excellent expansibility and high efficiency, and can be handled easily by the computer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm Design of Inter-satellite Routing Based on Fibonacci Heap

    Publication Year: 2011 , Page(s): 51 - 54
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (304 KB) |  | HTML iconHTML  

    As the satellites are limited by the deficient hardware resources and the difficulty of upgrading, the application of inter-satellite dynamic routing has been restricted. Meanwhile, the rapid changes of the satellites dynamic network topology caused by satellites' high-speed movement require a highly efficient static routing algorithm. By fully considering the characteristics of sparse edges of the satellite network, an inter-satellite routing algorithm obtaining a good time boundary is analyzed and proposed in this paper based on Fibonacci heap. Firstly, this paper introduces an inter-satellite network topology by using walk constellation and describes the network with the nod-arc-directed line mode. Further, to improve the Dijkstra algorithm, a method implementing the priority queue whose node value can be decreased is proposed. By analyzing the complexity of the algorithm and comparing different simulation results, this paper proves that the remarkable improvement in the conveniences and efficiency for the inter-satellite routing can be achieved through Dijkstra algorithm by using Fibonacci heap structure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path Planning for UCAV in Dynamic and Uncertain Environments Based on Focused D* Algorithm

    Publication Year: 2011 , Page(s): 55 - 58
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1457 KB) |  | HTML iconHTML  

    According to less attention has been paid to the problem of path planning in partially know environment. An improved Focused D* algorithm is proposed for solving the problem that three-dimensional path planning for Unmanned Combat Aerial Vehicle (UCAV) in dynamic and uncertain environments with both pop-up and unknown threat. First, a grid model of configuration space were constructed which combination of terrain and threat information. Then, the approach could update the environment information instantly when a pop-up threat turn up. Depending on the environment information, the improved Focused D* algorithm is capable of collision avoidance in three-dimensional, and re-planning on line to obtain a new global optimal trajectories. A final set of computer simulations is carried out to demonstrate the effectiveness of the dynamic motion planning algorithm based on the improved Focused D* algorithm which rapid construction of feasible, yet agile, trajectories. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Sensor Deployment for Satellite Antenna Reflector Based on Genetic Algorithm

    Publication Year: 2011 , Page(s): 59 - 63
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (397 KB) |  | HTML iconHTML  

    In the problem of optimal sensor deployment for satellite antenna reflector, to avoid the one-sidedness of single-objective criterion, in this paper, we adopt double-objectives criterion, which contains the largest orthogonality and the highest vibration energy of observed signal. The double-objectives criterion is converted to single-one criterion by mathematical transformation and Genetic Algorithm is utilized to solve this problem. Comparing with corresponding single-objective criterion by simulation results, we conclude that: the proposed method is a feasible method of optimal sensor deployment for satellite antenna reflector based on double-objectives criterion. The results, whose fitness function is a function based on double-objectives criterion, is not one-sided optimal solution in single objective, but a satisfying solution in global area. According to the application in real project, this satisfying solution is more significant in the area of astronautics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Linear Regular of Infinitely Many Sets

    Publication Year: 2011 , Page(s): 64 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (154 KB) |  | HTML iconHTML  

    This paper deals with bounded linear regularity and linear regularity of closed convex polyhedral sets and pseudo-convex sets. The linear regularity of an arbitrary collection of closed convex polyhedral subsets can be obtained under certain conditions. At the same time, the sufficient conditions are presented, which are for infinitely many polyhedral sets to be boundedly linearly regular and linearly regular. Some relevant examples are given in this paper. Finally, for infinitely many pseudo-convex sets, the linear regularity can be obtained. View full abstract»

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