矩阵特征值的几个不等式

研究矩阵特征值的上、下界以及特征值的实部、虚部的不等式 ,给出了特征值一些新的上界和下界     

具有时滞的非自治的捕食-食饵系统的全局吸引

考虑一个具有离散时滞的非自治的捕食—食饵系统。系统是由3种群组成的，其中一个为捕食者，另两个为食饵种群。本文的目的是给出时滞对系统的持续生存是无害的，从而确定了系统的周期解全局吸引的条件。     

The Hopf Property for Subgroups of Hyperbolic Groups

A group is said to be Hopfian if every surjective endomorphism of the group is injective. We show that finitely generated subgroups of torsion-free hyperbolic groups are Hopfian. Our proof generalizes a theorem of Sela (Topology 35 (2) 1999, 301–321).     

Simulation model for shapiro time delay and light deflection experiments

The time delay experiment proposed by I.I. Shapiro in 1964 and conducted in the seventies was the most precise experiment of general relativity until that time. Further experimentation has improved the accuracy level of both the time delay and the light deflection experiments. A simulation model is proposed that involves only a simple mass and time transformation factor involving velocity of light. The light deflection and the time delay experiments are numerically simulated using this model that does not use the general relativistic equations. The computed values presented in this paper compare well with recent levels of accuracy of their respective experimental results.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

水力机械内鲤鱼草鱼的压力损伤模拟试验

通过试验人工模拟水力机械内压力变化过程,测量压力时间变化,观察并解剖分析不同压力变化过程对鲤鱼和草鱼造成损伤的情况。试验发现,负压状态下的压力变化过程会对鱼的生存构成直接威胁,并得到了新型环保水力机械设计中应采用的压力时变导数极限值。     

Directed Motion of a Molecular Motor Based on the Four-State Model with Unequal Substeps

A periodic one-dimensional four-state hopping model is proposed. In the model, the substeps betweenarbitrary adjacent states are unequal, and an explicit solution of the master equation is first obtained for the probabilitydistribution as a function of the time and position for any initial distribution with all the transients included. Next, thetransient behaviors in the initial period of time and the characteristic time to reach the steady state for the molecularmotor are discussed. Finally, we compare the steady state results to experiments and illustrate qualitatively the kineticbehaviors of a molecular motor under external load F.     

用反射法自动测量大尺寸样品的折射率分布

针对大尺寸样品的折射率分布测量,引入自动扫描装置和适时数据处理系统,研究出一种高灵敏度的智能化反射法折射率分布测量仪,可进行快速、自动、准确的折射率分布测量.经理论分析和实验研究提出了一套合理的实验数据处理方法.并具体介绍和详尽分析了实验装置,讨论了有关理论和实验误差,给出了消除各种误差的有效方法,最终得出较为理想的实验结果.