Genetic regulatory network-based symbiotic evolution

The main theme of this paper is to present a novel evolution, the genetic regulatory network-based symbiotic evolution (GRNSE), to improve the convergent speed and solution accuracy of genetic algorithms. The proposed GRNSE utilizes genetic regulatory network (GRN) reinforcement learning to improve the diversity and symbiotic evolution (SE) initialization to achieve the parallelism. In particular, GRN-based learning increases the global rate by regulating members of genes in symbiotic evolution. To compare the efficiency of the proposed method, we adopt 41 benchmarks that contain many nonlinear and complex optimal problems. The influences of dimension, individual population size, and gene population size are examined. A new control parameter, the population rate is introduced to initiate the ratio between the gene and chromosome. Finally, all the studies of there 41 benchmarks demonstrate that from the statistic point of view, GRNSE give a better convergence speed and a more accurate optimal solution than GA and SE.     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

Illumination robust single sample face recognition based on ESRC

Multimedia Tools and Applications - The extended sparse representation classifier (ESRC) is one of the state-of-the-art solutions for single sample face recognition, but it performs...     

Topology optimization based on level set for a flexible multibody system modeled via ANCF

A topology optimization methodology is proposed for the flexible multibody system undergoing both large overall motion and large deformation. The system of concern is modeled via the absolute nodal coordinate formulation. The equivalent static load method is employed to transform the topology optimization of the nonlinear dynamic response of the system into a static one, and evaluated to adapt to the absolute nodal coordinate formulation by splitting the elastic deformations of the flexible components from the overall motions of those components. During the static topology optimization, the material interface is implicitly described as the zero level set of a higher-dimensional scalar function. Then, the semi-implicit level set method with the additive operator splitting algorithm is employed to solve the corresponding Hamilton-Jacobi partial differential equation. In addition, the expert evaluation method of weights based on the grey theory is utilized to define the objective function, and a modified augmented Lagrange multiplier method is proposed to treat the inequality volume constraint so as to avoid the oscillation and drift of the volume. Finally, two numerical examples are provided to validate the proposed methodology.     

用于半自动视频对象提取的自适应网格图像分割

随着MPEG－4标准的发展和基于内容的视频处理研究,视频对象平面（VOP）的有效产生成为一个关键问题。本文提出一种基于区域的自适应网格彩色图像分割方法,可用于获得半自动视频对象跟踪和提取所需的初始VOP。该方法利用CIE L＊a*b＊色彩空间的特征量,对视频序列的第一帧进行三角形网格的分裂与合并。对MPEG－4标准测试序列的分割实验取得了较好的结果。     

计算机犯罪侦查途径的探讨

近年来计算机犯罪案件呈迅速增长趋势,为有效控制和侦破此类案件,急需寻找一套行之有效的侦查办案途径.归纳各种犯罪手段,分别针对单机犯罪、专用网络犯罪和互联网犯罪,提出三种解决方案.     

数据库应用程序执行过程抽象

本文对数据库应用的执行流程进行了一个抽象,指出数据库应用流程通常都具有的几个步骤,从而使数据库应用程序的开发过程中可以更加有效的进行设计和实现。     

Locality-preserved maximum information projection.

Dimensionality reduction is usually involved in the domains of artificial intelligence and machine learning. Linear projection of features is of particular interest for dimensionality reduction since it is simple to calculate and analytically analyze. In this paper, we propose an essentially linear projection technique, called locality-preserved maximum information projection (LPMIP), to identify the underlying manifold structure of a data set. LPMIP considers both the within-locality and the between-locality in the processing of manifold learning. Equivalently, the goal of LPMIP is to preserve the local structure while maximize the out-of-locality (global) information of the samples simultaneously. Different from principal component analysis (PCA) that aims to preserve the global information and locality-preserving projections (LPPs) that is in favor of preserving the local structure of the data set, LPMIP seeks a tradeoff between the global and local structures, which is adjusted by a parameter alpha, so as to find a subspace that detects the intrinsic manifold structure for classification tasks. Computationally, by constructing the adjacency matrix, LPMIP is formulated as an eigenvalue problem. LPMIP yields orthogonal basis functions, and completely avoids the singularity problem as it exists in LPP. Further, we develop an efficient and stable LPMIP/QR algorithm for implementing LPMIP, especially, on high-dimensional data set. Theoretical analysis shows that conventional linear projection methods such as (weighted) PCA, maximum margin criterion (MMC), linear discriminant analysis (LDA), and LPP could be derived from the LPMIP framework by setting different graph models and constraints. Extensive experiments on face, digit, and facial expression recognition show the effectiveness of the proposed LPMIP method.