Titlebook: Bio-inspired Computing: Theories and Applications; 13th International C Jianyong Qiao,Xinchao Zhao,Shanguo Huang Conference proceedings 201

元音

A Study of Industrial Structure Optimization Under Economy, Employment and Environment Constraints anagement. In this paper, an optimization model based on MOEA is proposed to adjust industrial structure to meet the increasing demand. Increasing economy and employment along with reducing carbon emission are the objectives of model, which is solved by one of MOEA, NSGA-II. Jiangsu-Zhejiang-Shangha

Impugn

發(fā)生

Motor Imaginary EEG Signals Classification Based on Deep Learning,tion methods, but most of are not very efficient in this problem. Deep learning had been broadly used in image classification and has significant performance in classifying images. This paper proposes a comprehensive spatio-temporal feature classification method based on deep learning. It combines C

ACRID

DNA Origami Based Computing Model for the Satisfiability Problem,NP-complete problems. Compared with traditional DNA self-assembly, DNA origami is a new method of DNA self-assembly. We first give a description and the status quo of study of the satisfiability problem, briefly introduce the principle of DNA origami, propose the computing model based on DNA origami

傳授知識(shí)

DNA 3D Self-assembly Algorithmic Model to Solve Maximum Clique Problem,. This paper introduce a method of DNA 3D self-assembly algorithm to solve the Maximum Clique Problem. Firstly, we introduce a non-deterministic algorithm. Then, according to the algorithm we design the types of DNA tiles which the computation needs. Lastly, we demonstrate the self-assembly process

土坯

動(dòng)脈

An Efficient Genetic Algorithm for Solving Constraint Shortest Path Problem Through Specified Vertinsportation systems, emergency rescue, and military planning. In this paper, we propose an efficient genetic algorithm for solving the constraint shortest path problem. Firstly, the Dijkstra algorithm is used to calculate the shortest distance between any two specified vertices. The optimal solution

Flatus

An Attribute Reduction P System Based on Rough Set Theory, since it is a NP hard problem, while most of them have the drawback to fall into local optimal solution. The other way to solve this problem is based on parallel computing. Membrane computing model is a distributed, maximal parallel and non-deterministic computing model inspired from cell. In this

異端

Spatial-Temporal Analysis of Traffic Load Based on User Activity Characteristics in Mobile Cellularraffic load (DTL) generated from the base station (BS). We model the characteristics of UA, and use K-means clustering algorithm to characterize the hidden spatial association pattern in the wireless cellular system. The results show that (1) there is a strong linear interaction between UA and DTL;

exhilaration

DNA Strand Displacement Based on Nicking Enzyme for DNA Logic Circuits,the logic calculation model for it can cut one strand of a double-stranded DNA at a specific recognition nucleotide sequences known as a restriction site. Based on this, a variety of logic gates are designed and implemented, and a multi-person voting circuit is constructed.