Semi-parametric estimation of covariate effects using the positive stable frailty model

Many biological and medical studies have as a response of interest the time to occurrence of some event, such as the occurrence of a particular symptom or disease, remission, relapse, death due to some specific disease, or simply death. In this paper we study the problem of assessing the effect of potential risk factors on the outcome event of interest through a parametric or semi-parametric frailty model where the lifetimes have a reason to be considered dependent. This dependence may arise because of multiple endpoints within the same individual or because, when studying a single endpoint, there are natural groupings between study subjects. The objective of this paper is to extend both parametric and semi-parametric approaches to regression analysis in which the lifetimes of individuals in a group are effected by the same random frailty which follows a positive stable distribution. Some comparisons of the properties of this frailty distribution with other frailty distributions are made and an example which assesses the effect of a treatment in a litter-matched tumorigenesis study is presented.     

技术联盟的共生演化分析

企业组建技术联盟的根本目的,就是基于自己能力缺陷,分散风险,降低研发成本,共享技术收益,是一个典型的利益共生体.Logistic生物种群共生进化模型给技术联盟共生体提供了一个分析框架.分析结果表明:对于主体不均等的技术联盟,主导企业从合作伙伴中获得的收益是非常有限的,远远低于自己对伙伴企业的贡献,并且这种联盟方式要求企业之间的分工程度要高;而对于主体均等的技术联盟而言,双方的贡献相差不大,都相对比较小.技术联盟企业通过分工形式形成各种关系,以激烈的竞争维持着共生模式的稳定性.     

Calibration of a basket option model applied to company valuation

Applying real options thinking to company valuation seems theoretically and intuitively appealing. However, the real option analogy of a single European option as well as the compound option proxy perform poorly when applied to company valuation. We therefore suggest to rework the building blocks of real option applications to corporate valuation.  We introduce a framework to delineate the distribution of the underlying asset in the risk neutral world, which is important in order to value any derivative. This is achieved by an algorithm to calibrate a basket option model using real world data of observed share prices. The fitting takes account of the class of stable distributions. The index of stability of asymmetric α stable distribution serves as an over-all parameter to characterise the specific distribution.     

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

求解P0函数互补问题的一种微分方程方法

本针对P0函数互补问题，给出了一种微方程方法，并且证明了P0函数互补问题的解是微分方程系统的渐进稳定平衡点。在适当的假设条件下，证明了所给出的算法具有二次收敛速度。几个数值例子表明了该算法的有效性。     

变换中含有孤立稳定点的第二积分换元定理

在不定积分第二积分换元定理的条件中,要求变换x=φ(t)不含有稳定点,即:φ′(t)≠0.当变换x=φ(t)中含有孤立稳定点时,给出了变换中含有孤立稳定点的第二积分换元定理.拓宽了第二积分换元定理的应用范围.     

Generalized 3G theorem and application to relativistic stable process on non-smooth open sets

Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes.     

On the uniqueness of the foliation of spheres of constant mean curvature in asymptotically flat 3-manifolds

In this note we study constant mean curvature surfaces in asymptotically flat 3-manifolds. We prove that, outside a given compact subset in an asymptotically flat 3-manifold with positive mass, stable spheres of given constant mean curvature are unique. Therefore we are able to conclude that the foliation of stable spheres of constant mean curvature in an asymptotically flat 3-manifold with positive mass outside a given compact subset is unique.

     

具功能反应的三种群捕食者——食饵系统数学模型稳定性的研究

[1]中提出了具有功能反应的三种群捕食者——食饵系统的两种模型(Ⅰ)、(Ⅱ),并给出了局部渐近稳定的条件。本文研究了另外两种模型(Ⅲ)和(Ⅳ)的局部渐近稳定的条件。     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.