模糊决策在航空维修工程中的应用

本文以模糊数学和规划论为工具，对航空维修工程中一类决策问题的决策方法进行了探讨，给出了具有普遍意义的建模思想，通过实例分析，证明了这种方法的可行性和先进性。     

关于Euler相关数对

本文研究Euler函数问题.利用初等方法,获得了t≥3时Euler的所有数对(t是正整数),并推广了[2]的结果.     

导弹跟踪问题

实验目的本实验主要涉及常微分方程．通过实验将复习常微分方程的建模和求解．另外将介绍微分方程的数值方法：Euler法和改进的Euler法；还介绍了仿真方法．实际问题某军一导弹基地发现正北方向120千米处海面上有敌艇一艘以90千米／小时的速度向正东方向行驶．该基地立即发射导弹跟踪追击敌艇，导弹速率为450千米川。时，自动导航系统使导弹在任一时刻都能对准敌艇，试问导弹在何时何处击中敌艇？教学幻型微分方程建模的方法主要是依据守恒律来建立等量关系式，在这个问题上寻求等量关系是比较简单的．没坐标系如「图1」所示，取导弹基地处…     

线性随机分数阶微分方程Euler方法的弱收敛性与弱稳定性

本文主要研究了线性随机分数阶微分方程Euler方法的弱收敛性与弱稳定性.首先构造了数值求解线性随机分数阶微分方程的Euler方法,然后证明该方法是弱稳定的和α阶弱收敛的,文末给出的数值算例验证了所获得的理论结果的正确性.     

延迟微分方程隐式Euler方法的收敛性

本文讨论了用隐式Euler方法求解一类延迟量满足Lipschitz条件且Lipschitz常数小于1的非线性变延迟微分方程初值问题的收敛性.获得了带线性插值的隐式Euler方法的收敛性结果.     

论数论函数ω(n)及Ω(n)的一些性质

<正> 命 f(n)为一数论函数,关于函数比值 f(n+1)/f(n)(n=1,2,…)的分布问题.Soma-yajula,Sierpi(?)ski 及 Schinzel 曾用算术方法对于 Euler 函数φ(n)、除数和函数     

Bernoulli多项式和Euler多项式的关系

本文给出了 Bernoulli- Euler数之间的关系和 Bernoulli- Euler多项式之间的关系 ,从而深化和补充了有关文献中的相关结果 .     

线性中立型随机延迟微分方程Euler方法的均方稳定性

本文讨论Euler方法用于求解线性中立型随机延迟微分方程初值问题时数值解的稳定性,利用了一种不同于以往文献中的证明技巧,给出了Euler方法均方稳定的一个充分条件.文末的数值试验证实了本文所获理论结果的正确性.     

高阶Bernoulli多项式和高阶Euler多项式的关系

利用发生函数的方法，讨论了高阶Bernoulli数和高阶Euler数，高阶Bernoulli多项式和高阶Euler多项式之间的关系，得到了经典Bernoulli数和Euler数，经典Bernoulli多项式和Euler多项式之间的新型关系。     

关于n阶Euler函数

本文提出了n阶Euler函数的概念,并给出了它的重要性质和计算方法。     

Efficient on-line algorithms for Euler diagram region computation

Euler diagrams are an accessible and effective visualisation of data involving simple set-theoretic relationships. Sets are represented by closed curves in the plane and often have wellformedness conditions placed on them in order to enhance comprehensibility. The theoretical underpinning for tool support has usually focussed on the problem of generating an Euler diagram from an abstract model. However, the problem of efficient computation of the abstract model from the concrete diagram has not been addressed before, despite this computation being a necessity for computer interpretations of user drawn diagrams. This may be used, together with automated manipulations of the abstract model, for purposes such as semantic information presentation or diagrammatic theorem proving. Furthermore, in interactive settings, the user may update diagrams “on-line” by adding and removing curves, for example, in which case a system requirement is the update of the abstract model (without the necessity of recomputation of the entire abstract model). We define the notion of marked Euler diagrams, together with a method for associating marked points on the diagram with regions in the plane. Utilising these, we provide on-line algorithms which quickly compute the abstract model of a weakly reducible wellformed Euler diagram (constructible as a sequence of additions or removals of curves, keeping a wellformed diagram at each step), and quickly updates both the set of curves in the plane as well as the abstract model according to the on-line operations. Efficiency is demonstrated by comparison with a common, naive algorithm. Furthermore, the methodology enables a straightforward implementation which has subsequently been realised as an application for the user classification domain.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Three dimensional fluid–structure interaction under pulsatile flow by using distributed Lagrange multiplier method

In this article we discuss an application of a Lagrange multiplier based fictitious domain method for the simulation of moving leaflets in an unsteady flow generated by pressure gradients during the systolic phase of the cardiac cycle in three dimensional geometry. The mathematical model includes the Navier–Stokes equations coupled with the Euler–Newton equations describing fluid–structure interaction for the generalized Neumann boundary conditions on upstream and downstream boundaries. The solution method includes the finite element method combined with an operator-splitting scheme, where the fictitious formulation allows the flow calculations to be in a fixed rectangular parallelepiped to predict the dynamic structural positions and flow field during the valve opening and closing phases.     

A new Euler matrix method for solving systems of linear Volterra integral equations with variable coefficients

This article develops an efficient solver based on collocation points for solving numerically a system of linear Volterra integral equations (VIEs) with variable coefficients. By using the Euler polynomials and the collocation points, this method transforms the system of linear VIEs into the matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Euler coefficients. A small number of Euler polynomials is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for solving VIEs with variable coefficients.     

Minimizing the variance of a mathematical expectation estimate for a diffusion process functional based on a parametric transformation of a parabolic boundary value problem

This paper deals with finding ways of reducing the variance of a mathematical expectation estimate for the functional of a diffusion process moving in a domain with an absorbing boundary. The estimate of mathematical expectation of the functional is obtained based on a numerical solution of stochastic differential equations (SDEs) by using the Euler method. A formula of the limiting variance is derived with decreasing integration step in the Euler method. A method of reducing the variance value of the estimate based on transformation of the parabolic boundary value problem corresponding to the diffusion process is proposed. Some numerical results are presented.     

Locomotion Dynamics for Bio-inspired Robots with Soft Appendages: Application to Flapping Flight and Passive Swimming

In animal locomotion, either in fish or flying insects, the use of flexible terminal organs or appendages greatly improves the performance of locomotion (thrust and lift). In this article, we propose a general unified framework for modeling and simulating the (bio-inspired) locomotion of robots using soft organs. The proposed approach is based on the model of Mobile Multibody Systems (MMS). The distributed flexibilities are modeled according to two major approaches: the Floating Frame Approach (FFA) and the Geometrically Exact Approach (GEA). Encompassing these two approaches in the Newton–Euler modeling formalism of robotics, this article proposes a unique modeling framework suited to the fast numerical integration of the dynamics of a MMS in both the FFA and the GEA. This general framework is applied on two illustrative examples drawn from bio-inspired locomotion: the passive swimming in von Karman Vortex Street, and the hovering flight with flexible flapping wings.     

The Finite Difference Methods for Fractional Ordinary Differential Equations

Fractional finite difference methods are useful to solve the fractional differential equations. The aim of this article is to prove the stability and convergence of the fractional Euler method, the fractional Adams method and the high order methods based on the convolution formula by using the generalized discrete Gronwall inequality. Numerical experiments are also presented, which verify the theoretical analysis.     

Timed Petri nets and prediction to improve the Chandy–Misra conservative-distributed simulation

The main contribution of this paper shows that distributed simulation of timed Petri nets (TPN) can take advantage of their structure to obtain a significant lookahead which is usually difficult to compute with other models. In this paper, we introduce a conservative-distributed simulation with a reduced number of control messages and without deadlock resolution. This approach is based on a part of optimism computed on the prediction time each logical process can determine for its advancement. Obviously this prediction time must be computed easily according to the structure of the simulated logical process. Timed Petri nets meet these requirements and we use their structure to evaluate the depth of the prediction. In conservative-distributed simulation, it is known that the deeper the prediction, the better the efficiency of the simulation. We present a method we have devised based on channel time prediction. We compare its performance to the Chandy–Misra method and to some related Petri nets approaches (Chiola). Experiments carried out on Sun stations show that there is more parallelism and a reduced number of null messages in the cases of deadlock avoidance. Moreover, considering deadlock detection and resolution technique we observe that in many cases no deadlock occurs with less control messages.     

Piecewise linear concave dynamical systems appearing in the microscopic traffic modeling

Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The dynamics of these Petri nets are uniquely defined and may be described by a generalized matrix with a submatrix in the standard algebra with possibly negative entries, and another submatrix in the minplus algebra. When the dynamics is additively homogeneous, a generalized additive eigenvalue is introduced, and the ergodic theory is used to define a growth rate. In the traffic example of two roads with one junction, we compute explicitly the eigenvalue and we show, by numerical simulations, that these two quantities (the additive eigenvalue and the average growth rate) are not equal, but are close to each other. With this result, we are able to extend the well-studied notion of fundamental traffic diagram (the average flow as a function of the car density on a road) to the case of roads with a junction and give a very simple analytic approximation of this diagram where four phases appear with clear traffic interpretations. Simulations show that the fundamental diagram shape obtained is also valid for systems with many junctions.