New Linear Codes Over \mathbb{F}_3 and \mathbb{F}_5 and Improvements on Bounds

One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes.     

(2+1)维非对称 Nizhnik-Novikov-Veselov系统的新映射解及其局域结构

映射法是一种非常经典、有效和成熟的求解非线性演化方程的方法，其最大的特点是可以有多种不同形式的设解，使得最终求得的解丰富多彩. 利用改进的 Riccati 方程映射法和变量分离法，得到了(2+1)维非对称 Nizhnik-Novikov-Veselov 系统的新显式精确解.根据得到的孤波解，构造出该系统的峰孤子和分形孤子等局域结构，研究了两个孤立波的“追碰”现象. 关键词： 改进的映射法 (2+1)维非对称 Nizhnik-Novikov-Veselov 系统 局域结构 “追碰”现象     

基于彩色扫描仪的图像光谱重构

针对彩色扫描仪的特点,采用主元分析法(PCA)和反向传播(BP)人工神经网络(ANN)相结合的方法对图像光谱重构进行研究。选择IT8.7/2标准色卡作为训练样本,将该色卡中的另一组色靶作为检验样本以讨论不同网络结构以及不同主元数和训练样本数对光谱重构的影响,再以自然色系统(NCS)色卡为检验样本来分析不同种类的训练和检验样本与光谱重构性能的关系。实验结果表明,采用3-14-6网络结构和6个主元数是最佳选择,训练样本和扫描目标之间的一致性是基于彩色扫描仪图像光谱重构的关键所在。     

旋转流体实验设备改造

论述了旋转流体实验装置改造所存在的问题及改进的措施。     

车辆路径问题的改进遗传算法

提出一种基于遗传算法的求解车辆路径问题的新算法,避免传统遗传算法处理不可行约束条件中惩罚项系数选取不当所出现的问题.同时,通过现实例子分析该算法的优劣性,实验结果表明该算法是一种有效的算法.     

求解不等式约束优化问题的一个改进算法

本文改进了一个求解不等式约束优化问题的对偶算法，建立了一个相应的算法，进一步证明了该算法的收敛性．最后，给出数值结果以验证该算法的有效性。     

不同开关频率下电压控制升压变换器中的Hopf分岔分析

由于电压控制升压变换器的传统平均模型中没有包含开关频率,从而无法分析开关频率的大小对电压控制升压变换器中Hopf分岔的影响. 通过建立电压控制升压变换器的含有开关频率的改进平均模型,分析了开关频率对电压控制升压变换器中Hopf分岔的影响,并设计硬件电路,给出电路试验结果. 研究表明:采用电压控制升压变换器的改进平均模型,可以有效地分析不同开关频率对电压控制升压变换器中Hopf分岔的影响; 随着开关频率的减小,电压控制升压变换器更易于发生Hopf分岔. 关键词： 改进平均模型 电压控制升压变换器 开关频率     

宏观经济信息宣告的股市收益及波动性效应——基于改进的AR(1)-EGARCH(1,1)-M模型的实证检验

基于改进的AR(1)-EGARCH(1,1)-M模型,从收益率和波动性两个方面考察各类宏观信息宣告对股票市场价格行为的影响.结果表明,居民消费价格指数和商品零售价格指数对股票市场的收益有负向影响;国内生产总值、社会消费品零售总额、公开市场操作利率变动率和企业景气指数对股票市场的收益有正向影响;公开市场操作公告会导致股票市场条件收益率显著增加;其余各类宏观信息因素对股票市场收益的波动性并不存在显著影响.     

Improved Iterative Version of the Coats-Redfern Method to Evaluate Non-Isothermal Kinetic Parameters

An improved version of the Coats-Redfern method of evaluating non-isothermal kinetic parameters is presented. The Coats-Redfern approximation of the temperature integral is replaced by a third-degree rational approximation, which is much more accurate. The kinetic parameters are evaluated iteratively by linear regression and, besides the correlation coefficient, the F test is suggested as a supplementary statistical criterion for selecting the most probable mechanism function. For applications, both non-isothermal data obtained by theoretical simulation and experimental data taken from the literature for the non-isothermal dehydration of Mg(OH)₂ have been processed.This revised version was published online in November 2005 with corrections to the Cover Date.     

Simulation of container filling process with two inlets by improved smoothed particle hydrodynamics (SPH) method

In this article, an improved smoothed particle hydrodynamics (SPH) method is proposed to simulate the filling process with two inlets. Improvements are achieved by deriving a corrected kernel gradient of SPH and a density re-initialisation. In addition, a new treatment of solid wall boundaries is presented. Thus, the improved SPH method has higher accuracy and better stability, and conserves both linear and angular momentums. The validity of the new boundary treatment is shown by simulating the spin-down problem. The bench tests are also presented to demonstrate the performance of the improved SPH method. Then the filling process with a single inlet is simulated to show the ability to capture complex-free surface of the proposed method. Finally, the filling process with two inlets is numerically investigated. The numerical results show that the filling patterns are affected significantly by Reynolds number, aspect ratio of the container and the location of the inlets.