Colony and evolutionary dynamics of a two‐stage model with brood cannibalism and division of labor in social insects

Division of labor (DOL) is a major factor for the great success of social insects because it increases the efficiency of a social group where different individuals perform different tasks repeatedly and presumably with increased performance. Cannibalism plays an important role in regulating colony growth and development by regulating the number of individuals in a colony and increasing survival by providing access to essential nutrients and minimizing competition among colony mates. To understand the synergy effects of DOL and cannibalistic behavior on colony dynamic outcomes, we propose and study a compartmental two‐stage model using ecological and evolutionary game theory settings. Our analytical results of the ecological and evolutionary models suggest that: (1) A noncannibalistic colony can survive if the efficiency of energy investment reflecting the DOL is greater than the relative death rate of the older population. (2) A cannibalistic colony can die out if both the efficiency of energy investment and the relative cannibalism rate (where each is also reflecting the DOL) are too large; or if the relative cannibalism rate alone is too small. (3) From our numerical analysis, cannibalism can increase or reduce the colony's total population size, which greatly depends on the benefit of egg cannibalism increasing or decreasing of adult's lifespan. (4) A cannibalistic and noncannibalistic colony can experience bistability due to cooperative behavior. (5) In the evolutionary settings, DOL can prevent colony death and natural selection can preserve strong Allee effects by selecting the traits with the largest investment on brood care and the lowest cannibalism rate. (6) Evolutionary dynamics may increase the fitness of the colony, i.e., the successful production of workforce which results in the increase of total worker population size, colony survival, and reproduction. Our results suggest both cannibalism and DOLs are adaptive strategies that increase the size of the worker population, and therefore, persistence of the colony.     

含不相关机的动态可重入柔性流水车间问题的混合DABC-GA算法

为了改善生产线的物流平衡和加强阶段间的时间衔接,扩展一般可重入柔性流水车间调度理论,以最小化总加权完工时间为目标,研究了每阶段含不相关并行机的动态可重入柔性流水车间问题,工件在各阶段的加工时间取决于加工它的机器。鉴于所研究问题为NP-hard问题,首先,建立整数规划模型;其次,设计元胞矩阵编码方案,提出融合离散人工蜂群算法和遗传算法的一种混合算法以获得问题的近优解;最后,为了评估混合算法的性能,将所提出算法和一些元启发式算法进行了不同规模问题的对比测试,实验结果说明了所提算法的有效性。     

Improving artificial bee colony with one-position inheritance mechanism

Artificial bee colony (ABC) algorithm simulates the foraging behavior of honey bees. It shows good performance in many application problems and large scale optimization problems. However, variation of a solution in the ABC algorithm is only employed on one dimension of the solution. This would sometimes hamper the convergence speed of the ABC algorithm, especially for large scale optimization. This paper proposes a one-position inheritance (OPI) mechanism to overcome this drawback. The OPI mechanism aims to promote information exchange amongst employed bees of the ABC algorithm. For separable function, OPIABC has a higher probability resulting in function value improvement of the worst positions than ABC. Through one-position information exchange, the OPI mechanism can assist the ABC algorithm to find promising solutions. This mechanism has been tested on a set of 25 test functions with $D= 30$ and on CEC 2008 test suite with $D= 100$ and 1,000. Experimental results show that the OPI mechanism can speed up the convergence of the ABC algorithm. After the use of OPI, the performance of the ABC algorithm is significantly improved for both rotated problems and large scale problems. OPIABC is also competitive on both test suites comparing with other recently proposed swarm intelligence metaheuristics (e.g. SaDE and PSO2011). Furthermore, the OPI mechanism can greatly enhance the performance of other improved ABC algorithms.     

A novel bee swarm optimization algorithm for numerical function optimization

The optimization algorithms which are inspired from intelligent behavior of honey bees are among the most recently introduced population based techniques. In this paper, a novel algorithm called bee swarm optimization, or BSO, and its two extensions for improving its performance are presented. The BSO is a population based optimization technique which is inspired from foraging behavior of honey bees. The proposed approach provides different patterns which are used by the bees to adjust their flying trajectories. As the first extension, the BSO algorithm introduces different approaches such as repulsion factor and penalizing fitness (RP) to mitigate the stagnation problem. Second, to maintain efficiently the balance between exploration and exploitation, time-varying weights (TVW) are introduced into the BSO algorithm. The proposed algorithm (BSO) and its two extensions (BSO–RP and BSO–RPTVW) are compared with existing algorithms which are based on intelligent behavior of honey bees, on a set of well known numerical test functions. The experimental results show that the BSO algorithms are effective and robust; produce excellent results, and outperform other algorithms investigated in this consideration.     

ON THE SEPARATION PROPERTY OF SYMMETRIC ORDINARY SECOND-ORDER DIFFERENTIAL EXPRESSIONS

A 1-variable calculus type argument is used to show that, for a function f : R ² → R, if for all (a, b) ? R ² we have that f o c is smooth for every smooth curve c : R → R ² nonsingular except at 0 and with c(0) = (a, b), then f is smooth. This strengthens Boman's theorem. In fact, we use an even more special collection of smooth curves to prove Boman's theorem. It is shown using a related special collection of smooth curves how the upper half cone can be viewed largely as a model for polar coordinates. Our proof here shows how the use of Frölicher spaces can reduce questions in several dimensions to those of one real variable.     

一类带食饵趋向的Beddington-DeAngelis捕食者-食饵扩散模型整体解的有界性

本文研究一类带食饵趋向的Beddington-DeAngelis捕食者-食饵扩散模型,其中食饵趋向性描述的是捕食者对食饵数量变化而产生的一种正向迁移.利用Neumann热半群的L^p-L^q估计和带抛物型方程Moser迭代的L^p估计,获得了该模型经典解的整体有界性.     

A note on synchronous egg laying in a seabird behaviour model

ABSTRACT

During years when sea surface temperature (SST) is high, gulls in a colony on Protection Island, Washington, USA typically experience low food availability. As SST rises, feeder fish follow plankton to cooler temperatures in deeper water levels. Since gulls are surface-feeding birds, they face a food shortage. A tactic male gulls employ to deal with this food shortage is to cannibalize their neighbours' eggs. Gulls in this colony exhibit an adaptive tactic of every-other-day egg-laying synchrony in response to egg cannibalism, and the level of synchrony increases with colony density. Here we analyze the dynamics of an animal behaviour model for egg laying as a function of colony density. As colony density increases, the equilibrium loses stability in a 2-cycle bifurcation. The 2-cycle becomes increasingly synchronous as the colony density continues to increase. We show that egg-laying synchrony benefits the colony in the presence of cannibalism.     

A NOVEL METHOD OF FITTING SPATIO‐TEMPORAL MODELS TO DATA,WITH APPLICATIONS TO THE DYNAMICS OF MOUNTAIN PINE BEETLES

Abstract We develop a modular landscape model for the mountain pine beetle (Dendroctonus ponderosae Hopkins) infestation of a stage‐structured forest of lodgepole pine (Pinus contorta Douglas). Beetle attack dynamics are modeled using response functions and beetle movement using dispersal kernels. This modeling technique yields four model candidates. These models allow discrimination between four broad possibilities at the landscape scale: whether or not beetles are subject to an Allee effect at the landscape scale and whether or not host selection is random or directed. We fit the models with aerial damage survey data to the Sawtooth National Recreation Area using estimating functions, which allows for more rapid and complete parameter determination. We then introduce a novel model selection procedure based on facial recognition technology to compliment traditional nonspatial selection metrics. Together with these we are able to select a best model and draw inferences regarding the behavior of the beetle in outbreak conditions.     

基于GMRES(m)法的双连通区域数值保角变换的计算法

本文研究了基于模拟电荷法的双连通区域的数值保角变换问题.利用限制Krylov子空间最大维数的算法–GMRES(m)算法,求解基于模拟电荷法的双连通区域数值保角变换中的约束方程,获得了模拟电荷和变换半径,构造了近似保角变换函数.数值实验表明了本文算法的有效性.     

RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n - 1) I

We prove that any binary relation with underlying set (base) E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2, 3, 4 and (n - 1). In part I we characterize relations R and R' on the same base E such that R/X and R'/X are isomorphic for every subset X of E with cardinality 2, 3, 4. In part II we shall prove that R and R' are isomorphic as soon as n > 6 when R/X and R/X' are isomorphic for every subset X of E with cardinality 2, 3, 4 and (n - 1).     

Construction of new symmetric designs with parameters (66,26,10)

It is known that there exists only one (Tran van Trung's) design for (66,26,10) up to now. In this article we consider designs for (66,26,10) with the Frobenius group F₃₉ and we prove that there exist (up to isomorphism) exactly 18 such designs. © 1995 John Wiley & Sons, Inc. We characterize the proper t-wise balanced designs t?(v,K,1) for t ? 3, λ = 1 and v ? 16 with at least two block sizes. While we do not examine extensions of S(3,4,16)'s, we do determine all other possible extensions of S(3,K,v)'s for v ? 16. One very interesting extension is an S(4, {5,6}, 17) design. © 1995 John Wiley & Sons, Inc.     

An historical reenactment of the battle of Gettysburg on Janus (Army)

Utilizing Janus (A), we analyzed the decision made by LTG Richard Ewell at Gettysburg, PA on the evening of 1 July, 1863. At this time, LTG Ewell decided not to attack Culp's Hill. Instead, he waited until the next morning to attack, to permit the mustering of both artillery support and his third division, under command of MG Johnson. Many historians contend that this was a poor tactical decision and was a direct cause of the confederate loss at Gettysburg and possibly the war. We have investigated this issue using a combat simulation model called Janus (Army).Prerequisite to the simulation, systems and weapons of the time had to be modeled in the Janus database. To keep this relatively manageable, we decided to model only the most significant system types on each side. These included the Confederate and Yankee soldier armed with a bayonet and a non-repeating rifle; the cannoneer and cannon (12 Ib ball and cannister-shot) on each side. In total, the simulation represented nearly 200,000 systems engaged at Gettysburg.Our study employed a two level, two factor experimental design. The two factors were the presence of the corp's artillery and Johnson's division. Both factors were relevant to the decision to delay the confederate attack. The levels corresponded with whether or not each factor was used in the simulation. In all, we conducted three replications of the following four design points (tactical alternatives) from which to base our conclusions:

• 1.Design Point 1 (B): Situation on 1 Jul 1863 (no change). Ewell's Corps attacks.
• 2.Design Point 2 (B+A): Corps Artillery supports the attack.
• 3.Design Point 3 (B+J): MG Johnson's Division participates in attack.
• 4.Design Point 4 (B+A+J): Corps Artillery supports and MG Johnson's Division participates in attack.We conclude that LTG Ewell made the correct tactical decision. Without either his corps artillery or Johnson's Division, the corps would have faced annihilation should he have attacked on 1 July. Had he had his corps artillery (6 guns), he probably should have pushed aggressively up the hill. If he had only Johnson's division, he probably could have taken the hill but could not have held it as a tenable position for very long.

     

A particle swarm inspired multi-elitist artificial bee colony algorithm for real-parameter optimization

The Artificial Bee Colony (ABC) algorithm is one of the most recent swarm intelligence based algorithms which simulates the foraging behavior of honey bee colonies. In this work, a particle swarm inspired multi-elitist ABC algorithm named PS-MEABC is proposed and applied for real-parameter optimization. In this modified version, the global best solution and an elitist randomly selected from the elitist archive are used to modify parameters of each food source in either onlooker bees or employed bees phases. PS-MEABC is compared with 5 state-of-the-art swarm based algorithms on CEC05 and BBOB12 benchmark functions in terms of four metrics: the mean error, the best error, the success rate (SR) and the expected running time (ERT). Wilcoxon signed ranks test results on the mean and the best error show that the performance of PS-MEABC is significantly better than or at least similar to these algorithms, and PS-MEABC has wider application range in terms of the success rate and faster convergence speed in terms of the expected running time. Our algorithm is comparable to its competitors with a fewer control parameters to be tuned.     

Markovian representation of a bilinear time series model and maximum likelihood estimation of the parameters

A bilinear time series (BLTS) model is expressed in the form of Akaike's Markovian representation in order to use the Kalman recursive estimation approach. It is shown that Akaike's Markovian representation of autoregressive moving average models of orderp and q (ARMA(p,q)) and that of the bilinear model are equivalent. This equivalence facilitates the maximum likelihood estimation of the parameters involved in the bilinear model, which otherwise is an unwieldy problem. The present approach can easily be extended to take into account missing observations     

棱形六面体的两两面叠合

本文研究了棱形六面体经两两面面叠合后所能得到几何体.利用流形判别和基本群计算的基本方法,获得了在可能叠合到的476种几何体中,有409种不是流形,而在是流形的情形时,其基本群包括1,Z,Z2,Z3,Z5,Z7,Z8以及5种只能用关系表示的群.     

Statistical inference and modelling of momentum in stock prices

The following results are obtained, (i) It is possible to obtain a time series of market data {y(t)} in which the fluctuations in fundamental value have been compensated for. An objective test of the efficient market hypothesis (EMH), which would predict random correlations about a constant value, is thereby possible, (ii) A time series procedure can be used to determine the extent to which the differences in the data and the moving averages are significant. This provides a model of the form y(t)-y(t-l)=0.5{y(t- l)-y(t-2)}+ε(t)+0.8ε(r-1) where ε(t) is the error at time t, and the coefficients 0.5 and 0.8 are determined from the data. One concludes that today's price is not a random perturbation from yesterday's; rather, yesterday's rate of change is a significant predictor of today's rate of change. This confirms the concept of momentum that is crucial to market participants. (iii) The model provides out-of-sample predictions that can be tested statistically. (iv) The model and coefficients obtained in this way can be used to make predictions on laboratory experiments to establish an objective and quantitative link between the experiments and the market data. These methods circumvent the central difficulty in testing market data, namely, that changes in fundamentals obscure intrinsic trends and autocorrelations. This procedure is implemented by considering the ratio of two similar funds (Germany and Future Germany) with the same manager and performing a set of statistical tests that have excluded fluctuations in fundamental factors. For the entire data of the first 1149 days beginning with the introduction of the latter fund, a standard runs test indicates that the data is 29 standard deviations away from that which would be expected under a hypothesis of random fluctuations about the fundamental value. This and other tests provide strong evidence against the efficient market hypothesis and in favour of autocorrelations in the data. An ARIMA time series finds strong evidence (9.6 and 21.6 standard deviations in the two coefficients) that the data is described by a model that involves the first difference, indicating that momentum is the significant factor. The first quarter's data is used to make out-of-sample predictions for the second quarter with results that are significant to 3 standard deviations. Finally, the ARIMA model and coefficients are used to make predictions on laboratory experiments of Porter and Smith in which the intrinsic value is clear. The model's forecasts are decidedly more accurate than that of the null hypothesis of random fluctuations about the fundamental value.     

Clarkson and Random Clarkson Inequalities for Lr(X)

We first show how (p,p′) Clarkson inequality for a Banach space X is inherited by Lebesgue-Bochner spaces L_r(X), which extends Clarkson's procedure deriving his inequalities for L_p from their scalar versions. Fairly many previous and new results on Clarkson's inequalities, and also those on Rademacher type and cotype at the same time (by a recent result of the authors), are obtained as immediate consequences. Secondly we show that if the (p, p') Clarkson inequality holds in X, then random Clarkson inequalities hold in L_r(X) for any 1 ≤ r ≤ ∞; the converse is true if r = p'. As corollaries the original Clarkson and random Clarkson inequalities for L_p are both directly derived from the parallelogram law for scalars.     

Dynamic permeability of an assemblage of soft spherical particles

Under oscillatory Stokes flow, dynamic permeability of assemblage of soft spherical particles is derived. For the bed of soft particles, the fluid‐particle system is represented as an assemblage of uniform permeable spheres fixed in space. Each sphere, with a surrounding envelope of fluid, is uncoupled from the system and considered separately. This model is popularly known as cell model. Oscillatory Stokes equations are employed inside the fluid envelope, and oscillatory Brinkman equations are used inside the porous region. Four known boundary conditions namely: Happel's, Kuwabara's, Kvashnin's, and Cunningham's are considered on the outer boundary and results are compared. The behavior of dynamic permeability is analyzed with various parameters such as Darcy number (Da), frequency parameter (?), porosity (φ), and viscosity ratio (δ). Copyright © 2013 John Wiley & Sons, Ltd.     

On gelfand-kirillov dimensions (g,A) of modules

Let Gbe a real connected semisimple real Lie group and let be Aa connected reductive subgroupg,athe complexified Lie algebras of Gand A respectively; assume (g,a) is a regular pair.In this paper we study general properties of (g, A)-modules, and we prove for two particular cases that every admissible (g, A)-module with an infinitesimal character has finite length.We also compute Gelfand-Kiriilov dimensions for some modules and a number (Vogan's dimension) related to it.Finally we construct a virtual (g,A)-module with“minimal”Vogan's dimension.     

Local compactness for linear elasticity in irregular domains

For the theory of boundary value problems in linear elasticity, it is of crucial importance that the space of vector-valued L²-functions whose symmetrized Jacobians are square-integrable should be compactly embedded in L². For regions with the cone property this is usually achieved by combining Korn's inequalities and Rellich's selection theorem. We shall show that in a class of less regular regions Korn's second inequality fails whereas the desired compact embedding still holds true.