基于聚类算法的区间数多属性决策方法及应用

针对具有正态分布随机变量的多属性决策问题,依据属性均值聚类思想,提出了一种计算机编程求解方法.方法避开了区间数的运算和比较,评价结果不具有主观随意性.最后,我们给出了一个实际应用的例子,验证了方法的有效性.     

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4.     

Divagations about the periodic table: Boolean hypercube and quantum similarity connections

In this study, several simple aspects associated with the periodic table (PT) of the elements are commented. First, the connection of the PT with the structure of a seven-dimensional Boolean hypercube leads afterward to discuss the nature of those PT elements bearing prime atomic numbers. Second, the use of quantum similarity (QS) to obtain an alternative insight on the PT element relations will be also developed. The foundation of the second part starts admitting that any element of the PT can be attached to a schematic electronic density function, constructed with a single Gaussian function: a Gaussian atomic density function, allowing to consider the PT elements as a set of quantum objects, and permits a straightforward construction of a QS matrix. Such QS scheme can be applied to the whole PT or to any subset of it. Manipulation of the QS matrices attached to any quantum object set allows the evaluation of statistical-like values, acting as coordinates to numerically or graphically represent the chosen PT atomic element sets. © 2019 Wiley Periodicals, Inc.     

A Note on the Construction of Orthogonal Latin Hypercube Designs

Latin hypercube designs have been found very useful for designing computer experiments. In recent years, several methods of constructing orthogonal Latin hypercube designs have been proposed in the literature. In this article, we report some more results on the construction of orthogonal Latin hypercubes which result in several new designs.     

Analytical Expressions for Ising Models on High Dimensional Lattices

We use an m-vicinity method to examine Ising models on hypercube lattices of high dimensions d≥3. This method is applicable for both short-range and long-range interactions. We introduce a small parameter, which determines whether the method can be used when calculating the free energy. When we account for interaction with the nearest neighbors only, the value of this parameter depends on the dimension of the lattice d. We obtain an expression for the critical temperature in terms of the interaction constants that is in a good agreement with the results of computer simulations. For d=5,6,7, our theoretical estimates match the numerical results both qualitatively and quantitatively. For d=3,4, our method is sufficiently accurate for the calculation of the critical temperatures; however, it predicts a finite jump of the heat capacity at the critical point. In the case of the three-dimensional lattice (d=3), this contradicts the commonly accepted ideas of the type of the singularity at the critical point. For the four-dimensional lattice (d=4), the character of the singularity is under current discussion. For the dimensions d=1, 2 the m-vicinity method is not applicable.     

Improved book-embeddings of incomplete hypercubes

In this paper, we show that any incomplete hypercube with, at most, 2ⁿ+2ⁿ⁻¹+2ⁿ⁻² vertices can be embedded in n−1 pages for all n≥4. For the case n≥4, this result improves Fang and Lai’s result that any incomplete hypercube with, at most, 2ⁿ+2ⁿ⁻¹ vertices can be embedded in n−1 pages for all n≥2.Besides this, we show that the result can be further improved when n is large — e.g., any incomplete hypercube with at most 2ⁿ+2ⁿ⁻¹+2ⁿ⁻²+2ⁿ⁻⁷ (respectively, 2ⁿ+2ⁿ⁻¹+2ⁿ⁻²+2ⁿ⁻⁷+2ⁿ⁻²³⁰) vertices can be embedded in n−1 pages for all n≥9 (respectively, n≥232).     

The diameter of a random subgraph of the hypercube

In this paper we present an estimation for the diameter of random subgraph of a hypercube. In the article by A. V. Kostochka (Random Struct Algorithms 4 (1993) 215–229) the authors obtained lower and upper bound for the diameter. According to their work, the inequalities n + m_p ≤ D(G_n) ≤ n + m_p + 8 almost surely hold as n → ∞, where n is dimension of the hypercube and m_p depends only on sampling probabilities. It is not clear from their work, whether the values of the diameter are really distributed on these 9 values, or whether the inequality can be sharpened. In this paper we introduce several new ideas, using which we are able to obtain an exact result: D(G_n) = n + m_p (almost surely). © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

投影均匀分片拉丁超立方体设计

空间填充设计是有效的计算机试验设计,比如均匀设计、最大最小距离拉丁超立方体设计等.虽然这些设计在整个试验空间中有较好的均匀性,但其低维投影均匀性可能并不理想.对于因子是定量的计算机试验,已有文献构造了诸如最大投影设计、均匀投影设计等相适应的设计;而对于同时含有定性因子和定量因子的计算机试验,尚未有投影均匀设计的相关文献.文章提出了综合投影均匀准则,利用门限接受算法构造了投影均匀的分片拉丁超立方体设计.在新构造设计中,整体设计与每一片设计均具有良好的投影均匀性.模拟结果显示,与随机分片拉丁超立方体设计相比,利用新构造设计进行试验而拟合的高斯过程模型具有更小的均方根预测误差.     

广义超立方体网络中一类容错路由选择

证明了n-维广义超立方体网络Q(m1,m2,…,mn)中,任意两个节点x和y之间存在长度均不超过H(x,y)+2的m1+m2+…+mn-n条内点不交的路由,其中有H(x,y)条长度不超过H(x,y),此处H(x,y)表示x到y的汉明距离.并在此基础上讨论了广义超立方体网络的容错路由问题.证明了即使无效点很多,但只要存在某个(n-1)-维广义超子立方体中无效节点较少,则该n-维广义超立方体中的任意两个有效节点之间可以找到最优路由或接近最优路由的有效路由.     

CONNECTIVITY OF CARTESIAN PRODUCT DIGRAPHS AND FAULT-TOLERANT ROUTINGS OF GENERALIZED HYPERCUBE

ＣＯＮＮＥＣＴＩＶＩＴＹＯＦＣＡＲＴＥＳＩＡＮＰＲＯＤＵＣＴＤＩＧＲＡＰＨＳＡＮＤＦＡＵＬＴ┐ＴＯＬＥＲＡＮＴＲＯＵＴＩＮＧＳＯＦＧＥＮＥＲＡＬＩＺＥＤＨＹＰＥＲＣＵＢＥＸＵＪＵＮＭＩＮＧＡｂｓｔｒａｃｔ．Ｉｎｔｈｉｓｐａｐｅｒ，ｔｈｅｐｒｏｂｌｅｍ...