Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

链环的trip矩阵

ZULLI L首先构造了一个用于计算纽结Kauffman尖括号多项式的模2矩阵,纽结的trip矩阵.为了构造链环的trip矩阵,引入了一个带标识的穿有m个孔的圆盘来取代纽结情形下的圆盘,其中m为链环的分支数.主要结果为:定理若状态S是从状态AA…A经过i1,i2,…,ip位置上的标记替换(A换成B)而得的状态.设Ts是将trip矩阵T的左上角的n×n子块中ai1i1,ai2i2,…,aipip之值进行替换(0→1或1→0)所得的矩阵,则#(L|S)=n+m-秩(Ts).因此计算链环Kauffman尖括号多项式就归结为计算一组模2矩阵的秩.     

Polynomial Reproduction in Subdivision

We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in terms of a recurrence formula for the vectors which determine the structure of polynomial input with this property. From this recurrence, we obtain an algorithm to determine polynomial input of maximal degree. The algorithm can be used in the design of masks to achieve a high order of polynomial reproduction.     

一种基于图论与熵的专家判断客观可信度的确定方法

本文给出一种群决策中确定专家判断可信度的方法，其主要思路是首先通过图论中最小生成树的方法提取专家判断矩阵的全部信息，其次，使用相对熵指标确定获得专家判断的最终结果，并同时衡量专家自身判断的统一程度，从而确定专家判断的相对客观可信度。最后，文章给出一个典型的算例以说明该方法的可行性和有效性。     

行波管质量与可靠性信息管理系统的设计

本文从应用角度简要介绍了《行波管质量与可靠性信息管理系统》的研制背景，数据库的数据来源，数据结构，系统构成及功能特点。     

试生产中产品的可靠性保证

阐述了试行产中产品质量和可靠性的主要保证方法，由于这些做法来自于工厂的生产实践，所以，对承制方，订购方等各级，各类人员都有借鉴意义。同时对理论工作者也有一定的参考价值。     

给定拓扑结构的网络的可靠性设计

本文首先讨论了网络链路堵概率的加权平均值，提出了网络分配的一般准则，并在考虑了网络链路生存链路概率的因素后，提出了更一般的网络链路堵塞概率的加权平均值，以此为基础，分别讨论了网络在给定点的费用条件下，使得网络可靠性最大的网络设计问题，以及在给定网络可靠性指标的前提下，使得网络费用最小的网络设计问题。     

一类新的插值结点

有界单连通区域Ｇ，其边界θＧ＝Г∈（１，α），α〉０。本计算节以广义Ｆａｂｅｒ多项式φｎ（ｚ）的零点为插值结点的Ｌａｇｒａｎｇｅ插值多项式的逼近性质，得到了它对Ａ（Ｇ↑－）中的函数的一致逼近阶和平均逼近阶的估计，并且得到了它对Ｅ＾ｐ（Ｇ）中函数的平均逼近阶的估计，还指出关于平均逼近阶的估计是不可改进的。     

Barrier layer effect of tantalum on the electromigration in sputtered copper films on hydrogen silsesguioxane and SiO2

As IC devices scale down to the submicron level, the resistance-capacitance (RC) time delays are the limitation to circuit speed. A solution is to use low dielectric constant materials and low resistivity materials. In this work, the influence of underlying barrier Ta on the electromigration (EM) of Cu on hydrogen silsesquioxane (HSQ) and SiO₂ substrates was investigated. The presence of a Ta barrier not only improves the adhesion between Cu and dielectrics, but also enhances the crystallinity of Cu film and improves the Cu electromigration resistance. The activation energy obtained suggests a grain boundary migration mechanism and the current exponent calculated indicates the Joule heating effect.     

一类二元相关威布尔分布的可靠性问题

本文考虑生存函数为${\ol{F}(x_{1},x_{2})}=\exp\{-[(x_{1}^{1/\alpha}/\theta_{1})^{1/\delta}+(x_{2}^{1/\alpha}/\theta_{2})^{1/\delta}]^{\delta}\},\;x_{i}>0,\;\alpha>0$, $1\geq\delta>0,\;\theta_{i}>0\;(i=1,2)$的二元威布尔分布的两种可靠性问题, 提出可靠度$\pr$的估计并讨论了它们的渐近性, 最后还作了模拟计算.