A posteriori error estimates for a time discrete scheme for a phase-field system of Penrose-Fife type

A time discrete scheme is used to approximate the solution toa phase field system of Penrose–Fife type with a non-conservedorder parameter. An a posteriori error estimate is presentedthat allows the estimation of the difference between continuousand semidiscrete solutions by quantities that can be calculatedfrom the approximation and given data.     

Numerical approximation of generalized Newtonian fluids using Powell–Sabin–Heindl elements: I. theoretical estimates

In this paper we consider the numerical approximation of steady and unsteady generalized Newtonian fluid flows using divergence free finite elements generated by the Powell–Sabin–Heindl elements. We derive a priori and a posteriori finite element error estimates and prove convergence of the method of successive approximations for the steady flow case. A priori error estimates of unsteady flows are also considered. These results provide a theoretical foundation and supporting numerical studies are to be provided in Part II. Copyright © 2003 John Wiley & Sons, Ltd.     

On Brennan's Conjecture for a Special Class of Functions

In this paper, we prove Brennan's conjecture for conformal mappings f of the disk {z : | z| < 1} assuming that the Taylor coefficients of the function log(zf′(z)/f(z)) at zero are nonnegative. We also obtain inequalities for the integral means over the circle |z| = r of the squared modulus of the function zf′(z)/f(z).     

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

带惩罚项与随机输入的BP神经网络在线梯度学习算法的收敛性

本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。     

同轴相移数字全息中相移角的选取及相移误差的消除

基于两步同轴相移数字全息,首先从理论上分析了记录时不同相移角的选取及相移误差对再现像的影响,并给出了一种利用再现像所有抽样点的强度偏差之和作为评价标准,通过逐步改变理论设定相移角值来寻找实际相移角的相移误差消除新方法;其次对二步相移数字全息中记录时参考光波最佳相移角的选取作了计算机模拟,发现只有将参考光波的相移角选择在一定范围内,再现像的噪声较小;最后利用计算机模拟了相移误差消除,验证了所提方法的可行性.     

Oscillation theorems for differential equations with a nonlinear damping term

In this paper, we are concerned with a class of nonlinear second-order differential equations with a nonlinear damping term. Passage to more general class of equations allows us to remove a restrictive condition usually imposed on the nonlinearity, and, as a consequence, our results apply to wider classes of nonlinear differential equations. Two illustrative examples are considered.     

合作联盟资源集成计划一种新方法

合作联盟里，资源集成计划往往是联盟成员群体谈判博弈的结果。本以两人博弈为例，对联盟的资源集成计划给出一个谈判博弈模型，能够较好地模仿和反映合作联盟资源整合计划的制订过程。     

期货经纪公司保证金的一种确定方法

本文基于马尔可夫链在存储论中的应用，结合Ergodic定理，得到确定期货经纪公司保证金的Ergodic模型，即一个双目标规划问题，然后应用乘积最大化准则，将该模型转化为单目标规划问题来求解。该方法考虑期货经纪公司承担的风险和对投资者的吸引程度，为保证金的确定提供新的思路。     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.