自适应试验遗传算法研究与应用

均匀设计与遗传算法相结合已有许多成功例子,但在应用中均匀设计表一般囿以固定形式而使二者的结合缺乏灵活性和普适性.为此提出应用亚遗传算法获得若干个任意水平数的均匀设计,并将其以3种方式嵌入标准遗传算法中:1)初始种群的均匀性分布;2)进化过程中对变量空间均匀性投点搜索;3)应用均匀设计进行调优试验,同时还增加了正态随机和摄动调优等试验操作技术,以上形成了基于试验设计、具有自适应能力的试验遗传算法.算例表明,通过以上方法改进的遗传算法可较好地保持种群多样性,寻优效率有较大提高,并能自动适应算法对搜索精度的要求.     

多维修类型下汽车的可用性仿真

分析了影响可有性的多种因素,研究了汽车的多维修类型问题。建立了可用度仿真分析模型,并以某轻型汽车为实例进行分析,得到了汽车整个寿命周期中不同截面的可用度,并研究了可用度随行驶里程变化的关系。控制有显著影响的因素进行了仿试验,研究了汽车的最佳运行环境温度和最佳的保养间隔里程,对维修决策提供了有力支持。     

Linear chaos in the quantum harmonic oscillator

In this note,it is proved that for the annihilation operator B of the unforced quantum harmonic oscillator,B~n is mixing and generically 5-chaotic with any 0 δ 2 for each positive integer n.Besides,by using the result in[Wu X and Zhu P,J.Phys.A：Math.Theor.,2011,44：505101],the authors obtain that the principal measure of B~n is equal to 1 for each positive integer n.     

An Adjusted Gray Map Technique for Constructing Large Four-Level Uniform Designs

A uniform experimental design (UED) is an extremely used powerful and efficient methodology for designing experiments with high-dimensional inputs, limited resources and unknown underlying models. A UED enjoys the following two significant advantages: (i) It is a robust design, since it does not require to specify a model before experimenters conduct their experiments; and (ii) it provides uniformly scatter design points in the experimental domain, thus it gives a good representation of this domain with fewer experimental trials (runs). Many real-life experiments involve hundreds or thousands of active factors and thus large UEDs are needed. Constructing large UEDs using the existing techniques is an NP-hard problem, an extremely time-consuming heuristic search process and a satisfactory result is not guaranteed. This paper presents a new effective and easy technique, adjusted Gray map technique (AGMT), for constructing (nearly) UEDs with large numbers of four-level factors and runs by converting designs with s two-level factors and n runs to (nearly) UEDs with 2^t?1s four-level factors and 2^tn runs for any t ≥ 0 using two simple transformation functions. Theoretical justifications for the uniformity of the resulting four-level designs are given, which provide some necessary and/or sufficient conditions for obtaining (nearly) uniform four-level designs. The results show that the AGMT is much easier and better than the existing widely used techniques and it can be effectively used to simply generate new recommended large (nearly) UEDs with four-level factors.

     

A criterion for the similarity of length-two elements in a noncommutative PID

This paper presents a criterion for the similarity of length-two elements in a noncommutative principal ideal domain. The criterion enables the authors to develop an algorithm for determining whether B ₁ A ₁ and B ₂ A ₂ are similar, where A ₁,A ₂,B ₁,B ₂ are first-order differential (difference) operators. The main step in the algorithm is to find a rational solution of a parametric differential (difference) Risch’s equation, which has been well-studied in symbolic integration (summation).     

Effective lower bounds of wrap-around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-discrepancy on three-level combined designs

How to obtain an effective design is a major concern of scientific research. This topic always involves high-dimensional inputs with limited resources. The foldover is a quick and useful technique in construction of fractional designs, which typically releases aliased factors or interactions. This paper takes the wrap-around L₂-discrepancy as the optimality measure to assess the optimal three-level combined designs. New and efficient analytical expressions and lower bounds of the wraparound L₂-discrepancy for three-level combined designs are obtained. The new lower bound is useful and sharper than the existing lower bound. Using the new analytical expression and lower bound as the benchmarks, the authors may implement an effective algorithm for constructing optimal three-level combined designs.     

Efficient Asymmetrical Extended Designs Under Wrap-Around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-Discrepancy

The purpose of the present article is to introduce a class of mixed two- and three-level extended designs obtained by adding some new runs to an existing mixed two-and three-level design. A formulation of wrap-around L₂-discrepancy for the extended designs is developed. As a benchmark of obtaining (nearly) uniform asymmetrical extended designs, a lower bound to the wrap-around L₂-discrepancy for our proposed designs is established. Thorough numerical results are displayed, which provide further corroboration to the derived theoretical results.     

分布仿真实验管理系统中实验规划方法研究

分布仿真实验规划针对仿真应用系统的开发和运行过程,对其结构和运行控制进行合理设计,以实现分布仿真应用系统的自动化构建和提高仿真运行效率。首先,分布仿真实验规划定义了仿真过程中的联邦基本信息,例如:联邦名称、FED文件、运行时间等等。其次,研究了基于实体的成员规划方法,以及仿真任务向仿真节点的分配算法。最后,根据分布仿真实验规划的功能需求,设计实现了分布仿真实验规划工具。分布仿真实验规划工具以联邦成员、想定描述和仿真节点信息为输入,自动规划并生成XML格式的仿真方案文件。方案文件保存了仿真实验规划结果,并作为构建分布仿真应用系统和仿真运行的依据。     

Straightforward Guess and Determine Analysis Based on Genetic Algorithm

With the development of artificial intelligence, the genetic algorithm has been widely used in many fields. In cryptography, the authors find it is natural to code an individual and design its fitness in a genetic algorithm for a straightforward guess and determine analysis(SGDA, in short).Based on this observation, the authors propose an SGDA based on genetic algorithm. Comparing it with the other three SGDAs based on exhaustive search, MILP method and CPP method respectively,the authors illust...     

基于BP神经网络的虚假财务报告识别

针对虚假财务报告的特点,设计了一种基于BP(反向传播)神经网络的虚假财务报告识别模型。根据1999~2002年的年度审计报告意见,从上市公司中,选择确定了44家虚假财务报告样本,并按照一定的标准选择了44家真实财务报告样本,这88个样本构成训练数据集。类似地,从2003~2006年的上市公司中,选择了73家虚假财务报告样本和99家真实财务报告样本,这172个样本构成测试数据集。10个财务指标被选择为识别变量,使用训练数据集对BP神经网络模型进行训练,并将训练后的模型对测试数据集进行测试,取得了较好的实验结果。     

基于lookahead的交互式动态影响图的DMU改进算法

区别模型更新(discriminative model update,DMU)是一种常用的求解交互式动态影响图(interactive dynamic influence diagrams, I-DIDs)问题的算法。结合lookahead思想提出了一种判断模型近似行为等价的改进DMU方法。所提方法首先将满足近似行为等价的模型聚类形成代表模型集合,然后自上而下对代表模型进行更新,在模型更新过程中,只更新那些与其他模型预测行为不同的模型。结合lookahead思想提出了一种判断模型近似行为等价的方法。与DMU算法相比,该算法能迅速有效地减少模型的数量,从而减少了计算机的存储空间和运行时间,提高了算法的效率。最后通过对多Agent老虎问题及机器维修问题实验来验证所提方法的有效性。     

Superconvergence of mixed covolume method on quadrilateral grids for elliptic problems

This paper considers the mixed covolume method for the second-order elliptic equations over quadrilaterals.Superconvergence results are established in this paper on quadrilateral grids satisfying the h~2-parallelogram condition when the lowest-order Raviart-Thomas space is employed in the mixed covolume method.The authors prove O(h~2) accuracy between the approximate velocity or pressure and a suitable projection of the real velocity or pressure in the L~2 norm.Numerical experiments illustrating the theoretical results are provided.     

A modified likelihood ratio test for homogeneity in bivariate normal mixtures of two samples

This paper investigates the asymptotic properties of a modified likelihood ratio statistic for testing homogeneity in bivariate normal mixture models of two samples. The asymptotic null distribution of the modified likelihood ratio statistic is found to be χ₂², where χ₂² is a chi-squared distribution with 2 degrees of freedom. This research was supported by the National Natural Science Foundation of China under Grant No. 10661003, SRF for ROCS, SEM under Grant No. [2004]527, and the Natural Science Foundation of Guangxi under Grant No. 0728092.     

The limit theorem for dependent random variables with applications to autoregression models

This paper studies the autoregression models of order one, in a general time series setting that allows for weakly dependent innovations. Let {X _t } be a linear process defined by X _t = Σ _k=0^∞ψ _k ɛ _t−k , where {ψ _k , k ≥ 0} is a sequence of real numbers and {ɛ _k , k = 0, ±1, ±2, …} is a sequence of random variables. Two results are proved in this paper. In the first result, assuming that {ɛ _k , k ≥ 1} is a sequence of asymptotically linear negative quadrant dependent (ALNQD) random variables, the authors find the limiting distributions of the least squares estimator and the associated regression t statistic. It is interesting that the limiting distributions are similar to the one found in earlier work under the assumption of i.i.d. innovations. In the second result the authors prove that the least squares estimator is not a strong consistency estimator of the autoregressive parameter α when {ɛ _k , k ≥ 1} is a sequence of negatively associated (NA) random variables, and ψ ₀ = 1, ψ _k = 0, k ≥ 1.     

Study of Production Planning Fuzzy Multi-objective Linear Programming Model with Fuzzy Variables

ｔｕｄｙｏｆＰｒｏｄｕｃｔｉｏｎＰｌａｎｎｉｎｇＦｕｚｚｙＭｕｌｔｉｏｂｊｅｃｔｉｖｅＬｉｎｅａｒＰｒｏｇｒａｍｍｉｎｇＭｏｄｅｌｗｉｔｈＦｕｚｚｙＶａｒｉａｂｌｅｓＪＩＮＹｉＸＩＹｏｕｍｉｎＷＡＮＧＹｉｎｇｌｕｏＭａｎａｇｅｍｅｎｔＳｃｈｏｌ，Ｘ...     

基于权矩阵低秩逼近的MIMO OTHR多模SDC抑制算法

扩展多普勒杂波是天波超视距雷达(over the horizon radar,OTHR)慢速舰船目标检测面临的关键问题。在新一代多输入多输出天波超视距雷达系统下,基于最小方差无失真响应(minimum variance distortionless response,MVDR)权矢量,提出一种权矩阵低秩逼近的多模扩展多普勒杂波抑制算法。利用阻塞矩阵进行数据预处理,并利用“发射〖CD*2〗接收”二维权矩阵的特征分解对双迭代MVDR算法进行了多级扩展,在减小了计算量和样本需求的基础上,进一步改善俯仰空域滤波的输出信杂噪比,提升OTHR对低可探测慢速舰船目标的检测性能。理论分析和仿真验证了算法的有效性。     

TF/TA trajectory tracking using nonlinear predictive control approach

The use of a methodology of nonlinear continuous predictive control to design the guidance control law for the aircraft TF/TA² trajectory tracking problem is emplojed. For the derivation of the predictive control law, by using Taylor series expansion, and based on optimizing a performance index which is a quadratic function of both the predictive value of the state variables and the control inputs, a state variable feedback controller for nonlinear systems is obtained, and it provides a tradeoff between satisfactory tracking performance and the control magnitude requirements. Numerical simulation results for a supersonic fighter aircraft model show the viability of this approach.     

On algebraic immunity of trace inverse functions on finite fields of characteristic two

The trace inverse functions Tr(λx~(-1)) over the finite field F_(2~n) are a class of very important Boolean functions and are used in many stream ciphers such as SFINKS,RAKAPOSHI,the simple counter stream cipher(SCSC) presented by Si W and Ding C(2012),etc.In order to evaluate the security of those ciphers in resistance to(fast) algebraic attacks,the authors need to characterize algebraic properties of Tr(λx~(-1)).However,currently only some bounds on algebraic immunity of Tr(λx~(-1)) are given in the public literature,for example,the NGG upper bound and the Bayev lower bound,etc.This paper gives the exact value of the algebraic immunity of Tr(λx~(-1)) over F_(2~n),that is,AI(Tr(λx~(-1))) =[2n~(1/2)]- 2,where n ≥ 2,A ∈ F_(2~n) and λ≠ 0,which shows that Dalai's conjecture on the algebraic immunity of Tr(λx~(-1)) is correct.What is more,the authors demonstrate some weak properties of Tr(λx~(-1)) against fast algebraic attacks.     

A discontinuous Galerkin method combined with mixed finite element for seawater intrusion problem

<正> Seawater intrusion problem is considered in this paper.Its mathematical model is anonlinear coupled system of partial differential equations with initial boundary problem.It consistsof the water head equation and the salt concentration equation.A combined method is developedto approximate the water head equation by mixed finite element method and concentration equationby discontinuous Galerkin method.The scheme is continuous in time and optimal order estimates inH~1-norm and L~2-norm are derived for the errors.     

A class of constacyclic codes over ring <Emphasis Type="Italic">R</Emphasis> + <Emphasis Type="Italic">vR</Emphasis>

By constructing a Gray map, a class of constacyclic codes over ring R = R+vR is studied. Using cyclic codes and negacyclic codes of length p ^s over ring R, the structure of (1?2v)-constacyclic codes and dual codes of length p ^s over ring R are given, the Gray images of (1 ? 2v)-constacyclic codes in a particular case are also studied. It is shown that linear codes of length p ^s over ring R are (1?2v)-constacyclic codes if and only if their Gray images are distance-invariant cyclic codes of length 2p ^s over ring R.