On Time Dynamics of Coagulation-Fragmentation Processes

We establish a characterization of coagulation-fragmentation processes, such that the induced birth and death processes depicting the total number of groups at time t≥0 are time homogeneous. Based on this, we provide a characterization of mean-field Gibbs coagulation-fragmentation models, which extends the one derived by Hendriks et al. As a by-product of our results, the class of solvable models is widened and a question posed by N. Berestycki and Pitman is answered, under restriction to mean-field models.     

决策者具有(严格)凸性偏好结构下的一类交互式多目标决策方法

为了更好地解决决策者具有(严格)凸性偏好结构下的多目标决策问题,一般目标空间为有界凸域的情形常常可以转化为目标空间为有界闭凸区域的情形,首先分析了切割平面及该平面上偏好最优点与被切割平面分割成的为有界闭凸区域的目标空间或目标空间的子集的两个部分之间的关系;然后分析并指出了对于包含全局偏好最优目标方案点的为有界闭凸域的目标空间及其子集(准最优目标集),在确定了切割平面上的偏好最优点后,通过适当地选取供决策者与切割平面的偏好最优点进行比较判断的目标方案点,经过一次比较就可以确定一个新的范围更小的包含全局偏好最优目标方案点的目标空间的有界闭凸子区域(准最优目标集).为获取切割平面上的偏好最优点,提出了改进的坐标轮换法.在这些结论和方法的基础上,提出了决策者具有(严格)凸性偏好结构下的一类交互式多目标决策方法,要求决策者提供较易的偏好性息,决策效能较好.     

Parametric characterisation of a chaotic attractor using the two scale Cantor measure

A chaotic attractor is usually characterised by its multifractal spectrum which gives a geometric measure of its complexity. Here we present a characterisation using a minimal set of independent parameters which is uniquely determined by the underlying process that generates the attractor. The method maps the f(α) spectrum of a chaotic attractor on to that of a general two scale Cantor measure. We show that the mapping can be done in practice with reasonable accuracy for many of the standard chaotic attractors. In order to implement this procedure, we also propose a generalisation of the standard equations for the two scale Cantor set in one dimension to that in higher dimensions. Another interesting result we have obtained both theoretically and numerically is that, the f(α) characterisation gives information only up to two scales, even when the underlying process generating the multifractal involves more than two scales.     

Optimal control for reinitialization in finite element level set methods

A new optimal control problem that incorporates the residual of the Eikonal equation into its objective is presented. The formulation of the state equation is based on the level set transport equation but extended by an additional source term, correcting the solution so as to minimize the objective functional. The method enforces the constraint so that the interface cannot be displaced at least in the continuous setting. The system of first‐order optimality conditions is derived, linearized, and solved numerically. The control also prevents numerical instabilities, so that no additional stabilization techniques are required. This approach offers the flexibility to include other desired design criteria into the objective functional. The methodology is evaluated numerically in three different examples and compared with other PDE‐based reinitialization techniques. Copyright © 2016 John Wiley & Sons, Ltd.     

Gradient control and synchronization of Julia sets

This paper firstly introduces the control methods to fractals and give the definition of synchronization of Julia sets between two different systems. Especially, the gradient control method is taken on the classic Julia sets of complex quadratic polynomial Zn＋1 = zn^2＋ c, which realizes its Julia sets control and synchronization. The simulations illustrate the effectiveness of the method.     

Performance analysis of an integrated scheme in optical burst switching high-speed networks

A new integrated scheme based on resource-reservation and adaptive network flow routing to alleviate contention in optical burst switching networks is proposed. The objective of the proposed scheme is to reduce the overall burst loss in the network and at the same time to avoid the packet out-of-sequence arrival problem. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution schemes based on conventional routing. Through extensive simulations, it is shown that the proposed scheme not only provides significantly better burst loss performance than the basic equal proportion and hop-length based traffic routing algorithms, but also is void of any packet re-orderings.     

A novel pose and illumination robust face recognition with a single training image per person algorithm

In the real-world application of face recognition system, owing to the difficulties of collecting samples or storage space of systems, only one sample image per person is stored in the system, which is so-called one sample per person problem. Moreover, pose and illumination have impact on recognition performance. We propose a novel pose and illumination robust algorithm for face recognition with a single training image per person to solve the above limitations. Experimental results show that the proposed algorithm is an efficient and practical approach for face recognition.     

Positively Curved Manifolds with Almost Maximal Symmetry Rank

The symmetry rank of a Riemannian manifold is the rank of the isometry group. We determine precisely which closed simply connected 5-manifolds admit positively curved metrics with (almost maximal) symmetry rank two. We also determine the precise Euler characteristic and the fundamental groups of all closed positively curved n-manifolds with almost maximal symmetry rank [(n–1)/2] (n 6, 7).     

Entropy, independent sets and antichains: A new approach to Dedekind's problem

For -regular, -vertex bipartite graphs with bipartition , a precise bound is given for the sum over independent sets of the quantity . (In other language, this is bounding the partition function for certain instances of the hard-core model.) This result is then extended to graded partially ordered sets, which in particular provides a simple proof of a well-known bound for Dedekind's Problem given by Kleitman and Markowsky in 1975.