Numerical algorithms for time-fractional subdiffusion equation with second-order accuracy

This article aims to fill in the gap of the second-order accurate schemes for the time-fractional subdiffusion equation with unconditional stability. Two fully discrete schemes are first proposed for the time-fractional subdiffusion equation with space discretized by finite element and time discretized by the fractional linear multistep methods. These two methods are unconditionally stable with maximum global convergence order of $O(\tau+h^{r+1})$ in the $L^2$ norm, where $\tau$ and $h$ are the step sizes in time and space, respectively, and $r$ is the degree of the piecewise polynomial space. The average convergence rates for the two methods in time are also investigated, which shows that the average convergence rates of the two methods are $O(\tau^{1.5}+h^{r+1})$. Furthermore, two improved algorithms are constrcted, they are also unconditionally stable and convergent of order $O(\tau^2+h^{r+1})$. Numerical examples are provided to verify the theoretical analysis. The comparisons between the present algorithms and the existing ones are included, which show that our numerical algorithms exhibit better performances than the known ones.

Towards strongly consistent online HMM parameter estimation using one-step Kerridge inaccuracy

In this paper, we propose a novel online hidden Markov model (HMM) parameter estimator based on the new information-theoretic concept of one-step Kerridge inaccuracy (OKI). Under several regulatory conditions, we establish a convergence result (and some limited strong consistency results) for our proposed online OKI-based parameter estimator. In simulation studies, we illustrate the global convergence behaviour of our proposed estimator and provide a counter-example illustrating the local convergence of other popular HMM parameter estimators.

A hybrid of modified PSO and local search on a multi-robot search system

Particle swarm optimization (PSO), a new population based algorithm, has recently been used on multi-robot systems. Although this algorithm is applied to solve many optimization problems as well as multi-robot systems, it has some drawbacks when it is applied on multi-robot search systems to find a target in a search space containing big static obstacles. One of these defects is premature convergence. This means that one of the properties of basic PSO is that when particles are spread in a search space, as time increases they tend to converge in a small area. This shortcoming is also evident on a multi-robot search system, particularly when there are big static obstacles in the search space that prevent the robots from finding the target easily; therefore, as time increases, based on this property they converge to a small area that may not contain the target and become entrapped in that area.Another shortcoming is that basic PSO cannot guarantee the global convergence of the algorithm. In other words, initially particles explore different areas, but in some cases they are not good at exploiting promising areas, which will increase the search time.This study proposes a method based on the particle swarm optimization (PSO) technique on a multi-robot system to find a target in a search space containing big static obstacles. This method is not only able to overcome the premature convergence problem but also establishes an efficient balance between exploration and exploitation and guarantees global convergence, reducing the search time by combining with a local search method, such as A-star.To validate the effectiveness and usefulness of algorithms,a simulation environment has been developed for conducting simulation-based experiments in different scenarios and for reporting experimental results. These experimental results have demonstrated that the proposed method is able to overcome the premature convergence problem and guarantee global convergence.

Balancing exploration and exploitation in particle swarm optimization on search tasking

In this study we present a combinatorial optimization method based on particle swarm optimization and local search algorithm on the multi-robot search system. Under this method, in order to create a balance between exploration and exploitation and guarantee the global convergence, at each iteration step if the distance between target and the robot become less than specific measure then a local search algorithm is performed. The local search encourages the particle to explore the local region beyond to reach the target in lesser search time. Experimental results obtained in a simulated environment show that biological and sociological inspiration could be useful to meet the challenges of robotic applications that can be described as optimization problems.

Becoming-topologies of education: Deformations, networks and the database effect

This article uses topological approaches to suggest that education is becoming-topological. Analyses presented in a recent double-issue of Theory, Culture & Society are used to demonstrate the utility of topology for education. In particular, the article explains education's topological character through examining the global convergence of education policy, testing and the discursive ranking of systems, schools and individuals in the promise of reforming education through the proliferation of regimes of testing at local and global levels that constitute a new form of governance through data. In this conceptualisation of global education policy changes in the form and nature of testing combine with it the emergence of global policy network to change the nature of the local (national, regional, school and classroom) forces that operate through the ‘system’. While these forces change, they work through a discursivity that produces disciplinary effects, but in a different way. This new–old disciplinarity, or ‘database effect’, is here represented through a topological approach because of its utility for conceiving education in an increasingly networked world.

A Continuation Method of Parameter Inversion for Non-Equilibrium Convection-Dispersion Equation

Based on the homotopy mapping, a globally convergent method of parameter inversion for non-equilibrium convection-dispersion equations (CDEs) is developed. Moreover, in order to further improve the computational efficiency of the algorithm, a properly smooth function, which is derived from the sigmoid function, is employed to update the homotopy parameter during iteration. Numerical results show the feature of global convergence and high performance of this method. In addition, even the measurement quantities are heavily contaminated by noises, and a good solution can be found.

跨音速翼型反设计的一种大范围收敛方法

求解跨音速翼型的反设计问题时,传统的梯度型方法一般均为局部收敛.为增大求解的收敛范围,依据同伦方法的思想,通过构造不动点同伦,将原问题的求解转化为其同伦函数的求解,并依据拟Sigmoid函数调整同伦参数以提高计算效率,进而构造出一种具有较高计算效率的大范围收敛反设计方法.数值算例以RAE2822翼型的表面压力分布为拟合目标,分别采用B样条方法,PARSEC方法及正交形函数方法等3种不同的参数化方法,并分别以NACA0012,OAF139及VR15翼型为初始翼型进行迭代计算.计算结果证明,该方法适用于多种参数化方法,且具有较好的计算效率,从多个不同的初始翼型出发,经较少次数迭代后,均能与目标翼型很好地拟合,是一种高效的大范围收敛方法.

求解非线性反问题的大范围收敛梯度正则化算法

基于同伦映射的思想,改进了求解非线性反问题的梯度正则化算法.通过路径跟踪有效地拓宽了梯度正则化算法求解的收敛范围.对于正则化参数的修正,通过引入拟Sigmoid函数,提出了一种下降速率可调的连续化参数修正方法,在保证迭代稳定的条件下,得到较好的计算效率,同时保证该算法具有很好的抵抗观测噪声能力.实际算例表明,该方法收敛范围宽,计算效率高,在存在较强观测噪声的条件下也能得到很好的反演结果.

Clustering behaviors in networks of integrate-and-fire oscillators

Clustering behavior is studied in a model of integrate-and-fire oscillators with excitatory pulse coupling. When considering a population of identical oscillators, the main result is a proof of global convergence to a phase-locked clustered behavior. The robustness of this clustering behavior is then investigated in a population of nonidentical oscillators by studying the transition from total clustering to the absence of clustering as the group coherence decreases. A robust intermediate situation of partial clustering, characterized by few oscillators traveling among nearly phase-locked clusters, is of particular interest. The analysis complements earlier studies of synchronization in a closely related model. © 2008 American Institute of Physics.

Stabilization of planar collective motion: All-to-all communication

This paper proposes a design methodology to stabilize isolated relative equilibria in a model of all-to-all coupled identical particles moving in the plane at unit speed. Isolated relative equilibria correspond to either parallel motion of all particles with fixed relative spacing or to circular motion of all particles with fixed relative phases. The stabilizing feedbacks derive from Lyapunov functions that prove exponential stability and suggest almost global convergence properties. The results of the paper provide a low-order parametric family of stabilizable collectives that offer a set of primitives for the design of higher-level tasks at the group level. © 2007 IEEE.

Synchronization and balancing on the N-torus

In this paper, we study the behavior of a network of N agents, each evolving on the circle. We propose a novel algorithm that achieves synchronization or balancing in phase models under mild connectedness assumptions on the (possibly time-varying and unidirectional) communication graphs. The global convergence analysis on the N-torus is a distinctive feature of the present work with respect to previous results that have focused on convergence in the Euclidean space. © 2006 Elsevier B.V. All rights reserved.

理性遗传算法及其在运动规划中的应用

为提高理性遗传算法遗传信息的完备性、算法全局收敛性以及算法的整体结构,给出了一个更一般化的理性算子和算法结构,证明了算法的全局收敛性.理论分析和在运动规划问题中的应用结果验证了理性遗传算法的有效性.

The Risk Implications of Globalisation: An Exploratory Analysis of 105 Major Industrial Incidents (1971–2010)

This paper revisits work on the socio-political amplification of risk, which predicts that those living in developing countries are exposed to greater risk than residents of developed nations. This prediction contrasts with the neoliberal expectation that market driven improvements in working conditions within industrialising/developing nations will lead to global convergence of hazard exposure levels. It also contradicts the assumption of risk society theorists that there will be an ubiquitous increase in risk exposure across the globe, which will primarily affect technically more advanced countries. Reviewing qualitative evidence on the impact of structural adjustment reforms in industrialising countries, the export of waste and hazardous waste recycling to these countries and new patterns of domestic industrialisation, the paper suggests that workers in industrialising countries continue to face far greater levels of hazard exposure than those of developed countries. This view is confirmed when a data set including 105 major multi-fatality industrial disasters from 1971 to 2000 is examined. The paper concludes that there is empirical support for the predictions of socio-political amplification of risk theory, which finds clear expression in the data in a consistent pattern of significantly greater fatality rates per industrial incident in industrialising/developing countries.

Resource allocation analysis of the stochastic diffusion search

The Stochastic Diffusion Search (SDS) was developed as a solution to the best-fit search problem. Thus, as a special case it is capable of solving the transform invariant pattern recognition problem. SDS is efficient and, although inherently probabilistic, produces very reliable solutions in widely ranging search conditions. However, to date a systematic formal investigation of its properties has not been carried out. This thesis addresses this problem. The thesis reports results pertaining to the global convergence of SDS as well as characterising its time complexity. However, the main emphasis of the work, reports on the resource allocation aspect of the Stochastic Diffusion Search operations. The thesis introduces a novel model of the algorithm, generalising an Ehrenfest Urn Model from statistical physics. This approach makes it possible to obtain a thorough characterisation of the response of the algorithm in terms of the parameters describing the search conditions in case of a unique best-fit pattern in the search space. This model is further generalised in order to account for different search conditions: two solutions in the search space and search for a unique solution in a noisy search space. Also an approximate solution in the case of two alternative solutions is proposed and compared with predictions of the extended Ehrenfest Urn model. The analysis performed enabled a quantitative characterisation of the Stochastic Diffusion Search in terms of exploration and exploitation of the search space. It appeared that SDS is biased towards the latter mode of operation. This novel perspective on the Stochastic Diffusion Search lead to an investigation of extensions of the standard SDS, which would strike a different balance between these two modes of search space processing. Thus, two novel algorithms were derived from the standard Stochastic Diffusion Search, ‘context-free’ and ‘context-sensitive’ SDS, and their properties were analysed with respect to resource allocation. It appeared that they shared some of the desired features of their predecessor but also possessed some properties not present in the classic SDS. The theory developed in the thesis was illustrated throughout with carefully chosen simulations of a best-fit search for a string pattern, a simple but representative domain, enabling careful control of search conditions.

Second-order negative-curvature methods for box-constrained and general constrained optimization

A Nonlinear Programming algorithm that converges to second-order stationary points is introduced in this paper. The main tool is a second-order negative-curvature method for box-constrained minimization of a certain class of functions that do not possess continuous second derivatives. This method is used to define an Augmented Lagrangian algorithm of PHR (Powell-Hestenes-Rockafellar) type. Convergence proofs under weak constraint qualifications are given. Numerical examples showing that the new method converges to second-order stationary points in situations in which first-order methods fail are exhibited.