2017 13th International Conference on Computational Intelligence and Security (CIS)

15-18 Dec. 2017

Filter Results

Displaying Results 1 - 25 of 146
  • [Title page i]

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

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

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

    Publication Year: 2017, Page(s):5 - 19
    Request permission for commercial reuse | PDF file iconPDF (138 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2017, Page(s): 20
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • Organizing Committee

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

    Publication Year: 2017, Page(s):22 - 23
    Request permission for commercial reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2017, Page(s): 24
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • An Efficient Algorithm for Parallel Computation of Rough Entropy Using CUDA

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

    Continuously improving computation efficiency of rough entropy is very meaningful, because it is helpful to apply rough sets to some fields with high performance requirement. Recently, Graphics Processing Unit (GPU) has gained a lot of attention from scientific communities for its applicability in high performance computing. This paper proposes an efficient algorithm which is based on sorting tech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An alpha-Dominance Expandation Based Algorithm for Many-Objective Optimization

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

    The convergence ability of Pareto-based evolutionary algorithms sharply reduces for many-objective optimization problems because the Pareto dominance is inefficient to rank the solutions and result in too many solutions becoming the non-dominated solutions. To overcome this shortcoming, it is necessary to increase the selection pressure toward the global optimal solutions and well-maintain the div... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Memetic Algorithm For Matching Process Models

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

    To support the analysis, redesign, and implementation projects in enterprises, it's necessary to identify the correspondences between different business process models. However, according to the process model matching contests, the effectiveness of state-of-the-art process model matchers is low, i.e., their alignment only contain a few existing and many irrelevant correspondences. To improve the q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Effective Solution to Nonlinear Bilevel Programming Problems Using Improved Particle Swarm Optimization Algorithm

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

    Nonlinear bilevel programming has a hierarchical structure and has been proved to be NP-hard. In this paper, a class of nonlinear bilevel programming problems is studied. The follower's problem is converted into a series of constraints for the leader's problem by using KKT optimality conditions. For the resultant problem, a method called Chen-Harker-Kanzow-Smalen smoothing method is applied to sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Hybrid Gravitational Search Algorithm for Adaptive Adjustment of Parameters

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

    In this paper, a new Improved Hybrid Gravitational Search Algorithm (IHGSA) is proposed. First, the influence of the learning factor on global exploration and the local exploitation of the algorithm is analyzed, and the parameter adjustment mechanism which can balance the two search capabilities is designed reasonably. Secondly, the PSO is embedded into the Gravitational Search Algorithm (GSA), an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Multi-objective Evolutionary Algorithm Based on a Further Decomposition Strategy

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

    In multi-objective evolutionary algorithms (MOEAs) based on the constrained decomposition approach, the closest sub objective space to the sub-problem is treated as a feasible region for this sub-problem, where the solutions are regarded to be better than that outside it. This approach is expected to maintain the population's diversity. However, due to the inconsistency of the weight vectors and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Optimization Model and Algorithm for a Network Scheduling Problem in Inter-Datacenters Elastic Optical Networks

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

    The routing and virtual network function (VNF) deployment for VNF service chaining in inter-datacenters elastic optical networks (inter-DC EONs) is an important network scheduling problem. In this paper, the problem tackled is more complex and practical than those tackled in the existing works in the following three aspects: 1) each datacenter can only provide some specific (not all) VNFs; 2) the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Video Server Placement and Flux Plan Based on GA

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

    The paper is about a research on a problem of placing video servers and planning fluxes in an existing network topology, which must meet both the broadband limits and user's needs. For this problem, we build a bilevel mode and design two algorithms, in which the genetic algorithm is used to optimize the upper target and the SPFA minimum cost flow algorithm is used for lower target. Experimental re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multi-objective Framework for Location Recommendation Based on User Preference

    Publication Year: 2017, Page(s):39 - 43
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    Location recommendation has attracted increasing attention in recent years. This paper proposes a novel multi-objective framework for location recommendation based on user preference. Under this framework, user preference can be separated into common preference and individual preference. Then two contradictory objective functions are designed to describe these two kinds of preferences. It is diffi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Memetic Particle Swarm Optimization Algorithm to Solve Multi-objective Optimization Problems

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

    An improved particle swarm optimization algorithm to solve multi-objective optimization problems is proposed, called MoMPSO. Firstly, Simulated annealing is incorporated to Particle swarm optimization to enhance the search ability. Secondly, Nonuniform mutation is used to increase the diversity. The simulated results show that the proposed algorithm is better than the compared ones. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improvement Based Evolutionary Algorithm with Adaptive Weight Adjustment for Many-Objective Optimization

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

    For many-objective optimization problems (MaOPs), how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition-based evolutionary algorithm with adaptive weight adjustment is designed to obtain this goal. Firstly, a new method based on uniform design and crowding distance is designed to generate a set of weight vectors wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BPSOBDE: A Binary Version of Hybrid Heuristic Algorithm for Multidimensional Knapsack Problems

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

    A hybrid heuristic algorithm, named BPSOBDE, is proposed for solving multidimensional knapsack problems (MKPs), in which the basic binary particle swarm optimization (BPSO) is combined with a binary differential evolution (BDE) to maintain the diversity of the swarm and makes it more explorative, effective and efficient. BPSOBDE is tested through computational experiments over suites of benchmark ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 3-D Structural Components Automatic Modeling Method Based on BIM

    Publication Year: 2017, Page(s):59 - 63
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    With the application of 3D building information model(BIM) technology and computer technology, facing the construction engineering structure design part, according to the related engineering design specifications, it designs automatic modeling method for three-dimensional structure. The method mainly aims at reinforced concrete frame structure. Based on the completion of BIM model by building prof... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extrapolation of Discrete Multi-projection Methods for Fredholm Integral Equations of the Second Kind

    Publication Year: 2017, Page(s):64 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (169 KB) | HTML iconHTML

    In this paper, we analyze the asymptotic error expansion for the approximation solution obtained by iterated discrete multi-projection methods for Fredhlom integral equations of the second kind. We show that under some smoothness conditions the approximation solution admits an error expansion in even powers of h beginning with term h4r to term h7r. Under these expansion, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kernelised Rényi Distance for Localization and Mapping of Autonomous Vehicle

    Publication Year: 2017, Page(s):69 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (607 KB) | HTML iconHTML

    Accurate locating is an important task for autonomous vehicles' safely driving. In order to realize the precise locating autonomous vehicles without Global Positioning System(GPS) signal, a Kernelized Rényi Distance(KRD) based simultaneous localization and mapping(SLAM) algorithm is proposed in this paper. In our Algorithm, pose estimation are computed by optimizing KRD between two groups ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forward Vehicle Detection Based on Incremental Learning and Fast R-CNN

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

    Recently the research of vehicle detection is mainly through machine learning, but it still has low detection accuracy problem. With the study of researchers, using deep learning methods of vehicle detection becomes hot. In this paper, a selective search method and a target detection model based on Fast R-CNN are used to detect vehicle. The strategy optimizes the model by preprocessing the sample ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Protocols on Group Consensus of Continuous-Time Multi-agent Systems

    Publication Year: 2017, Page(s):77 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (183 KB) | HTML iconHTML

    In this paper, we consider a kind of new protocols on group consensus in which communication weights of topology graph are all non-negative. This is also different with general group consensus protocols. Necessary and sufficient conditions which group consensus under these protocols can reach are obtained for the first, second and high order continuous-time multi-agent system. Finally, numerical e... View full abstract»

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