一类两性分枝过程条件均值增长率的极限性质

本文主要研究随机环境中配对依赖人口数两性 Galton-Watson 分枝过程的条件均值增长率的极限性质．利用上可加函数的性质，得到配对单元平均增长率的极限性质和该过程条件均值的上界和下界．文中给出了关于过程条件均值增长率的两个序列，利用配对单元平均增长率的性质，获得了这两个序列的极限性质．随机环境中配对依赖人口数两性分枝过程比较复杂，本文的结论推广了现有的研究成果．     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

First Identification of a Putative Sex Pheromone in a Praying Mantid

Praying mantids are models for a wide variety of behavioral, physiological, and ecological studies, and sex pheromones have been assumed to be important components of their biology. However, no mantid pheromone has ever been identified. We collected volatiles emitted by females of the mantid, Sphodromantis lineola, via solid phase microextraction (SPME). Mass spectral analysis revealed the collected volatiles to be a mixture of pentadecanal and tetradecanal. We prepared a synthetic mixture of these compounds, and found that males were both attracted to this mixture and stimulated to exhibit typical precopulatory behavior. We then examined male antennae with scanning electron microscopy, and confirmed the presence of porous antennal sensilla typical of insect pheromone receptors, i.e., that male mantids are equipped with the appropriate morphological apparatus to receive volatile chemical signals. Pheromones, in conjunction with visual and tactile cues, are thus an important feature of the reproductive biology of this, and undoubtedly other species of mantids. In addition to adding a crucial aspect of behavioral biology to our knowledge of this group, identification and synthesis of mantid pheromones may be a first step in attracting and aggregating these generalist predators for use in pest control.     

A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization

Traditional Genetic Algorithms (GAs) mating schemes select individuals for crossover independently of their genotypic or phenotypic similarities. In Nature, this behavior is known as random mating. However, non-random protocols, in which individuals mate according to their kinship or likeness, are more common in natural species. Previous studies indicate that when applied to GAs, dissortative mating - a type of non-random mating in which individuals are chosen according to their similarities - may improve their performance (on both speed and reliability). Dissortative mating maintains genetic diversity at a higher level during the run, a fact that is frequently observed as a possible cause of dissortative GAs’ ability to escape local optima. Dynamic optimization demands a special attention when designing and tuning a GA, since diversity plays an even more crucial role than it does when tackling static ones. This paper investigates the behavior of the Adaptive Dissortative Mating GA (ADMGA) in dynamic problems and compares it to GAs based on random immigrants. ADMGA selects parents according to their Hamming distance, via a self-adjustable threshold value. The method, by keeping population diversity during the run, provides an effective means to deal with dynamic problems. Tests conducted with dynamic trap functions and dynamic versions of Road Royal and knapsack problems indicate that ADMGA is able to outperform other GAs on a wide range of tests, being particularly effective when the frequency of changes is low. Specifically, ADMGA outperforms two state-of-the-art algorithms on many dynamic scenarios. In addition, and unlike preceding dissortative mating GAs and other evolutionary techniques for dynamic optimization, ADMGA self-regulates the intensity of the mating restrictions and does not increase the set of parameters in GAs, thus being easier to tune.     

一种基于配合约束的装配顺序产生算法

结合配合约束在装配中的应用,在分析装配零件的配合约束及其特点的基础上,得到零件之间的空间位置关系和零件的局部自由度,充分利用这些信息,引入优先装配方向和局部自由度表的概念,提出了一种基于最少装配方向的装配顺序自动生成算法。     

Male response to natural sex pheromone ofMigdolus fryanus westwood (Coleoptera: Cerambycidae) females as affected by daily climatic factors

Males of the sugarcane borer,Migdolus fryanus (Coleoptera: Cerambycidae), are attracted to females by means of a sex pheromone. Mating usually occurs during a few days from October to March under field conditions in São Paulo State, Brazil. This work reports on mating of this species as affected by daily climatic factors, during a single nuptial flight. Maximum male capture by the natural sex pheromone occurred from 1000 to 1100 AM at air and soil temperatures of 30.0°C and relative humidity of 57.0%. As these temperatures increased, females burrowed into the soil, as they are more sensitive to heat than males. Thus, it was concluded that sex pheromone-mediated mating in this cerambycid is directly affected by temperatures of air and soil.     

Snake Mating Systems, Behavior, and Evolution: The Revisionary Implications of Recent Findings.

Sexual selection and mating systems profoundly influence the behavior and psychology of animals. Using their own studies of green anacondas (Eunectes murinus) and reviewing other recent studies, the authors conclude that incomplete data derived from a few well-studied snake species have led to general acceptance of polygyny as the dominant mating system in snakes. New data on behavior, paternity, and life history in a diverse taxonomic array of snakes support the view that polyandry is not only common in snakes but may have been the ancestral mating system. This interpretation helps to explain many seemingly paradoxical behavioral differences between lizards and snakes, such as the lack of territorial systems in most snakes and their frequent female-biased sexual size dimorphism. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

嗜虫书虱交配规律的研究

研究了嗜虫书虱在26 ℃、75%RH条件下以全麦粉、酵母、脱脂奶粉为饲料的交配规律和产卵情况.结果表明:该虫在成虫后第2～7天开始交配;其在成虫后第3～4天及黑暗后4 h达到交配高峰期;产卵增长率和单头雌虫产卵的情况证明了交配的高峰期在成虫后第三至四天.     

Generation of assembly models from kinematic constraints

In this paper, we propose a new joint-based assembly modeling method. In joint-based assembly modeling, the assembly constraints are specified on the components, but not on the geometric elements of the components. The proposed method generates assembly models from kinematic joint constraints by applying three procedures (1) to extract all feasible JMFs (Joint Mating Feature) for each mating component using information on joint constraints, (2) to derive mating alternatives for each pair of mating components after reducing the number of JMFs using the pruning criteria, and (3) to generate an assembly model by choosing the intended one from the mating alternatives for each pair of mating components and solving the JMF constraints. Since the joint constraints are expressed in terms of the relations between components rather than relations between geometric elements, the proposed method is more intuitive and natural for assembly modeling and supports modeling activities effectively by minimizing user interactions. By using joint mating constraints for assembly modeling, moreover, the kinematic behaviors of assemblies determined in the conceptual design stage can be directly applied and consistently maintained up to the detailed design stage. In the proposed method, it is also not necessary to re-input the mating constraints even when the component topology is changed.