The Continuous Run Sum Chart

The run sum chart is an effective two-sided chart that can be used to monitor for process changes. It is known that it is more sensible than the Shewhart chart with runs rules and its performance improves as the number of regions increases. However, as the number of regions increses the resulting chart has more parameters to be defined and its design becomes more involved. In this article, we introduce a one-parameter run sum chart. This chart accumulates scores equal to the subgroup means and signals when the cummulative sum exceeds a limit value. A fast initial response feature is proposed and its run length distribution function is found by a set of recursive relations. We compare this chart with other charts suggested in the literature and find it competitive with the CUSUM, the FIR CUSUM, and the combined Shewhart FIR CUSUM schemes.     

A Bayesian approach to non-parametric monotone function estimation

Summary.  The paper proposes two Bayesian approaches to non-parametric monotone function estimation. The first approach uses a hierarchical Bayes framework and a characterization of smooth monotone functions given by Ramsay that allows unconstrained estimation. The second approach uses a Bayesian regression spline model of Smith and Kohn with a mixture distribution of constrained normal distributions as the prior for the regression coefficients to ensure the monotonicity of the resulting function estimate. The small sample properties of the two function estimators across a range of functions are provided via simulation and compared with existing methods. Asymptotic results are also given that show that Bayesian methods provide consistent function estimators for a large class of smooth functions. An example is provided involving economic demand functions that illustrates the application of the constrained regression spline estimator in the context of a multiple-regression model where two functions are constrained to be monotone.     

分析对流-扩散方程显格式稳定性的一种方法

给出了分析二维对流-扩散方程FTCS显格式（时间向前,空间中心的差分格式）稳定条件的一种方法.这种方法可用于分析一维到高维对流-扩散方程差分格式的稳定性.     

安全的多层门限秘密共享方案

考虑到多层组织共享秘密,设计了多层门限秘密共享方案。本文方案安全性基于RSA密码体制、Sham ir门限方案以及哈希函数的安全性。方案中,秘密份额由参与者选择和保存,秘密分发者也不知晓。每个参与者只须维护一个秘密份额,可实现对多个秘密的共享。方案不需要安全信道,算法能够保障信息安全传送以及验证真实性。     

三维有限元渗流模拟计算在蟒河口水库防渗设计中的应用

蟒河口水库工程天然来水量较小，开发目标高，采取有效的防渗处理措施才能保证水库开发要求的蓄水量．工程中采用三维有限元渗流模拟计算对防渗处理措施进行复核．根据计算结果，对防渗措施进行调整、优化，确定了经济、高效的防渗方案．通过工程经验类比知，计算所采用的方法和最终得到的结果是满意的．     

托马斯·纳什《春》的赏析及翻译

该文对英国文艺复兴时期剑桥的“大学才子”之一 ,诗人和剧作家托马斯·纳什的《春》从三个方面进行了赏析 :1.诗人运用了丰富多彩的意象 ;2 .诗人糅合了动态和静景 ;3.诗人运用了腹韵和五步抑扬格的韵律 ,并在学习、比较、借鉴名家前辈的译文之后完成了《春》的翻译     

Information preserving statistical obfuscation

The problem of limiting the disclosure of information gathered on a set of companies or individuals (the respondents) is considered, the aim being to provide useful information while preserving confidentiality of sensitive information. The paper proposes a method which explicitly preserves certain information contained in the data. The data are assumed to consist of two sets of information on each respondent: public data and specific survey data. It is assumed in this paper that both sets of data are liable to be released for a subset of respondents. However, the public data will be altered in some way to preserve confidentiality whereas the specific survey data is to be disclosed without alteration. The paper proposes a model based approach to this problem by utilizing the information contained in the sufficient statistics obtained from fitting a model to the public data by conditioning on the survey data. Deterministic and stochastic variants of the method are considered.     

The densest <Emphasis Type="Italic">k</Emphasis>-subgraph problem on clique graphs

The Densest k-Subgraph (DkS) problem asks for a k-vertex subgraph of a given graph with the maximum number of edges. The problem is strongly NP-hard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In this paper we focus on special cases of the problem, with respect to the class of the input graph. Especially, towards the elucidation of the open questions concerning the complexity of the problem for interval graphs as well as its approximability for chordal graphs, we consider graphs having special clique graphs. We present a PTAS for stars of cliques and a dynamic programming algorithm for trees of cliques. M.L. is co-financed within Op. Education by the ESF (European Social Fund) and National Resources. V.Z. is partially supported by the Special Research Grants Account of the University of Athens under Grant 70/4/5821.     

A correlation-theoretical interpretation of schur analysis

This paper is heavily leaned on the author's recent investigations concerning SCHUR analysis of non-negative Hermitian block matrices. The parameters of the matrix balls and the triangular choice scheme which describe a non-negative Hermitian block matrix will be interpreted in the framework of correlation theory     

多孔介质中可压缩混溶驱动问题的特征：混合元方法

本文考虑二维一般有界区域中的多孔介质同可压缩混溶动问题的数值解方法，给出了全离散特征－混合元格，证明了格式的唯一可解性，得到最佳Ｈ－模误差估计。