Large regular simplices contained in a hypercube

We prove that the n-dimensional unit hypercube contains an n-dimensional regular simplex of edge length c√n, where c > 0 is a constant independent of n. Supported by MEXT Grant-in-Aid for Scientific Research (B) 20340022.     

A new class of Latin hypercube designs with high-dimensional hidden projective uniformity

Latin hypercube design is a good choice for computer experiments. In this paper, we construct a new class of Latin hypercube designs with some high-dimensional hidden projective uniformity. The construction is based on a new class of orthogonal arrays of strength two which contain higher strength orthogonal arrays after their levels are collapsed. As a result, the obtained Latin hypercube designs achieve higher-dimensional uniformity when projected onto the columns corresponding to higher strength orthogonal arrays, as well as twodimensional projective uniformity. Simulation study shows that the constructed Latin hypercube designs are significantly superior to the currently used designs in terms of the times of correctly identifying the significant effects.     

基于计算机试验设计的遗传算法参数配置

遗传算法作为一种随机化优化搜索方法,已经在很多领域得到了成功应用,但其存在控制参数多且配置困难的问题.本文采用一类最新试验设计方法-计算机试验设计,对遗传算法的参数配置进行优化.结果表明,基于正交拉丁超立方设计的参数配置,其算法的计算精度和速度表现最佳.模拟结果进一步讨论了不同试验设计方案在遗传算法中的差别.     

大口径主镜轻量化结构参数的优化设计

针对空间遥感器中大口径主镜的轻量化结构设计引入了基于Kriging近似模型的多目标遗传优化方法,以2 m口径SiC主镜为例对其轻量化结构参数进行了优化设计。采用拉丁超立方法对优化参数进行试验设计,建立了Kriging模型,并用多目标遗传算法迭代求得了最优解。优化后得到了质量为243 kg的2 m口径SiC主镜,其面形精度达到了25.7 nm PV,4.7 nm RMS,轻量化率为84%。试验结果验证了此优化设计方法的可行性,为大口径主镜的轻量化结构参数优化设计提供了借鉴和参考。     

VERTEX-FAULT-TOLERANT CYCLES EMBEDDING ON ENHANCED HYPERCUBE NETWORKS

In this paper, we study the enhanced hypercube, an attractive variant of the hypercube and obtained by adding some complementary edges from a hypercube, and focus on cycles embedding on the enhanced hypercube with faulty vertices. Let Fu be the set of faulty vertices in the n-dimensional enhanced hypercube Qn,k （n ≥ 3, 1 ≤ k 〈≤n - 1）. When IFvl = 2, we showed that Qn,k - Fv contains a fault-free cycle of every even length from 4 to 2n - 4 where n （n ≥ 3） and k have the same parity; and contains a fault-free cycle of every even length from 4 to 2n - 4, simultaneously, contains a cycle of every odd length from n-k ＋ 2 to 2^n-3 where n （≥ 3） and k have the different parity. Furthermore, when ｜Fv｜ = fv ≤ n - 2, we prove that there exists the longest fault-free cycle, which is of even length 2^n - 2fv whether n （n ≥ 3） and k have the same parity or not; and there exists the longest fault-free cycle, which is of odd length 2^n - 2fv ＋ 1 in Qn,k - Fv where n （≥ 3） and k have the different parity.     

关于超立方体网络的(d,k)独立数

(d,k)独立数是分析互连网络性能的一个重要参数.对于任意给定的图G和正整数d和k,确定G的(d,k)独立数问题是一个NPC问题.因此,确定一些特殊图的(d,k)独立数显得很重要.本文确定了k维超立方体网络的(d,k)独立数等于2,如果d=k≥4或者d=k-1≥6 以及αd,k-t(Qk)=αd,k(Qk),其中0≤t≤k-2,1≤d≤k-t-1.     

代理模型在机翼油箱晃动适航审定中的应用

飞机飞行过程中,机翼油箱易受扰动或激励作用而产生低频晃动,引起机翼油箱壁面变形失效.本文将响应面代理模型引入飞机复合材料燃油箱晃动适航审定工作,以晃动频率、晃动幅值和油箱载液比为自变量,以油箱外壁面最大主应变峰值为响应,建立了油箱上下蒙皮响应面统计模型,给出油箱上下蒙皮最大主应变峰值与激励频率、幅值和油箱载液比等因素的显式响应函数.开展物理全尺寸试验和流固耦合数值模拟验证代理模型的有效性.结果 表明,上下蒙皮最大主应变峰值呈非线性趋势,存在最危险载液比使得主应变峰值最大化,且油箱破坏多发生在下蒙皮.     

最优对称拉丁超立方体的构造

基于模型对称分解的对称全局敏感性分析在高维复杂模型的推断中起着重要作用.Wang和Chen (2017)提出了一种对称设计来获得对称灵敏度指标的估计,此设计具有较高的抽样效率且不需要得到对称分解项的解析表达.然而,给定试验次数,对称设计的生成具有较强的随机性,导致某些设计的空间填充性较差且在低维投影出现塌陷.文章提出了一种对称拉丁超立方体,使对称设计同时具有拉丁超立方体结构,从而在保持设计对称性的基础上最大化一维投影的均匀性.通过剖析设计的结构得到了对称拉丁超立方体的构造方法.同时,进一步提出最优化算法,得到具有最优中心化L2偏差的对称拉丁超立方体设计.通过一个构造算例,验证了所得设计的优良性.     

Slightly subcritical hypercube percolation

We study bond percolation on the hypercube {0,1}^m in the slightly subcritical regime where p = p_c(1 ? ε_m) and ε_m = o(1) but ε_m ? 2^?m/3 and study the clusters of largest volume and diameter. We establish that with high probability the largest component has cardinality , that the maximal diameter of all clusters is , and that the maximal mixing time of all clusters is . These results hold in different levels of generality, and in particular, some of the estimates hold for various classes of graphs such as high‐dimensional tori, expanders of high degree and girth, products of complete graphs, and infinite lattices in high dimensions.