Self representation problem is very important for the negative selection algorithms. In this paper, two methods, named as K-NN-ASR and B-NN-ASR, are proposed to calculate the self radius of a self sample in the contin...
详细信息
In this work, a Gong-Si-shaped circularly polarized (CP) array with power driver for 5G is proposed. The radiator of the constructed CP array consists of two Chinese-like characters ' and '' with the simil...
详细信息
Evolutionary Algorithms (EAs) with gradient-based repair, which utilize the gradient information of the constraints set, have been proved to be effective. It is known that it would be time-consuming if all infeasible ...
详细信息
ISBN:
(纸本)9781479914869
Evolutionary Algorithms (EAs) with gradient-based repair, which utilize the gradient information of the constraints set, have been proved to be effective. It is known that it would be time-consuming if all infeasible individuals are repaired. Therefore, so far the infeasible individuals to be repaired are randomly selected from the population and the strategy of choosing individuals to be repaired has not been studied yet. In this paper, the Species-based Repair Strategy (SRS) is proposed to select representative infeasible individuals instead of the random selection for gradient-based repair. The proposed SRS strategy has been applied to εDEag which repairs the random selected individuals using the gradient-based repair. The new algorithm is named SRS-εDEag. Experimental results show that SRS-εDEag outperforms εDEag in most benchmarks. Meanwhile, the number of repaired individuals is reduced markedly.
Evolutionary clustering is a hot research topic that clusters the time-stamped data and it is essential to some important applications such as data streams clustering and social network analysis. An evolutionary clust...
详细信息
ISBN:
(纸本)9781479914869
Evolutionary clustering is a hot research topic that clusters the time-stamped data and it is essential to some important applications such as data streams clustering and social network analysis. An evolutionary clustering should accurately reflect the current data at any time step while simultaneously not deviate too drastically from the recent past. In this paper, the differential evolution (DE) is applied to deal with the evolutionary clustering problem. Comparing with the typical k-means, evolutionary clustering based on DE (deEC) could perform a global search in the solution space. Experimental results over synthetic and real-world data sets demonstrate that the deEC provides robust and adaptive solutions.
String stretched tightly along a sequence of fixed grasp points takes the shape of a polygonal arc. In this work, we investigate how many points are necessary and sufficient to grasp and tie arbitrary knots while main...
详细信息
ISBN:
(纸本)9781467380270
String stretched tightly along a sequence of fixed grasp points takes the shape of a polygonal arc. In this work, we investigate how many points are necessary and sufficient to grasp and tie arbitrary knots while maintaining tension, so that the string remains polygonal. This approach allows reasoning that is entirely geometric, which does not rely on potentially inaccurate dynamic models of the string or detailed knowledge of physical characteristics of the string. Algorithms are proposed to determine the contact locations, and generate the motions needed to tie arbitrary knots. This work shows that a number of grasp points that is linear in the number of crossings in a knot diagram is sufficient to immobilize string in a polygonal shape with the topology of an arbitrary knot, or to fold or unfold the knot from a straight configuration.
Clonal selection algorithms (CSAs) are a kind of Artificial Immune Algorithms (AIAs). In this paper, recent advances in clonal selection algorithms are summarized and reviewed. First, the basic framework of clonal sel...
详细信息
Clonal selection algorithms (CSAs) are a kind of Artificial Immune Algorithms (AIAs). In this paper, recent advances in clonal selection algorithms are summarized and reviewed. First, the basic framework of clonal selection algorithms is given. Second, various types of applications using clonal selection algorithms are summarized, including global optimization, constrained optimization, combinatorial optimization, multiobjective optimization, dynamic optimization and other applications. Last, a brief conclusion and some remarks about clonal selection algorithms are given.
The Shortest Path (SP) problems are conventional combinatorial optimization problems. There are many deterministic algorithms for solving the shortest path problems in static topologies. However, in dynamic topologies...
详细信息
The Shortest Path (SP) problems are conventional combinatorial optimization problems. There are many deterministic algorithms for solving the shortest path problems in static topologies. However, in dynamic topologies, these deterministic algorithms are not efficient due to the necessity of restart. In this paper, an improved Genetic Algorithm (GA) with four local search operators for Dynamic Shortest Path (DSP) problems is proposed. The local search operators are inspired by Dijkstra's Algorithm and carried out when the topology changes to generate local shortest path trees, which are used to promote the performance of the individuals in the population. The experimental results show that the proposed algorithm could obtain the solutions which adapt to new environments rapidly and produce high-quality solutions after environmental changes.
The mass adoption of autonomous driving and Advanced Driver-Assistance System (ADAS) technologies increases the complexity and maintenance cost of automotive-embedded software during model-based development. Through m...
详细信息
The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden informat...
详细信息
At present, moving vehicle detection on airborne platform has been an important technology for urban traffic surveillance. In such a situation, most commonly used methods (e.g. image subtraction) could hardly work wel...
详细信息
暂无评论