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

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

Mbius立方体的拓扑结构性质

超立方体网络是目前在超级计算机处理器结构中应用得最广泛的拓扑结构,Mbius立方体是超立方体的一种变形,已经被证明它在某些方面具有优于超立方体的拓扑性质.本文指出了n维Mbius立方体递归结构的一些重要拓扑性质.     

M(o)bius立方体的拓扑结构性质

超立方体网络是目前在超级计算机处理器结构中应用得最广泛的拓扑结构,M(o)bius立方体是超立方体的一种变形,已经被证明它在某些方面具有优于超立方体的拓扑性质.本文指出了n维M(o)bius立方体递归结构的一些重要拓扑性质.     

Möbius立方体的拓扑结构性质

超立方体网络是目前在超级计算机处理器结构中应用得最广泛的拓扑结构,M(o)bius立方体是超立方体的一种变形,已经被证明它在某些方面具有优于超立方体的拓扑性质.本文指出了n维M(o)bius立方体递归结构的一些重要拓扑性质.     

嵌套拉丁超立方设计的优化

由于嵌套拉丁超立方设计(nested Latin hypercube design,NLHD)在整个设计区域中并不总具有很好的空间填充性,文章提出了一个分层加强随机进化算法对NLHD进行优化,提高它的空间填充性.该算法优先考虑在实际中更重要的底层设计,逐层优化后得到最终的NLHD.提出了三类基本操作来搜索更好的设计,并保证了每步更新后的设计依然保持NLHD的结构.算例表明该算法速度快,效率高.     

两水平U-型设计的扩大设计在投影加权对称偏差下的均匀性

均匀设计以其稳健和使用方便、灵活的特性而广受欢迎.为获得实验目标区域内散布均匀的设计点集,不同的均匀度量标准相继被提出.目前被广泛应用的有中心化L₂-偏差、可卷型L₂-偏差、混合偏差等.对称化L₂-偏差具有更好的几何性质,但受限于投影均匀性差的缺陷,使用范围十分有限.为了改进对称化L₂-偏差的低维投影均匀性,基于指数加权方式的投影加权对称化L₂-偏差的概念被提出,加权后的对称化L₂-偏差既能保留原偏差的各种优良性质,同时有效克服原来的缺陷并有更优异的表现.折叠翻转是构造因子设计时非常有用的技巧.本文利用投影加权对称偏差来作为评价折叠翻转方案的最优性准则,得到了两水平U-型设计在一般折叠翻转方案下扩大设计的投影加权对称偏差的下界,该下界可以作为寻找最优折叠翻转方案的基准.     

纵向数据下均值协方差联合建模中的ARMA Cholesky因子模型

在广义估计方程框架下,发展了一类灵活的回归模型来参数化协方差结构.通过合并广泛使用的修正的Cholesky分解和滑动平均Cholesky分解,得到自回归滑动平均Cholesky分解.该分解能够参数化更一般的协方差结构,且其输入具有清晰的统计解释.对这些输入建立回归模型,并利用拟Fisher迭代算法估计回归系数.均值和协方差模型中的参数估计皆具有相合性和渐近正态性.最后通过模拟研究考察了所提方法的有限样本表现.     

基于三种重复方式下超希腊拉丁方设计的方差分析

超希腊拉丁方设计可以从多个不同方向控制试验的误差,在医学和工农业生产等领域有着广泛的应用.因此,对超希腊拉丁方设计进行方差分析有着重要意义.文章首先给出了超希腊拉丁方设计的方差分析,并讨论了在三种不同重复方式下的超希腊拉丁方设计的方差分析,最后通过例子验证所获的理论结果.     

n维超立方体的层次结构模型

本文首次提出了 n维超立方体的层次结构模型 HHC,详细讨论了该结构中结点的分布及各结点的连接关系 .并利用 HHC,讨论了超立方体非对称比较模型的最优诊断算法 ,极大独立点集等问题     

线性混合模型协方差阵的谱分解的一种新方法及其应用

对平衡线性混合模型, 随机效应的设计阵具有一定结构.定义了一种新的矩阵序, 借助于这种新序, 提出了协方差阵谱分解的一种新方法.与现有的两种方法相比较, 新方法的突出的特点是能够给出协方差阵不同特征值的精确个数, 以及谱分解中不同特征值对应的投影阵与随机效应的设计阵之间的关系. 基于新的谱分解结果,(1) 证明了平衡随机模型的方差分析估计为最小方差无偏估计; (2) 证明了在一定条件下, 一般平衡线性混合模型的方差分析估计也具有最小方差无偏性; (3) 给出了一般混合模型的极大似然方程显示解存在的一个较易验证的判定定理, 并给出了显示解存在时解的一般形式; (4) 清晰地显示了谱分解估计的构造原理, 并找到了谱分解估计与方差分析估计相等的充要条件.     

Complex dynamics and bifurcation analysis of host–parasitoid models with impulsive control strategy

In this paper, we propose and analyse two type host–parasitoid models with integrated pest management (IPM) interventions as impulsive control strategies. For fixed pulsed model, the threshold condition for the global stability of the host-eradication periodic solution is provided, and the effects of key parameters including the impulsive period, proportionate killing rate, instantaneous search rate, releasing constant, survival rate and the proportionate release rate on the threshold condition are discussed. Then latin hypercube sampling /partial rank correlation coefficients are used to carry out sensitivity analyses to determine the significance of each parameters. Further, bifurcation analyses are presented and the results show that coexistence of attractors existed for a wide range of parameters, and the switch-like transitions among these attractors indicate that varying dosages and frequencies of insecticide applications and numbers of parasitoid released are crucial for IPM strategy. For unfixed pulsed model, the results show that this model exists very complex dynamics and the host population can be controlled below ET, and it implies that the modelling methods are helpful for improving optimal strategies to design appropriate IPM.     

Column-orthogonal designs with multi-dimensional stratifications

The orthogonal Latin hypercube design and its relaxation, and column-orthogonal design, are two kinds of orthogonal designs for computer experiments. However, they usually do not achieve maximum stratifications in multi-dimensional margins. In this paper, we propose some methods to construct column-orthogonal designs with multi-dimensional stratifications by rotating symmetric and asymmetric orthogonal arrays. The newly constructed column-orthogonal designs ensure that the estimates of all linear effects are uncorrelated with each other and even uncorrelated with the estimates of all second-order effects(quadratic effects and bilinear effects) when the rotated orthogonal arrays have strength larger than two. Besides orthogonality, the resulting designs also preserve better space-filling properties than those constructed by using the existing methods. In addition, we provide a method to construct a new class of orthogonal Latin hypercube designs with multi-dimensional stratifications by rotating regular factorial designs. Some newly constructed orthogonal Latin hypercube designs are tabulated for practical use.     

Multi-scroll and hypercube attractors from a general jerk circuit using Josephson junctions

In this paper Josephson junctions are used in order to generate n-scroll and n-scroll hypercube attractors. The design and realization of multi-scroll attractors depends on synthesizing the nonlinearity with an electrical circuit. Therefore we propose to use of the Josephson junction in a general jerk circuit in such a way that there is no need for synthesizing the nonlinearity towards chaotic n-scroll and hyperchaotic n-scroll hypercube attractors. The results are illustrated with computer simulations.     

Multi-scroll and hypercube attractors from a general jerk circuit using Josephson junctions

In this paper Josephson junctions are used in order to generate n-scroll and n-scroll hypercube attractors. The design and realization of multi-scroll attractors depends on synthesizing the nonlinearity with an electrical circuit. Therefore we propose to use of the Josephson junction in a general jerk circuit in such a way that there is no need for synthesizing the nonlinearity towards chaotic n-scroll and hyperchaotic n-scroll hypercube attractors. The results are illustrated with computer simulations.     

Transitivity of varietal hypercube networks

The varietal hypercube VQn is a variant of the hypercube Qn and has better properties than Qn with the same number of edges and vertices. This paper proves that VQn is vertex-transitive. This property shows that when VQn is used to model an interconnection network, it is high symmetrical and obviously superior to other variants of the hypercube such as the crossed cube.     

On the multisearching problem for hypercubes

In this paper we give improved bounds for the multisearch problem on a hypercube. This is a parallel search problem where the elements in the structure S to be searched are totally ordered, but where it is not possible to compare in constant time any two given queries q and q′. More precisely, we are given on a n-processor hypercube a sorted n-element sequence S, and a set Q of n queries, and we need to find for each query q Q its location in the sorted S. We present an improved algorithm for the multisearch problem, one that takes O(log n(log log n)³) time on a n-processor hypercube. This problem is fundamental in computational geometry, for example it models planar point location in a slab. We give as application a trapezoidal decomposition algorithm with the same time complexity on a n log n-processor hypercube. The hypercube model for which we claim our bounds is the standard one, SIMD, with O(1) memory registers per processor, and with one-port communication. Each register can store O(log n) bits, so that a processor knows its ID.     

Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques

In a recent work, we introduced the concept of convex extensions for lower semi-continuous functions and studied their properties. In this work, we present new techniques for constructing convex and concave envelopes of nonlinear functions using the theory of convex extensions. In particular, we develop the convex envelope and concave envelope of z=x/y over a hypercube. We show that the convex envelope is strictly tighter than previously known convex underestimators of x/y. We then propose a new relaxation technique for fractional programs which includes the derived envelopes. The resulting relaxation is shown to be a semidefinite program. Finally, we derive the convex envelope for a class of functions of the type f(x,y) over a hypercube under the assumption that f is concave in x and convex in y.     

A rule-based development of incremental models

In the study, we propose a concept of incremental fuzzy models in which fuzzy rules are aimed at compensating discrepancies resulting because of the use of a certain global yet simple model of general nature (such as e.g., a constant or linear regression). The structure of input data and error discovered through fuzzy clustering is captured in the form of a collection of fuzzy clusters, which helps eliminate (compensate) error produced by the global model. We discuss a detailed architecture of the proposed rule-based model and present its design based on an augmented version of Fuzzy C-Means (FCM). An extended suite of experimental studies offering some comparative analysis is covered as well.     

Analysing emergency medical service ambulance deployment on a Brazilian highway using the hypercube model

In this study we analyse the ambulance deployment of an emergency medical system on a Brazilian highway connecting the cities of São Paulo and Rio de Janeiro. Our focus is on the mean response time of the system to an emergency call, viewed as an important component of the user service. To evaluate the system performance we applied the hypercube model, a well-known tool for planning server-to-customer systems, which is based on spatially distributed queuing theory. The results showed that the model can be effective in supporting design and operational decisions, in particular to reduce the workload unbalancing among the ambulances.