声学超表面的非对称声分束特性研究

非对称声分束超表面是由人工微单元结构按照特定序列构建的二维平面结构,可将垂直入射的声波分成两束传播方向和分束比自由调控的透射波,在声功能器件设计及声通信领域具有广泛的应用前景。本文系统研究了一种实现非对称声分束的设计理论和实现方法,基于局域声功率守恒条件研究了声分束器的设计理论、阻抗矩阵分布、法向声强分布、声压场分布等。利用遗传算法对四串联共振腔结构进行参数优化实现了声分束器所需的阻抗矩阵分布,声压场分布表明声波入射到声分束器后在入射侧激发出两列传播方向相反且幅值和衰减系数均相同的表面波,实现了入射侧与透射侧的局域声功率相互匹配。声波经过声分束器后被分为两束透射波,两束透射波的折射角和透射系数与理论值十分吻合,证明了设计理论及实现方法的正确性和可行性。本文的研究工作可以为新型非对称声分束结构设计提供理论参考、设计方法和技术支持,并促进其在工程领域的实际应用。     

Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

基质刚性影响声孔效应介导的单细胞基因转染

实验研究了基质刚性对单细胞质粒DNA转染效果的影响。实验采用高声压短脉冲(0.45MPa,10μs)条件的超声对培养在不同硬度凝胶基质(软的凝胶基质：0.2kPa,硬的凝胶基质：40kPa)上的力学敏感细胞NIH 3T3进行质粒DNA转染实验。实验结果表明,培养在硬的凝胶基质上的细胞,质粒DNA转染效率明显高于培养在软的凝胶基质上的细胞。进一步对质粒DNA进行荧光示踪可知培养在不同刚性基质上的细胞导入质粒DNA的方式不同。当细胞被培养在硬的凝胶基质上时,通过声致穿孔产生的小孔进入细胞内的质粒DNA更多,而培养在软的凝胶基质上的细胞,更多的质粒DNA可以通过非声致穿孔作用,例如内吞方式导入细胞。 细胞骨架蛋白分布规律表明,硬的凝胶基质上培养的细胞内有更多的F肌动蛋白微丝,可以更好地支撑起细胞的铺展形态,相对不容易发生内吞作用。而软的凝胶基质上培养的细胞内F肌动蛋白则更多以球形状态存在,细胞形貌骗向圆形,此时更容易发生胞吞作用。     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Existence of the uniformly minimum risk equivariant estimators of parameters in a class of normal linear models

In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)^α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively. Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there exist UMRE estimators of parameters in the variance components model are obtained for the first time.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

线性双向联想存储器

提出了一个线性双向联想存储器的模型，一组有限个向量对由一线性算子建立起双向联想关系，此线性算于是一个网络的联结权重矩阵。该权矩阵由最小二乘法决定。由权矩阵的解导出一特殊类型的Ｌｙａｐｕｎｏｖ矩阵方程．本文提供了这种Ｌｙａｐｕｎｏｖ矩阵方程的解。