Homotopies of Central Quasigroups

The article analyzes homotopies between central quasigroups, and their groups of autotopies. In particular, the cycle types of autotopies of central quasigroups and other group isotopes of prime order are identified.     

On the existence of retransmission permutation arrays

We investigate retransmission permutation arrays (RPAs) that are motivated by applications in overlapping channel transmissions. An RPA is an $n\times n$ array in which each row is a permutation of $\{1,\dots ,n\}$, and for $1?i?n$, all $n$ symbols occur in each $i\times ?\frac{n}{i}?$ rectangle in specified corners of the array. The array has types 1, 2, 3 and 4 if the stated property holds in the top left, top right, bottom left and bottom right corners, respectively. It is called latin if it is a latin square. We show that for all positive integers $n$, there exists a type-1, 2, 3, 4 $\mathrm{RPA}\left(n\right)$ and a type-1, 2 latin $\mathrm{RPA}\left(n\right)$.     

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.     

钢-混凝土组合梁收缩徐变效应的随机分析

钢-混凝土组合梁是由混凝土板和钢梁通过剪力键连接而成的组合结构。由于混凝土的收缩徐变,将引起结构内力和应力重分布。混凝土收缩徐变具有离散性大的特点,进而导致结构长期响应表现出随机性。本文综合考虑徐变模型、收缩模型、混凝土抗压强度、混凝土弹性模量、环境湿度、钢材弹性模量、荷载以及剪力键刚度的随机性对钢-混凝土组合梁结构响应的影响。利用拉丁超立方抽样技术和基于响应面方法的蒙特卡洛抽样,研究了钢-混凝土组合梁挠度和应力时变效应的概率问题。     

(3,2,1)-共轭r-正交拉丁方的存在性

如果两个v阶拉丁方L和M的重叠产生恰好r个不同的有序对,则称L和M是r-正交的.如果L还是M的(i,j,k)-共轭,则称L是(i,j,k)-共轭r-正交的,简记为(i,j,k)-r-COLS(v)((i,j,k)-r-conjugate orthogonal Latin square of order v),其中{i,j,k}={1,2,3}.本文研究(3,2,1)-r-COLS(v)的存在性问题.对于v 23,除去少数几个可能的例外值,本文给出关于(3,2,1)-r-COLS(v)的几乎完整的解.对于v23,如果r∈[v,v2]\{v+1,v+2,v+3,v+5,v+7,v2 1},除去可能的例外r=v2 3,都存在(3,2,1)-r-COLS(v).由于(3,2,1)-r-COLS(v)的存在性与(1,3,2)-r-COLS(v)的存在性是等价的,本文得到关于(1,3,2)-r-COLS(v)的同样结论.     

关于超立方体网络的(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.