A class of multivariate skew-normal models

The existing model for multivariate skew normal data does not cohere with the joint distribution of a random sample from a univariate skew normal distribution. This incoherence causes awkward interpretation for data analysis in practice, especially in the development of the sampling distribution theory. In this paper, we propose a refined model that is coherent with the joint distribution of the univariate skew normal random sample, for multivariate skew normal data. The proposed model extends and strengthens the multivariate skew model described in Azzalini (1985,Scandinavian Journal of Statistics,12, 171–178). We present a stochastic representation for the newly proposed model, and discuss a bivariate setting, which confirms that the newly proposed model is more plausible than the one given by Azzalini and Dalla Valle (1996,Biometrika,83, 715–726).     

异丙酚用于喉部手术前气管切开的临床观察

目的 观察异丙酚在喉部手术前行气管切开期间应用的可行性及安全性.方法 选择择期喉部手术患者24例,每组12例,随机分为异丙酚组(Ⅰ组)和局麻组(Ⅱ组).Ⅰ组患者在局麻前给予异丙酚1～2 mg/kg缓慢静脉注射,待患者睫毛反射消失、意识丧失后给予1%利多卡因局部浸润再行气管切开.Ⅱ组患者仅在1%利多卡因局部浸润下行气管切开.记录切皮前、切皮时、插管时、插管后1 min、插管后3 min时患者心率(HR)、平均动脉压(MAP)及脉搏氧饱和度(SPO2),观察患者呼吸抑制发生率,燥动发生率及术后遗忘率.结果 切皮时,插管时及插管后1 min,3 min Ⅱ组患者心率(HR)、平均动脉压(MAP)较Ⅰ组患者明显升高,躁动发生率Ⅱ组患者明显高于Ⅰ组患者(P＜0.05),呼吸抑制发生率及脉搏氧饱和度(SPO2)变化无明显差异(P＞0.05).结论 异丙酚用于喉部手术前气管切开安全可行.     

甲醛与乙腈相互作用的理论研究

在HF/ 6 311G(d ,p)、MP2 / 6 311G(d ,p)和B3LYP/ 6 311G(d ,p)水平上 ,对H2 CO和CH3 CN以及设计的 4种结构H2 CO…CH3 CN复合物等进行几何全优化和振动频率计算 ,排除振动频率为负值的非局域极小点结构 ,并对稳定的环状构型复合物结合能进行基组重叠误差校正和零点振动能校正 .分子间相互作用的能量分解分析显示 ,静电能在H2 CO…CH3 CN相互作用能量中占主导地位 ,电荷转移能居第二位 .     

A RANDOM FIXED POINT ITERATION FOR THREE RANDOM OPERATORS ON UNIFORMLY CONVEX BANACH SPACES

In the present paper we introduce a random iteration scheme for three random operators defined on a closed and convex subset of a uniformly convex Banach space and prove its convergence to a common fixed point of three random operators. The result is also an extersion of a known theorem in the corresponding non-random case.     

Synchronization in supply chains: implications for design and management

Supply chain management literature calls for coordination between the different members of the chain. Materials should be moved from one supplier to the next according to a just-in-time schedule. In this paper, we show that for many supply chain configurations, complete synchronization will result in some members of the chain being ‘losers’ in terms of cost. We develop an algorithm for optimal synchronization of supply chains and provide some guidelines for incentive alignment along the supply chain. In developing the model, we use the economic delivery and scheduling problem model and analyze supply chains dealing with single and multiple components. For single-component supply chains, we derive a closed-form expression for the optimal synchronized cycle time. For multi-component supply chains, we develop an algorithm for finding the optimal synchronized cycle time. We test the performance of the algorithm and show that it provides optimal solutions for a wide range of problems. We illustrate the models with numerical examples.     

Lower Bounds for the Height and Size of the Ideal Class Group in CM-Fields

 We prove that, under the assumption of the Generalized Riemann Hypothesis, the exponent of the ideal class group of a CM-field goes to infinity with its absolute discriminant. This gives a positive answer to a question raised by Louboutin and Okazaki [4]. Received September 10, 2001; in revised form April 5, 2002     

Cesàro means of double Walsh-Fourier series

We investigate approximation properties of Cesàro (C; −α, −β)-means of double Walsh-Fourier series with α, β ∈ (0, 1). As an application, we obtain a sufficient condition for the convergence of the means σ _n,m ^/−α,−β (f; x, y) to f(x,y) in the L ^p -metric, p ∈ [1, ∞]. We also show that this sufficient condition cannot be improved.     

A Branch & Cut algorithm for a four-index assignment problem

In this paper, we examine the orthogonal Latin squares (OLS) problem from an integer programming perspective. The OLS problem has a long history and its significance arises from both theoretical aspects and practical applications. The problem is formulated as a four-index assignment problem whose solutions correspond to OLS. This relationship is exploited by various routines (preliminary variable fixing, branching, etc) of the Branch & Cut algorithm we present. Clique, odd-hole and antiweb inequalities implement the ‘Cut’ component of the algorithm. For each cut type a polynomial-time separation algorithm is implemented. Extensive computational analysis examines multiple aspects concerning the design of our algorithm. The results illustrate clearly the improvement achieved over simple Branch & Bound.     

Parallel discrete event simulation algorithm for manufacturing supply chains

Parallel discrete event simulation (PDES) is concerned with the distributed execution of large-scale system models on multiple processors. It is an enabler in the implementation of the virtual enterprise concept, integrating semi-autonomous models of production cells, factories, or units of a supply chain. The key issue in PDES is to maintain causality relationships between system events, while maximizing parallelism in their execution. Events can be executed conservatively only when it is safe to do so, sacrificing the extent to which potential parallelism of the system can be exploited. Alternatively, they can be processed optimistically without guarantee of correctness, but incurring the overhead of a rollback to an earlier saved state when causality error is detected. The paper proposes a modified optimistic scheme for distributed simulation of constituent models of a supply chain in manufacturing, which exploits the inherent operating characteristics of its domain.