Mesh Simplification Based on Super-Face and Genetic Algorithm in Reverse Engineering

Mesh simplification is one of the most important links in the context of reverse engineering. It is also an important consideration in computer graphics. This paper presents a novel and original method of triangular mesh reduction. A new concept of super-face is defined. In order to construct a super-face, a way to calculate the scattered point curvature is discussed. The growth of a seed point and the combination of different regions are also necessary for the construction of a super-face. When the hole left by the deletion of super-face is retriangulated a genetic algorithm is used that has been modified for our specific problem. Then the different weights to balance the optimisation of the new triangular mesh can be adjusted.     

基于波动方程的聚焦点控制照明叠前深度偏移

 基于波动方程的聚焦点控制照明叠前深度偏移技术借助于差分计算，把速度、密度等介质参数的影响体现在差分计算的矩阵方程中，能够自动适应速度场的任意变化，快速傅里叶变换的使用也加速了波场延拓的计算速度。因此此法兼具有限差分偏移方法和傅里叶偏移方法的优点，既可适应速度场的剧烈变化，又可保证对陡倾地层的成像效果，是目前针对复杂构造最有效的成像方法之一。对于单个聚焦点及其周围的成像步骤为：①采用矩形网格情况下绕射走时的有限差分计算方法生成合成算子；②应用合成算子来合成面炮震源和面波记录；③对合成的面炮震源和面波记录做傅里叶有限差分法波动方程叠前深度偏移，得到该聚焦点及其附近区域的成像结果。按照上述成像步骤，将震源波场和炮集记录依据相应的外推公式进行延拓，最终应用成像条件求取成像值。在地质目标处选取多个聚焦点，可以得到面向目标的控制照明偏移成像，在多个层位上选取多个聚焦点进行控制照明叠前深度偏移，可以得到整块区域的成像。通过对Marmousi模型的试算，取得了较好的效果。     

一种改进选择算子的遗传算法在泊松曲线沉降预测模型中的应用

选择算子是遗传算法的重要算子之一,它对于种群的多样性和算法的收敛性具有重要的影响。本文对轮盘赌选择算子进行改进,将适应值分组应用于种群个体的选择中,提出适应度分组轮盘赌,并将该方法用于泊松曲线沉降预测模型的优化。实验结果表明,该算法为泊松曲线沉降预测模型的参数估计提供一种有效的方法。     

An Operator-integration-factor splitting method for time-dependent problems: Application to incompressible fluid flow

In this paper we present a simple, general methodology for the generation of high-order operator decomposition (splitting) techniques for the solution of time-dependent problems arising in ordinary and partial differential equations. The new approach exploits operator integration factors to reduce multiple-operator equations to an associated series of single-operator initial-value subproblems. Two illustrations of the procedure are presented: the first, a second-order method in time applied to velocity-pressure decoupling in the incompressible Stokes problem; the second, a third-order method in time applied to convection-Stokes decoupling in the incompressible Navier-Stokes equations. Critical open questions are briefly described.     

自适应变异粒子群优化算法及在新冠肺炎疫情传播预测中的应用

为克服粒子群算法容易陷入局部最优和全局寻优精度不高的缺点,通过对算法的局部寻优和全局寻优的特点进行分析,首先使用正态分布衰减策略改进惯性权重;同时基于算法运行的时间自适应采用不同的基于高斯分布及柯西分布的变异优化策略,解决全局搜索和局部开发能力的不平衡问题,实现了局部寻优和全局寻优的双重优化,满足了提高寻优速度和寻优精度的目的.为验证算法有效性及实用性,将改进算法用于预测新冠肺炎疫情传播情况.选取100天新冠肺炎疫情每日新确诊人数的数据,利用算法优化前馈神经网络的参数,使训练好的神经网络模型预测新冠肺炎疫情的性能提升.实验部分首先使用测试函数将改进的算法与其它五种算法进行对比,验证算法的良好性能,最后应用到神经网络完成新冠肺炎疫情传播预测.     

Analysis of nonlinear electrical circuits using bernstein polynomials

In electrical circuit analysis, it is often necessary to find the set of all direct current (d.c.) operating points (either voltages or currents) of nonlinear circuits. In general, these nonlinear equations are often represented as polynomial systems. In this paper, we address the problem of finding the solutions of nonlinear electrical circuits, which are modeled as systems of n polynomial equations contained in an n-dimensional box. Branch and Bound algorithms based on interval methods can give guaranteed enclosures for the solution. However, because of repeated evaluations of the function values, these methods tend to become slower. Branch and Bound algorithm based on Bernstein coefficients can be used to solve the systems of polynomial equations. This avoids the repeated evaluation of function values, but maintains more or less the same number of iterations as that of interval branch and bound methods. We propose an algorithm for obtaining the solution of polynomial systems, which includes a pruning step using Bernstein Krawczyk operator and a Bernstein Coefficient Contraction algorithm to obtain Bernstein coefficients of the new domain. We solved three circuit analysis problems using our proposed algorithm. We compared the performance of our proposed algorithm with INTLAB based solver and found that our proposed algorithm is more efficient and fast.     

Entropy/cross entropy-based group decision making under intuitionistic fuzzy environment

We study the group decision making problem under intuitionistic fuzzy environment. Based on entropy and cross entropy, we give two methods to determine the optimal weights of attributes, and develop two pairs of entropy and cross entropy measures for intuitionistic fuzzy values. Then, we discuss the properties of these measures and the relations between them and the existing ones. Furthermore, we introduce three new aggregation operators, which treat the membership and non-membership information fairly, to aggregate intuitionistic fuzzy information. Finally, several practical examples are presented to illustrate the developed methods.     

The induced generalized aggregation operators for intuitionistic fuzzy sets and their application in group decision making

In this paper, we present the induced generalized intuitionistic fuzzy ordered weighted averaging (I-GIFOWA) operator. It is a new aggregation operator that generalized the IFOWA operator, including all the characteristics of both the generalized IFOWA and the induced IFOWA operators. It provides a very general formulation that includes as special cases a wide range of aggregation operators for intuitionistic fuzzy information, including all the particular cases of the I-IFOWA operator, GIFOWA operator and the induced intuitionistic fuzzy ordered geometric (I-IFOWG) operator. We also present the induced generalized interval-valued intuitionistic fuzzy ordered weighted averaging (I-GIIFOWA) operator to accommodate the environment in which the given arguments are interval-valued intuitionistic fuzzy sets. Further, we develop procedures to apply them to solve group multiple attribute decision making problems with intuitionistic fuzzy or interval-valued intuitionistic fuzzy information. Finally, we present their application to show the effectiveness of the developed methods.     

多级小波分解与LBP融合的纹理提取算法

为提高不同光照、不同角度条件下的纹理识别精度,提出了一种利用多级小波分解和多尺度旋转不变LBP融合的纹理提取算法。算法在传统的LBP特征提取基础上,采用多尺度的旋转不变LBP算子分别对多级小波逼近图像提取直方图序列特征向量,与各级小波能量进行加权融合,获取更多的纹理信息,对光照和角度的变化有更高的鲁棒性。仿真结果表明,相对传统的LBP特征提取算法,改进的算法具有更高的纹理识别率。     

改进的Beamlet与Canny相结合提取复杂图像线特征

传统Beamlet无结构算法在提取图像线特征时不仅存在重叠模糊的缺陷,而且在提取复杂图像线特征时不能有效地检测出目标信息,细节特征更是难以刻画。针对这些问题,提出将改进的Beamlet无结构算法与Canny算子相结合的方法提取复杂图像的线特征。首先,对图像进行Beamlet变换,通过改进Beamlet无结构算法,采用新的能量统计和制定新的划线规则,以保证每个二进方块最多有一条最优基;然后,对图像用Canny算子检测边缘,通过选取较大的Sigma,只检测明显的大边缘;最后,两者结合得到图像的线特征。从检测的线特征的线型连接程度等方面对该算法的性能进行了评价,并与现有的方法进行了比较,实验结果表明,该方法克服了两种方法单独提取线特征时存在的断裂、重叠、模糊和虚假边缘的缺点,有效地提高了复杂图像线特征提取的准确性和连续性。