基于熵理论的病例父母亲对照研究来精细定位

原始的连锁不平衡熵指数通过比较群体样本中标记熵和条件熵来定位疾病位点或数量性状位点．它可能受群体混杂的影响．而利用病例父母亲对照研究或其他的家系研究可以避免群体混杂的影响．本文拓展了连锁不平衡熵指数到病例父母亲数据，将没有传递给受累子代的父母亲的基因型视为对照样本．随机模拟的结果表明连锁不平衡熵指数适用家系研究．     

非线性纵向数据模型中方差和自相关系数的齐性检验

刻画纵向数据的协方差结构有三个可能因素：随机效应、序列相关和随机误差．在纵向数据分析中，模型方差的齐性是一个基本假定．但是，该假设未必正确．Zhang和、Weiss^[1]研究了具有随机效应的线性模型的异方差检验．林金官和韦博成^[2]将Zhang和、Weiss^[1]的结果推广到非线性情形．本文对具有自相关误差的非线性纵向数据模型，研究了方差齐性和相关系数的齐性检验，得到了检验的score统计量并应用于血浆渗透数据(见Davidian和Giltian^[3])．最后，本文还给出了模拟结果．     

关于参数型copula函数的拟合检验

在金融和保险中,copula函数是一种构造多元相关分布函数的有力工具．然而,怎样选择一个适当的copula函数用于拟合数据,并没有找到统一的方法．因此,基于copula函数的经验分布,我们提出了一种用于检验具有某种特定参数结构的copula函数拟合数据优良性的方法,并得到了此检验的渐近性质．由于该检验统计量的极限分布依赖未知参数,我们采用非参数蒙特卡罗方法确定临界值．我们做了一个简单的模拟来验证本文提出的检验方法的功效．     

具有椭球误差的线性一致相关模型的相关性检验

本文讨论具有椭球误差的线性一致相关模型的相关性检验问题.基于Fisher-score方法给出模型参数估计的迭代公式,然后分别对一致相关系数进行了存在性和齐性检验,得到了相应检验的score统计量,同时给出了功效模拟.最后利用实际数据说明了模型以及检验统计量的价值.     

时间序列中向量自回归模型的拟合优度检验

本文提出并研究了一些诊断检验工具,用于一般参数型的时间序列向量自回归模型的拟合优度检验．该检验在零假设下渐近服从卡方分布,并能侦察到以参数速度收敛到零假设模型的备择模型．检验涉及到权函数,因此可以灵活地选择权函数以提高检验功效,尤其是在可能的偏离方向已知情形．如果备择不是方向型的,而只知道其属于某一个模型类中,此时可构造一个渐近分布自由的极大极小（maximin）检验．对于饱和备择,基于得分型思想给出了构造万能（omnibus）检验的可行性构想．本文对提出的检验从理论上进行了功效研究．另外,为提高检验在小样本情形的功效,本文把非参数Monte Carlo检验方法推广到相依数据情形．最后,通过模拟研究和实际数据分析进一步表明检验的有用性．     

具有结构变化的非线性回归模型的阶段异方差检验

对于具有结构变化的非线性回归模型,两阶段的随机误差同时具有方差齐性是一个基本假设,但是该假设未必正确．本文研究该模型阶段异方差的检验问题．首先探讨了两阶段异方差的同时检验,然后构造了两阶段异方差的两个单个检验,分别得到了同时检验和单个检验的score统计量以及相应的调整形式．然后应用得到的检验统计量分析了南澳大利亚洋葱数据的阶段异方差性(Ratkowsky,1983),并用AIC,SBC进行模型比较,得到的结果与检验结果非常吻合．最后,用Monte Carlo模拟方法研究了统计量的检验功效．     

线性混合模型方差分量的检验

对于含有两个方差分量的随机效应设计阵为任意阵的线性混合模型的方差分量单边检验问题给出了精确的F检验和基于广义p值的检验.对于给出的精确的F检验给出检验存在条件以及是一致最优无偏检验的条件.通过数值模拟,基于广义p值检验的功效和犯第一类错误的概率被讨论,由模拟结果可以看出基于广义p值的检验很好地控制了犯第一类错误的概率.     

纵向部分线性模型的分块经验似然比检验

结合基函数逼近技术和分块经验似然方法,对纵向数据下的部分线性模型提出了一个简单有效的检验方法.在一定条件下,证明了所构造的检验统计量渐近服从标准卡方分布,进而得到了一定置信水平的拒绝域.数据模拟表明该检验方法可以有效地消除纵向数据的组内相关性对检验功效的影响.     

具有随机删失数据的部分线性模型的拟合优度检验的渐近性质

研究随机删失部分线性回归模型的假设检验问题. 提出了一个检验统计量来检验数据是否满足一个部分线性回归模型, 它是基于残差的cusum过程的平方形式. 研究了零假设下和局部对立假设下检验统计量的渐近分布. 数值模拟表明该检验方法有好的检验功效.     

极值分布和威布尔分布异常数据的检验方法

本文对威布尔分布的极值分布异常数据的检验给出了一系列的方法，首先，导入了极值分布下一般Ｄｉｘｏｎ型统计量的精确分布，同时还给出了改进的Ｇ型统计量，及它们的分位点表。最后本文提出了一个新的统计量；Ｆ型统计量，并用Ｍｏｎｔｅ－Ｃａｒｌｏ模拟的方法给出其分位点表，从而首次给出威布尔分布异常值的直接检验方法。本文进一步讨论了这些检验方法的功效，且表明Ｆ型检验是最优的。     

Bounds for the price of a European-style Asian option in a binary tree model

Inspired by the ideas of Rogers and Shi [J. Appl. Prob. 32 (1995) 1077], Chalasani et al. [J. Comput. Finance 1(4) (1998) 11] derived accurate lower and upper bounds for the price of a European-style Asian option with continuous averaging over the full lifetime of the option, using a discrete-time binary tree model. In this paper, we consider arithmetic Asian options with discrete sampling and we generalize their method to the case of forward starting Asian options. In this case with daily time steps, the method of Chalasani et al. is still very accurate but the computation can take a very long time on a PC when the number of steps in the binomial tree is high. We derive analytical lower and upper bounds based on the approach of Kaas et al. [Insurance: Math. Econ. 27 (2000) 151] for bounds for stop-loss premiums of sums of dependent random variables, and by conditioning on the value of underlying asset at the exercise date. The comonotonic upper bound corresponds to an optimal superhedging strategy. By putting in less information than Chalasani et al. the bounds lose some accuracy but are still very good and they are easily computable and moreover the computation on a PC is fast. We illustrate our results by different numerical experiments and compare with bounds for the Black and Scholes model [J. Pol. Econ. 7 (1973) 637] found in another paper [Bounds for the price of discretely sampled arithmetic Asian options, Working paper, Ghent University, 2002]. We notice that the intervals of Chalasani et al. do not always lie within the Black and Scholes intervals. We have proved that our bounds converge to the corresponding bounds in the Black and Scholes model. Our numerical illustrations also show that the hedging error is small if the Asian option is in the money. If the option is out of the money, the price of the superhedging strategy is not as adequate, but still lower than the straightforward hedge of buying one European option with the same exercise price.     

On the Stirling numbers associated with the meromorphic Weyl algebra

The generalized Stirling numbers introduced recently (Mansour and Schork, 2011 [5], Mansour et al., 2011 [6]) are considered in detail for the particular case $s=2$ corresponding to the meromorphic Weyl algebra. A combinatorial interpretation in terms of perfect matchings is given for these meromorphic Stirling numbers and the connection to Bessel functions is discussed. Furthermore, two related $q$-polynomial identities are derived.     

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time

We describe a randomized algorithm for computing the trapezoidal decomposition of a simple polygon. Its expected running time is linear in the size of the polygon. By a well-known and simple linear time reduction, this implies a linear time algorithm for triangulating a simple polygon. Our algorithm is considerably simpler than Chazelle's [3] celebrated optimal deterministic algorithm. The new algorithm can be viewed as a combination of Chazelle's algorithm and of simple nonoptimal randomized algorithms due to Clarkson et al. [6], [7], [9] and to Seidel [20]. As in Chazelle's algorithm, it is indispensable to include a bottom-up preprocessing phase, in addition to the actual top-down construction. An essential new idea is the use of random sampling on subchains of the initial polygonal chain, rather than on individual edges as is normally done. Received April 18, 2000, and in revised form December 7, 2000. Online publication June 20, 2001.     

Sensitivity analysis of permeability parameters for flows on Barcelona networks

We consider the problem of optimizing vehicular traffic flows on an urban network of Barcelona type, i.e. square network with streets of not equal length. In particular, we describe the effects of variation of permeability parameters, that indicate the amount of flow allowed to enter a junction from incoming roads.On each road, a model suggested by Helbing et al. (2007) [11] is considered: free and congested regimes are distinguished, characterized by an arrival flow and a departure flow, the latter depending on a permeability parameter. Moreover we provide a rigorous derivation of the model from fluid dynamic ones, using recent results of Bretti et al. (2006) [3]. For solving the dynamics at nodes of the network, a Riemann solver maximizing the through flux is used, see Coclite et al. (2005) [4] and Helbing et al. (2007) [11].The network dynamics gives rise to complicate equations, where the evolution of fluxes at a single node may involve time-delayed terms from all other nodes. Thus we propose an alternative hybrid approach, introducing additional logic variables. Finally we compute the effects of variations on permeability parameters over the hybrid dynamics and test the obtained results via simulations.     

CSP-V方案的特性参数及中止规则[R]

本文计算并给出连续抽样方案ＣＳＰ－Ｖ的三类特性参数，与ＡＯＱＬ相应的ＰＬ值，与操作特性值０．１相应的极限质量水平ＬＱ值，以及与ＡＱＬ，ＬＱ相应的中止概率Ｐ１，Ｐ２等。还讨论了在ＣＳＰ－Ｖ方案中以中止规则［Ｒ］代替现行中止规则［Ｓ］的可能性。     

Bounds for Asian basket options

In this paper we propose pricing bounds for European-style discrete arithmetic Asian basket options in a Black and Scholes framework. We start from methods used for basket options and Asian options. First, we use the general approach for deriving upper and lower bounds for stop-loss premia of sums of non-independent random variables as in Kaas et al. [Upper and lower bounds for sums of random variables, Insurance Math. Econom. 27 (2000) 151–168] or Dhaene et al. [The concept of comonotonicity in actuarial science and finance: theory, Insurance Math. Econom. 31(1) (2002) 3–33]. We generalize the methods in Deelstra et al. [Pricing of arithmetic basket options by conditioning, Insurance Math. Econom. 34 (2004) 55–57] and Vanmaele et al. [Bounds for the price of discrete sampled arithmetic Asian options, J. Comput. Appl. Math. 185(1) (2006) 51–90]. Afterwards we show how to derive an analytical closed-form expression for a lower bound in the non-comonotonic case. Finally, we derive upper bounds for Asian basket options by applying techniques as in Thompson [Fast narrow bounds on the value of Asian options, Working Paper, University of Cambridge, 1999] and Lord [Partially exact and bounded approximations for arithmetic Asian options, J. Comput. Finance 10 (2) (2006) 1–52]. Numerical results are included and on the basis of our numerical tests, we explain which method we recommend depending on moneyness and time-to-maturity.     

Equations with infinite delay: Blending the abstract and the concrete

Using perturbation theory for adjoint semigroups (a modification of sun-star calculus) we prove, in the case of infinite delay, the principle of linearized stability for nonlinear renewal equations, delay-differential equations and coupled systems of these two types of equations. Our results extend those of Diekmann et al. (1995) [13] and Diekmann et al. (2007) [14] to the case of infinite delay.     

On the Rayleigh-Plateau instability

In this paper,we study the surface instability of a cylindrical pore in the absence of stress. This instability is called the Rayleigh-Plateau instabilty. We consider the model developed by Spencer et ...     

Linearly Implicit Approximations of Diffusive Relaxation Systems

Diffusive relaxation systems provide a general framework to approximate nonlinear diffusion problems, also in the degenerate case (Aregba-Driollet et al. in Math. Comput. 73(245):63–94, 2004; Boscarino et al. in Implicit-explicit Runge-Kutta schemes for hyperbolic systems and kinetic equations in the diffusion limit, 2011; Cavalli et al. in SIAM J. Sci. Comput. 34:A137–A160, 2012; SIAM J. Numer. Anal. 45(5):2098–2119, 2007; Naldi and Pareschi in SIAM J. Numer. Anal. 37:1246–1270, 2000; Naldi et al. in Surveys Math. Indust. 10(4):315–343, 2002). Their discretization is usually obtained by explicit schemes in time coupled with a suitable method in space, which inherits the standard stability parabolic constraint. In this paper we combine the effectiveness of the relaxation systems with the computational efficiency and robustness of the implicit approximations, avoiding the need to resolve nonlinear problems and avoiding stability constraints on time step. In particular we consider an implicit scheme for the whole relaxation system except for the nonlinear source term, which is treated though a suitable linearization technique. We give some theoretical stability results in a particular case of linearization and we provide insight on the general case. Several numerical simulations confirm the theoretical results and give evidence of the stability and convergence also in the case of nonlinear degenerate diffusion.     

Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming

Sample average approximation (SAA) is one of the most popular methods for solving stochastic optimization and equilibrium problems. Research on SAA has been mostly focused on the case when sampling is independent and identically distributed (iid) with exceptions (Dai et al. (2000) [9], Homem-de-Mello (2008) [16]). In this paper we study SAA with general sampling (including iid sampling and non-iid sampling) for solving nonsmooth stochastic optimization problems, stochastic Nash equilibrium problems and stochastic generalized equations. To this end, we first derive the uniform exponential convergence of the sample average of a class of lower semicontinuous random functions and then apply it to a nonsmooth stochastic minimization problem. Exponential convergence of estimators of both optimal solutions and M-stationary points (characterized by Mordukhovich limiting subgradients (Mordukhovich (2006) [23], Rockafellar and Wets (1998) [32])) are established under mild conditions. We also use the unform convergence result to establish the exponential rate of convergence of statistical estimators of a stochastic Nash equilibrium problem and estimators of the solutions to a stochastic generalized equation problem.