泛协Kriging的数学模型

Due to its complexities in both mathematicM formulations and applications, universal co-kriging （UCK） has not been sufficiently discussed in literature. An extended and simpler matrix formulation UCK with incorporation of a polynomial variable trend is proposed in this paper. Estimators of the value and expectation of a regionMized vector taken in a point are obtained on the basis of cross-covaxiance and cross-vaxiogram, respectively. The complex expressions of co-kriging with trend are greatly simplified by introducing special matrix operations, such as Kronecker product, into the formulations. This simplification offers a feasible and easier approach for computer coding of the UCK, and helps the practitioners to use the UCK technique conveniently in real cases.     

基于Kriging模型的供应链优化设计

供应链优化的目的之一是确定使得总成本最小的最佳运作水平.供应链系统是复杂的动态系统,由于库存系统的复杂性和供应链本身的不确定性,利用传统优化方法往往需要耗费一定的计算成本和经济成本.而元模型则能以简单的数学表达式较精确地刻画仿真系统的输入输出关系,为研究者分析复杂系统提供了一种分析方法.针对供应链优化问题,给出了一种基于计算机试验设计中的元模型一Kriging模型的供应链优化方法,并通过一个三级供应链问题对所提方法进行了实证研究.研究结果表明了所提方法的有效性和可用性,为供应链优化提供了一种新的研究思路.     

Kriging空间分析法及其在城市大气污染中的应用

目前常用的大气污染物浓度插值方法没有考虑变量的空间分布特征 ,无法检验插值结果 ,不适用于复杂的城市大气环境的空间分析 .本文引用非参数地质统计学的指示克立格法 ,定义了大气环境研究领域的指示函数 ,据此分析了某市 SO2 的空间变异特征 ,估计了其 SO2 的空间分布 ,并给出了估计的精度 (估计误差 ) ,最后研究了监测点位置与估计误差空间分布之间的关系 .结果表明指示克立格法是城市大气污染空间分析、插值的有力工具 .     

基于粒子群优化Kriging模型的边坡可靠度分析

采用传统极限平衡法进行边坡可靠度分析时,不可避免会遇到一个问题,即边坡功能函数形式的高度非线性以及隐含性.对于隐式功能函数,传统的求解方法是通过对功能函数进行多次迭代,从而得到安全系数值.但是由于功能函数的形式较为复杂,导致迭代计算的过程变得尤为繁琐且效率低下.鉴于传统边坡可靠度分析中存在的安全系数计算繁琐耗时的问题,...     

“断块”与 “板块”

从“断块”学说的观点看,“板块”是断块的一种特殊类型,它是被巨大的深切整个岩石圈的断裂带所围限的断块,是最大一级的断块,称做“岩石圈断块”. 板块学说主要是在对海洋的研究与地球物理研究的基础上发展起来的,它提出了一些有价值的新论点.但大多数研究板块的人,对大陆地区的地质情况还缺乏深入研究,不能充分利用本世纪以来在大陆地质构造研究方面所获得的科学结论与思想方法,这就使板块学说的进一步发展受到了阻碍。 本文先对断块学说的历史发展与现阶段理论作一简单介绍,然后应用断块构造的力学分析与历史分析方法,对板块构造研究中出现的一些主要问题谈一些看法.作者认为板块边界的力学机制主要是受基底锯齿状断裂的活动方式控制的,板块内部的应力分布也主要与板块内部次一级强度不同的断块的复杂活动有关。关于板块运动的驱动力,不但应考虑地球内部的热运动,而且应考虑到重力作用和地球作为一个旋转天体所具有的各种动力学行为.     

基于偏最小二乘变换与Kriging模型的全局优化方法

针对传统Kriging模型在多变量(高维)输入全局优化中因超参数过多而引发收敛速度慢,精度低,建模效率不高问题,提出了基于偏最小二乘变换技术和Kriging模型的有效全局优化方法.首先,构造偏最小二乘高斯核函数;其次,借助差分进化算法寻找满足期望改进准则最大化条件的新样本点;然后,将不同核函数和期望改进准则组合,构建四种有效全局优化算法并进行比较;最后,数值算例结果表明,基于偏最小二乘变换的Kriging全局优化方法在解决高维全局优化问题方面相比于标准的全局优化算法在收敛精度及收敛速度方面更具优势.     

基于滑动Kriging插值的MLPG法求解结构非耦合热应力问题

将基于滑动Kriging插值的无网格局部Petrov-Galerkin(MLPG)法用来求解二维结构非耦合热应力问题,首先进行瞬态热传导的求解,然后再通过顺序耦合法将不同时刻节点温度作为附加体力项施加到应力分析中.瞬态温度场和非耦合热应力分析通过加权余量法来离散,同时用Heaviside分段函数作为局部弱形式的权函数.由于滑动Kriging插值构造的形函数满足Kroneckerδ函数的性质,因此方便了本质边界条件的施加.刚度矩阵形成过程中只涉及到边界积分而没有涉及到区域积分,因此可以减少计算工作量,最后通过两个数值算例来验证本文方法的有效性.     

Quincunx multiresolution analysis for <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>(ℚ<Stack><Subscript>2</Subscript><Superscript>2</Superscript></Stack>)

With an eye on applications in quantum mechanics and other areas of science, much work has been done to generalize traditional analytic methods to p-adic systems. In 2002 the first paper on p-adic wavelets was published. Since then p-adic wavelet sets, multiresolution analyses, and wavelet frames have all been introduced. However, so far all constructions have involved dilations by p. This paper presents the first construction of a p-adic wavelet system with a more general matrix dilation, laying the foundation for further work in this direction.     

Approximation of the classes <Emphasis Type="Italic">C</Emphasis><Stack><Subscript>β</Subscript><Superscript>ψ</Superscript></Stack><Emphasis Type="Italic">H</Emphasis><Subscript>ω</Subscript> by generalized Zygmund sums

We obtain asymptotic equalities for the least upper bounds of approximations by Zygmund sums in the uniform metric on the classes of continuous 2π-periodic functions whose (ψ, β)-derivatives belong to the set H _ω in the case where the sequences ψ that generate the classes tend to zero not faster than a power function.     

传承&#183;探索&#183;创新

金风送爽,丹桂飘香。在这收获的季节里,中国珠算心算协会和世界珠算心算联合会相继在天津召开会员大会,组成新一届理事会和新的领导机构,这标志着我国和世界珠算心算事业将开启崭新的一页!     

The smooth structure set of <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> × <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>

We calculate \({\mathcal{S}^{{\it Diff}}(S^p \times S^q)}\), the smooth structure set of S ^p × S ^q , for p, q ≥ 2 and p + q ≥ 5. As a consequence we show that in general \({\mathcal{S}^{Diff}(S^{4j-1}\times S^{4k})}\) cannot admit a group structure such that the smooth surgery exact sequence is a long exact sequence of groups. We also show that the image of the forgetful map \({\mathcal{S}^{Diff}(S^{4j}\times S^{4k}) \rightarrow \mathcal{S}^{Top}(S^{4j}\times S^{4k})}\) is not in general a subgroup of the topological structure set.     

On the Crossing Number of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> □ <Emphasis Type="Italic">P</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(K_m □ P_n), the crossing number of the Cartesian product K_m □ P_n. We prove that for m ≥ 3,n ≥ 1 and cr(K_m □ P_n)≥ (n − 1)cr(K_m+2 − e) + 2cr(K_m+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for m = 6, i.e., cr(K₆ □ P_n) = 15n + 3. Research supported by NFSC (60373096, 60573022).     

Regular<Emphasis Type="Italic">n</Emphasis>-simplices in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> with vertices in ℤ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

In this paper theI andII regularn-simplices are introduced. We prove that the sufficient and necessary conditions for existence of anI regularn-simplex in ℝ ⁿ are that ifn is even thenn = 4m(m + 1), and ifn is odd thenn = 4m + 1 with thatn + 1 can be expressed as a sum of two integral squares orn = 4m - 1, and that the sufficient and necessary condition for existence of aII regularn-simplex in ℝ ⁿ isn = 2m ² - 1 orn = 4m(m + 1)(m ∈ ℕ). The connection between regularn-simplex in ℝ ⁿ and combinational design is given.     

The number of S-precomplete classes in the functional system <Emphasis Type="Italic">P</Emphasis><Stack><Subscript><Emphasis Type="Italic">κ</Emphasis></Subscript><Superscript><Emphasis Type="Italic">τ</Emphasis></Superscript></Stack>

The problem on the number of precomplete classes in the functional system P _κ ^τ is considered, elements of P _κ ^τ are deterministic S-functions defined on words of length τ composed from letters of an alphabet of cardinality κ. An asymptotics for the number of S-precomplete classes in P _κ ^τ is obtained for arbitrary fixed κ and τ tending to infinity.     

Equitable total coloring of <Emphasis Type="Italic">F</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> ⋁ <Emphasis Type="Italic">W</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ _t (G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ _et (G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order. Supported by the National Natural Science Foundation of China (No. 10771091).     

On Dirichlet Type Spaces <Emphasis Type="Italic">A</Emphasis><Stack><Subscript><Emphasis Type="Italic">ω</Emphasis></Subscript><Superscript>2</Superscript></Stack> Over the Half–Plane

Some extensions of the results of the first author related with the Hilbert spaces A _ω,0 ² of functions holomorphic in the half–plane are proved. Some new Hilbert spaces A _ω ² of Dirichlet type are introduced, which are included in the Hardy space H2 over the half–plane. Several results on representations, boundary properties, isometry, interpolation, biorthogonal systems and bases are obtained for the spaces A _ω ² ? H₂.     

An extremal problem in the Hardy space <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> for 0&lt;<Emphasis Type="Italic">p</Emphasis>&lt;∞

We prove that if the function determining a linear functional over the Hardy space is analytic on the disk of radius greater than 1 then the extremal function of this functional is analytic on the same disk.     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.     

A Ring Theoretic Construction of Hadamard Difference Sets in ℤ<Subscript>8</Subscript><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>×ℤ<Subscript>2</Subscript><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Let be the Galois ring of characteristic 2³ and rank n and let . We give an explicit construction of Hadamard difference sets in .}Research supported by NSA grant MDA 904-02-1-0080.