已知离散点曲率的曲线拟合递推方法

该文介绍了一种简单的在已知离散点曲率的情况下进行平面和空间曲线拟合的方法，在相邻的已知离散点之间，用线性插值的规则获得插值点的曲率值，然后提出一种基于微分原理的递推方法，从起始点开始逐点运算推进，将曲线形状拟合出来．     

渐近非扩张映象具误差的迭代收敛问题

研究了Banach空间中渐近非扩张型映象不动点的迭代逼近问题，所得结果改进了相关文献的最新成果．     

一阶积分微分方程周期边值问题解的存在性

研究了一类一阶纯量形式积分微分方程的周期边值问题，利用单调迭代方法证明了问题极解的存在性。     

基于语义网络的方案设计过程表达与推理

从基于机械运动方案设计的表达方法必须能支持概念设计全过程的思想出发，提出计算机辅助概念设计系统必须能够表达设计方案、产生方案、产生多个方案和确定最优方案．根据方案表达方法应具备的基本功能要求，选用语义网络技术表达设计方案过程、工艺动作、机构及其相互间的关系，通过对设计方案中机构时间配合及其影响的表达和调整实现了方案设计运动循环图表达的计算机辅助化．利用基于语义网络表示的不确定性推理技术构造待求问题的语义网络片断，通过已有设计实例与设计要求的属性值与属性值、属性值与属性值域、属性值域与属性值域三者的匹配比较构造贴近度计算公式，并对工业平缝机中的挑线机构进行了机构选型．实例证明了击模型的正确、实用性．     

基于二维提升方案的可逆双正交小波变换在渐进性无损图像压缩中的应用

分析了一维(基于行、列分解和重构)提升方案的特点，从理论上指出了一维提升方案的不足之处，提出了二维(基于子带分解和重构)提升方案，并给出了CDF(1，3)双正交小波二维提升方案的具体形式，改进的提升方案弥补了一维提升方案的不足之处，不需作‘√2’因子和归一化处理，整个小波变换是可逆的、基于整数运算的、能量守恒的，减少了误差传递的机会，用该小波变换实现了快速的、渐进性的直至无损图像压缩。     

预优矩阵及其构造技术

为达到预处理共轭梯度法(PCG)提高收敛速度，克服数值不稳定性目的，给出了构造预优矩阵的条件，并构造了三个典型的预优矩阵。它们是不完全Cholesky因子预优矩阵，对角预优矩阵和利用SSOR法导出的预优矩阵，且在PCG中是应用效果很好的预优矩阵。     

Shift visual cryptography scheme of two secret images

A new visual cryptography scheme of two secret images, which is named the shift visual cryptography of two secret images, is given. The compound function family of a general construction model is also introduced. The uniqueness and validity of this model are proved, and the minimum rows and columns for realizing the scheme are obtained. Compared with visual cryptography of one secret image, the shift visual cryptography scheme can share two secret images with the same size of pixels expansion without losing the contrast. It has randomness and various forms, and furthermore, we can also visually recover two secret images even if the two shares are different in form and color.     

A model for assessing effects of climate change on runoff in China

A model is established for assessing the effects of climate change on runoff in China based on the land surface parameterization scheme variable infiltration capacity (VIC). The entire area of China is represented by 2604 cells with a resolution of 60 km×60 km for each cell. Forcing data, soil and vegetation parameters needed by the VIC model for the entire area of China are prepared. Daily forcing data, which are obtained from 740 stations between 1980 and 1990, are interpolated to the 60 km×60 km grid system. The VIC model is run on every grid cell over the whole China, and a routing scheme is run offline with daily input of surface runoff and drainage from the VIC to get hydrograph at basin outlets. The spatial patterns of simulated runoff and mean annual precipitation are consistent very well. The results of monthly streamflow simulations over the Huaihe and Weihe River basins indicate that there is a good agreement between the observed and simulated values, and also initially indicate the rationality and feasibility of the evaluation model.     

Compact difference approximation with consistent boundary condition

For simulating multi-scale complex flow fields it should be noted that all the physical quantities we are interested in must be simulated well. With limitation of the computer resources it is preferred to use high order accurate difference schemes. Because of their high accuracy and small stencil of grid points computational fluid dynamics (CFD) workers pay more attention to compact schemes recently. For simulating the complex flow fields the treatment of boundary conditions at the far field boundary points and near far field boundary points is very important. According to authors' experience and published results some aspects of boundary condition treatment for far field boundary are presented, and the emphasis is on treatment of boundary conditions for the upwind compact schemes. The consistent treatment of boundary conditions at the near boundary points is also discussed. At the end of the paper are given some numerical examples. The computed results with presented method are satisfactory.     

Design and Implementation of a Novel Algorithm for Iterative Decoding of Product Codes

A novel product code iterative decoding algorithm and its high speed implementation scheme are proposed in this paper.Based on partial combination of selected columns of check matrix,the reduced-complexity syndrome decoding method is proposed to decode sub-codes of product code and deliver soft output information.So iterative decoding of product codes is possible.The fast sorting algorithm and a look-up method are proposed for high speed implementation of this algo-rithm.Compared to the conventional weighing iterative algorithm,the proposed algorithm has lower complexity while offering better performance,which is demonstrated by simulations and implementation analysis.The implementation scheme and verilog HDL simulation show that it is feasible to achieve high speed decoding with the proposed algorithm.