A note on the existence of fractional f-factors in random graphs

Let G=Gn,p be a binomial random graph with n vertices and edge probability p=p(n),and f be a nonnegative integer-valued function defined on V(G) such that 0a≤f(x)≤bnp-2np ㏒n for every x ∈V(G). An fractional f-indicator function is an function h that assigns to each edge of a graph G a number h(e) in [0,1] so that for each vertex x,we have dh G(x)=f(x),where dh G(x) = x∈e h(e) is the fractional degree of x in G. Set Eh = {e:e ∈E(G) and h(e)=0}.If Gh is a spanning subgraph of G such that E(Gh)=Eh,then Gh is called an fractional f-factor of G. In this paper,we prove that for any binomial random graph Gn,p with p≥n-23,almost surely Gn,p contains an fractional f-factor.     

Dynamic fuzzy reliability models of degraded hold-down structures for folded solar array

The hold-down structures are of considerable importance to the launch of solar array. Due to the difficulties in obtaining sufficient load specimen, it is imprecise to construct the stress as random variables. Therefore, dynamic fuzzy reliability models are developed in this paper, which resolve the problems in dealing with the interaction between the fuzzy stress process and the stochastic strength process. Even for a deterministic fuzzy stress process, the influences of material statistical properties on reliability can be affected by the level α of fuzzy stress. Meanwhile, the level α relates to investment in the collection of information about the fuzzy stress on hold-down bar. Hence, the models can be used for the economic analysis and optimal design of hold-down bar. Finally, key fuzzy parameters of stress, which have significant influences on both the reliability behavior and the effects of material statistical properties on reliability, are identified and some suggestions for the reliability enhancement of hold-down bar are provided in this paper.     

CRPED软件及其应用

阐述了在轧钢工艺剪切规程设计中所采用的工程概率优化设计方法及 CRPED软件。结合剪切生产实际情况 ,证明此方法的实用性和 CRPED的可操作性 ,对剪切规程进行工程概率优化设计可取得明显的经济效益。     

直觉Menger空间中的广义压缩映射原理及其在微分方程中的应用

利用Atanassov的思路,将直觉Menger空间定义为由Menger提出的Menger空间的自然推广.同时也得出一个新广义压缩映射,并运用该压缩映射证明了直觉Menger空间中微分方程解的存在性定理.     

用概率断裂力学方法预测管状接头的疲劳寿命

本文研究了Ｔ型管状接头在面内和面外弯曲循环载荷作用下的疲劳强度问题，通过将材料常数和初始裂纹尺寸作为随机变量，采用ＭｏｎＣａｒｌｏ模拟方法对疲劳寿命进行了统计分析．同时，对计算结果进行了线性回归，并与实验结果作了比较。     

关于随机共轭空间的各种定义及随机线性泛函各种有界性的某些评论

中心目的是详细廉政论在随机共轭空间理论形成过程中所经历的三个阶段的工作，尤其指出了这三个阶段工作之间的联系及本质差别；给出了强有界、拓扑有界及几乎处处有界随机线性泛函之间的关系；亦指出了在概率赋范空间上线性算子理论研究中目前存在的不足．     

Hill‐climbing to Pasch valleys

Exhaustive enumeration of Steiner Triple Systems is not feasible, due to the combinatorial explosion of instances. The next‐best hope is to quickly find a sample that is representative of isomorphism classes. Stinson's Hill‐Climbing algorithm [ 20 ] is widely used to produce random Steiner Triple Systems, and certainly finds a sample of systems quickly, but the sample is not uniformly distributed with respect to the isomorphism classes of STS with ν ≤ 19, and, in particular, we find that isomorphism classes with a large number of Pasch configurations are under‐represented. No analysis of the non‐uniformity of the distribution with respect to isomorphism classes or the intractability of obtaining a representative sample for ν > 19 is known. We also exhibit a modification to hill‐climbing that makes the sample if finds closer to the uniform distribution over isomorphism classes in return for a modest increase in running time. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 405–419, 2007     

寿命服从对数正态分布、有置信度时概率疲劳S-N曲线的合理重构

当概率疲劳S-N曲线以特定存活概率(P)和置信度(C)的方式给出并无法重做试验时,除特定P-C外无法做其它概率水平的可靠性分析.因此,需要广泛适用的曲线模型.建立了疲劳寿命服从对数正态分布时疲劳试验S-N数据及广义曲线的Monte Carlo模拟重构方法.为了避免现有人为放大样本到数千给出偏危险评价,从实际试验情况出发,采用了材料小试样每组样本7至20、结构试样每组样本至多10个、还原统计参量误差小于5%的模拟策略.然后,依据模拟数据利用回归法重建了可实现任意P-C水平可靠性分析的P-C-S-N曲线.铁路60Si2Mn高强度弹簧钢概率曲线的重构实践说明了方法的有效性与适用性.     

利用二粒子非最大纠缠态的概率密集编码方案

提出了当量子通道为非最大纠缠态时的概率密集编码方案，通过引入辅助粒子和进行联合么正变换，量子密集编码以一定概率实现。     

On patching algorithms for random asymmetric travelling salesman problems

Let the arc-lengthsL _ij of a complete digraph onn vertices be independent uniform [0, 1] random variables. We consider the patching algorithm of Karp and Steele for the travelling salesman problem on such a digraph and give modifications which tighten the expected error. We extend these ideas to thek-person travelling salesman problem and also consider the case where cities can be visited more than once.