Krylov-Bogolyubov averaging of asymptotically autonomous differential equations

We apply the Krylov and Bogolyubov asymptotic integration procedure to asymptotically autonomous systems. First, we consider linear systems with quasi-periodic coefficient matrix multiplied by a scalar factor vanishing at infinity. Next, we study the asymptotically autonomous Van-der-Pol oscillator.

     

谐和随机噪声联合作用下Van der PolDuffing振子的参数主共振

研究了Van der Pol－Duffing振子在谐和与随机噪声联合激励下的参数主共振响应和稳定性问题。用多尺度法分离了系统的快变项，并求出了系统的最大Liapunov指数和稳态概率密度函数，还分析了失稳、分 叉和跳跃现象，讨论了系统的阻尼项、非线性项、随机项和确定性参激强度等参数对系统响应的影响。数值模拟表明所提出的方法是有效的。     

利用场耦合理论研究开放微波谐振腔

利用电磁场的等效原理，将一个开放微波腔等效于一个闭合边界微波腔（即封闭微波腔）和开放边界（即行波吸收边界）两部分，然后利用等效封闭微波腔的本征模式及其与开放边界的耦合，建立了关于开放微波腔模式（即模式场分布、频率、品质因子）的耦合方程组，其中开放边界为行波吸收边界.以X波段六腔渡越振荡管为例进行分析，将该振荡管等效为封闭微波腔和同轴输出结构两部分，用SUPPERFISH获得封闭腔的各个模式场分布及频率，然后根据封闭微波腔与开放边界的耦合，求得六腔渡越振荡管的工作模频率为9.25GHz，品质因子为115.2，与实验测量结果基本符合.     

A Categorical Structure for the Virtual Braid Group

This article gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one morphism corresponding to a transposition in the symmetric group. This point of view makes many relationships between the virtual braid group and the pure virtual braid group apparent, and makes representations of the virtual braid groups and pure virtual braid groups via solutions to the algebraic Yang–Baxter Equation equally transparent. In this categorical framework, the virtual braid group has nothing to do with the plane and nothing to do with virtual crossings. It is a natural group associated with the structure of algebraic braiding.     

Double Hopf bifurcation for van der Pol-Duffing oscillator with parametric delay feedback control

The stability and bifurcation of a van der Pol-Duffing oscillator with the delay feedback are investigated, in which the strength of feedback control is a nonlinear function of delay. A geometrical method in conjunction with an analytical method is developed to identify the critical values for stability switches and Hopf bifurcations. The Hopf bifurcation curves and multi-stable regions are obtained as two parameters vary. Some weak resonant and non-resonant double Hopf bifurcation phenomena are observed due to the vanishing of the real parts of two pairs of characteristic roots on the margins of the “death island” regions simultaneously. By applying the center manifold theory, the normal forms near the double Hopf bifurcation points, as well as classifications of local dynamics are analyzed. Furthermore, some quasi-periodic and chaotic motions are verified in both theoretical and numerical ways.     

The (S−1,S) inventory model and its counterparts in queueing theory

We explore the relationship between the ($S?1,S$) inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the ($S?1,S$) model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period.     

A perturbation theory for the discrete harmonic oscillator equation

This work deals with the existence, uniqueness and stability of solutions for the semilinear discrete harmonic oscillator equation on Banach spaces by using recent characterization of maximal regularity for a best difference approximation of the discrete harmonic oscillator equation.     

Convergence analysis and performance of the extended artificial physics optimization algorithm

This paper presents extended artificial physics optimization (EAPO), a population-based, stochastic, evolutionary algorithm (EA) for multidimensional search and optimization. EAPO extends the physicomimetics-based Artificial Physics Optimization (APO) algorithm by including each individual’s best fitness history. Including the history improves EAPO’s search capability compared to APO. EAPO and APO invoke a gravitational metaphor in which the force of gravity may be attractive or repulsive, the aggregate effect of which is to move individuals toward local and global optima. A proof of convergence is presented that reveals the conditions under which EAPO is guaranteed to converge. Discrete-time linear system theory is used to develop a second-order difference equation for an individual’s stochastic position vector as a function of time step. Stable solutions require eigenvalues inside the unit circle, leading to explicit convergence criteria relating the run parameters {m_i, w, G}. EAPO is tested against several benchmark functions with excellent results. The algorithm converges more quickly than APO and with better diversity.     

A mathematical model of deterministic wormhole routing in hypercube multicomputers using virtual channels

Although several analytical models have been proposed in the literature for binary n-cubes with deterministic routing, most of them have not included the effects of virtual channel multiplexing on network performance. The only mathematical model for deterministic wormhole routing in hypercubes with virtual channels was proposed in [Y. Boura, Design and Analysis of Routing Schemes and Routers for Wormhole-routed Mesh Architectures, Ph.D. Thesis, Department of Computer Science and Engineering, Pennsylvania State University, 1995] which uses complex combinatorial analysis with a computation time of O(N=2ⁿ) for an n-dimensional hypercube. This paper proposes a new and simple analytical model to compute message latency in binary n-cubes with virtual channels. It is very simple and easy to understand which uses an average case analysis and requires a computation time of O(n) for an n-dimensional hypercube. Results from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.     

Rigidity and flexibility of virtual polytopes

All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.