Globally Exponential Stability for Delayed Neural Networks Under Impulsive Control

In this paper, the dynamic behaviors of a class of neural networks with time-varying delays are investigated. Some less weak sufficient conditions based on p-norm and ∞-norm are obtained to guarantee the existence, uniqueness of the equilibrium point for the addressed neural networks without impulsive control by applying homeomorphism theory. And then, by utilizing inequality technique, Lyapunov functional method and the analysis method, some new and useful criteria of the globally exponential stability with respect to the equilibrium point under impulsive control we assumed are derived based on p-norm and ∞-norm, respectively. Finally, an example with simulation is given to show the effectiveness of the obtained results.     

基于词性的文本挖掘算法在IDS日志中的应用

提出一种以词性为参考值的文本挖掘算法,能有效挖掘与种子词有关的关联规则。基于Bootstrapping算法思想,既减少了预处理阶段对于词根还原的依赖,能处理日志中出现的中文词汇。增加了对于日志文本上下的理解,提高了关联规则的有效性,并应用与IDS日志挖掘之中,有效改善挖掘效率,为规则库提供关联规则。     

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.     

Performance-First Control for Discrete-Time LQG Problems

Performance-first control for discrete-time LQG is considered in this paper to minimize the probability that the performance index exceeds a preselected threshold via constructing a closed-loop feedback control law. This problem can be converted into a mean-variance control problem which can be solved by developing a nested form of the variance and using polynomial optimization as a solution scheme.     

A divide-and-conquer hole-filling method for handling disocclusion in single-view rendering

Large holes are unavoidably generated in depth image based rendering (DIBR) using a single color image and its associated depth map. Such holes are mainly caused by disocclusion, which occurs around the sharp depth discontinuities in the depth map. We propose a divide-and-conquer hole-filling method which refines the background depth pixels around the sharp depth discontinuities to address the disocclusion problem. Firstly, the disocclusion region is detected according to the degree of depth discontinuity, and the target area is marked as a binary mask. Then, the depth pixels located in the target area are modified by a linear interpolation process, whose pixel values decrease from the foreground depth value to the background depth value. Finally, in order to remove the isolated depth pixels, median filtering is adopted to refine the depth map. In these ways, disocclusion regions in the synthesized view are divided into several small holes after DIBR, and are easily filled by image inpainting. Experimental results demonstrate that the proposed method can effectively improve the quality of the synthesized view subjectively and objectively.     

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...     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

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

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