On the solution of Maxwell's equations in polygonal domains

This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H² when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H², and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

Analysis of the manufacturing lead time in a production system with non-renewal batch input,threshold policy and post-operation

In this paper, we analyze the manufacturing lead time in a production system with BMAP (Batch Markovian Arrival process) input and post-operation operated under the N-policy. We use the factorization principle to derive the waiting time distribution (hence the manufacturing lead time) and the mean performance measures. A numerical example is provided.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

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

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

Vassiliev invariants for braids on surfaces

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.

     

Mass‐lumping or not mass‐lumping for eigenvalue problems

In this article we analyze the effect of mass‐lumping in the linear triangular finite element approximation of second‐order elliptic eigenvalue problems. We prove that the eigenvalue obtained by using mass‐lumping is always below the one obtained with exact integration. For singular eigenfunctions, as those arising in non convex polygons, we prove that the eigenvalue obtained with mass‐lumping is above the exact eigenvalue when the mesh size is small enough. So, we conclude that the use of mass‐lumping is convenient in the singular case. When the eigenfunction is smooth several numerical experiments suggest that the eigenvalue computed with mass‐lumping is below the exact one if the mesh is not too coarse. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 653–664, 2003     

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     

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

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

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.