一类(0,1)-矩阵的最大积和式的积分表达式

给出了线和n-2的n阶（0，1）－矩阵的最大积和式的积分表达式，并证明了该积分表达式与[1]得到的组合表达式等价。     

研究K4-同胚图K4(α,1,1,δ,ε,η)色性的一个引理

主要介绍了一个引理，这个引理奠定了K4－同胚图K4（α，1，1，δ，ε，η）色性研究的基础。     

Co-P非晶态合金电子性质和局域结构的理论研究

根据Co P非晶态合金结构的短程有序和结构中可能存在P -P相互作用的实验事实 ,选择了单磷原子簇模型ConP(n =1～ 5 )和双磷原子簇模型ConP2 (n =1～ 4 ) ,用密度泛函理论方法对其进行计算 .结果表明 ,在单磷Co2 P( 2 ) 、Co3 P( 1) 及Co4P( 2 ) 模型体系中 ,Co原子供给P原子电子 ,与电负性规则一致 ,同时Co和P之间具较强化学作用 ,可以形成稳定的原子簇 ;而在双磷和单磷原子簇Co5P( 1) 模型体系中 ,形成的原子簇不稳定 ,采用单磷Co2 P( 2 ) 、Co3 P( 1) 及Co4P( 2 ) 模型能较好地反映Co P非晶态合金的结构特点 .     

LOCAL WELL-POSEDNESS AND ILL-POSEDNESS ON THE EQUATION OF TYPE □u = uk((e)u)α

This paper undertakes a systematic treatment of the low regularity local wellposedness and ill-posedness theory in Hs andHs for semilinear wave equations with polynomial nonlinearity in u and (e)u. This ill-posed result concerns the focusing type equations with nonlinearity on u and (e)tu.     

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.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

On the influence of the surfactant''s polar group on the local and terminal velocities of bubbles

The local and the terminal velocities, the size and the degree of bubbles’ shape deformations were determined as a function of distance from the position of the bubble formation (capillary orifice) in solutions of n-octyltrimethylammonium bromide, n-octyldimethylphosphine oxide, n-octyl-β-D-glucopyranoside and n-octanoic acid.

These surface-active compounds have different polar groups but an identical hydrocarbon chain (C8) in the molecule. The motion of the bubbles was monitored and recorded using a stroboscopic illumination, a CCD camera, and a JVC professional video. The recorded bubble images were analyzed by the image analysis software. The bubbles accelerated rapidly and their shape was deformed immediately after detachment from the capillary. The extent of the bubbles’ shape deformation (ratio of horizontal and vertical diameters) was 1.5 in distilled water and dropped rapidly down to a level of ca. 1.05–1.03 with increasing surfactant concentration. After the acceleration period the bubbles either attained a constant value of the terminal velocity (distilled water and high concentrations of the solutions), or a maximum in the velocity profiles was observed (low concentrations). The values of the terminal velocity diminished drastically with increasing concentration, from the value of 35 cm/s in water down to about 15 cm/s, while the bubble diameter decreased by ca. 10% only. The surfactant adsorption at the surface of the bubbles was evaluated and the minimum adsorption coverages required to immobilize the bubbles’ surface were determined. It was found that this minimum adsorption coverage was ca. 4% for n-octyldimethylphosphine oxide, n-octyl-β-D-glucopyranoside, n-octanoic acid and 25% for n-octyltrimethylammonium bromide. The difference in the adsorption coverage together with the surfactants’ surface activities indicate that it is mainly the adsorption kinetics of the surfactants that governs the fluidity of interfaces of the rising bubbles.