基于微分法的最优算子及其在光测灰度图像处理中的应用

基于边缘的图像特征提取方法是光测图像事后处理的一种重要方法,由于边缘图像具有直观、特征点突出的优点,因而在光测图像事后处理领域有着广泛应用。阐述了微分法边缘检测算子的原理,提出了基于最优算子的光测灰度图像的边缘提取方法,并对其处理效果进行了比对。

涡轮叶片CT图像边缘提取的最优算子研究

为了解决叶片计算机断层(computed tomograghy,简称CT)图像边缘提取精度低效率差的问题,以解析法提取边缘的理论为基础,推导了适用于CT图像边缘提取的最优算子,并通过定量计算与模拟标准图像对最优算子的性能进行了分析,结果表明最优算子在抗噪、定位精度以及单像素响应等方面都比传统的边缘提取算子更为优越.实际应用最优算子提取的叶片边缘更光顺,噪声点以及伪边缘更少,进一步证明了最优算子在CT图像边缘提取方面有着明显的优势.

技术人员绩效考评模糊综合评判算子研究

运用模糊综合评判进行绩效考评时,大多文献直接采用"∧,∨"计算合成值,没有就具体问题具体分析。在对四个常用算子进行深入研究的基础上,通过实际数据验证,可以得出适于技术人员绩效考评的最优模糊综合评判算子。

一种新边缘检测算子——正弦算子

边缘检测是在图像中标注灰度强度变化的过程,边缘检测的主要目的是检测和标注显著的灰度强度变化,检测准则、定位准则和响应的唯一性是评估边缘检测算子的三个准则,该文基于这三个准则,给出了获取最优边缘检测算子的详细理论推导,以一维阶跃边缘最优检测算子为例,讨论了对任意形状边缘设计边缘检测算子的过程。在此基础上,该文提出了一种新检测算子——正弦算子,根据评估边缘检测算子的三个准则,该文建议的正弦算子要优于高斯一阶导函数,实验结果表明,正弦算子对检测和定位一维和二维含噪边缘都具有较好的效果。

基于细分变异算子策略的遗传算法

针对基本遗传算法局部搜索能力不强以及早熟的问题,提出基于细分变异算子的遗传算法(Genetic Algorithm Based on Subdividing Mutation,SMSGA)。SMSGA将变异算子依据进化历程分成大步前进算子和最优调教算子。大步前进算子防止遗传早熟现象的发生;最优调教算子加强局部搜索的能力。同时,为加快算法收敛速度,对遗传操作实施策略进行优化,引入了路由选择操作。选用3个典型的测试函数在MATLAB平台中对该算法与基本遗传算法以及采用双变异率的改进遗传算法进行比较分析,结果表明,SMSGA可以有效的避免遗传算法中存在的局部搜索能力差和早熟现象的出现。

基于最优Rump区间算子的非线性方程组解的可信验证方法

基于Baumann最优中心形式对Rump提出的非线性方程组解的存在性验证方法进行了改进.首先研究了Rump区间算子与Krawczyk区间算子的关系;其次借鉴最优Krawczyk区间算子的构造过程,给出了Rump区间算子的最优形式;最后根据改进的Rump解的存在性定理,设计了验证非线性方程组解存在的区间算法程序.与Rump验证算法相比,理论分析与数值实验均表明,所提算法均可以给出宽度最窄(或至少相同)的解的包含区间.

一种最优规划程序设计语言OPPLFC

提出了一种基于流演算的最优规划程序设计语言OPPLFC(optimal planning programming language basedon fluent calculus)。通过定义动作表达式来描述顺序、并发、非确定选择等复杂动作,利用最优规划算子实现最优规划。OPPLFC的最优规划算子是通过引入强化学习报酬函数的多次离线执行。当与前一次离线执行所得的报酬相比较,值小则所得的动作序列为当前最优规划。给出了OPPLFC语言的组成、程序语义及其实现。最后,通过实例验证了OPPLFC语言的可行性。

在包装流水线中边缘检测算法的比较

阐述了经典边缘算子、最优算子以及自适应邻域算法、纹理边缘检测、边界跟踪技术以及神经网络方法等其它改进算法及其特性。经分析,Canny边缘检测算法以及由它改进得各种算法可以应用于包装的流水线控制中。

稳定高效的时域反Q滤波方法

本文提出了一种全新的基于等效Q值的时域反Q滤波算法,其允许等效Q值在垂向上随时间连续变化,在空间上存在弱变化;将加权最小平方方法优化设计思想引入到时域反Q补偿短算子设计当中,给出最优时域短算子设计,将大量的频率域乘法工作转化为少量的时域褶积运算;采取表驱动方案,将短算子的构建与反Q补偿运算相剥离,极大地提升了计算效率;提出了一种新的稳定性控制方法,其既保证算法具有良好的稳定性,又满足短算子设计精度的要求.数值计算表明:时域反Q滤波算法可以取得与频域算法相同的补偿效果,并保证算法具备良好的稳定性和较高的计算效率.

跳过程ρ最优耦合算子的存在性

本文在适当的条件下，证明了一般状态跳过程ρ最优耦合算子的存在性．

基于证据理论的电力视角图像边缘检测

针对传统边缘检测算法忽视图像不确定性的问题,研究了基于D-S证据理论的边缘检测方法。首先介绍了传统的边缘检测方法(一阶微分算子、二阶微分算子,以及在二阶微分算子上改进而来的最优算子法),并结合仿真结果分析了传统的边缘检测算法的优缺点。传统的边缘检测方法利用微分算子求出梯度后,使用一个阈值进行决策,判断该像素是边缘与否,采用硬阈值划分的方法忽略了像素点的不确定性。基于此,研究并实现了基于证据理论的图像边缘检测的方法,并将电力图像检测领域与传统的边缘检测方法进行了对比分析。结果表明,基于证据理论的边缘检测算法具有很好抗噪声能力,能够较少地检测出伪边缘,同时又检测出了相对完整的边缘。

Study on Microsatellite Distribution in Complete Genomes of Tobacco Vein Clearing Virus

MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCBI database.The results showed that the repetitions number and their location of the N-base group has been extracted and displayed.The largest repetitions of N-base group in the complete genomes of the tobacco vein clearing virus was decreased as the exponential function with the increasing of N.The method used in this study could be applied to the extraction and revealing of the microsatellite distribution features in the complete genomes of other viruses,thereby provided a basis for the research of the structure and the law of function,inheritance and variation by the using of the microsatellite distribution features.

The optimal time-frequency atom search based on a modified ant colony algorithm

this paper, a new optimal time-frequency atom search method based on a modified ant colony algorithm is proposed to improve the precision of the traditional methods. First, the discretization formula of finite length time-frequency atom is inferred at length. Second; a modified ant colony algorithm in continuous space is proposed. Finally, the optimal time- frequency atom search algorithm based on the modified ant colony algorithm is described in detail and the simulation experiment is carried on. The result indicates that the developed algorithm is valid and stable, and the precision of the method is higher than that of the traditional method.

Accuracy analysis of the optimal separable approximation method of one-way wave migration

An approximation for the one-way wave operator takes the form of separated space and wave-number variables and makes it possible to use the FFT, which results in a great improvement in the computational efficiency. From the function approximation perspective, the OSA method shares the same separable approximation format to the one-way wave operator as other separable approximation methods but it is the only global function approximation among these methods. This leads to a difference in the phase error curve, impulse response, and migration result from other separable approximation methods. The difference is that the OSA method has higher accuracy, and the sensitivity to the velocity variation declines with increasing order.

Layout problem of multi-component systems arising for improving maintainability

To improve the mainlainability design efficiency and quality, a layout optimization method for maintainability of multi-component systems was proposed. The impact of the component layout design on system maintainability was analyzed, and the layout problem for maintainability was presented. It was formulated as an optimization problem, where maintainability, layout space and distance requirement were formulated as objective functions. A multi-objective particle swarm optimization algorithm, in which the constrained-domination relationship and the update strategy of the global best were simply modified, was then used to obtain Pareto optimal solutions for the maintainability layout design problem. Finally, application in oxygen generation system of a spacecraft was studied in detail to illustrate the effectiveness and usefulness of the proposed method. The results show that the concurrent maintainability design can be carried out during the layout design process by solving the layout optimization problem for maintainability.

Evolutionary Computation for Realizing Distillation Separation Sequence Optimization Synthesis

Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequence, and it is directly applied as the coding method. Genetic operators, which ensure to prohibit illegal filial generations completely, are designed by using the method of graph theory. The crossover operator based on a single parent or two parents is designed successfully. The example shows that the average ratio of search space from evolutionary algorithm with two-parent genetic operation is lower, whereas the rate of successful minimizations from evolutionary algorithm with single parent genetic operation is higher.

Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

周期Sobolev类的2n-宽度

一、引言 设Q(x)是实系数多项式.称W_p(Q(D))-{f丨f^(i)(0)-f^(i)(2π),i-0,…,deg-1,f^(degQ-1)在[0,2π]上绝对连续,‖Q(D)f‖_p≤1}是由线性微分算子Q(D)所确定的周期Sobolev类,其中D-d/dx,degQ是Q的次数,p∈[1,∞],‖·‖_p是通常L_p[0,2π]-范数.我们分别用d_n(p,q)、d^n(p,q)、δ_n(p,q)和b_n(p,q)记W_p(Q(D))在L_q[0。

Optimality Condition for Infinite-dimensional Programming Problem with Operator and Bound Constraints

A first-order necessary condition for an infinite-dimensional nonlinear op-timization problem, which arises when the all-at-once method is employed to slove theoptimal control problems, is formulated and analyzed. Operator constraint and simplebound on part of the variables are both considered. Based on this optimality condition,the trust-region subproblems are built, then the trust region method rnay be employedto deal with the optimizatiou problem in infinite-dimensional space.

Nonholonomic motion planning for a free-falling cat using spline approximation

An optimal motion planning of a free-falling cat based on the spline approximation is investigated.Nonholonomicity arises in a free-falling cat subjected to nonintegrable velocity constraints or nonintegrable conservation laws.The equation of dynamics of a free-falling cat is obtained by using the model of two symmetric rigid bodies.The control of the system can be converted to the motion planning problem for a driftless system.A cost function is used to incorporate the final errors and control energy.The motion planning is to determine control inputs to minimize the cost function and is formulated as an infinite dimensional optimal control problem.By using the control parameterization,the infinite dimensional optimal control problem can be transformed to a finite dimensional one.The particle swarm optimization(PSO) algorithm with the cubic spline approximation is proposed to solve the finite dimension optimal control problem.The cubic spline approximation is introduced to realize the control parameterization.The resulting controls are smooth and the initial and terminal values of the control inputs are zeros,so they can be easily generated by experiment.Simulations are also performed for the nonholonomic motion planning of a free-falling cat.Simulated experimental results show that the proposed algorithm is more effective than the Newtoian algorithm.