线性弹性柔性壳非协调有限元计算模型

本文基于Ciarlet-Lods-Miara定义的柔性壳模型提出一种Galerkin非协调有限元离散格式.首先,对积分区域进行Delaunay三角剖分,并在三角网格上对位移前两个分量用一次Lagrange多项式逼近,对第三个分量(即法向位移)用非协调Morley元逼近.其次,讨论了构造的Galerkin非协调有限元离散格式解的存在性、唯一性和先验误差估计.最后对特殊边界条件下的锥壳采用该方法进行数值实验,计算出不同网格下锥壳的位移,并通过分析数值实验结果证明有限元离散格式的收敛性和有效性.     

An adaptive method based on the improved LPA-ICI algorithm for MRI enhancement

Various diseases are diagnosed using medical imaging used for analysing internal anatomical structures. However, medical images are susceptible to noise introduced in both acquisition and transmission processes. We propose an adaptive data-driven image denoising algorithm based on an improvement of the intersection of confidence intervals (ICI), called relative ICI (RICI) algorithm. The 2D mask of the adaptive size and shape is calculated for each image pixel independently, and utilized in the design of the 2D local polynomial approximation (LPA) filters. Denoising performances, in terms of the PSNR, are compared to the original ICI-based method, as well as to the fixed sized filtering. The proposed adaptive RICI-based denoising outperformed the original ICI-based method by up to 1.32 dB, and the fixed size filtering by up to 6.48 dB. Furthermore, since the denoising of each image pixel is done locally and independently, the method is easy to parallelize.     

A meshless method for solving 1D time-dependent heat source problem

A novel meshless numerical procedure based on the method of fundamental solutions (MFS) and the heat polynomials is proposed for recovering a time-dependent heat source and the boundary data simultaneously in an inverse heat conduction problem (IHCP). We will transform the problem into a homogeneous IHCP and initial value problems for the first-order ordinary differential equation. An improved method of MFS is used to solve the IHCP and a finite difference method is applied for solving the initial value problems. The advantage of applying the proposed meshless numerical scheme is producing the shape functions which provide the important delta function property to ensure that the essential conditions are fulfilled. Numerical experiments for some examples are provided to show the effectiveness of the proposed algorithm.     

非线性广义最小方差控制律综述

如何设计简单的控制策略对复杂非线性系统进行控制是控制界还未解决的难题．非线性广义最小方差控制律的提出使得非线性控制器的设计可以基于更为一般的非线性模型，并且控制器易于实现．整个系统包含时滞环节，稳定的非线性输入子系统和一个可以用多项式或者状态空间描述的子系统．通过最小化由误差加权项、状态加权项和输入加权项组成的信号的方差得到优化控制器．在系统为开环稳定的情况下，可用史密斯预估器进行控制．本文首先介绍了非线性广义最小方差控制的发展进程，然后综述了基于状态空间和多项式描述的系统的非线性广义最小方差控制器的设计以及其现状和今后的发展方向．     

一种新的大整数乘法算法

为解决超出计算机系统基本整数类型表达能力的整数(大整数)算术运算问题,以基础算法--大整数乘法为研究对象,根据大整数的表示形式与多项式表示形式上的相似性,结合大整数乘法进位与取模的特点,给出了一种关于大整数乘法的多项式算法.其方法与别的方法最大的不同是,虽然是求两个大整数乘法,但整个算法没有使用乘法,只是用加法运算而已...     

一类积分不等式的机器判定

将一类积分不等式转化为Tarski模型外的齐次对称多项式不等式,该类齐次对称多项式的次数是给定的,变元个数可以是任意多个,并且多项式的系数是与变元个数相关的变系数.这些特点与杨路等人最近提出的几个公开问题密切相关,是比较有代表性的一类齐次对称多项式.然后利用Timofte关于对称多项式不等式判定的降维方法,结合不等式证明软件BOTTEMA及差分代换方法,给出对应的一类Tarski模型外的齐次对称多项式不等式的机器判定算法,从而实现原积分不等式的机器判定.当给定的积分不等式及齐次对称多项式不等式不成立时,可给出具体不成立的数值反例.应用例子表明问题的广泛性及算法的有效性.     

半导体照明中结温的电学法测试与优化

基于电学法测试半导体照明的结温,实现了结温测试的电路,采用脉冲调制对LED的瞬态结温值进行测试.实脸发现,结温与正向电压的标定系数K值是影响结温测试精度的主要因素,分析了产生误差的主要原因,并对该系数进行修正.测试结果表明:结温的实测值与参考值有良好的一致性,存在误差的原因是采样的延时时间较长,可提高数据采样率和剔除不...     

Adaptive predistortion using threshold decomposition‐based piecewise linear modeling

A new adaptive predistortion approach for nonlinear power amplifiers based on the piecewise linear (PWL) approximation of nonlinear functions is presented. The PWL model is obtained using threshold decomposition (TD) of the input‐output characteristics. The TD based PWL model is used to develop a baseband predistorter using both the direct and the indirect learning architectures. The proposed predistorter is proved to provide a better performance in suppressing nonlinear distortion than conventional polynomial predistorters and a reduced hardware complexity as compared to lookup table (LUT) approach. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Efficient bit-parallel multipliers over finite fields GF(2)

Hardware implementation of multiplication in finite field GF(2^m) based on sparse polynomials is found to be advantageous in terms of space-complexity as well as the time-complexity. In this paper, we present a new permutation method to construct the irreducible like-trinomials of the form (x + 1)^m + (x + 1)ⁿ + 1 for the implementation of efficient bit-parallel multipliers. For implementing the multiplications based on such polynomials, we have defined a like-polynomial basis (LPB) as an alternative to the original polynomial basis of GF(2^m). We have shown further that the modular arithmetic for the binary field based on like-trinomials is equivalent to the arithmetic for the field based on trinomials. In order to design multipliers for composite fields, we have found another permutation polynomial to convert irreducible polynomials into like-trinomials of the forms (x² + x + 1)^m + (x² + x + 1)ⁿ + 1, (x² + x)^m + (x² + x)ⁿ + 1 and (x⁴ + x + 1)^m + (x⁴ + x + 1)ⁿ + 1. The proposed bit-parallel multiplier over GF(2^4m) is found to offer a saving of about 33% multiplications and 42.8% additions over the corresponding existing architectures.