Statistical inference for coherent systems with Weibull distributed component lifetimes under complete and incomplete information

Point estimators for the parameters of the component lifetime distribution in coherent systems are evolved assuming to be independently and identically Weibull distributed component lifetimes. We study both complete and incomplete information under continuous monitoring of the essential component lifetimes. First, we prove that the maximum likelihood estimator (MLE) under complete information based on progressively Type‐II censored system lifetimes uniquely exists and we present two approaches to compute the estimates. Furthermore, we consider an ad hoc estimator, a max‐probability plan estimator and the MLE for the parameters under incomplete information. In order to compute the MLEs, we consider a direct maximization of the likelihood and an EM‐algorithm–type approach, respectively. In all cases, we illustrate the results by simulations of the five‐component bridge system and the 10‐component parallel system, respectively.     

On holonomy of Weyl connections in Lorentzian signature

Holonomy algebras of Weyl connections in Lorentzian signature are classified. In particular, examples of Weyl connections with all possible holonomy algebras are constructed.     

薄板声谐振子扰动的声学特征检测研究

为进行快速ＮＤＴ，研究了薄板声谐振子扰动和声学特征变化的关系，用有限元方法分析在睡无缺陷薄板的振动频率和振型。利用数字信号处理技术，实验研究了样品中缺陷对声学特征的影响。实现和理论分析结果一致性很好。研究结果有助于正确利用样品声学特征进行无损检测。     

弱形变双奇核158Tm中的旋称反转

通过融合蒸发反应¹⁴⁴Nd(¹⁹F,5n)布居了双奇核¹⁵⁸Tm的高自旋态. 扩展了原来已知的带结构, 并建立了一条新转动带. 通过与相邻核的比较, 讨论¹⁵⁸Tm核中两条四准粒子带的内禀组态, 并分别指定为πh_11/2\otimes νh_9/2(α=+1/2)\otimes (νi_13/2)²和πh_11/2\otimes νh_9/2(α=－1/2)\otimes (νi_13/2)² 组态. 建立在πh_11/2\otimes νi_13/2组态上的转动带被观测到呈现持续旋称反转现象, 而前述的两条高自旋区的 四准粒子转动带也呈旋称反转. 对这两种类型的旋称反转现象的可能机制进行了简单而定性的讨论.     

A≈80区奇–奇核80,82Rb的晕带能谱计算

在A≈80区奇-奇核旋称反转问题上已提出几种机制,但没有一种理论推断是结论性的.在本工作中将角动量投影壳模型应用到^80,82Rb核,对组态为πg_9/2⊙νg_9/2的正宇称晕带和组态为π(p_1/2,p_3/2,f_5/2)⊙νg_9/2 的负宇称晕带理论计算和实验结果进行了比较,特别是对正宇称晕带中的signature反转机制进行了探讨.角动量投影壳模型计算显示正宇称晕带中的signature反转是原子核随自旋增加形状发生变化的信号,其间原子核从低自旋的长椭球变到高自旋的扁椭球.此外,还确定了此两带的原子核形状     

Certificateless signature: a new security model and an improved generic construction

Certificateless cryptography involves a Key Generation Center (KGC) which issues a partial key to a user and the user also independently generates an additional public/secret key pair in such a way that the KGC who knows only the partial key but not the additional secret key is not able to do any cryptographic operation on behalf of the user; and a third party who replaces the public/secret key pair but does not know the partial key cannot do any cryptographic operation as the user either. We call this attack launched by the third party as the key replacement attack. In ACISP 2004, Yum and Lee proposed a generic construction of digital signature schemes under the framework of certificateless cryptography. In this paper, we show that their generic construction is insecure against key replacement attack. In particular, we give some concrete examples to show that the security requirements of some building blocks they specified are insufficient to support some of their security claims. We then propose a modification of their scheme and show its security in a new and simplified security model. We show that our simplified definition and adversarial model not only capture all the distinct features of certificateless signature but are also more versatile when compared with all the comparable ones. We believe that the model itself is of independent interest.A conventional certificateless signature scheme only achieves Girault’s Level 2 security. For achieving Level 3 security, that a conventional signature scheme in Public Key Infrastructure does, we propose an extension to our definition of certificateless signature scheme and introduce an additional security model for this extension. We show that our generic construction satisfies Level 3 security after some appropriate and simple modification. A preliminary version of the extended abstract of partial results appeared in ACISP 2006 [9].     

一种移动Agent的安全认证方案的设计与实现

针对移动Agent的安全问题，简要介绍了几种常用的安全认证技术，并在公钥密码体制认证方案的基础上，提出并实现了一种可用于移动Agent和Agent平台之间安全认证的方案。证书采用X.509证书格式，使用RSA和IDEA混合加密的算法，密钥管理采用PGP算法中公私钥环的方式，使该认证方案具有很高的安全性。文中详细说明了方案的实现流程，并深入分析了其安全性。结果表明，采用该方案能有效改善移动Agent的安全性。     

Signature of relations in mapping class groups and non-holomorphic Lefschetz fibrations

We introduce the notion of signature for relations in mapping class groups and show that the signature of a Lefschetz fibration over the 2-sphere is the sum of the signatures for basic relations contained in its monodromy. Combining explicit calculations of the signature cocycle with a technique of substituting positive relations, we give some new examples of non-holomorphic Lefschetz fibrations of genus and which violate slope bounds for non-hyperelliptic fibrations on algebraic surfaces of general type.

     

Speeding up Exponentiation using an Untrusted Computational Resource

We present protocols for speeding up fixed-base variable-exponent exponentiation and variable-base fixed-exponent exponentiation using an untrusted computational resource. In the fixed-base protocols, the exponent may be blinded. In the variable-base protocols, the base may be blinded. The protocols are described for exponentiation in a cyclic group. We describe how to extend them to exponentiation modulo an integer where the modulus is the product of primes with single multiplicity. The protocols provide a speedup of over the square-and-multiply algorithm, where k is the bitlength of the exponent. One application of the protocols is to speed up exponentiation-based verification in discrete log-based signature and credential schemes. The protocols also allow signature verifiers to dynamically choose, for each message, the amount of work it would like to perform to verify the signature. This results in a work-security tradeoff. We introduce a fifth protocol to perform variable-base variable- exponent exponentiation, which also has this feature. Our model allows the trusted resource to perform computations in its idle time. The protocols facilitate the offloading of work to the offline stage, such that the work the trusted resource performs when it has to do an exponentiation is smaller. Our protocols are unconditionally secure.     

ʧЧ��������ϵͳ���������Ԫ������

??Coherent systems are very important in reliability,survival analysis and other life sciences. In this paper, we consider the number of working components in an $(n-k+1)$-out-of-$n$ system, given that at least $(n-m+1)$ components are working at time $t$, and the system has failed at time $t$. In this condition, we compute the probability that there are exactly $i$ working components. First the reliability and several stochastic properties are obtained. Furthermore, we extend the results to general coherent systems with absolutely continuous and exchangeable components.