矩阵换算分光光度法中两种计算方法的比较

研究了在pH为10.5的硼砂-氢氧化钾缓冲溶液和乙醇的增敏作用条件下,偶氮氯膦Ⅰ与钙镁的吸收特性,建立了多波长吸光光度法同时测定钙镁的方法。采用两种矩阵算法对实验数据进行处理,并对结果进行比较和分析。钙镁质量浓度在0～1mg/L范围内用方法2能得到准确结果。

武器装备寿命相关问题研究

对装备寿命基本概念进行了辨析，明确了影响装备寿命的主要因素，提出了装备“三大寿命”延寿的主要应对措施。

Hand-eye calibration with a new linear decomposition algorithm

To solve the homogeneous transformation equation of the form AX=XB in hand-eye calibration, where X represents an unknown transformation from the camera to the robot hand, and A and B denote the known movement transformations associated with the robot hand and the camera, respectively, this paper introduces a new linear decomposition algorithm which consists of singular value decomposition followed by the estimation of the optimal rotation matrix and the least squares equation to solve the rotation matrix of X. Without the requirements of traditional methods that A and B be rigid transformations with the same rotation angle, it enables the extension to non-rigid transformations for A and B. The details of our method are given, together with a short discussion of experimental results, showing that more precision and robustness can be achieved.

Cache performance optimization of irregular sparse matrix multiplication on modern multi-core CPU and GPU

This paper focuses on how to optimize the cache performance of sparse matrix-matrix multiplication(SpGEMM).It classifies the cache misses into two categories;one is caused by the irregular distribution pattern of the multiplier-matrix,and the other is caused by the multiplicand.For each of them,the paper puts forward an optimization method respectively.The first hash based method removes cache misses of the 1 st category effectively,and improves the performance by a factor of 6 on an Intel 8-core CPU for the best cases.For cache misses of the 2nd category,it proposes a new cache replacement algorithm,which achieves a cache hit rate much higher than other historical knowledge based algorithms,and the algorithm is applicable on CELL and GPU.To further verify the effectiveness of our methods,we implement our algorithm on GPU,and the performance perfectly scales with the size of on-chip storage.

Regular Quasi Cyclic Low Density Parity Check Codes with Girth 8 from Elementary Number Theory

This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant permutation matrices via arithmetic analysis.The proposed constructions of quasi-cyclic LDPC codes achieve the following main advantages simultaneously:1) our methods are constructive in the sense that we avoid any searching process;2) our methods ensure no four or six cycles in the bipartite graphs corresponding to the LDPC codes;3) our methods are direct constructions of quasi-cyclic LDPC codes which do not use any other quasi-cyclic LDPC codes of small length like component codes or any other algorithms/cyclic codes like building block;4)the computations of the parameters involved are based on elementary number theory,thus very simple and fast.Simulation results show that the constructed regular codes of high rates perform almost 1.25 dB above Shannon limit and have no error floor down to the bit-error rate of 10-6.

Adaptive preprocessing algorithms of corneal topography in polar coordinate system

New adaptive preprocessing algorithms based on the polar coordinate system were put forward to get high-precision corneal topography calculation results. Adaptive locating algorithms of concentric circle center were created to accurately capture the circle center of original Placido-based image, expand the image into matrix centered around the circle center, and convert the matrix into the polar coordinate system with the circle center as pole. Adaptive image smoothing treatment was followed and the characteristics of useful circles were extracted via horizontal edge detection, based on useful circles presenting approximate horizontal lines while noise signals presenting vertical lines or different angles. Effective combination of different operators of morphology were designed to remedy data loss caused by noise disturbances, get complete image about circle edge detection to satisfy the requests of precise calculation on follow-up parameters. The experimental data show that the algorithms meet the requirements of practical detection with characteristics of less data loss, higher data accuracy and easier availability.

Matrix Decomposition and Calculation of Chrestenson Spectra

Calculation of a variation of discrete Fourier transform.Chrestenson spectraof functions of n indeterminates over integer modulo m(composite integer),is con-sidered.Based on sparse matrix decomposition,two fast algorithms with complexityO(mnn∑ri=1pi)are given to calculate the Chrestenson spectra,where p1p2…p2 is theprime factor decomposition of m.

Optical plasma boundary reconstruction based on least squares for EAST Tokamak

Reconstructing the shape and position of plasma is an important issue in Tokamaks. Equilibrium and fitting（EFIT） code is generally used for plasma boundary reconstruction in some Tokamaks. However, this magnetic method still has some inevitable disadvantages. In this paper, we present an optical plasma boundary reconstruction algorithm. This method uses EFIT reconstruction results as the standard to create the optimally optical reconstruction. Traditional edge detection methods cannot extract a clear plasma boundary for reconstruction. Based on global contrast, we propose an edge detection algorithm to extract the plasma boundary in the image plane. Illumination in this method is robust. The extracted boundary and the boundary reconstructed by EFIT are fitted by same-order polynomials and the transformation matrix exists. To acquire this matrix without camera calibration, the extracted plasma boundary is transformed from the image plane to the Tokamak poloidal plane by a mathematical model,which is optimally resolved by using least squares to minimize the error between the optically reconstructed result and the EFIT result. Once the transform matrix is acquired, we can optically reconstruct the plasma boundary with only an arbitrary image captured. The error between the method and EFIT is presented and the experimental results of different polynomial orders are discussed.