非齐次的食饵——捕食模型

为了建立被捕食与捕食模型,我们在ｚ＾ｄ上考虑两种群的相互作用,还考虑了在被捕食者数目很大时,捕食者变化地趋于一个常数的情况,最后,给出了关于两种群共存的与非共存问题的研究。     

马尾松毛虫幼虫的捕食天敌及其捕食作用的研究

根据林间调查和室内观察资料,分析了江西省万年县不同松林中马尾松毛虫不同发生代别低龄幼虫期的主要捕食天敌种类及数量。结果表明低龄幼虫期捕食无敌有13科31种,其中以蜘蛛类最多,其次为蚂蚁类。不同林型中捕食天敌的种类和数量在年份间代别间均存在一定差异,数量差异尤其显著。在室内研究了几种主要捕食无敌对马尾松毛虫低龄幼虫的捕食作用及其功能反应,结果表明功能反应为S型,由此建立了它们的功能反应模型。     

两类非耗散系统的弱持久性

利用Perron-Frobenuis定理及定性理论,讨论了环状捕食－被捕食模型及文[1]中提出的一类食物链模型为非耗散系统的条件及模型为非耗散系统时的弱持久性问题,得到其弱持久的判别准则,解决了文[1]提出的问题。     

捕食风险的种群动态效应及其作用机理研究进展

捕食者不但可以通过直接捕杀猎物而控制猎物的种群数量,还可以通过捕食风险效应影响猎物种群的繁殖和动态,并且在某些情况下,捕食风险效应对猎物种群动态的控制作用甚至大于捕食者的直接捕杀.关于捕食风险效应对猎物动物繁殖产出和种群动态变化的作用及其机理方面的野外研究越来越受到国内外学者重视.本文介绍了近年来捕食风险效应的研究进展,重点关注了美国黄石国家公园中捕食者对马鹿(Cervus elephus)、加拿大育空地区的捕食者对白靴兔(Lepus americanus)的捕食风险效应等案例研究,以阐明捕食风险效应对猎物种群动态影响的重要性,以及关于捕食风险效应影响猎物种群繁殖和动态机理的两个假说(捕食者敏感食物假说、捕食应激假说).并结合我国在捕食者与猎物之间关系的研究现状,提出了进一步在野外开展捕食风险效应对濒危有蹄类猎物种群动态影响研究的建议,阐释了开展这些研究的重要意义.     

两种杀虫剂对稻田捕食性天敌集团捕食功能的影响

将稻田各类捕食性天敌作为一集团,运用功能法评价了甲胺磷和杀虫双对该集团捕食功能的影响,由于各类捕食性天敌对杀虫剂敏感性的不同,甲胺磷和杀虫双造成的各类天敌的死亡率和残存天敌个体的捕食功能减退率均不同。实验表明,隐翅虫类和狼蛛类对甲胺磷较为敏感,而对杀虫双,肖蛸类最为敏感。杀虫双对隐翅虫类的致死作用及捕食功能影响较小。就集团的捕食功能而言,甲胺磷影响明显大于杀虫双,但在总的功能减退率组分中,甲胺磷致     

捕食──被捕食系统中的周期现象

本文给出了捕食被捕食系统中增殖率非单调的场合以及捕食具有饱和的场合,系统周期解的存在性;另一方面,当增殖率单调或捕食量仅与个体数成比例这样简单型的相互作用,或相互作用具有时滞效应时,给出了周期解的存在性．     

饥饿对大草蛉雄成虫捕食作用的影响

对不同饥饿程度大草蛉雄成虫捕食作用影响的研究表明,饥饿不能改变大草蛉雄成虫捕食作用功能反应类型,饥饿对捕食量影响不显著;大草蛉雄成虫对麦二叉蚜的捕食量（Ｎａ）随着时间（ｔ）的变化,其模型为Ｎａ＝１００／１＋ｅ＾－０．３０８８－０．０９９６ｔ;大草蛉雄成虫在２４ｈ内的捕食速率（Ｖ）与其时间段（ｘ）的关系为Ｖ＝６．７１１７ｘ＾－０．７９２８;大草蛉雄成虫喜好选择捕食麦二叉蚜的低龄若蚜。     

捕食线虫真菌

捕食线虫真菌是一类通过捕食器官捕食线虫的生物,在自然界是影响线虫数量的主要因子。对捕食线虫真菌的捕食器官、捕食机制、捕食线虫真菌的形态及其在植物线虫的生物防治进行了简要论述。     

具有比率依赖和密度制约的周期捕食-被捕食系统的一致持久性(英文)

系统的讨论了具有比率依赖和密度制约的周期捕食-被捕食系统的持久性问题,不仅得到了系统一致持久的充分条件,还得到了必要条件,并且持久性条件在模型中得到验证.     

捕食植物的捕食结构

据统计,全世界能捕食动物的捕食植物约有五百多种.广泛分布在世界各地,自然界中存在的这种特殊类型的捕食方式,是由于它们所处的特殊自然环境所决定的。它们往往生存在氮素和其他矿质养料较匮乏、自然条件并不十分优越的环境中,单纯地靠体内叶绿体进行光合作用,只能维持短暂的生活,必须靠捕食动物来补充体内的营养物质,维持自身的生存,在长期的自然选择中,这种适应不断被巩固和加强,其形态结构变得更有利于巧妙和有效地捕捉动物,这类捕食结构的特化,主要表现在以下几个方面:     

Construction of Selection Indexes with Restrictions

In this paper the problem of unistage selection with inequality constraints is formulated. If the predictor and criterion variables are all normally distributed, this problem can be written as a convex programming problem, with a linear objective function and with linear constraints and a quadratic constraint. Using the duality theory, for convex nonlinear programming it is proved, that its dual problem can be transformed into a convex minimization problem with non-negativity conditions. Good computational methods are known for solving this problem. By the help of the dual problem sufficient conditions for a solution of the original primal problem are derived and illustrated by an example of practical interest.     

The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches

The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the {tt NNI} search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the {tt NNI} search problem, 2) introduce extensions that significantly enlarge the search space of the {tt NNI} search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the {tt NNI} search problem. The exceptional speedup achieved in the extended {tt NNI} search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees.     

Effective haplotype assembly via maximum Boolean satisfiability

The haplotype assembly problem seeks the haplotypes of an individual from which a set of aligned SNP fragments are available. The problem is important as the haplotypes contain all the SNP information, which is essential to such studies as the analysis of the association between specific diseases and their potential genetic causes. Using Minimum Error Correction as the objective function, the problem is NP-hard, which raises the demand for effective yet affordable solutions. In this paper, we propose a new method to solve the problem by providing a novel Max-2-SAT formulation for the problem. The proposed method is compared with several well-known algorithms proposed for the problem in the literature on a recent extensive benchmark, outperforming them all by achieving solutions of higher average quality.     

Analysis of mussel growth data*

This short paper considers the problem of estimating the year of birth of a mussel picked at an unknown time. This is an important problem not only for studying a certain mussel population but also for environmental monitoring. A mathematical formulation of the problem is presented, which leads to a combined delay estimation and constrained linear regression problem. A solution is developed and applied to the estimation problem. Examples with mussels picked from a river in Sweden are shown, which demonstrate that the proposed technique works well in practice.     

The component retrieval problem in printed circuit board assembly

Minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the specification of the order in which components are to be placed on the board and the assignment of component types to the feeder slots of the placement machine. If some component types are assigned to multiple feeder slots, an additional problem emerges: for each placement on the board, one must select the feeder slot from which the required component is to be retrieved. In this paper, we consider this component retrieval problem for placement machines of the Fuji CP type. We explain why simple forward dynamic programming schemes cannot provide a solution to this problem, invalidating the correctness of an algorithm proposed by Bard, Clayton, and Feo (1994). We then present a polynomial algorithm that solves the problem to optimality. The analysis of the component retrieval problem is facilitated by its reformulation as a PERT/CPM problem with design aspects: finding the minimal makespan of the assembly process amounts to identifying a design for which the longest path in the induced PERT/CPM network is shortest. The complexity of this network problem is analyzed, and we prove that the polynomial solvability of the component retrieval problem is caused by the specific structure it inflicts on the arc lengths of the network: in the absence of this structure, the network problem is shown to be NP-hard.     

A special view on the nature of the allocation problem

One of the remaining important problems of life cycle inventory analysis is the allocation problem. A proper solution of this problem calls for a proper understanding of the nature of the problem itself. This paper argues that the established definition of the allocation problem as the fact that one unit process produces more than one function, is not appropriate. That definition points to an important reason of the occurrence of the problem, but the situation of internal (closed-loop) recycling already indicates that there may be product systems which contain multifunction processes, but which nevertheless need not exhibit an allocation problem. The paper proceeds by examining a number of simple hypothetical cases, and proposes a precise and operational definition of the allocation problem. This enables a systematic categorization of approaches for dealing with the allocation problem.     

Reconstructing recombination network from sequence data: the small parsimony problem

The small parsimony problem is studied for reconstructing recombination networks from sequence data. The small parsimony problem is polynomial-time solvable for phylogenetic trees. However, the problem is proved NP-hard even for galled recombination networks. A dynamic programming algorithm is also developed to solve the small parsimony problem. It takes O(dn2(3h)) time on an input recombination network over length-d sequences in which there are h recombination and n - h tree nodes.     

蚂蚁群落优化算法在蛋白质折叠二维亲-疏水格点模型中的应用

氨基酸的亲疏水格点模型是研究蛋白质折叠的一种重要的简化模型,其优化问题是一个非确定型的多项式问题。采用蚂蚁群落优化算法对这一问题进行了研究,对测试数据的计算结果表明,在一定规模下,此算法能够有效地获得亲-疏水格点模型的最优解,其效率优于传统的Monte Carlo仿真等方法。     

Scaffold filling under the breakpoint and related distances

Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, a problem on filling an incomplete multichromosomal genome (or scaffold) I with respect to a complete target genome G was studied. The objective is to minimize the resulting genomic distance between I' and G, where I' is the corresponding filled scaffold. We call this problem the onesided scaffold filling problem. In this paper, we conduct a systematic study for the scaffold filling problem under the breakpoint distance and its variants, for both unichromosomal and multichromosomal genomes (with and without gene repetitions). When the input genome contains no gene repetition (i.e., is a fragment of a permutation), we show that the two-sided scaffold filling problem (i.e., G is also incomplete) is polynomially solvable for unichromosomal genomes under the breakpoint distance and for multichromosomal genomes under the genomic (or DCJ--Double-Cut-and-Join) distance. However, when the input genome contains some repeated genes, even the one-sided scaffold filling problem becomes NP-complete when the similarity measure is the maximum number of adjacencies between two sequences. For this problem, we also present efficient constant-factor approximation algorithms: factor-2 for the general case and factor 1.33 for the one-sided case.     

Pontryagin's principle for control problems in age-dependent population dynamics

In this paper, Pontryagin's principle is proved for a fairly general problem of optimal control of populations with continuous time and age variable. As a consequence, maximum principles are developed for an optimal harvesting problem and a problem of optimal birth control.