By Topic

2013 Ninth International Conference on Computational Intelligence and Security

14-15 Dec. 2013

Filter Results

Displaying Results 1 - 25 of 187
  • [Front cover]

    Publication Year: 2013, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (815 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2013, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2013, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (364 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2013, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (319 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2013, Page(s):v - xvii
    Request permission for commercial reuse | PDF file iconPDF (138 KB)
    Freely Available from IEEE
  • Organization

    Publication Year: 2013, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (239 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2013, Page(s):xix - xx
    Request permission for commercial reuse | PDF file iconPDF (326 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2013, Page(s):xxi - xxii
    Request permission for commercial reuse | PDF file iconPDF (193 KB)
    Freely Available from IEEE
  • The Finite Element Analysis on the Multi-bubble Model in the Ship Wake

    Publication Year: 2013, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB) | HTML iconHTML

    The double-bubble model is formed in the spherical coordinates, which is based on the distribution of bubbles in the ship wake. The multi-bubble models are created and the finite element structure models of the multi-bubble are formed and studied by then. A sound source is located in the field point models of the multi-bubble, and the active acoustic characteristic of the models are obtained by th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approximation Scheme for RNA Folding Structure Prediction Including Pseudoknots

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

    The paper further investigates the computational problem and complexity of predicting Ribonucleic Acid structure. In order to find a way to optimize the Ribonucleic Acid pseudoknotted structure, we investigate the Ribonucleic Acid pseudoknotted structure based on thermal dynamic model, computational methods, minimum free energy are adopted to predict Ribonucleic Acid structure. The contribution of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Glowworm Swarm Optimization Algorithm for Solving Multi-objective Optimization Problem

    Publication Year: 2013, Page(s):11 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB) | HTML iconHTML

    The glowworm swarm optimization algorithm is used to solve multi-objective optimization problem (MOP-GSO). It is shown by simulation that, MOP-GSO algorithm is effective to solve multi-objective optimization. Compared with NSGA2, it is better in term of the spread of the solutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Artificial Bee Colony Algorithm with Two-Stage Eagle Strategy

    Publication Year: 2013, Page(s):16 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (605 KB) | HTML iconHTML

    Pointing at that Artificial Bee Colony Algorithm (ABC) has the defect of slow search speed and low precision, the article proposed an Improved Artificial Bee Colony Algorithm with Two-Eagle Strategy (ETABC) through using a kind of optimization method-Eagle Strategy, and proved the convergence of ETABC. The simulation results show that ETABC is more effective in solving optimization problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing Vaccine Distribution for Different Age Groups of Population Using DE Algorithm

    Publication Year: 2013, Page(s):21 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    Vaccination is one of the most promising methods to control the epidemic spread by protecting the most vulnerable population and reducing the number of susceptible population who are exposed to the virus. However, the vaccine doses are usually limited and can only be supplied during the epidemic outbreak. How to distribute the vaccines to different populations to reduce the total number of infecti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Resource Allocation of TD-LTE System Based on Improved Quantum Evolutionary Algorithm

    Publication Year: 2013, Page(s):26 - 30
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB) | HTML iconHTML

    A new model of time division duplex long term evolution (TD-LTE) system considering crossed time slot (CTS) interference is proposed in this paper because CTS interference may greatly affect system performance. An improved quantum evolutionary algorithm (QEA) is put forward to solve the model efficiently. The proposed QEA enhances the global search capability and has a good convergence due to the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Differential Evolution Algorithm for Mixed Integer Programming Problems

    Publication Year: 2013, Page(s):31 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB) | HTML iconHTML

    This paper proposes an improved differential evolution algorithm, named I-DE, for constrained nonlinear mixed integer programming problems. The new population initialization technology and dynamic non-linear scaling factor are applied to enhance optimization capability of algorithm. We strengthen influence of constraint matrix to deal with constraint of problems. Introduction of special truncation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Middleware-Based Model for Redundant Reader Elimination Using Plant Growth Simulation Algorithm

    Publication Year: 2013, Page(s):36 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB) | HTML iconHTML

    Eliminating redundant readers is a significant way to improve the performance of the radio frequency identification (RFID) networks. This paper proposes a middleware-based model for redundant reader elimination, which is formulated as a multi-dimensional optimization problem. It uses the data in RFID middleware to distinguish redundant readers and no "write-to-tag" operations are required. The Pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Genetic Algorithm for Interval Linear Bilevel Programming Problems

    Publication Year: 2013, Page(s):41 - 44
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    This paper deals with a class of interval linear bilevel programming problems, in which some or all of the leader's and follower's objective function coefficients are specified in terms of intervals. The focus of solving this class of problems is on determining the optimal value range when different coefficients of objectives are taken in intervals given. In order to obtain the best and the worst ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Energy-Aware Optimization Model Based on Data Placement and Task Scheduling

    Publication Year: 2013, Page(s):45 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB) | HTML iconHTML

    Recently, technologies on reducing energy consumption of data centers have drawn considerable attentions. One constructive way is to improve energy efficiency of servers. Aiming at this goal, we propose a new energy-aware optimization model based on the combination of data placement and task scheduling in this paper. The main contributions are: (1)The impact of servers' performance on energy consu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic Algorithm Nested with Simulated Annealing for Big Job Shop Scheduling Problems

    Publication Year: 2013, Page(s):50 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (539 KB) | HTML iconHTML

    In so many combinatorial optimization problems, Job shop scheduling problems have earned a reputation for being difficult to solve. Genetic algorithm has demonstrated considerable success in providing efficient solutions to many non-polynomial-hard optimization problems. In the field of job shop scheduling, genetic algorithm has been intensively researched, but it's converge speed is not favorable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Differential Evolution with Two Mutation Strategies for Linear Bilevel Programming Problems

    Publication Year: 2013, Page(s):55 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    An improved constraint handling technique based on a comparison mechanism is presented, and then it is combined with selection operator in differential evolution to fulfill constraint handling and selection simultaneously. A differential evolution with two mutation strategies based on this new constraint handling technique is developed to solve the linear bilevel programming problems. The simulati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Genetic Algorithm for Solving the Probabilistic Minimum Spanning Tree Problem

    Publication Year: 2013, Page(s):61 - 65
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (165 KB) | HTML iconHTML

    The probabilistic minimum spanning tree (PMST) problem is NP-complete and is hard to solve. However, it has important theoretical significance and wide application prospect. A parallel genetic algorithm based on coarse-grained model is proposed to solve PMST problem in this paper. Firstly, we discuss several problems of determinant factorization encoding, and develop repairing method for illegal i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary Algorithm Based on Automatically Designing of Genetic Operators

    Publication Year: 2013, Page(s):66 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB) | HTML iconHTML

    At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. Can evolutionary algorithms be designed automatically by computer? In this paper, a novel evolutionary algorithm based on automatically designing of genetic opera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Related Vehicle Routing Problem for Multiple Depots Basing on Dynamic Constraint

    Publication Year: 2013, Page(s):71 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    The research based on multi-depot RVRP with road capacity dynamic constraint. Building relevant mathematic model, and brought simulated annealing mechanism into chaos genetic algorithm. The simulated result shows that the proposed algorithm can be applied to solve this problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Related Vehicle Routing Problem for Single Distribution Centre Based on Dynamic Constraint

    Publication Year: 2013, Page(s):76 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB) | HTML iconHTML

    Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Evolutionary Algorithm for Portfolio Optimization and Its Application

    Publication Year: 2013, Page(s):80 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB) | HTML iconHTML

    Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR) are two of the most widely used and important risk measures in financial risk management models. Because VaR and CVaR portfolio optimization models are often nonlinear and non-convex optimization models, traditional optimization methods usually can not get their global optimal solutions, instead, they often get a local optimal solution. In t... View full abstract»

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