Interaction of catechin with poly(L-proline)

Summary Catechin binds strongly to both poly(vinylpyrrolidone) and poly(L-proline) in dilute aqueous solution, inducing a collapse of the more flexible poly(vinylpyrrolidone) chains, but forming a microgel with the more extended poly(L-proline) chains. Low concentrations of poly(L-proline) inhibit the discoloration of aqueous solutions of catechin, thereby implicating the ortho hydroxyyl groups in the catechol moiety in the binding process. Modeling shows that the likely binding sites on poly(L-proline) arise from two minor local conformations. These minor conformations are less frequent in poly(-hydroxy-L-proline) than in poly(L-proline), which may explain why catechin interacts more strongly with poly(L-proline) than with poly(-hydroxy-L-proline).     

An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem

This paper presents an improved ant colony optimization algorithm (IACO) for solving mobile agent routing problem. The ants cooperate using an indirect form of communication mediated by pheromone trails of scent and find the best solution to their tasks guided by both information (exploitation) which has been acquired and search (exploration) of the new route. Therefore the premature convergence probability of the system is lower. The IACO can solve successfully the mobile agent routing problem, and this method has some excellent properties of robustness, self-adaptation, parallelism, and positive feedback process owing to introducing the genetic operator into this algorithm and modifying the global updating rules. The experimental results have demonstrated that IACO has much higher convergence speed than that of genetic algorithm (GA), simulated annealing (SA), and basic ant colony algorithm, and can jump over the region of the local minimum, and escape from the trap of a local minimum successfully and achieve the best solutions. Therefore the quality of the solution is improved, and the whole system robustness is enhanced. The algorithm has been successfully integrated into our simulated humanoid robot system which won the fourth place of RoboCup2008 World Competition. The results of the proposed algorithm are found to be satisfactory.     

Analysis and application of Bio-Inspired Multi-Net Security Model

With the rapid development of network technologies and deteriorating of network environment, traditional single-net security system cannot satisfy the security requirement. The excellent security performance of biological systems impels the bio-inspired network security theory to be a hot research area currently. Based on Bio-inspired Multidimensional Network Security Model we have put forward, we have advanced Bio-inspired Multi-Net Security system by implementing the functional distribution of different subnets of different transient states in Multi-Net Paralleling structure. Firstly, parameter estimation and modified algorithms of Hidden Markov Model are introduced to construct the mathematical mode of B-MNS; secondly, the integrated performance of our modified B-MNS has been tested and its simulation has been carried out. So the feasibility, validity and high efficiency of our model have been demonstrated theoretically, and practically.     

基于PolyTrans的IGES文件简化

CAD软件与基于多边形的3D软件之间数据转换需求不断增加,但是CAD模型复杂度和精细度却越来越高,数据转换的难度变大.为了解决这一难题,结合PolyTrans,分析如何解决一般3D软件难以导入大型的IGES(Initial Graphics Exchange Specifi-cation)文件的问题.从PolyTrans模型简化模块的理论依据着手,研究如何控制多边形的数量、降低文件的复杂性和减少文件的数量,使大型CAD装配模型能顺利地以单个实体形式导入Lightwave、3DS MAX以及Maya类的3D软件.并结合具体科研项目,给出了模型优化前后各指标参数对比情况.     

Robust Stabilization Over Communication Channels in the Presence of Unstructured Uncertainty

This technical note is concerned with the problem of controlling plants over communication channels, where the plant is subject to two types of unstructured uncertainty: additive uncertainty and stable coprime factor uncertainty. Necessary lower bounds on the rate of transmission (or channel capacity) C, for robust stabilization, are computed explicitly. In particular, it is shown that the lower bound in the additive uncertainty case corresponds to a fixed point of a particular function. In the stable coprime factor uncertainty case, the derivation relies on linear fractional transformation concepts. The results are important in determining the minimum channel capacity needed in order to stabilize plants subject to unstructured uncertainty over communication channels. For instance, the bounds obtained can be used to analyze the effect of uncertainty on the channel capacity. An illustrative example is provided.     

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.     

Optimization for limited angle tomography in medical image processing

This paper aims to reduce the problems of incomplete data in computed tomography, which happens frequently in medical image process and analysis, e.g., when the high-density region of objects can only be penetrated by X-rays at a limited angular range. As the projection data are available only in an angular range, the incomplete data problem can be attributed to the limited angle problem, which is an ill-posed inverse problem. Image reconstruction based on total variation (TV) reduces the problem and gives better performance on edge-preserving reconstruction; however, the artificial parameter can only be determined through considerable experimentation. In this paper, an effective TV objective function is proposed to reduce the inverse problem in the limited angle tomography. This novel objective function provides a robust and effective reconstruction without any artificial parameter in the iterative processes, using the TV as a multiplicative constraint. The results demonstrate that this reconstruction strategy outperforms some previous ones.     

Control theoretic smoothing splines

Some of the relationships between optimal control and statistics are examined. We produce generalized, smoothing splines by solving an optimal control problem for linear control systems, minimizing the L²-norm of the control signal, while driving the scalar output of the control system close to given, prespecified interpolation points. We then prove a convergence result for the smoothing splines, using results from the theory of numerical quadrature. Finally, we show, in simulations, that our approach works in practice as well as in theory     

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

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